Data Structures Basics Mcqs
Our collections of Multiple choice questions and answers focuses on study of ” Data Structures Basics “. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Data Structures Basics comprehensively.
17. A relation that can be used to partition a set into equivalence classes is called
Symmetric
Asymmetric
Equivalence
Non-equivalence
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
18. A sequence is also referred to as a
Tuple
Instsance
Domain
Attribute
19. A set cannot have
Unique values
Uniform values
Duplicate values
Sequenced values
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
20. A simple type whose values contain no subparts, is called
Integer type
String type
Boolean type
Aggregate type
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
21. A solution is assumed to be efficient if it is able to solve problem within required
Constraints
Processing
Decision making
Developers
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
22. A task to be performed is known as
Operation
Work
Function
Problem
23. A ________is a linear list of data elements in which the addition of a new element or the deletion of an element occurs only at one end.
Top
Push and pop
Stack
None of the above
24. ADT is called as Abstract because
It is completely independent data type
It is collection of different data types
Implementation Details are hidden
None of these
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
25. ADT stands for
Array data type
Actual data type
Abstract data type
Assertion data type
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
26. Algorithm that begins with First position in array and looks at each value in turn until it is found is known to be
Linear seaching
Binary searching
Sequential searching
Tree searching
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
27. An ADT and data related to its implementation together make up a
Type
Class
Object
Member
28. An ADT is defined to be a mathematical model of a user-defined type along with the collection of all ____________ operations on that model
Primitive
Structured
Cardinality
Assignment
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
29. An algorithm is composed of a series of
Steps
Structures
Domains
Architectures
30. An algorithm must have
Correct guidelines
Infinite length
Termination
Both a and b
Answer & Solution
No Solution for this Answer..! Report or Discus this Question