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.
2. A collection of elements having an specific order is called
Program
Sequence
Structure
Relation
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
3. A collection of values are known as
Chain
Type
Stack
Array
4. A data item can be thought of a member of a
Type
Function
Standard
Structure
5. A data structure is a group of data elements grouped together under ______.
One name
Different names
Multiple names
Same name
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
6. A data structure requires a certain amount of space for each
Data process
Data movement
Data item
Data action
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
7. A function can be thought as a matching between
Inputs
Outputs
Parameters
Both a and b
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
8. A function or a mapping of inputs to outputs is called
Process
Program
Algorithm
Problem
9. A given algorithm is able to compute
2 functions only
Particular function
Multiple functions
Infinite functions
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
10. A growth rate of n, is referred to as
Absolute growth rate
Linear growth rate
Exponential growth rate
Quadratic growth rate
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
11. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a
Queue
Stack
Tree
Linked list
12. A list which displays the relationship of adjacency between elements is said to be
Linear
Non linear
Linked list
Trees
13. A problem definition should not include any
Inputs
Outputs
Constraints
Steps
Answer & Solution
No Solution for this Answer..! Report or Discus this Question
14. A random access file is organized most like a(n):
Array
Object
Class
Pointer
15. A record is modifiable only when medication does not affect its
Resource requirements
Degradation requirements
Space requirements
Reference requirements
Answer & Solution
No Solution for this Answer..! Report or Discus this Question