Explain these terms - Linked List, Stack, Queue.

Question

Accepted Answer

Linked List is a linear data structure. Stack and Queue are abstract data types.

Linked List: A collection of nodes where each node points to the next node.
Stack: A data structure where elements are added and removed from the top only.
Queue: A data structure where elements are added at the rear and removed from the front only.
Example: Browser history can be implemented using a Linked List.
Example: Undo/Redo functionality can be implemented using a Stack.
Example: Print queue can be implemented using a Queue.

Accepted Answer

Stacks are based on the LIFO principle, i.e., the element inserted at the last is the first element to come out of the list. Queues are based on the FIFO principle, i.e., the element inserted at the first is the first element to come out of the list. The main difference between Stack and Linked List is that a Stack works according to the FIFO mechanism while a Linked List works by storing the data and the addresses of other nodes to refer to each other.

Explain these terms - Linked List, Stack, Queue.

Top Cognizant Full Stack Software Developer interview questions & answers

Popular interview questions of Full Stack Software Developer

Top HR questions asked in Cognizant Full Stack Software Developer