MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Arrays: A collection of elements stored in contiguous memory locations. Linked Lists: A collection of nodes, each containing an element and a reference to the next node. Stacks: A collection of elements with Last-In-First-Out (LIFO) order.

Detailed explanation-2: -An array is a collection of items of same data type stored at contiguous memory locations.

Detailed explanation-3: -A general definition of a linear list might say that it is a sequence of nodes together with a set of operations on those nodes. The undefined term “node” can be thought of as something carrying some information; it might be a person’s health record, a playing card, or simply an integer.

Detailed explanation-4: -An array is a collection of elements of the same type placed in contiguous memory locations that can be individually referenced by using an index to a unique identifier. Five values of type int can be declared as an array without having to declare five different variables (each with its own identifier).

Detailed explanation-5: -Unlike Arrays, LinkedList is not stored in a contiguous memory location. Each element int the list is spread across the memory and are linked by the pointers in the Node. Thus whenever a new element needs to be added a separate memory is allocated enough to store both key and the pointer to the next element.