SRM RMP-MCA -20.01.2024-FN

What does the following function do? 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

What is the modified list after the following double linked list is passed to the function call: NULL<-1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6->NULL void fun(struct node **head_ref) { struct node *temp = NULL; struct node *current = *head_ref; while (current != NULL) { temp = current->prev; current->prev = current->next; current->next = temp; current = current->prev; } if(temp != NULL ) *head_ref = temp->prev; }

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

What will be the output of the following code snippet for the list 1->2->3->4->5->6? void solve(struct node* start) { if(start == NULL) return; printf("%d ", start->data); if(start->next != NULL ) solve(start->next->next); printf("%d ", start->data); }

• 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 will the function return if the following list is passed 1 -> 2 -> 3 -> 4 -> 5 int solve(ListNode* root) { int sum = 0; while (root != NULL) { sum += root -> val; root = root -> next; } return sum; }

• 15
• 20
• 5
• 1

What does the following code snippet do? ListNode* solve(ListNode* head) { ListNode* prev = NULL; if(head == NULL) { return head; } if(head -> next == NULL) { return head; } ListNode* curr = head -> next; while(head != NULL) { head -> next = prev; prev = head; head = curr; if(curr != NULL) { curr = curr -> next; } } return prev; }

• Returns the original linked list
• Returns the linked list after reversing it
• Returns a linked list containing elements at odd indices only
• None of the above

What will be the output of the following code snippet for 1->2->3->4->5? void solve (ListNode* head) { while(head != NULL) { cout << head -> data << " "; head = head -> next; } }

• 1 2 3 4 5
• 5 4 3 2 1
• 1 3 5 2 4
• 2 4 1 3 5

What does the following code snippet do? int solve (ListNode* list) { ListNode* fast = list; ListNode* slow = list; while(fast -> next != NULL && fast -> next -> next != NULL) { fast = fast -> next -> next; slow = slow -> next; } return slow -> data; }

• Find middle element in the linked list.
• Find last element in the linked list
• Find first element in the linked list
• None of the above

What does the following code snippet do? void solve(ListNode* node) { node = node -> next; }

• Deletes the given node from the linked list
• Deletes head of the list
• Deletes last node of the list
• None of the above

which of the following options creates a new node for the code snippet: struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr;

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

What is the functionality of the following code? public void function(Node node) { if(size == 0) head = node; else { Node temp,cur; for(cur = head; (temp = cur.getNext())!=null; cur = temp); cur.setNext(node); } size++; }

• Inserting a node at the beginning of the list
• Deleting a node at the beginning of the list
• Inserting a node at the end of the list
• Deleting a node at the end of the list