MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -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-2: -A graph can be represented using 3 data structures-adjacency matrix, adjacency list and adjacency set. An adjacency matrix can be thought of as a table with rows and columns.

Detailed explanation-3: -The memory representation of a text is the result of inferential processes that take place during reading. These processes allow the reader to establish coherence as he or she proceeds through the text.

Detailed explanation-4: -Arrays are represented with diagrams that represent their memory use on the computer. These are represented by the square boxes that represent every bit of the memory. We can write the value of the element inside the box.

Detailed explanation-5: -A linear data structure, that represents a relationship between elements by successive memory location, is known as an array. Whereas, a linear data structure that represents a relationship between elements, by a pointer and link, is known as a linked list. Common non-linear data structures are a tree, graph, etc.