Home / MCQ Bank / Computer

Computer Networking Miscellaneous Difficulty: Medium

Solve the following recurrence using Master's theorem. T(n) = 4T (n/4) + n log n What is the output of the given code? a=5 b=15 while a&&b puts a+b end Consider the following dynamic programming implementation of the boolean parenthesization problem: int count_bool_parenthesization(char *sym, char *op) { int str_len = strlen(sym); int True[str_len][str_len],False[str_len][str_len]; int row,col,length,l; for(row = 0, col = 0; row < str_len; row++,col++) { if(sym[row] == 'T') { True[row][col] = 1; False[row][col] = 0; } else { True[row][col] = 0; False[row][col] = 1; } } for(length = 1; length < str_len; length++) { for(row = 0, col = length; col < str_len; col++, row++) { True[row][col] = 0; False[row][col] = 0; for(l = 0; l < length; l++) { int pos = row + l; int t_row_pos = True[row][pos] + False[row][pos]; int t_pos_col = True[pos+1][col] + False[pos+1][col]; if(op[pos] == '|') { _______________; } if(op[pos] == '&') { _______________; } if(op[pos] == '^') { _______________; } } } } return True[0][str_len-1]; } Which of the following lines should be added to complete the "if(op[pos] == '|')" part of the code? What will we not do with function pointers? Which of the following is the correct expression that evaluates to true if the number x is between 1 and 100 or the number is negative?