Data Structures

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 alternate nodes of Linked List

• Prints all nodes of linked list in reverse order

• Print alternate nodes in reverse order

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

• Log(2^n)

• n/2

• Log n

• n

A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p point such that both the operations enQueue and deQueue can be performed in constant time?

• Rear Node

• Front Node

• Not possible with one pointer

• node next to front

What are the application(s) of linked list?

• Implementation of stacks and queues

• 
  Maintaining a directory of names

• None of the above

• 
  Both a and b

Which of the following information is stored in a doubly-linked list’s nodes?

• Value of the node

• Address of the next node

• Address of the previous node

• All the above

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as _____________

• Queue
  

• Stack
  

• Tree
  

• Linked list

Which principle is followed by the Queue data structure? 

• LIFO

• FILO

• FIFO

• LILO

What is a circular queue? 

• A queue that can only hold circular objects 

• A queue where the last element points to the first 

• A queue where the first element points to the last 

• None of the above 

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

• 3

• 2

• 1

• 4

What is the time complexity to insert an element to the front of a LinkedList(head pointer given)?

• O(1)

• O(n)

• O(Log n)

• None of the above