A function in O(n²) notation is:

What operation is performed between two vectors?

If T(n) is 7T(n/2) + bn², then it is called

Which of the following recurrence relations can be used to find the nth Fibonacci number?

When is selection sort an appropriate choice to sort a dataset?

Consider B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is

Consider the following statements about Kruskal's algorithm:

S1. Kruskal's algorithm might produce a non-minimal spanning tree.

S2. Kruskal's algorithm can efficiently be implemented using the disjoint-set data structure.

What does the following function do for a given Linked List with first node as head?

void fun1(struct node* head)

{

 if(head == NULL)

  return;

 fun1(head->next);

 printf("%d ", head->data);

}

Which of the following statements about spanning trees is false?

Consider the following code:

#include<stdio.h>
int recursiveSum(int n)
{
     if(n == 0)
       return 0;
     return n + recursiveSum(n - 1);
}
int main()
{
   int n = 8;
   int ans = recursiveSum(n);
   printf("%d",ans);
   return 0;
}

Which of the following lines is the recurrence relation for the above code?