A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

21. What is precondition?
a. It is an assertion that must be true at the initiation of an operation
b. It is an assertion that must be true upon completion of an operation
c. It is a statement that must be true at a designated point in a program
d. None of the mentioned
View Answer Report Discuss Too Difficult!
Answer: (a).It is an assertion that must be true at the initiation of an operation

22. What is Class Invariant?
a. A class invariant is an assertion that must be true of any class instance between calls of its exported operations
b. Class invariants must be established by class constructors
c. Class invariants must be preserved by every exported operation in the class
d. All of the mentioned
View Answer Report Discuss Too Difficult!
Answer: (d).All of the mentioned

23. Which of the following are post condition heuristics?
a. Specify restrictions on parameters
b. Specify conditions that must have been established
c. Specify empty preconditions as true or none
d. None of the mentioned
View Answer Report Discuss Too Difficult!
Answer: (d).None of the mentioned

24. Which of the following are class invariant heuristics?
a. Specify restrictions on attributes
b. Specify restrictions on parameters
c. Specify relationships between the parameters and the results
d. All of the mentioned
View Answer Report Discuss Too Difficult!
Answer: (a).Specify restrictions on attributes

25. 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
View Answer Report Discuss Too Difficult!
Answer: (c).All of the mentioned

26. 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
View Answer Report Discuss Too Difficult!
Answer: (d).All of the mentioned

27. 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
View Answer Report Discuss Too Difficult!
Answer: (d).None of the mentioned

28. 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
View Answer Report Discuss Too Difficult!
Answer: (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

29. 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
View Answer Report Discuss Too Difficult!
Answer: (c).All of the mentioned

30. 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
View Answer Report Discuss Too Difficult!
Answer: (b).Values are not necessarily stored in adjacent memory cells and are accessed using pointers or references

Page 3 of 13