DSA LINKED LIST QUIZ

What is a singly linked list?

• A singly linked list is a collection of elements that are all of the same data type.

• A singly linked list is a linear data structure where each element points to the next, forming a chain.

• A singly linked list is a type of tree structure with multiple branches.

• A singly linked list is a data structure where elements are stored in a grid format.

How does a doubly linked list differ from a singly linked list?

• A doubly linked list does not allow for node deletion.

• A singly linked list uses more memory than a doubly linked list.

• A doubly linked list can only be traversed from the end to the beginning.

• A doubly linked list allows traversal in both directions, while a singly linked list allows traversal in only one direction.

What are the advantages of using linked lists over arrays?

• Fixed size allocation

• Advantages of linked lists over arrays include dynamic size, efficient insertions and deletions, and better memory management.

• Slower access time for elements

• Higher memory overhead for storage

Describe the structure of a node in a singly linked list.

• A node in a singly linked list contains three fields: 'data', 'next', and 'prev'.

• A node in a singly linked list has only one field: 'data'.

• A node in a singly linked list is a complex data structure with multiple pointers.

• A node in a singly linked list has two fields: 'data' (to store the value) and 'next' (a pointer to the next node).

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

• O(n^2)

• O(log n)

• O(n)

• O(1)

Explain how to traverse a doubly linked list.

• Use only 'prev' to traverse the list in both directions.

• Traverse a doubly linked list by starting at the head and using 'next' to move forward, or 'prev' to move backward.

• Traverse the list by jumping to random nodes without following pointers.

• Start at the tail and only use 'next' to move forward.

What are some common applications of linked lists in programming?

• File input/output operations

• Sorting algorithms

• Common applications of linked lists include implementing stacks and queues, dynamic memory allocation, adjacency lists for graphs, undo functionality in applications, and maintaining a list of items in a game.

• Implementing binary trees

How do you delete a node from a singly linked list?

• Remove the node by setting its value to null.

• Add a new node in place of the node to be deleted.

• Update the previous node's next pointer to skip the node to be deleted.

• Copy the node's value to the next node and delete the next node.

What is the purpose of the 'next' pointer in a singly linked list?

• The 'next' pointer indicates the size of the list.

• The 'next' pointer is used for memory allocation.

• The 'next' pointer connects nodes in a singly linked list, allowing traversal.

• The 'next' pointer stores the value of the node.

Describe a scenario where a linked list would be preferred over an array.

• A linked list is preferred for scenarios with frequent insertions and deletions, such as managing a dynamic playlist.

• A linked list is best for scenarios with minimal memory usage, such as storing a small number of items.

• A linked list is ideal for scenarios requiring random access to elements, like an array of student grades.

• A linked list is preferred for scenarios with fixed-size data, such as storing a month of calendar days.