CTDL & GT

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

• O(n)

• O(1)

• O(log n)

• None of the above

What will be the output of the following code snippet for the list 1->2->3->4->5->6?

• 1 2 3 4 5 6

• 1 3 5 5 3 1

• 1 3 5 1 3 5

• 2 4 6 1 3 5

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

void fun1(struct node* head) { if(head == NULL) return; fun1(head->next); printf("%d ", head->data); }

• Prints all nodes of linked lists

• Prints all nodes of linked list in reverse order

• Prints alternate nodes of Linked List

• Prints alternate nodes in reverse order

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

• log 2 n

• n/2

• log 2 n – 1

• n

In Linked List implementation, a node carries information regarding

• Data

• Link

• Data and Link

• None of the mentioned

Which data structure allows deleting data elements from and inserting at rear?

• Stacks

• Queues

• Dequeues

• Binary search tree

Stack is also called as

• A First in first out

• B First in last out

• C Last in last out

• D Last in first out

Which of the following is not the type of queue?

• A Priority queue

• B Circular queue

• C Single ended queue

• D Ordinary queue

Which of the following data structure is linear type?

• A Stack

• B Graph

• C Trees

• D Binary tree

What is recurrence for worst case of QuickSort and what is the time complexity in Worst case?

• Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)

• Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)

• Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(nLogn)

• Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(nLogn)