Algorithm and Data Structure Specification - Software Design Question and Answers

1.

What are Abstract Data Type?

   A.) They are a set of values and operations for manipulating those values
   B.) They are a scheme for storing values in computer memory
   C.) Arrays, stacks, queues, lists, and trees are all examples of abstract data types
   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

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?

   A.) Label record fields only once
   B.) Use ellipses to simplify large, repetitive structures
   C.) Draw linked structures so that the pointers point down the page or from left to right
   D.) All of the mentioned

Answer: Option 'D'

All of the mentioned

3.

The contiguous structures stores record in which of the field location?

   A.) The left subtree
   B.) The right subtrees
   C.) The node
   D.) All of the mentioned

Answer: Option 'D'

All of the mentioned

4.

What is Linked Implementation?

   A.) Values are stored in adjacent memory cells
   B.) Values are not necessarily stored in adjacent memory cells and are accessed using pointers or references
   C.) Values are not stored in adjacent memory cells
   D.) None of the mentioned

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?

   A.) Pseudo code is English augmented with programming language constructs
   B.) It offers much of the ease and power of expression of English together with the precision of a programming language
   C.) There are many versions of pseudo code and no widely accepted standard
   D.) None of the mentioned

Answer: Option 'D'

None of the mentioned

6.

Algorithms may be stated in an operation specification for which of the following reasons?

   A.) An algorithm may be stated to provide a procedural specification of the operation’s behavior
   B.) An algorithm may be stated to specify that the algorithm is to be used in the implementation
   C.) All of the mentioned
   D.) None of the mentioned

Answer: Option 'C'

All of the mentioned
 

7.

What is minispec?

   A.) It is a step-by-step description of how an operation transforms its inputs to outputs
   B.) Calls to other operations may be included in minispec
   C.) They are more often written in a pseudo code language
   D.) All of the mentioned

Answer: Option 'D'

All of the mentioned

8.

What is a Reference denoted by?

   A.) They to memory cells are represented by pointer arrows originating in the memory cell rectangles
   B.) They to memory cells are represented by pointer arrows originating in the memory cell rectangles & dot represents the null pointer
   C.)  They are represented by connecting disjoint collections of arrays or records with pointer arrows
   D.) A dot represents the null pointer

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?

   A.) Contiguous Implementation
   B.) Linked Implementation
   C.) All of the mentioned
   D.) None of the mentioned

Answer: Option 'C'

All of the mentioned

10.

What is data structure diagram?

   A.) A simple graphical notation is traditionally used to depict data structures
   B.) It is a scheme for storing values in computer memory
   C.) All of the mentioned
   D.) None of the mentioned

Answer: Option 'A'

A simple graphical notation is traditionally used to depict data structures


Algorithm and Data Structure Specification Download Pdf

Recent Posts