Data Structure II Mock Test 6

1. In general, which of the following methods isn’t used to find the factorial of a number?

2. What is the following expression, lcm (a, gcd (a, b)) equal to?

3. Consider the following recursive implementation to find the factorial of a number. Which of the lines is the base case?

int fact(int n)
{
     if(n == 0)
        return 1;
     return n * fact(n - 1);
}
int main()
{
      int n = 5;
      int ans = fact(n);
      printf("%d",ans);
      return 0;
}

4. What is the time complexity of the fastest known matrix multiplication algorithm?

5. What is the output of the following code?

#include<stdio.h>
#include<stdlib.h>
struct Node
{
      int val;
      struct Node *next;
}*head;
int get_len()
{
      struct Node *temp = head->next;
      int len = 0;
      while(temp != 0)
      {
          len++;
          temp = temp->next;
      }
      return len;
}
int main()
{
      int arr[10] = {1,2,3,4,5}, n = 5, i;
      struct Node *temp, *newNode;
      head = (struct Node*)malloc(sizeof(struct Node));
      head->next = 0;
      temp = head;
      for(i=0; i<n; i++)
      {
          newNode = (struct Node*)malloc(sizeof(struct Node));
          newNode->val = arr[i];
          newNode->next = 0;
          temp->next = newNode;
          temp = temp->next;
      }
      int len = get_len();
      printf("%d",len);
      return 0;
}

6. Which of the following takes O(n) time in worst case in array implementation of stack?

7. Which is the smallest number of 3 digits that is divisible by 2, 4, 8?

8. How many times will the function fact() be called when the following code is executed?

 
int fact(int n)
{
      if(n == 0)
        return 1;
      return n * fact(n - 1);
}
int main()
{
      int n = 5;
      int ans = fact(n);
      printf("%d",ans);
      return 0;
}

9. Which of the following is not another name for GCD(Greatest Common Divisor)?

10. Which of the following methods used to find the sum of first n natural numbers has the least time complexity?