KLU- CLUSTER -6 DAY-7

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

A linear collection of data elements where the linear node is given by means of pointer is called?

• linked list
• node list
• primitive list
• None of these

What is the time complexity to count the number of elements in the linked list?

• O(1)
• O(n)
• O(logn)
• None of the mentioned

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

• O(1)
• O(n)
• θ (n)
• θ (1)

What is the output of following function for start pointing to first node of following linked list? 1->2->3->4->5->6 void fun(struct node* start) { if(start == NULL) return; printf("%d ", start->data); if(start->next != NULL ) fun(start->next->next); printf("%d ", start->data); }

• 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 functionality of the following piece of code? public int function(int data) { Node temp = head; int var = 0; while(temp != null) { if(temp.getData() == data) { return var; } var = var+1; temp = temp.getNext(); } return Integer.MIN_VALUE; }

• Find and delete a given element in the list
• Find and return the given element in the list
• Find and return the position of the given element in the list
• Find and insert a new element in the list

Linked lists are not suitable to for the implementation of?

• Insertion sort
• Radix sort
• Polynomial manipulation
• Binary search

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

Which of these is an application of linked lists?

• To implement file systems
• For separate chaining in hash-tables
• To implement non-binary trees
• All of the mentioned

In circular linked list, insertion of node requires modification of?

• One pointer
• Two pointer
• Three pointer
• None