Linked Lists

Which of the following is not a disadvantage to the usage of array?

• Fixed size

• There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size

• Insertion based on position

• Accessing elements at specified positions

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

• O(1)

• O(n)

• O(logn)

• O(n²)

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

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

Insertion of an element at the middle of a linked list requires the modification of how many pointers?

• 2

• 1

• 3

• 4

Insertion of an element at the front of a linked list requires the modification of how many pointers?

• 2

• 1

• 3

• 4

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 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));

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

• Dynamic

• Static

• Compile time

• None of the mentioned