Data Structure MCQ (Multiple Choice Questions) || 20 MCQ QUESTIONS
Question 1: Consider the following singly linked list wherein each node of the linked list contains a data (integer) and a link pointing to the next node: What would be the outputs of the following if the initial call is func(head): void func(node* root) { if(!root) return; printf("%d, ",root->data); func(root->link); } Select one: a. 20, 5, 15, 10 b. 20 c. None of these d. 10, 15, 5, 20 The correct answer is: 10, 15, 5, 20 Question 2: How many maximum pointers will get updated in removal of a term from a polynomial stored in a doubly circular linked list? a. 3 b. 2 c. 4 d. 1 The correct answer is: 2 Question 3: How many minimum pointers will get updated in removal of a term from a polynomial stored in a doubly linked list? a. 3 b. 4 c. 1 d. 2 The correct answer is: 1 Question 4 Consider the following keys to be stored in a hash table of size 13 (location 0 to location 12) using division method and linear probing is used as the collision resolution ...