Data Structure Basics

What is a linked list?

• A linked list is a data structure that only allows elements to be added at the beginning

• A linked list is a data structure that stores elements in a circular manner

• A linked list is a linear data structure where elements are stored in nodes. Each node contains a data field and a reference (link) to the next node in the sequence.

• A linked list is a type of array with fixed size

How is a stack different from an array?

• A stack differs from an array in terms of the order in which elements are accessed and removed.

• A stack can store elements of different data types, which an array cannot.

• A stack allows access to elements randomly, unlike an array.

• A stack is resizable while an array is fixed in size.

Explain the concept of FIFO in queues.

• FIFO in queues means the element that is removed last is the one that is added first.

• FIFO in queues means the element that is added last is the one that is removed first.

• FIFO in queues means the element that is added first is the one that is removed first.

• FIFO in queues means the element that is removed first is the one that is added last.

What is the purpose of a doubly linked list?

• To limit the number of elements that can be stored

• To only allow traversal in one direction

• To allow traversal in both directions and make operations like insertion and deletion more efficient.

• To make operations like insertion and deletion less efficient

What are the two main operations performed on a queue?

• add and remove

• push and pop

• 
• insert and remove

How is a circular queue different from a regular queue?

• In a circular queue, elements can be accessed in any order, while in a regular queue, elements can only be accessed sequentially

• In a circular queue, once the queue becomes full, it can overwrite old elements starting from the beginning of the queue, whereas a regular queue cannot overwrite elements and requires resizing or shifting elements.

• A circular queue can only be implemented using arrays, while a regular queue can be implemented using linked lists

• In a circular queue, elements are always stored in a random order, whereas in a regular queue, elements are stored sequentially

What is the role of a head/start pointer in a linked list?

• Points to the first node of the linked list.

• Stores the data of the linked list

• Acts as a tail pointer

• Skips every other node

Explain the concept of a priority queue.

• A priority queue is a data structure that always serves the element with the lowest priority first.

• A priority queue is a data structure that stores elements along with their associated priorities. The element with the highest priority is served before elements with lower priorities.

• A priority queue is a data structure that serves elements based on their insertion order.

• A priority queue is a data structure that stores elements in random order.

What is the significance of a top pointer in a stack?

• The top pointer in a stack is used to delete elements from the stack

• The top pointer in a stack is irrelevant and not used in stack operations

• The top pointer in a stack provides easy access to the most recently added element.

• The top pointer in a stack indicates the size of the stack

Compare and contrast singly linked lists and doubly linked lists.

• Doubly linked lists have each node pointing to the next node only.

• Singly linked lists have each node pointing to the previous node.

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

• Singly linked lists have constant time complexity for inserting and deleting nodes.