MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Explanation: A linked list is a collection of objects linked together by references from an object to another object. By convention these objects are names as nodes. Linked list consists of nodes where each node contains one or more data fields and a reference(link) to the next node.

Detailed explanation-2: -Link − Each link of a linked list can store a data called an element. Next − Each link of a linked list contains a link to the next link called Next. LinkedList − A Linked List contains the connection link to the first link called First.

Detailed explanation-3: -A linked list is a sequence of nodes that contain two fields: an integer value and a link to the next node. The last node is linked to a terminator used to signify the end of the list.

Detailed explanation-4: -In the linked list, we need to traverse through each element until we reach the nth position. Time taken to access an element represented in arrays is less than the singly, doubly and circular linked lists. Thus, array implementation is used to access the item at the position n.

Detailed explanation-5: -What does the following function do for a given Linked Listst with first node as head? void fun1(struct node* head) if(head == NULL) return; fun1(head-> next); printf("%d “, head-> data); a. Prints all nodes of linked lists.