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.

81. A simple type whose values contain no subparts, is called
a. Integer type
b. String type
c. Boolean type
d. Aggregate type
View Answer Report Discuss Too Difficult!
Answer: (a).Integer type

82. Records can be accessed by unique numbers, that are known to be
a. Record-match query
b. Exact-match query
c. Data-match query
d. Query-match
View Answer Report Discuss Too Difficult!
Answer: (b).Exact-match query

83. Interface of ADT can be defined in terms of
a. Type
b. Set of operations
c. Set of assertions
d. Both a and b
View Answer Report Discuss Too Difficult!
Answer: (d).Both a and b

84. Term that makes realization of a data type as a software component is called
a. Actual data type
b. Abstract data type
c. Visual data type
d. Component data type
View Answer Report Discuss Too Difficult!
Answer: (b).Abstract data type

85. A record is modifiable only when medication does not affect its
a. Resource requirements
b. Degradation requirements
c. Space requirements
d. Reference requirements
View Answer Report Discuss Too Difficult!
Answer: (c).Space requirements

86. A solution is assumed to be efficient if it is able to solve problem within required
a. Constraints
b. Processing
c. Decision making
d. Developers
View Answer Report Discuss Too Difficult!
Answer: (a).Constraints

87. An implementation for an ADT is called
a. Data process
b. Data movement
c. Data structure
d. Data member
View Answer Report Discuss Too Difficult!
Answer: (c).Data structure

88. Data structure that allows extremely fast exact-match search, is known to be
a. Arrays
b. Pointers
c. Stacks
d. Hash tables
View Answer Report Discuss Too Difficult!
Answer: (d).Hash tables

89. A data item can be thought of a member of a
a. Type
b. Function
c. Standard
d. Structure
View Answer Report Discuss Too Difficult!
Answer: (a).Type

90. Data structure that support efficient insertion of new records, is said to be
a. Array
b. Hash table
c. Pointer
d. Stack
View Answer Report Discuss Too Difficult!
Answer: (b).Hash table