What is the output of the following program? #include int max_num(int a,int b) {
What is the output of the following program? #include int max_num(int a,int b) { if(a> b) return a; return b; } int maximum_subarray_sum(int *arr,…
Longest palindromic subsequence is an example of . . . . . . . .
Longest palindromic subsequence is an example of . . . . . . . .
The following sequence is a fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, …
The following sequence is a fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, …. Which technique can be used to get…
In which of the following cases the minimum no of insertions to form palindrome
In which of the following cases the minimum no of insertions to form palindrome is maximum?
What is the space complexity of the following dynamic programming implementation
What is the space complexity of the following dynamic programming implementation of the balanced partition problem? #include int balanced_partition(int *arr, int len) { int…
Suppose you have coins of denominations 1, 3 and 4. You use a greedy algorithm,
Suppose you have coins of denominations 1, 3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which…
Find the maximum sub-array sum for the following array: {3, 6, 7, 9, 3, 8}
Find the maximum sub-array sum for the following array: {3, 6, 7, 9, 3, 8}
You are given a boolean expression which consists of operators &, | and ∧ (AND
You are given a boolean expression which consists of operators &, | and ∧ (AND, OR and XOR) and symbols T or F (true…
What is the value stored in arr[2][3] when the following code is executed? #incl
What is the value stored in arr[2][3] when the following code is executed? #include #include int max_num(int a, int b) { if(a > b)…
What will be the value stored in max_value when the following code is executed?
What will be the value stored in max_value when the following code is executed? #include #include int max_of_two(int a, int b) { if(a >…
Which of the following problems can be solved using the longest subsequence prob
Which of the following problems can be solved using the longest subsequence problem?
What will be the value stored in arr[2][2] when the following code is executed?
What will be the value stored in arr[2][2] when the following code is executed? #include int get_ways(int num_of_dice, int num_of_faces, int S) { int…