Home / MCQ Bank / Computer

Computer Miscellaneous In Java Difficulty: Medium

Consider the following naive method to find the maximum sub-array sum: #include<stdio.h> int main() { int arr[1000]={2, -1, 3, -4, 1, -2, -1, 5, -4}, len=9; int cur_max, tmp_max, strt_idx, sub_arr_idx; cur_max = arr[0]; for(strt_idx = 0; strt_idx < len; strt_idx++) { tmp_max=0; for(sub_arr_idx = strt_idx; sub_arr_idx < len; sub_arr_idx++) { tmp_max +=arr[sub_arr_idx]; if(tmp_max > cur_max) _____________; } } printf("%d",cur_max); return 0; } Which line should be inserted to complete the above code? What is the primary advantage of the Boyer-Moore algorithm compared to the Naive Search algorithm? How can you determine the path of the currently executing script in Python? What will be the output of the following C code? #include<stdio.h> #define max 20 main() { #ifndef max #define min 10 #else #define min 30 #endif printf("%d",min); } What is the purpose of the reticulate package in R?