1.
What are Abstract Data Type?
Answer: Option 'D'
They are a set of values and operations for manipulating those values, Arrays, stacks, queues, lists, and trees are all examples of abstract data types
2.
Which of the following are the heuristics for data structure diagram?
Answer: Option 'D'
All of the mentioned
3.
The contiguous structures stores record in which of the field location?
Answer: Option 'D'
All of the mentioned
4.
What is Linked Implementation?
Answer: Option 'B'
Values are not necessarily stored in adjacent memory cells and are accessed using pointers or references
5.
Figure out the incorrect statements for pseudo code?
Answer: Option 'D'
None of the mentioned
6.
Algorithms may be stated in an operation specification for which of the following reasons?
Answer: Option 'C'
All of the mentioned
7.
What is minispec?
Answer: Option 'D'
All of the mentioned
8.
What is a Reference denoted by?
Answer: Option 'B'
They to memory cells are represented by pointer arrows originating in the memory cell rectangles & dot represents the null pointer
9.
Data structures generally employ which of the following implementation strategies?
Answer: Option 'C'
All of the mentioned
10.
What is data structure diagram?
Answer: Option 'A'
A simple graphical notation is traditionally used to depict data structures