Data Structures Basics

What is a linked list?

• A linked list is a linear data structure where each element is a separate object called a node. Each node contains a data field and a reference (link) to the next node in the sequence.

• A linked list is a form of hash table

• A linked list is a type of tree structure

• A linked list is a two-dimensional array

How are nodes connected in a linked list?

• Nodes in a linked list are connected through cables.

• Nodes in a linked list are connected through wireless signals.

• Nodes in a linked list are connected through Bluetooth.

• Nodes in a linked list are connected through pointers.

What is the difference between a singly linked list and a doubly linked list?

• A singly linked list has nodes pointing to both the next and previous nodes.

• A doubly linked list has nodes pointing to the next node only.

• The main difference is that a singly linked list has nodes pointing to the next node only, while a doubly linked list has nodes pointing to both the next and previous nodes.

• A singly linked list has nodes pointing to the previous node only.

What is a stack and how is it different from a linked list?

• A stack follows the LIFO principle, while a linked list allows for dynamic size and efficient insertion/deletion at any position.

• A stack allows for dynamic size and efficient insertion/deletion at any position, while a linked list has a fixed size.

• A stack and a linked list are essentially the same data structure with different names.

• A stack follows the FIFO principle, while a linked list follows the LIFO principle.

Explain the concept of LIFO in the context of stacks.

• In the context of stacks, LIFO refers to the First In, First Out principle where the first added item is the first one to be removed.

• LIFO stands for Last In, Last Out in stacks, meaning the last added item is the last one to be removed.

• In the context of stacks, LIFO refers to the Last In, First Out principle where the most recently added item is the first one to be removed.

• LIFO in stacks means the items are removed randomly without any specific order.

What is a queue and how is it different from a stack?

• A queue is different from a stack because it follows the FIFO principle, while a stack follows the LIFO principle.

• A queue is different from a stack because it follows the FILO principle, while a stack follows the FIFO principle.

• A queue is different from a stack because it is implemented using arrays, while a stack is implemented using linked lists.

• A queue is different from a stack because it allows random access, while a stack does not.

Explain the concept of FIFO in the context of queues.

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

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

• FIFO in queues means elements are removed based on their size.

• FIFO in queues means elements are removed randomly.

How can you implement a stack using an array?

• To implement a stack using an array, you should use the splice() method exclusively.

• You can implement a stack using an array by utilizing the push() and pop() methods to add and remove elements, respectively.

• Implementing a stack with an array involves only using the slice() method.

• You can implement a stack using an array by using the shift() and unshift() methods.

How can you implement a queue using two stacks?

• Use a queue for enqueue and a stack for dequeue operations

• Use a single stack for both enqueue and dequeue operations

• Use one stack for enqueue and another for dequeue operations.

• Use two stacks for both enqueue and dequeue operations

What are the applications of stacks and queues in real-life scenarios?

• Stacks and queues in weather forecasting

• Stacks and queues for traffic management

• Various real-life scenarios such as undo mechanisms, backtracking, function call management, printer queues, call center systems, and task scheduling.

• Using stacks and queues for cooking recipes