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. What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked list, you may assume that n>8. A O(n) and O(n) B O(1) and O(1) C O(n) and O(1) D O(1) and O(n) Correct Answer: D None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 2. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time? A Insertion B Deletion C To empty a queue D Both Insertion and To empty a queue Correct Answer: D None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 3. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list? A Deleting a node whose location in given B Searching of an unsorted list for a given item C Inverting a node after the node with given location D Traversing a list to process each node Correct Answer: A None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 4. Standard approach for implementation of a list is/are of A 1 type B 2 types C 3 types D 4 types Correct Answer: B None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 5. A linear collection of data element given by mean of pointer is called ______________. A Linked List B Queue C Stack D Graph Correct Answer: A None. Check Answer report_problem Report forum Discussion
