Understanding Data Structures

What is a singly linked list?

• A singly linked list is a collection of elements stored in a matrix format.

• A singly linked list is a circular data structure where elements are connected in a loop.

• A singly linked list is a data structure that allows random access to elements.

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

How do you insert a node in a singly linked list?

• Add a new node by deleting the last node.

• Create a new list and copy all nodes to it.

• Insert a new node by reversing the list.

• Insert a new node by adjusting pointers in the linked list.

What are the advantages of using a doubly linked list over a singly linked list?

• Singly linked lists allow for faster insertion at both ends.

• Doubly linked lists allow bidirectional traversal, easier node deletion, and more efficient algorithms.

• Doubly linked lists use less memory than singly linked lists.

• Doubly linked lists can only be traversed in one direction.

Explain how to delete a node from a doubly linked list.

• Remove the head node only.

• Reverse the entire list.

• Adjust pointers of adjacent nodes and free the node.

• Replace the node with a new one.

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

• O(log n)

• O(n)

• O(1)

• O(n^2)

Describe the main operations of a queue.

• Add, Remove, Check, Count

• Insert, Remove, View, Empty

• Push, Pop, Top, IsFull

• The main operations of a queue are Enqueue, Dequeue, Peek, IsEmpty, and Size.

What is the difference between a queue and a stack?

• A queue uses LIFO, while a stack uses FIFO.

• A stack allows random access, while a queue does not.

• Both queue and stack use FIFO.

• A queue uses FIFO, while a stack uses LIFO.

How can a queue be implemented using an array?

• A queue can be implemented using a linked list with a single pointer.

• A queue can be implemented using a stack with no pointers.

• A queue can be implemented using an array by using two pointers for front and rear, managing enqueue and dequeue operations accordingly.

• A queue can be implemented using an array without managing front and rear.

What are the advantages of using a linked list over an array?

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

• Higher memory overhead

• Slower search times

• Fixed size allocation

Explain the concept of circular queues.

• A circular queue is a linear data structure that does not allow wrapping around.

• A circular queue is a data structure that connects the end of the queue back to the front, allowing efficient space utilization.

• A circular queue is a type of stack that only allows insertion at one end.

• A circular queue is a data structure that only allows elements to be removed from the front.