MCQ bookmark_border Q. Consider the following linked list and linked list representation. what will be the value of following statement ?start->next->next->next->datastruct node { int data; struct node *next; }*start = NULL; A 12 B 30 C 15 D 25 Correct Answer: D None. Check Answer report_problem Report
MCQ bookmark_border 1. A linked list is a linear collection of homogeneous elements called______. A Runtime B Nodes C Pointers D None of the above Correct Answer: B None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 2. Consider the following definition in c programming language.struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr;Which of the following c code is used to create new node? A ptr = (NODE*)malloc(sizeof(NODE)); B ptr = (NODE*)malloc(NODE); C ptr = (NODE*)malloc(sizeof(NODE*)); D ptr = (NODE)malloc(sizeof(NODE)); Correct Answer: A None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 3. First link node of list is accessed from a pointer named A Tail B Head C Terminator D Initiator Correct Answer: B None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 4. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue? A Only front pointer B Only rear pointer C Both front and rear pointer D None of the mentioned Correct Answer: B None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 5. Can we read a data item at any location of a list within a constant time (i.e. O(1))? A Yes B Yes, only if the list is implemented by pointers (i.e. linked-list) C Yes, only if the list is implemented by an array D No, we need O(n) computation steps no matter what kind of implementation is used Correct Answer: C None. Check Answer report_problem Report forum Discussion
