What is the basic principle in Rabin Karp algorithm?

Rabin- Karp algorithm can be used for discovering

plagiarism in a sentence.

Dijikstra’s Algorithm is more efficient than Bellmann

Ford Algorithm.

Which line should be inserted in the blank to

complete the following dynamic programming implementation of the maximum

sub-array sum problem?

#include<stdio.h>

int

max_num(int a,int b)

{

if(a> b)

           return a;

return b;

}

int

maximum_subarray_sum(int *arr, int

len)

{

int sum[len], idx;

sum[0] = arr[0];

for(idx = 1; idx <

len; idx++)

           sum[idx] = _______________________;

int mx = sum[0];

for(idx = 0; idx <

len; idx++)

           if(sum[idx] > mx)

               mx =sum[idx];

           return

mx;

}

int

main()

{

int arr[] = {-2, -5, 6, -2, 3, -1, 0,-5, 6}, len = 9;

int ans =

maximum_subarray_sum(arr,

len);

printf("%d",ans);

return 0;

Bellmann Ford algorithm is used to indicate whether

the graph has negative weight cycles or not.

What will be the best case time complexity of the

following code?

#include<bits/stdc++.h>

using namespace std;

void

func(char* str2, char* str1)

{

          int m = strlen(str2);

          int n = strlen(str1);

          for (int i = 0; i <= n - m; i++)

        {

                   int j;

                   for (j = 0; j < m; j++)

                             if (str1[i + j] != str2[j])

                                      break;

                   if (j == m)

                             cout

<< i << endl;

          }

}

int

main()

{

          char str1[] = "1253234";

          char str2[] = "323";

          func(str2, str1);

          return 0;

}

How many times the for loop in the Bellmann Ford Algorithm

gets executed?

Bellmann Ford Algorithm can be applied for

_____________

Which of the following is a sub-string of “SANFOUNDRY”?

What is the objective of

the knapsack problem?