DS - UNIT1 TEST

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

• Value of a node

• Address of Next Node

• Address of the previous Node

• All of the above

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

3

• 2

• 1

• 3

• 4

. 

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

• 2

• 1

• 3

• 4

Which of the following can be done with LinkedList?

• Implementation of Stacks and Queues

• Implementation of Trees

• Implementation of Data Structures that can stimulate Dynamic Arrays

• All of the Above

Which type of linked list stores the address of the head node in the next pointer of the last node?

• Singly Linked List

• Doubly Linked List

• Hashed List

• Circular Linked List

Polynomial addition can be implemented using which of the following datastructure?

• Linked List

• Trees

• Stacks

• None of the above

A linked list in which none of the nodes contains a NULL pointer is?

• Singly Linked List

• Doubly Linked List

• Circular Linked List

• None of the above

Which of the following statements are true?

• Random access of elements at a linked list is not possible.

• Arrays have better cache locality than linked list.

• The size of linked list is dynamic and can be changed as needed.

• All of the above

What will be the output of the following code snippet for 1->2->3->4->5?

• 12345

• 54321

• 13524

• 24135

Which of the following is optimal to find an element at kth position at the linked list?

• 
  

  Singly Linked List

• Doubly Linked List

• Circular Linked List

• Array implementation of linked list.