Miscellaneous on Data Structures MCQs with Answers 2027

Q781

Open question

Is Morse code speed measured in characters per minute (cpm)?

Select an option to see the answer and solution.

Q782

Open question

Choose the weakest cipher from the following?

Select an option to see the answer and solution.

Q783

Open question

How many times is the function recursive_get_len() called when the following code is executed?

#include<stdio.h>
#include<stdlib.h>
struct Node
{
      int val;
      struct Node *next;
}*head;
int recursive_get_len(struct Node *current_node)
{
      if(current_node == 0)
        return 0;
      return 1 + recursive_get_len(current_node->next);
}
int main()
{
      int arr[10] = {-1,2,3,-3,4,5}, n = 6, 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 = recursive_get_len(head->next);
      printf("%d",len);
      return 0;
}

Select an option to see the answer and solution.

Q784

Open question

What is the minimal dominating set for the graph given below?
Miscellaneous on Data Structures mcq question image

Select an option to see the answer and solution.

Q785

Open question

How many times is the function recursive_search_num() called when the following code is executed?

#include<stdio.h>
int recursive_search_num(int *arr, int num, int idx, int len)
{
     if(idx == len)
     return -1;
     if(arr[idx] == num)
     return idx;
     return recursive_search_num(arr, num, idx+1, len);
}
int main()
{
      int arr[8] ={1,2,3,3,3,5,6,7},num=5,len = 8;
      int indx = recursive_search_num(arr,num,0,len);
      printf("Index of %d is %d",num,indx);
      return 0;
}

Select an option to see the answer and solution.

Q786

Open question

What is the independence number of the graph given below?
Miscellaneous on Data Structures mcq question image

Select an option to see the answer and solution.

Q787

Open question

In terms of Venn Diagram, which of the following expression gives LCM (Given A ꓵ B ≠ Ø)?

Select an option to see the answer and solution.

Q788

Open question

What is the alternative name given to Rail fence cipher?

Select an option to see the answer and solution.

Q789

Open question

In a graph, a maximal independent set is also a dominating set.

Select an option to see the answer and solution.

Q790

Open question

What will be the ciphered text corresponding to "ALGORITHM" if gronsfeld cipher is used for encryption with key "4321"?

Select an option to see the answer and solution.

Q791

Open question

Which graph is also known as biclique?

Select an option to see the answer and solution.

Q792

Open question

Consider the following pseudocode for the edge coloring problem of a graph. Which of the following best suits the blank?

Start traversing the graph using BFS traversal 
Pick up any vertex from the graph  
__________________________  
Traverse one its edges 
Repeat until all the edges of the graph are covered

Select an option to see the answer and solution.

Q793

Open question

If GCD of two numbers is 1, then the two numbers are said to be . . . . . . . .

Select an option to see the answer and solution.

Q794

Open question

What will be the time complexity of the code to find a minimum element from an array of size n and uses square root decomposition(exclude pre processing time)?

Select an option to see the answer and solution.

Q795

Open question

Which of the following problems is not NP complete?

Select an option to see the answer and solution.

Q796

Open question

What is the GCD of 20 and 12 using Euclid's algorithm?

Select an option to see the answer and solution.

Q797

Open question

Beaufort cipher is an example of . . . . . . . .