MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -A doubly linked list is a variant of a linked list in which each node has pointers to both the next and previous nodes in the list. This allows for efficient insertion and deletion of elements, as well as the ability to move through the list in both directions.

Detailed explanation-2: -A stack is represented using nodes of a linked list. Each node consists of two parts: data and next(storing the address of the next node). The data part of each node contains the assigned value, and the next points to the node containing the next item in the stack. The top refers to the topmost node in the stack.

Detailed explanation-3: -Stacks in Data Structures is a linear type of data structure that follows the LIFO (Last-In-First-Out) principle and allows insertion and deletion operations from one end of the stack data structure, that is top.

Detailed explanation-4: -The Linked List is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers. It is implemented on the heap memory rather than the stack memory.