DS Module 3 Linked List

Which of the following can be done with Linked List?

• Implementation of Stacks and Queues

• Implementation of Binary Trees

• Implementation of Data Structures that can simulate 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

In which type of linked lists traversals can be performed in both directions?

• Singly Linked Lists

• Doubly Linked Lists

• Circular Linked Lists

• None of the above

Which of the following statements are true?

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

• Linked lists are not stored in contiguous location

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

• All of the above

Which type of linked list has neither beginning nor end?

• Singly Linked List

• Doubly Linked List

• Circular Linked List

• None of the above

Which of the following is not an example of linear data structure?

• Graph

• Linked list

• Array

• Stack

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

The type of pointer used to point to the address of the next element in a linked list?

• Pointer to character

• Pointer to integer

• Pointer to node

• None of the above

What is a linked list?

• A collection of data elements stored in contiguous memory locations.

• A sequence of elements where each element points to the next element.

• A collection of key-value pairs.

• A data structure where elements are stored in a hierarchical manner.

Which operation is faster in a linked list compared to an array?

• • Accessing an element by index

• • Inserting an element at the beginning

• • Inserting an element at the end

• Accessing the last element