MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Implementation − Implementation provides the internal representation of a data structure. Implementation also provides the definition of the algorithms used in the operations of the data structure.

Detailed explanation-2: -Implementation. Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by a pointer-a bit string, representing a memory address, that can be itself stored in memory and manipulated by the program.

Detailed explanation-3: -Most of the data structures make use of arrays to implement their algorithms. Following are the important terms to understand the concept of Array.

Detailed explanation-4: -Representation of data structure in memory is known as Abstract Data Type. Abstract data types can be a list, stack, or queue which will be used to represent different data structures in memory.

Detailed explanation-5: -Implementation Independent Structures These data structures are more abstractly discussed. They may be implemented with different underlying structures. For example the stack and queue could be implemented either as a linked list or an array.