Datastructure Basics

What is a linked list?

• A linked list has a fixed size

• A linked list does not contain nodes

• A linked list is a type of tree structure

• 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.

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 wires.

• Nodes in a linked list are connected through tubes.

• Nodes in a linked list are connected through pointers.

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

• Doubly linked lists are unidirectional, while singly linked lists are bidirectional.

• The memory usage of singly linked lists is higher than that of doubly linked lists.

• Singly linked lists have nodes with two links, while doubly linked lists have nodes with one link.

• The main difference is that singly linked lists have one link per node, pointing to the next node, while doubly linked lists have two links per node, pointing to both the next and previous nodes.

Explain the concept of a stack.

• A stack is a data structure that follows the First In, First Out (FIFO) principle.

• A stack is a data structure that does not restrict the order of element retrieval.

• A stack is a data structure that follows the Last In, First Out (LIFO) principle.

• A stack is a data structure that allows random access to elements.

What is the rule followed in stack data structure?

• First In First Out (FIFO)

• Last In First Out (LIFO)

• Shortest element first

• Random order

How is a stack different from a queue?

• In a stack, elements are added and removed from the same end following the Last In First Out (LIFO) principle. In a queue, elements are added at the rear and removed from the front following the First In First Out (FIFO) principle.

• In a stack, elements are removed from the front, while in a queue, elements are removed from the rear.

• Stacks are typically implemented using arrays, while queues are implemented using linked lists.

• Stacks allow random access to elements, while queues only allow sequential access.

Define a queue.

• A queue is a non-linear data structure.

• A queue is a data structure that follows the Last In First Out (LIFO) principle.

• A queue is a linear data structure that follows the First In First Out (FIFO) principle.

• A queue is a data structure that allows random access to elements.

What is the principle followed in a queue?

• First In First Out (FIFO)

• Last In First Out (LIFO)

• Alphabetical order

• Random selection

Explain the concept of FIFO in queues.

• FIFO in queues means elements are removed randomly.

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

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

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

How are elements added and removed in a queue?

• Elements are added using 'enqueue' and removed using 'dequeue'.

• Elements are added using 'add' and removed using 'remove'.

• Elements are added using 'insert' and removed using 'delete'.

• Elements are added using 'push' and removed using 'pop'.