Data Structures Linked List Quiz

What is a singly linked list?

• A list that contains only even numbers

• A list that can only store integers

• A data structure that consists of a sequence of nodes where each node contains a data field and a reference to the next node in the sequence.

• A type of list that allows elements to be accessed in reverse order

Explain the concept of node in a singly linked list.

• A node is a type of function in programming languages

• A node is a basic unit of the list that contains data and a reference to the next node in the sequence.

• A node is a type of leaf in a tree structure

• A node is a type of data structure used in arrays

What is a doubly linked list?

• A type of list where each node contains a reference to the next node only

• A type of list where each node contains a reference to the previous node only

• A type of list where each node contains a reference to both the previous and the next node, but in a random order

• A type of linked list where each node contains a reference to the previous and the next node.

Differentiate between singly linked list and doubly linked list.

• Singly linked list has each node pointing to the previous node

• Doubly linked list has each node pointing to the next node only

• Singly linked list has each node pointing to the next node, while doubly linked list has each node pointing to both the next and previous nodes.

• Singly linked list has each node pointing to both the next and previous nodes

What are the basic operations that can be performed on a linked list?

• Insertion, deletion, traversal, and searching

• Sorting, filtering, merging, reversing

• Addition, subtraction, multiplication, division

• Copying, pasting, cutting, formatting

Explain the process of inserting a new node at the beginning of a linked list.

• Delete the current head of the linked list and then insert the new node

• Set the next pointer of the new node to null and then update the head of the linked list to point to the new node

• Insert the new node at the end of the linked list instead of the beginning

• Set the next pointer of the new node to the current head of the linked list, then update the head of the linked list to point to the new node.

What are the applications of linked list in computer science?

• Creating static arrays

• Implementing data structures and dynamic memory allocation

• Sorting algorithms

• Implementing GUI interfaces

How is a linked list used in implementing a stack data structure?

• The middle node of the linked list is used as the top of the stack.

• The linked list is not used in implementing a stack data structure.

• The head of the linked list is used as the top of the stack.

• The tail of the linked list is used as the top of the stack.

What is the time complexity of searching an element in a linked list?

• O(n^2)

• O(n)

• O(1)

• O(log n)

What is the time complexity of inserting an element at the end of a linked list?

• O(log n)

• O(n)

• O(n^2)

• O(1)