Q3: What the output of the following program: static void Main(string[] args) } I int i =2 m = 15, n = 2, s = 6, h = 2, k = 3; while (i <= m) { } if { } (i >= n && i <= s) int j =i - h; while (j <= i + k) Console.Write(" ({0}, {1}): {2}=>", i, j,i*j++); Console.WriteLine("*****"); i += 2; Console.ReadLine();

Q3: What the output of the following program: static void Main(string[] args) } I int i =2 m = 15, n = 2, s = 6, h = 2, k = 3; while (i <= m) { } if { } (i >= n && i <= s) int j =i - h; while (j <= i + k) Console.Write(" ({0}, {1}): {2}=>", i, j,i*j++); Console.WriteLine("*****"); i += 2; Console.ReadLine();

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

8. Know how to do these, to trace functions like these and to debug functions like these: // recursive power , compute xn int exp(int x, int n){ if(n== return return *exp( ); } void main(){ int a,b; cin >>a>>b; cout>a; rev_print(a); }
#include <stdio.h> int arrC[10] = {0}; int bSearch(int arr[], int l, int h, int key); int *joinArray(int arrA[], int arrB[]) { int j = 0; if ((arrB[0] + arrB[4]) % 5 == 0) { arrB[0] = 0; arrB[4] = 0; } for (int i = 0; i < 5; i++) { arrC[j++] = arrA[i]; if (arrB[i] == 0 || (bSearch(arrA, 0, 5, arrB[i]) != -1)) { continue; } else arrC[j++] = arrB[i]; } for (int i = 0; i < j; i++) { int temp; for (int k = i + 1; k < j; k++) { if (arrC[i] > arrC[k]) { temp = arrC[i]; arrC[i] = arrC[k]; arrC[k] = temp; } } } for (int i = 0; i < j; i++) { printf("%d ", arrC[i]); } return arrC; } int bSearch(int arr[], int l, int h, int key) { if (h >= l) { int mid = l + (h - l) / 2; if…
Java (Generic Method) - What Order?
What does the below do? #include <stdio.h>#include <string.h>int main(void) { char fnameArray[50] [50]; int i; for (i = 0; i <=5; i++) { scanf("%s", fnameArray[i] ); } for (i = 0; i <=5; i++) { printf("\n%s\n", fnameArray[i] ); } return 0;}
#include <stdio.h> #include <string.h> int IsPasswordOkay(char* pass) { char Password[12]; strcpy(Password, pass); if (!strcmp(Password, "goodpass")) return(1); else return(0); } int main(int argc, char **argv) { int PwStatus; if (argc < 2) { printf("Input your password\n"); return(-1); } PwStatus = IsPasswordOkay(argv[1]); if (PwStatus == 0) { printf("Acces denied"); return(-1); } else { printf("Access granted"); return(1); } } Write a function to conduct input validation to secure the smallest buffer. You may call this function void SecurePasswordBuffer(const char *arg).
def ppv(tp, fp): # TODO 1 return def TEST_ppv(): ppv_score = ppv(tp=100, fp=3) todo_check([ (np.isclose(ppv_score,0.9708, rtol=.01),"ppv_score is incorrect") ]) TEST_ppv() garbage_collect(['TEST_ppv'])
C CodeApproved Libraries:<string.h> *not allowed in some questions<math.h><stdlib.h><time.h> (for srand(time(0)) only)
#include <stdio.h>#include <stdlib.h> int MAX_SIZE = 10;int n = 0; //A counter variable which will keep track of number of elements in arr. void append(int *arr, int element){ if(n == MAX_SIZE) { MAX_SIZE = MAX_SIZE * 2; int *ptr = (int*)malloc(MAX_SIZE * sizeof(int)); //Copy elements of existing array to a new array for(int i=0;i<n;i++) { ptr[i] = arr[i]; } arr = ptr; n++; } arr[n] = element;} int get(int *arr, int index){ return arr[index];}int main(){ int *arr = (int*)malloc(MAX_SIZE * sizeof(int)); n = 10; for(int i=0;i<n;i++) arr[i] = i+1; printf("\nArray size: %d", MAX_SIZE); printf("\nNumber of elements: %d", n); printf("\nArray: "); for(int i=0;i<n;i++) printf("%d ", arr[i]); printf("\n\nAdding an element"); append(arr, 11); printf("\nArray size: %d", MAX_SIZE); printf("\nNumber of elements: %d", n);…
#include<iostream>using namespace std;const int rows=10;const int columns=10;int computer_board1[rows][columns];int computer_board2[rows][columns];int player_board[rows][columns];int x,y;void setboard(){for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){computer_board1[i][j]=0;player_board[i][j]=0;}}}void display_computer_board1(){cout<<"Computer's Board"<<endl;cout<<" 0 1 2 3 4 5 6 7 8 9 "<<endl;for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){if(j==0){cout<<i<<" ";}cout<<computer_board1[i][j]<<" "; }cout<<endl;}cout<<endl;}void display_player_board(){cout<<"Your Board"<<endl;cout<<" 0 1 2 3 4 5 6 7 8 9 "<<endl;for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){if(j==0){cout<<i<<" ";}cout<<player_board[i][j]<<" "; } cout<<endl;} }void place_player_ships(){for(int i=1;i<=15;i++){cout<<"Horizontal…
cse
#include<iostream>using namespace std;const int rows=10;const int columns=10;int computer_board1[rows][columns];int computer_board2[rows][columns];int player_board[rows][columns];int x,y;void setboard(){for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){computer_board1[i][j]=0;player_board[i][j]=0;}}}void display_computer_board1(){cout<<"Computer's Board"<<endl;cout<<" 0 1 2 3 4 5 6 7 8 9 "<<endl;for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){if(j==0){cout<<i<<" ";}cout<<computer_board1[i][j]<<" "; }cout<<endl;}cout<<endl;}void display_player_board(){cout<<"Your Board"<<endl;cout<<" 0 1 2 3 4 5 6 7 8 9 "<<endl;for(int i=0;i<rows;i++){for(int j=0;j<columns;j++){if(j==0){cout<<i<<" ";}cout<<player_board[i][j]<<" "; } cout<<endl;} }void place_player_ships(){for(int i=1;i<=15;i++){cout<<"Horizontal…
7. The following function converts a postfix expression to an infix expression assuming the expression can only contain unsigned integer numbers and +' and -' operators. 1. public static String convert (String postfix) { 2. String operand1, operand2, infix; 3. Stack s = new AStack; 4. int i = 0; 5. while (i < postfix.length) { char nextc = postfix.charAt (i); if ((nextc 6. 7. '+')|| (nextc == '-') { == operand2 = s.pop (); operandl = s.pop () ; infix = '(' + operandl + nextc + operand2 + ')'; s.push (infix); i++; 8. 9. 10. 11. } 12. else if (Character.isDigit (nextc)){ int start = i; while (Character.isDigit (postfix.charAt (i)) i++; infix = postfix.substring (start, i); s.push (infix); 13. 14. 15. 16. 17. } else i++; 18. 19. } 20 return s.pop () ; 21. } (a) Rewrite only the lines of code that need to be changed so that the above function converts a postfix expression to a prefix expression. (b) Describe in words what changes are needed on the above given convert () function so that it…