LINKED LIST

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

• a) Fixed size
  
  

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

• c) Insertion based on position
  

• d) Accessing elements at specified positions

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

• a) O(1)
  

• b) O(n)
  

• c) O(logn)
  

• d) O(n²)

A linear collection of data elements where the linear node is given by means of pointer is called?

• a) Linked list
  

• b) Node list
  

• c) Primitive list
  

• d) Unordered list

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

• a) Pointer to character
  

• b) Pointer to integer
  

• c) Pointer to node
  

• d) Node

What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?

• a) O(1)
  

• b) O(n)
  

• c) O(n²)
  

• d) O(n³)

Which of the following c code is used to create new node?

• a) ptr = (struct node*)malloc(sizeof(struct node));
  

• b) ptr = (struct node*)malloc(struct node);

• c) ptr = (struct node*)malloc(sizeof(struct node*));
  

• d) ptr = (struct node)malloc(sizeof(struct node));

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

• a) Dynamic
  

• b) Static
  

• c) Compile time
  

• d) Heap

In Linked List implementation, a node carries information regarding ___________

• a) Data
  

• b) Link
  

• c) Data and Link
  

• d) Node

What does the following function do for a given Linked List with first node as root

• a) Prints all nodes of linked lists
  

• b) Prints all nodes of linked list in reverse order
  

• c) Prints alternate nodes of Linked List
  

• d) Prints alternate nodes in reverse order

Fill the missing code.

• root=nnode;

• nnode->next=root;

• nnode=next;

• nnode->next=nnode;