Sasi-FN-03.05.2024

Consider a small circular linked list. How to detect the presence of cycles in this list effectively?

• Possible if X is not last node
• Possible if size of linked list is even
• Possible if size of linked list is odd
• Possible if X is not first node

What is the best case time complexity of deleting a node in a Singly Linked list?

• O (n)
• O (n2)
• O (nlogn)
• O (1)

Which of the following statements are not correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?

• Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL
• SLL uses lesser memory per node than DLL
• DLL has more searching power than SLL
• Number of node fields in SLL is more than DLL

Which of the following data structures can be used for parentheses matching?

• n-ary tree
• queue
• priority queue
• stack

Minimum number of queues to implement stack is ___________

• 3
• 4
• 1
• 2

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?

• Possible if X is not last node
• Possible if size of linked list is even
• Possible if size of linked list is odd
• Possible if X is not first node

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

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list

• Only P4
• Only P1
• P1 and P4.
• P1 and P2

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?

• ptr = (NODE*)malloc(sizeof(NODE));
• ptr = (NODE*)malloc(NODE);
• ptr = (NODE*)malloc(sizeof(NODE*));
• ptr = (NODE)malloc(sizeof(NODE));

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