Miscellaneous on Data Structures MCQ question and answer with solution

Home / Data Structure / Miscellaneous On Data Structures

73.
Consider the following recursive implementation of linear search on a linked list:
struct Node
{
     int val;
     struct Node* next;
}*head;
int linear_search(struct Node *temp,int value)
{
      if(temp == 0)
         return 0;
      if(temp->val == value)
         return 1;
      return _________;
}
Which of the following lines should be inserted to complete the above code?

Answer & Solution Discuss in Board Save for Later

76.
Consider the following recursive implementation to find the largest element in an array.
int max_of_two(int a, int b)
{
      if(a > b)
        return a;
      return b;
}
int recursive_max_element(int *arr, int len, int idx)
{
      if(idx == len - 1)
      return arr[idx];
      return _______;
}
Which of the following lines should be inserted to complete the above code?

Answer & Solution Discuss in Board Save for Later

Read More Section(Miscellaneous on Data Structures)

Each Section contains maximum 100 MCQs question on Miscellaneous on Data Structures. To get more questions visit other sections.