Sasi-AN-02.05.2024

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

Linked lists are not suitable to for the implementation of?

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

In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

• Pointer to character
• Pointer to integer
• Pointer to node
• Node

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

The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?

• Singly linked list
• Doubly linked list
• Circular doubly linked list
• Array implementation of list

Consider the following definition in c programming language.Which of the following c code is used to create new node? 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 kind of linked list is best to answer question like "What is the item at position n"?

• Singly linked list
• Doubly linked list
• Circular linked list
• Array implementation of linked list

Linked lists are not suitable to for the implementation of?

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

Linked list is considered as an example of ___________ type of memory allocation.

• Dynamic
• Static
• Compile time
• None of the mentioned