Abhay Pawar Sir’s

Shree Coaching Classes

Subject : Data Structure (D.S.)
Test :- Unit – I, II and III
Time :- 2.00 Hrs Max. Marks :

Section A : Fill in the blanks

Data structure is a scheme for organizing data in the memory of a computer.

A data structure is said to be Linear if its elements form a sequence.
A two-dimensional array is a collection of similar data elements where each element
is referenced by two subscripts.
A Stack is a linear structure in which items may be added or removed only at one
end.
A special queue known as dequeue allows insertion and deletion of elements at both
the end.
A linked list, or one-way list, is a linear collection of data elements, called Nodes
where the linear order is given by means of pointers.
Insertion operation is used for adding a new element to the list.
Sorting operation is used for arranging the elements in some type of order.
An algorithm is a clearly specified set of simple instructions to be followed to solve a
problem.
The complexity of an algorithm is a function describing the efficiency of the
algorithm in terms of the amount of data the algorithm must process.
Time complexity is a function describing the amount of time an algorithm takes in
terms of the amount of input to the algorithm.
Space complexity is a function describing the amount of

If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and
then removed one at a time, in what order will they be removed?
[D]
A. ABCD
B. ABDC
C. DCAB
D. DCBA

Queue is also known as: [ B ]

A. Last in first out list
B. First in first out list
C. both A and B
D. none of the above

A queue is a data structure in which all insertions and deletions are made
respectively at:
[A]
A. rear and front
B. front and front
C. front and rear
D. rear and rear

A stack is a data structure in which all insertions and deletions of entries

are made at:
[A]
A. One end
B. In the middle
C. Both the ends
D. At any position

Which among the following is a linear data structure: [ D ]

A. Queue
B. Stack
C. Linked List
D. all the above