Linked List Quiz

What is the output of following function in which start is pointing to the first node of the following linked list 1->2->3->4->5->6 ?

• 1 4 6 6 4 1

• 1 3 5 1 3 5

• 1 2 3 5

• 1 3 5 5 3 1

What is the optimal time complexity to count the number of nodes in a linked list?

• O(n)

• O(1)

• O(log n)

• O(n log n)

What is the time complexity to insert an element to the front of a LinkedList(head pointer given)?

• O(n)

• O(1)

• O(log n)

• O(n log n)

What is the time complexity of a program to reverse a linked list?

• O(n)

• O(1)

• O(log n)

• O(n log n)

Which of the following problems can be solved using 2 pointers on linked list?

• Detecting cycle in a Linked List

• Finding intersection of two linked lists

• Finding middle of a linked lists

• All the above

Which of the following operations is performed more efficiently by doubly linked list than by linear linked list? (ISRO CS 2001)

• Deleting a node whose location is given

• Searching an unsorted list for a given item

• Inserting a node after the node with a given location

• Traversing the list to process each node

Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?

• Delete the last element of the list

• Delete the first element of the list

• Add an element after the last element of the list

• Interchange the first two elements of the list

What does the following function do for a given Linked List with first node as head?

• a)     Prints all nodes of linked lists

• b)    Prints all nodes of linked list in reverse order

• c)     Prints alternate nodes of Linked List

• d)    Prints alternate nodes in reverse order

Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that a node of doubly linked list has previous pointer as prev and next pointer as next.

 

• a)     2 <--> 1 <--> 4 <--> 3 <--> 6 <-->5

• b)     5 <--> 4 <--> 3 <--> 2 <--> 1 <-->6.

• c)    6 <--> 5 <--> 4 <--> 3 <--> 2 <--> 1.

• d)     6 <--> 5 <--> 4 <--> 3 <--> 1 <--> 2

Insertion of an element at the middle of a linked list requires the modification of how many pointers?

• 2

• 1

• 3

• 4