MCQ

:Data
Structur
e

MCQ :Data Structure

Index
1. Data structure basics
2. Algorithm Complexity Notations
3. Linked List
4. Stacks and Queues
5. Trees and Binary Trees
6. Binary Search Tree
7. Balanced Trees
8. Graphs
9. Applications of Graphs
10.Dynamic Storage Management
11.Searching and Sorting Techniques
12.File Structures

Unit 1 : Data structure Basics

1. Data structures can be divided in to two types.
(a) Two (b) Three
(c) Three
(d) None.
2. ________is dividing the larger problems to sub problems
(a) Modularity
(b) Complex Programming
(c) Object Programing
(d) None of the above
3. A storage structure representation in auxiliary memory is often called as.
(a) Database
(b) Relational Model
(c) File Structure
(d) Data Structure
4. ________ represents the logical relationship of the particular data sets.
(a) Data structure
(b) Information
(c) Program
(d) None of the above
5. When the data is stored in the memory in linear or sequential form is called
1 | Page

MCQ :Data Structure

(a) Nonlinear Data structure
(b)Linear Data structure
(c) user define data structure
(d) all of the above
6. Array, Stack, Queue, Linked list are examples of
(a) Linear data structure
(b) Nonlinear data structure
(c) data structure
(d) none of these
7. When the data is stored in the memory in dispersed or non-sequential order is
called nonlinear data structure is called
(a) sequential data structure
(b)Non Linear data structure
(c) data structure
(d) Linear data structure
8. ________ is the simplest type of data structures.
(a) array
(b) Linked list
(c) Graph
(d) Tree.
9. Which of the following is not anonlinear data structure?
(a) array
(b) Graph
(c) Binary tree
(d) Binary search tree
10.Generally in linked list the elements are connected by the link field which
contains the
(a) Address
(b) Pointer
(c) Address of the next Node
(d) base address
11.linear list in which insertions and deletions are restricted at one end
(a) Stack
(b) Queue
(c) Array
(d) Linked List
12.The end where element is inserted and deleted in stack is called
(a) Start
(b)Top
(c) First
(d) Front
13.The end where we insert an element in queue is called
(a) Rear
(b) front
(c) Beginning
(d) First
14.The linear data structure which work in FIFO
(a) Array
(b) Linked List
(c) Queue
(d) Tree
15.Stack data structure is works in
(a) fist come first serve
2 | Page

MCQ :Data Structure

(b) FIFO (First in First Out)
(c) LIFO(Last in last Out)
(d) None of the above
16.Which is not nonlinear data structure(a) Tree
(b) Array
(c) Multi-dimensional array
(d) Linked list
17.A nonlinear data structure which contains the hierarchical relationship between
various elements is called
(a) Graph
(b) Binary Tree
(c) Tree
(d) None of the above
18.Data structure in having parent child relationship is called
(a) Linear data structure
(b) Nonlinear data structure
(c) Tree
(d) Graph
19.Data sometimes contain a relationship between pairs of elements which is
necessarily hierarchical in nature is called
(a) Tree
(b) Array
(c) List
(d)Graph
20.________ is used in dividing the larger problems to sub problems
(a) Modularity
(b) Data structure
(c) Object oriented approach
(d) all of these
21.Insertion and deletion of element in queue are done in ________ and ______ ends
respectively.
(a) start and stop end
(b) Top and bottom
(c) Front and rear
(d) none of these
22._____ is called as a list of finite number of elements of similar data types.
(a) List
(b)Array
(c) Linked List
(d) Tree
23.Accessing each record exactly once so that certain item in data structure is
processed is called
(a) Recording
(b)Traversing
(c) Sorting
(d) None
24.is a step by step procedure for solving a particular problem
(a) algorithm
(b) flow chart
(c) sequence chart
(d) Program.
25.The efficiency of the algorithm is depending on
3 | Page

MCQ :Data Structure

(a) Time
(b) Space
(c) Memory
(d)Time and space
26.Combining the records in two different file into a single file
(a) Merging
(b) Sorting
(c) Connecting
(d) Traversing
27.The function which gives the running time and/ or space in terms of the input
size.
(a) Complexity
(b) Program performance
(c) Program Execution
(d) None of these
28.___________ is used in finding the location of the record with the given key
value.
(a)Searching
(b) Sorting
(c) Sequencing
(d) merging
29.__________an element in an array requires elements to be moved down the list.
(a) Searching
(b) Sorting
(c) Inserting
(d) Deleting
30.__________searching records sequentially in data structure.
(a) Binary search
(b)Linear search
(c) None of these
(d) Both A & B

Unit 2: Algorithm Complexity Notations

31.Functions are also called as greater or least integer function.
(a) Floor
(b) Ceiling
(c) Both A and B
(d) None of these
32.The term _____ is used in remainder function
(a) floor
(b) eval
(c) mode
(d) all of these
33.INT (x), converts x into an integer by deleting the______________.
(a) fractional part of the number
(b) point of number
(c) Decimal number
(d) none of these
34.The product of the positive integers from 1 to n, inclusive, is denoted by n! is
called
(a) factorial of a number
(b) Armstrong number
(c) Product of number
(d) Summation of numbers
4 | Page

MCQ :Data Structure

35.A ______of a set of n elements is an arrangement of the elements in a given
order.
(a) Traversing
(b) Sequencing
(c) Ordering
(d)permutation
36.It is a step by step procedure in normal English language for solving a
particular problem.
(a) Algorithm
(b) Procedure
(c) Program
(d) Module
37.ABS(INT(6.36) will returns
(a) 6.36
(b) -6.36
(c) 6
(d) .36
38.It consists of number of condition which leads to selection of one out of several
alternative modules.
(a) Selection logic
(b) Flow logic
(c) Iteration
(d) Sequence
39.Time and space are two main measures for the efficiency of(a) An algorithm
(b) Loop control
(c) Data structure
(d) None of these
40.When the ITEM is in the last position of the array DATA or is not there at all
then complexity is called in
(a) Worst case
(b) Best case
(c) Average case
41.When the ITEM is in the first position of the array DATA, so the complexity is
(a) C(n)=1
(b) O(n)
(c) log(n)
(d) O(n2)
42.Measuring the performance of algorithm in relation with the input size n is
called
(a) rate of growth
(b) rate of Execution
(c) average execution
(d) none of these
43.Which of the following are asymptotic notations
(a) Oh Notation
(b) Omega Notation
(c) Theta Notation
(d)All of these
44.The________ of algorithm highly related with growth of rate
(a) complexity
(b) rate of performance
(c) rate of execution
5 | Page

MCQ :Data Structure

(d) none of these
45.Function returns absolute value of a given number
(a) fix
(b) floor
(c) ceiling
(d)absolute

Unit 3: Linked List

46.Linked list store data ___________.
(a) Dynamically
(b) Statically
(c) Both Dynamic and static
(d) Randomly
47.List is a _____
(a) Self-referential structure
(b) structure
(c) pointer variable
(d) nonlinear data structure
48.Linked list is a linear collection of data elements called(a) Elements
(b)
Nodes
(c) Data values
(d) None of these
49. Each node is divided into ____ parts
(a) Three
(b)Two
(c) Many
(d) Four
50.First part is known as __________where data is stored
(a) Address
(b) Data
(c) Info
(d)Both b & c
51.The next or link field contain
(a) address of another node
(b) address of first node
(c) address of next node in list
(d) address of current node
52.The link field of last node contains a special value, called(a) Null pointer
6 | Page

MCQ :Data Structure

(b) address pointer
(c) value
(d) None of these
53.Generally the data field of a node may be
(a) a record with more than one data item
(b) various data structure
(c) pointers
(d) addresses
54.Which of the following expression advance the current node to next node in list
if p assumed as current node pointer
(a) p++
(b) p=p+1
(c) p=p->next
(d) p->next
55.Processing each node of linked list exactly once is called as
(a) Traversing
(b) Moving
(c) Arranging
(d) None of these
56.To find the location of an ITEM in the list is known as
(a) Searching
(b) Lookup
(c) address search
(d) None of these
57.The operating system of a computer may periodically collect all the deleted
space onto
(a) list
(b) linked list
(c) The free storage list
(d) all of these
58.computer may periodically collect all the deleted space onto the free storage
list is called
(a) Garbage Collection
(b) Memory optimization
(c) Memory Management
(d) None of these
59.The simplest way of inserting a node is by inserting a node at
(a) the beginning of a list
(b) After any node in list
(c) inserting at intermediate position
(d) inserting at the end of list
60.Insertion node at beginning requires change address of
(a) First node of the list
(b) last node of the list
(c) Start pointer of the list
(d) link pointer of the first node
61.The ________of a node is made just by a pointer change
(a) Deletion
(b) Insertion
(c) Searching
(d) Merging
62.Which of the following is not type of the list
(a) Doubly List
7 | Page

MCQ :Data Structure

(b) Singly Linked List
(c) Circular Linked List
(d)Linear Linked List
63.In ________ we cantraverse in both forward and backward direction.
(a) Bidirectional List
(b)Doubly Linked List
(c) Unidirectional List
(d) Circular Linked List
64.______ is the one where the null pointer in the last node is replaced with the
address of the first node.
(a) Circular linked list
(b) Linked List
(c) Singly Link List
(d) Doubly linked list
65.Doubly linked list are also called as _________________.
(a) Two way linked list
(b) Double side linked list
(c) binary linked list
(d) None of these
66.The memory address of the first element of an array is called
(a) Address element
(b)Base Address
(c) Unique address
(d) base Memory
67.Which of the following data structures are indexed structures?
(a) linear arrays
(b) linked lists
(c) both of above
(d) none of above
68.A variable P is called pointer if(a) P contains the address of an element in DATA.
(b) P points to the address of first element in DATA
(c) P can store only memory addresses
(d) P contain the DATA and the address of DATA
69.Which of the following data structure can't store the non-homogeneous data
elements?
(a) Arrays
(b)Records
(c) Pointers
(d) None
70.When new data are to be inserted into a data structure, but there is no
available space; this situation is usually called(a) Underflow
(b)Overflow
(c) Houseful
(d) Saturated
71.The situation when in a linked list START=NULL is
(a) Underflow
(b) Overflow
(c) Houseful
(d) Saturated

8 | Page

MCQ :Data Structure

Unit 4
72.______ is a data structures in which insertion and deletion of items are made at
the one end.
(a) Stack
(b) Queue
(c) Array
(d) Two dimensional Array
73.____ is used to insert an item into a stack.
(a) Pop
(b) Insert
(c) Delete
(d)Push
74.Pop is used to delete an item from a stack.
(a) Delete
(b) Remove
(c) Pop
(d) Clear
75.In stack insertion and deletion can be done from
(a) Top
(b) Base Address
(c) Front
(d) Rear
76.Stack is a an ordered collection of items forming a list that is
(a) Last in first Out
(b) First in First Out
(c) Last in Last Out
(d) First in Last Out
77.Operation in stack affect
(a) Both end
(b) Single end
(c) Top end
(d) None
78.______ and ______ operation belongs to stack
(a) push and pop
(b) insert and delete
(c) Read and write
(d) all of the above
79.Initially top set to
(a) 1
9 | Page

MCQ :Data Structure

(b)-1
(c) 0
(d) Null
80.Implementation of stack can be done either using(a) array or list
(b)array or single linked list
(c) Doubly list or 2D array
(d) Circular or doubly linked list
81.Before executing push operation one must check for the
(a) OVERFLOW
(b) UNDERFLOW
(c) Maximum value
(d) Minimum value
82.Top =Top +1 indicates
(a) A successful push operation
(b) A successful pop operation
(c) Is stack Full
(d) Is stack empty
83.a + b * c d is in data structure
(a) Post fix expression
(b) Prefix expression
(c) Infix expression
(d) mathematical expression
84.In some type of notation the operator is placed before its two operands, this is
called
(a) Infix expression
(b)Prefix expression
(c) Postfix expression
(d) Regular expression
85.Pop operation is performed by removing the first or the start node of a linked
list.
(a) pop
(b) Delete
(c) Remove
(d) Push
86.Before every deletion into the stack __________ condition need to be checked.
(a) insertion
(b) Deletion
(c) Pop
(d) Push
87.A _____ is a linear list of elements in which deletions and insertion can take
place from different end.
(a) Queue
(b) Stack
(c) Array
(d) List
88.In queue deletions can take place only at one end, called the
(a) Front
(b) Rear
(c) Head
(d) Top
89.In Queue insertions can take place only at the other end, called
(a) Rear
10 | P a g e

MCQ :Data Structure

(b) Front
(c) Top
(d) Start
90.Queues are also called
(a) (FIFO) first-in-first-out data structure
(b) (LIFO) Last in First out data structure
(c) linear data structure
(d) none of these
91.The two methods offered by queue for adding and deleting element from the
queue.
(a) Push and Pop
(b) Insert and delete
(c) Enqueue and Dequeue
(d) All of these
92.Whenever the element is deleted from the queue the value of the ______ is
increased by 1
(a) Front
(b) Rear
(c) Start
(d) Top
93.Whenever an element is ______ to the queue, the value of REAR is increased by
1
(a) Added
(b) Updated
(c) Deleted
(d) Increased
94.P+Q and (X+Y)* Z is the _______________ expression
(a) Regular arithmetic expression
(b)Infix expression
(c) Postfix expression
(d) Prefix expression
95.__________ and ___________ are the two pointers are used in queue.
(a) Rear and Front
(b) Front and Start
(c) Front and Rear
(d) First and Last
96.New node can be availed from ___________ list while inserting new element into
the queue.
(a) Link list
(b)AVAIL list
(c) Array
(d) None
97.Post fix expression of a + b * c d
(a) abc*+d(b) abc*+d
(c) abcd*+(d) *+-abc

11 | P a g e

MCQ :Data Structure

Unit 5
98.A tree is a non-linear data structure
(a) tree
(b) Array
(c) Linked list
(d) Stack
99.A tree is a non-linear data structure that consists of a _____ and potentially many levels of
additional nodes that form a hierarchy.
(a) Root Node
(b) Front Node
(c) Parent Node
(d) Child Node
100.
A tree can be empty with no nodes called
(a) The null or empty tree
(b) The Blank Tree
(c) Tree
(d) Binary Tree
101.
Top most nodes in a tree.
(a) Root
(b) Leaf Node
(c) Child Node
(d) Parent Node
102.
The node that has a child.
(a) Root
(b)parent
(c) leaf
(d) None
103.
The node with the same parent.
(a) Sibling
(b) Leaf
(c) Child
(d) All of these
104.
The nodes with no children.
(a) Leaves
(b) Child
(c) parent
(d) Internal node
105.
The nodes with at least one child.
12 | P a g e

MCQ :Data Structure

(a) Internal Node
(b) External Node
(c) Leaf
(d) Child
106.
connection between one node to another is called
(a) Edge
(b) Connection
(c) Link
(d) Relation
107.
Number of sub trees of a node is called
(a) Child tree
(b)Degree
(c) Node
(d) None of these
108.
The maximum level of any node in the tree is called(a) Height
(b) Max node
(c) Max level
(d) All of the above
109.
_____is a special case of tree where no node of a tree can have a degree of
more than two.
(a) A binary tree
(b) BST tree
(c) AVL Tree
(d) Tree
110.
The maximum number of nodes at levelx will be
x

(a) 2 -1
(b) x2-1
x

(c) K 2
(d) None of these
111.
A binary tree which has only left sub tree is called
(a) Left Tree
(b)Left skewed tree
(c) Left Binary Tree
(d) AVL Tree
112.
__________are not efficient in memory management
(a) Binary tree
(b)Skewed trees
(c) Full Binary Tree
(d) Complete Binary Tree
113.
______ tree is a binary tree in which every level, except possibly the last, is
completely filled, and all nodes are as far left as possible.
(a) Complete binary tree
(b) Binary Tree
(c) Tree
(d) AVL Tree
114.
Traversing in which left sub tree processed first , then root and right sub
tree is called
(a) Inorder Traversing
(b) Pre order Traversing
(c) Post order Traversing
(d) None of these
13 | P a g e

MCQ :Data Structure

115.

Which of the following is in Inorder manner

117.

(a) D B E A C
(b) A B C D E
(c) C A B D E
(d) A C B D E
A link list presentation of binary tree consist node having
(a) A left pointer , Right Pointer, and Data
(b) Right pointer, Null pointer and First Node pointer
(c) Address of Root pointer
(d) None of these
Which of the following is in preorder Mannner

118.

(a) ABDEC
(b) ABCDE
(c) CABED
(d) EDBAC
Which of the following is in post ordermanner

119.

(a) ABCDEFG
(b) DEBFGCA
(c) ABCDEFG
(d) GCFABDE
In binary trees if a node does not have any parent is called-

116.

14 | P a g e

MCQ :Data Structure

120.

121.

(a) Root Node

(b) Sibling Node
(c) Child Node
(d) None of these
One of the subclass of binary tree _______ tree.
(a) Binary search tree
(b)Complete binary tree
(c) AVL Binary tree
(d) Tree
Binary trees which have more or less than 2n-1 nodes called
(a) Incomplete Binary tree
(b) Binary Search Tree
(c) Full Binary Tree
(d) Complete Binary Tree

15 | P a g e

MCQ :Data Structure

Unit 6
______is designed to minimize the number of disk accesses.
(a) A B-tree
(b) A binary Tree
(c) Binary Search Tree
(d) Full Binary Tree
123.
Tree can be converted into an equivalent binary tree, but this process
makes the tree(a) Imbalance
(b) Balanced
(c) Full binary
(d) Incomplete Binary tree
124.
Linear representation of complete binary tree in array the left and right
node will be
(a) 2i and 2i+1
(b) 2 and 2i
(c) 2n and 2n
(d) None of these
125.
For incomplete binary trees extra storage is required
(a) Extra storage
(b) Minimum storage
(c) Sequential Memory byte
(d) None of these
126.
Tree that have the value at n is greater than every value in the left subtree
of n and is less than every value in the right subtree of n is called(a) Binary tree
(b)Binary search tree
(c) Full binary tree
(d) Search tree
127.
__________ helps in easy insertion and deletion of elements.
(a) Binary tree
(b)Binary search tree
(c) Tree
(d) None of these
128.
Information represented by each node is a _______rather than a single data
element
(a) Record
(b) Data
(c) Value
(d) All of these
129.
In binary search tree nodes are compared according to their _____rather
than any part of their associated records.
(a) Key
(b) Data
122.

16 | P a g e

MCQ :Data Structure

(c) Records
(d) Index values
130.
sequential representation of binary tress uses the physical
____________relationship of the computer memory
(a) adjacency
(b) Sequentially
(c) Linear
(d) None of these
131.
To represent a node in tree sequentially using postorder traversal vector
required is called(a) Post
(b) Prepost
(c) Both a and b
(d) Degree
132.
enables one to search for and find an element with an average running time
(a) Log(n)
(b) O(n)
(c) O(log2 n)
(d) OLog(n)
133.
Ordered binary tree is a _______binary tree data structure
(a) node-based
(b) Record Based
(c) List Based
(d) None of these
134.
In Binary search tree the left sub tree of a node contains only nodes with
keys _______ the node's key.
(a) Less than
(b) Greater than
(c) Equal to
(d) Not equal to
135.
In binary search tree the right sub tree of a node contains only nodes with
keys _______the node's key.
(a) greater than
(b) Less than
(c) Equal to
(d) Not equal to
136.
Binary search tree is very useful in
(a) Searching
(b) Sorting
(c) Searching and sorting
(d) Insert and deleting
137.
The minimum element of a binary search tree is (a) Last node of left roof
(b) Last node of the tree
(c) Last node of the right roof
(d) None of these
138.
The maximum element of a binary search tree is (a) Last node of right roof
(b) Last node of left root
(c) Root node of the tree
(d) Leaf node of the tree
139.
________a node from a BST is a relatively complex task
(a) Removing
17 | P a g e

MCQ :Data Structure

(b) Insertion
(c) Searching
(d) Sorting
140.
If we are trying to _________ a leaf node just delete that node and the rest of
the tree is left as it is earlier.
(a) Delete
(b) Update
(c) Insert
(d) Search

18 | P a g e

MCQ :Data Structure

Unit 7
141.
________ is a balanced binary tree that rearranges its nodes whenever it
becomes unbalanced.
(a) AVL tree
(b) Binary tree
(c) Binary search tree
(d) Complete Binary tree
142.
_______ is designed to minimize the number of disk accesses.
(a) B-tree
(b) Binary tree
(c) AVL tree
(d) Binary search tree
143.
AVL tree is another balanced binary search tree named after(a) Denis Ritchie, Goslings and Tom Cruise
(b)Adelson, Velskii and Landis
(c) Anderson, Venny Ruskin, Linde Parker
(d) Any Thompson, Veronica bush, Limphe Jeorge
144.
In an AVL tree, a new field must be introduced. This new field stores the
_______of a node
(a) Balance factor
(b) Balance order
(c) Order value
(d) Pointer value
145.
the balance factor of a node which denotes the
(a) difference of heights between the left and right subtrees of the
tree
(b) difference between left and right node of tree
(c) difference between child and parent node
(d) none of these
146.
The balance factor of a node in a binary tree can have value
(a) 1 or 0
(b) 0 or -1
(c) 0 or 1 and -1
(d) 1, 0 or 2
147.
If a balance factor of a node is ______ then the heights of its left and right
subtrees are equal.
(a) 0
(b) 1
(c) 2
(d) -1
148.
_______ specifies the height of left subtree is lesser than the right subtree
(a) 1
(b) 0
(c) -1
(d) 2
149.
If the balance factor is _____ then the height of its left subtree is more than
the height of right subtree.
19 | P a g e

MCQ :Data Structure

(a) 1
(b) 3
(c) -1
(d) 0
150.
_________ an element into an AVL search tree is very similar to that of the
process used in a binary tree.
(a) Shifting
(b) Insertion
(c) Deletion
(d) Balancing tree

151.

152.

153.

An AVL tree is ____________tree

(a) balanced binary search
(b) Binary search tree
(c) Complete tree
(d) Full tree
Which of the following determine balance factor of balance tree
(a) TL or TR
(b) non empty binary
(c) h (TL)-h(TR) 1. h(TL) h(TR)
(d) h (TL)-h(TR) - (TL) h(TR)
(e) None of these
Balance factor of the root node is

(a) -1
(b) 0
(c) 1
(d) +1
Struct AVLNode

154.
{

Int data;
Int balfactor;
_______________________
}
In above structure definition which element must required to define(a) Struct left, right;
(b) Struct *left, *right;
(c) Struct avlNode *left,* right;
20 | P a g e

MCQ :Data Structure

(d)Struct AVLNode *left,*right;
155.
Any operation in tree start from
(a) Start pointer
(b) Root
(c) Tree pointer
(d) None of these
156.
After insertion of the element, if the balance factor of any node in the tree is
affected, we need to resolve this problem by applying the technique called
________
(a) Rotation
(b) Shifting
(c) Moving
(d) Deletion
157.
To perform rotations in avl tree it is necessary to identify a specific node A
whose ______is neither 0, 1 or -1,
(a) balance factor
(b) level
(c) Depth of tree
(d) Node factor
158.
______is a mirror of the left rotation operation
(a) A right rotation
(b) Rotation
(c) Both A and B
(d) Neither A nor B
159.
A ______________ must be performed when attempting to balance a tree
which has a left subtree that is right heavy.
(a) Rotation
(b) Left rotation
(c) Right left Rotation
(d) Right rotation
160.
For retrieval and manipulation of data stored in external memory need
(a) B tree
(b) B+ tree
(c) B tree and B+ tree
(d) None of these
161.
M-way tree used for
(a) retrieval and manipulation of data stored in external memory
(b) retrieval and manipulation of data stored in RAM
(c) retrieval and manipulation of data stored in internal memory
(d) all of above
162.
A B-Tree of order M is
(a) A full binary tree
(b) A full binary tree or complete binary tree
(c) An Empty tree or full tree
(d)An empty tree or m-way search tree
163.
In __________all internal nodes of T (other than its root) have between [M/2]
and M subtrees.
(a) B-Tree
(b) Binary tree
(c) AVL tree
(d) Tree
164.
A b-tree has a minimum number of allowable children for each node known
as the
21 | P a g e

MCQ :Data Structure

(a) Balance factor
(b)Minimization factor
(c) Maximization factor
(d) X factor
165.
Each node of a ________ may have a variable number of keys and children
(a) AVL tree
(b)B-Tree
(c) BST
(d) Binary tree
166.
In b-tree the _____are stored in non-decreasing order.
(a) Keys
(b) Children
(c) Leaf node
(d) Internal node
167.
In B-tree every node must have at least (a) t-1 keys
(b) 2t -1 keys
(c) t-2 keys
(d) 2-t keys
168.
______ is an ideal data structure for situations where all data cannot reside
in primary storage and accesses to secondary storage are comparatively
expensive
(a) B-Tree
(b) Binary tree
(c) AVL Tree
(d) Tree
169.
Searching in b-tree the number of accesses depends on the(a) Nodes
(b) Internal nodes
(c) Level
(d)Height of B-tree
170.
The B-trees are commonly used in large __________to provide quick access to
the data.
(a) Data
(b) Records
(c) Databases
(d) file
171.
In B-tree search operation the worst case time complexity is
(a) LogN
(b)O(n)
(c) Olog(n)
(d) None of these
172.
During the process of deletion to make the tree balance
(a) Pull smallest from left sibling
(b) Pull largest from left sibling
(c) Pull smallest from right sibling
(d) Pull largest from left sibling

22 | P a g e

MCQ :Data Structure

Unit 8 :Graph
173.

Used to model a large variety of data(a) Graph

(b) Array
(c) Tree
(d) List
174.
Graph algorithms are useful in a huge number of applications in computer
science.
(a) Tree
(b) Binary tree
(c) Graph algorithms
(d) Linear data structure
175.
A graph data structure consists mainly(a) Nodes and vertices
(b) Values and records
(c) Pointers and edges
(d) Above all
176.
Directed link between two nodes is known as
(a) Arc
(b) Edge
(c) Vertex
(d) Link
177.
Undirected link between the nodes is known as
(a) Edge
(b) Link
(c) Arc
(d) Point
178.
A sequence of consecutive edges in a graph and the length of the path is
the number of edges traversed is called(a) Edge
(b)Path
(c) Vertices
(d) Links
179.
In ______ the directions of edges are not assigned.
(a) Directed graph
(b) Graph
(c) Undirected graph
(d) Linked graph
180.
In the Undirected graph only connect to each other.
(a) Edges
(b) Links
(c) Vertices
(d) Arcs
181.
A graph where each edge e in G is assigned a direction(a) Graph
(b)Directed Graph
(c) Undirected Graph
23 | P a g e

MCQ :Data Structure

(d) None of these
182.
In directed graph each edge e is identified with __________ of nodes in G
(a) Unordered pair of nodes(v1 ,v2)
(b) Ordered pair of nodes (v1,v2)
(c) Sequential list of nodes
(d) All of above
183.
Directed graph can be seen as
(a) Network
(b) Flow network
(c) Connected graph
(d) Both a and c
184.
The ________algorithm is used to find out the maximum flow from a source
to a sink in a graph.
(a) Ford-Fulkerson
(b) Kruskal Algorithm
(c) Search algorithm
(d) Hashing algorithm
185.
Graph having cost and weight associated with edges of graph is called(a) Directed graph
(b) Undirected graph
(c) Spars graph
(d)Weighted Graph
186.
Directed and undirected graphs may both be weighted
(a) Weighted
(b) Directional graph
(c) Sparse Graph
(d) Multi graph
187.
________is a graph which has more than one edge between the same two
vertices
(a) Multigraph
(b) Graph
(c) Acyclic graph
(d) Undirected
188.
A graph with no path and starts and ends at the same vertex(a) Directed Graph
(b) Undirected Graph
(c) Multi graph
(d)Acyclic graph
189.
An acyclic undirected graphic is like a(a) Tree
(b) Array
(c) List
(d) Stack
190.
Graph with the number of edges is far less than |V | 2 -

191.

(a)
Spars Graph
(b)Multi path graph
(c) Acyclic graph
(d) None of these

_____also known as oriented acyclic graph.

(a) Multi graph
(b) Spars graph
(c) Acyclic directed graph
(d) Acyclic graph
24 | P a g e

MCQ :Data Structure

192.
A vertex is not adjacent to any other vertices in a graph, then such type of
vertex is known as (a) Isolated Vertex
(b) Directed Vertex
(c) Main vertex
(d) Adjacent Vertex
193.
A graph containing only isolated vertices is called (a) Null graph
(b) Multi graph
(c) Acyclic graph
(d) Directed graph
194.
Following diagram represent-

(a) Graph
(b)Null Graph
(c) Un directed graph
(d) Vertex only
195.
A graph in which each pair (v1, v2) of nodes in G there is a path from v1 to
v2 and there is also a path from v2 to v1.
(a) Strongly connected graph
(b) Sparse graph
(c) Directed graph
(d) Null graph
196.
In an undirected graph, the ________ of a vertex v is the number of edges
connected to v.
(a) Degree
(b) Edges
(c) Vertex
(d) Points
197.
In a directed graph, the __________ of a vertex v is the number of edges
leaving v
(a) In degree
(b) Degree
(c) Out degree
(d) In-out degree
198.
In a directed graph _________is the number of edges ending at v.
(a) in-degree
(b) out degree
(c) in- out degree
(d) none of these
199.
A graph can be represented commonly using
(a) Adjacency matrix and Incidence Matrix.
(b) Matrix
(c) Adjacency Matrix only
(d) Incidence Matrix
200.
In a directed graph, the ________ of a vertex v is the number edges of
leaving v, and its _______ is the number of edges ending at v.
(a) In-degree, out- degree
25 | P a g e

MCQ :Data Structure

(b) Out-degree , In degree
(c) Edges, degree
(d) Degree, edges
201.
It is a two-dimensional Boolean matrix to store the information about the
graph nodes(a) Adjacency Matrix
(b) Array
(c) Two dimensional array
(d) Matrix
202.
The rows and columns represent source and destination vertices and entries
in the matrix indicate
(a) Source and destination in vertices
(b) Values of graph
(c) Edges of graph
(d) None of these
203.
A multigraph is a graph which has more than one______ between the same
two vertices.
(a) Links
(b)Edges
(c) Points
(d) Vetex
204.
In _________ entries in an array indicate if both are related to each other
through edges.
(a) Incidence matix
(b) Adjacency matrix
(c) Multigraph matrix
(d) Matrix
205.
Incidence Matrix entries values of the matrix are given as
(a) -1, 0, or 1.
(b) 1 or 0
(c) -1 or 0
(d) 1 or -1
206.
In adjacency matrix,_____ is marked in a cell if there exists an edge between
two nodes that index that cell.
(a) 0
(b)1
(c) -1
(d) None of these
207.
A null graph consists of V vertices but no edges, then the adjacency matrix
has all of its entire elements as ________________.
(a) 0
(b) -1
(c) 1
(d) All of these
208.
______are used to solve the problem related to the area of artificial
intelligence, algebraic
manipulation, text processing, graphics etc.
(a) List structures
(b) Array
(c) Tree
(d) Graph
209.
_________ of a list is the maximum level attributed to any element within the
list or within any sublist in the list.
26 | P a g e

MCQ :Data Structure

(a) Length
(b) Order
(c) Level
(d)Depth
210.
__________ is the number of elements at level 1 in a list.
(a) Length
(b) Depth
(c) Level
(d) Order
211.
____________is implemented as an array of lists with one list of destination
nodes for each source node.
(a) Adjacency Matrix
(b)Adjacency List
(c) List
(d) List structure
212.
_________ every entry is a set (or multiset) of two nodes containing the two
ends of the corresponding edge.
(a) Graph
(b)Undirected graph
(c) MultiGraph
(d) Directed graph
213.
__________ every entry is a tuple of two nodes, one denoting the source node
and the other denoting the destination node of the corresponding arc.
(a) Spars graph
(b) Multi graph
(c) Directed graph
(d) Undirected graph
214.
Adjacency lists are preferred for (a) Graph
(b)Spars Graph
(c) Multi graph
(d) Null graph
215.
The number of distinct unordered pairs (vi, vj ) with vi, vj in a graph with n
vertices is
(a) n(n-1)/2
(b) n*n/2
(c) (n-1)/2
(d) None of these
216.
The three properties associated with list structures are:
(a) Order, depth, length
(b) Degree, vertices, edges
(c) Atom, element, list
(d) Cost, weight, data
217.
The depth first search algorithm is used to visit all of the nodes in the graph
for its examination and not always necessary to find the
(a) Path
(b) shortest path.
(c) Longest path
(d) All nodes
218.
This algorithm uses a queue data structure to perform the search.
(a) Stack
(b) List structure
(c) Queue
27 | P a g e

MCQ :Data Structure

(d) Matrix
219.
A spanning tree T is defined as an undirected tree of a connected graph G
which is composed of all the vertices and the edges necessary to connect all the
nodes of graph G.
(a) Spanning tree
(b) Spars graph
(c) Graph
(d) Null graph
220.
A single graph can have many (a) Spanning tree
(b) Multi graph
(c) Null graph
(d) Graph
221.
A spanning tree is a _______ of G that includes all the vertices of G and is
also a tree.
(a) Graph
(b) Spanning tree
(c) Sub graph
(d) Multi graph
222.
If the graph is not connected in the spanning tree, then it is known as
______________.
(a) Spanning forest
(b) Multi graph
(c) Spars graph
(d) Graph
223.
A minimum spanning tree would be one with the lowest total cost.
(a) Spanning tree
(b) Weighted graph
(c) Minimum spanning tree
(d) Graph

28 | P a g e

MCQ :Data Structure

Unit 9: Application of Graph

224.

________ cannot be applied for linear ordering in the graph with cycles.
(a) Topological sorting
(b) Breadth first searching
(c) Depth first searching
(d) None of these
225.
__________ was used for network analysis
(a) Sorting
(b) Searching
(c) Network analysis
(d) Traversing
226.
Topological Sort was used for network analysis with technique (a)PERT
(b) CPM
(c) DAG
(d) Non
227.
________ order produced by a topological sort is not unique
(a) vertex
(b) nodes
(c) points
(d) levels
228.
Descriptors successor must appear after that descriptor in ______ ordering
for topological sort.
(a) Random
(b)Linear
(c) Alphabetical
(d) Unique
229.
_______ may have more than one possible topological order.
(a) DAG
(b) BST
(c) DFS
(d) Topological sort
230.
_______is used to find the shortest path between the two vertices in a
weighted directed graph
(a) Dijkstras Algorithm
(b) Hashing algorithm
(c) Breadth first search algorithm
(d) Depth firs t algorithm
231.
The time required by Dijkstra's algorithm is(a) O(1000)
(b) O(n)
(c) O(|V|2
(d) Log(n)
232.
In Dijkstras algorithm, _______ are assigned to each vertex.
(a) Weight
29 | P a g e

MCQ :Data Structure

(b) Length
(c) Cost
(d)Labels
233.
Spanning tree has all the vertex that lies in the tree, but _____________.
(a) With loop
(b)Without loop
(c) Without edges
(d) Null
234.
The total _______of a tree is given by the sum of the weights of the edges in
the tree.
(a) Edge
(b) Label
(c) Weight
(d) Vertex
235.
Prim's algorithm and Kruskal's algorithm which are also known as greedy
algorithms
(a) Primes algorithm
(b) Kruskals Algorithm
(c) Boruvkas algorithm
(d)Both a and b
236.
__________ is very similar to Dijkstra's single-source shortest path algorithm.
(a) Prims algorithm
(b) Kruskals algorithm
(c) Boruvkas algorithm
(d) None of these
237.
________ is always not unique.
(a) Minimum spanning tree
(b) Maximum spanning tree
(c) Spanning tree
(d) Spanning forest
238.
Minimum spanning tree is a graph with weight ________ than or _______ to
the weight of every other spanning tree.
(a) less, greater
(b)less, equal
(c) greater, equal
(d) greater, always greater
239.
Prims minimum spanning tree algorithm is known as ____________ style
algorithm
(a) greedy
(b) unique
(c) linear
(d) sparse
240.
The NP stands for nondeterministic polynomial time
(a) Node processed
(b) Non deterministic point
(c) Non deterministic polynomial time
(d) Node polynomials
241.
A problem is said to be polynomial if there exists an algorithm that solves
the problem in time for the expression like T(n) = O(nc), where c is a constant
(a) Polynomials
(b) node polynomials
(c) Non deterministic polynomials
(d) deterministic polynomials
30 | P a g e

MCQ :Data Structure

242.

Example of polynomial problems

(a) O(n Log n )
(b) O(E2)
(c) O|V|
(d) Olog
243.
Any problem for which the answer is either in the form of YES or NO is
called a decision problem.
(a) Decision Problem
(b) Boolean problem
(c) Algorithm problem
(d) None of these
244.
An algorithm for a decision problem is termed _______.
(a) Kruskals algorithm
(b) Buruvkas Algorithm
(c) Spars algorithm
(d)Decision Algorithm
245.
Any problem that involves the identification of an optimal solution (where
some value needs to be found out as minimized or maximized) is known as-.
(a) Decision Problem
(b)Optimization Problem
(c) Identical Problem
(d) None of these
246.
_________ is used to solve an optimization problem.
(a) Decision algorithm
(b)Optimization algorithm
(c) Kruskals algorithm
(d) Buruvkas algorithm
247.
A________ is a sequence of vertices in the graph, with perhaps an empty
sequence denoting that no path exists.
(a) Solution
(b) Algorithm
(c) Problem
(d) All of these
248.
It is very difficult to find the solution for some of the _________where the
methodology of finding its solution may be endless.
(a) Optimization problems
(b) Decision problems
(c) Algorithms problems
(d) None of these
249.
If an optimization problem is easy then its related decision problem is easy
as well.
(a) Optimization algorithm
(b)Decision problem
(c) Decision algorithm
(d) all of the above
250.
An algorithm is said to be polynomially bounded if its worst-case complexity
is bounded by a ___________ of the input size.
(a) Polynomial function
(b) Polynomial problems
(c) Decision problem
(d) Optimization problem
251.
NP represents the class of _________ which can be solved in polynomial time
by a non-deterministic model of computation.
31 | P a g e

MCQ :Data Structure

(a) Decision problems
(b) Optimization problems
(c) Calculation problems
(d) Searching problems
252.
______ is the standard notation for the class of all NP-complete problems
(a) NPC
(b) NP
(c) CPM
(d) DFS
253.
A decision problem E is _________ if every problem in the class NP is
polynomial-time reducible to E.
(a) NP- Complete
(b) NP- Incomplete
(c) NP
(d) All of these
254.
A problem is _____ if an algorithm to solve it in (deterministic) polynomial
time would make it possible to solve all NP problems in polynomial time.
(a) NP-hard
(b) NP- complete
(c) NP-Incomplete
(d) None of these
255.
A problem is NP-hard if an algorithm to solve it in (deterministic) polynomial
time would make it possible to solve all ____________ problems in polynomial time.
(a) decision
(b) non-deterministic
(c) NP
(d) optimization

32 | P a g e

MCQ :Data Structure

UNIT 10: Dynamic Memory Allocation

256.
Language PL/I define different _________ depending upon the life span and
access method of the variables.
(a) variable
(b) memory
(c) storage class
(d) Dynamic memory
257.
_________ block allocations are one of the basic types under dynamic
storage allocation
(a) Fixed block and variable block
(b) fixed and permanent
(c) variable length
(d) none of these
258.
________ holds basically programs and their data.
(a) Memory
(b) Variable
(c) Program
(d) Pointer
259.
__________ data structures like integer, real, or character variable has the
characters that, their sizes are specified either explicitly or implicitly in their
declarations.
(a) Primitive
(b) User define
(c) Non primitive
(d) External data
260.
_________ are imposing limitations.
(a) Static allocation
(b) Dynamic allocation
(c) Compile time allocation
(d) All of these
261.
Static allocations are manageable for _________ for simple application.
(a) Primitive data structure
(b) Linear data structure
(c) Nonlinear data structure
(d) Dynamic data structure
262.
_________ storage allocation is the simplest case of dynamic storage
allocation.
(a) Random block storage
(b)First block
(c) last block
(d) highest block
263.
Straight forward method in which, all the blocks are of (a) Identical size
(b) Minimum size
(c) Appropriate size
(d) Max size
33 | P a g e

MCQ :Data Structure

264.

RETURNNODE() is used to return the (a) block of memory

(b) pointer of first node
(c) value of node
(d) none of these
265.
the _______ is executed it checks for the availability of free node in the AVAIL
list and get a memory block
(a) RETURNNODE()
(b) NODEACCESS()
(c) GETNODE()
(d) FINDNODE()
266.
To overcome the disadvantages of ________ blocks of variable sizes are used
(a) Fixed block storage
(b) Dynamic storage
(c) Max block storage
(d) Variable length storage
267.
For dynamic storage________ play a vital for the management of memory
blocks.
(a) Array
(b) Matrix
(c) Linked list
(d) Queue
268.
Free memory in the free storage area generally holds the memory as
____________________ block.
(a) contiguous
(b) continuous
(c) non-contiguous
(d) non-continuous
269.
Procedure _________________ will return the used block of memory to the
memory pool.
(a) RETURNNODE()
(b) AVAIL()
(c) GETNODE()
(d) All of the above
270.
In the _____ algorithm, the allocator keeps a list of free blocks and, on
receiving a request for memory, scans along the list for the first block that is large
enough to satisfy the request.
(a) First Fit
(b) Last fit
(c) List fit
(d) Max Fit
271.
In first fit algorithm If the chosen block is significantly larger than that
requested, then it ____ and the remainder added to the list as another free block.
(a) Split
(b) Merged
(c) Discard
(d) Delete
272.
With the variable size blocks, we encounter the problem of fragmentation
(a) Fragmentation
(b) Allocation
(c) Deallocation
(d) Split
273.
There are two types of memory fragmentation
34 | P a g e

MCQ :Data Structure

(a) one
(b)Two
(c) Tree
(d) Four
274.
Fragmentation types
(a) Typical and non-typical
(b) External and non-external
(c) External and Internal
(d) Extreme and non-extreme
275.
_____is a phenomenon in which storage space is used inefficiently, reducing
storage capacity and in most cases performance.
(a) Fragmentation
(b) Defragmentation
(c) Deletion
(d) Insertion
276.
_________ also used to denote the wasted space itself.
(a) Fragmentation
(b) Split
(c) Memory allocation
(d) Deallocation
277.
________ fragmentation occurs when more storage is allocated than is
actually requested
(a) Internal
(b) External
(c) Both Internal and external
(d) Neither Internal nor external
278.
Slack space, causes a degradation of (a) System performance
(b) Program performance
(c) Process handling
(d) None of these
279.
__________ fragmentation occurs when free memory becomes divided into
several small blocks over time.
(a) External
(b) Internal
(c) Dynamic
(d) Deallocation
280.
It is the process of releasing an allotted memory and returning it to the free
list.
(a) Storage Release
(b) Free Memory
(c) Memory management
(d) Memory allocation
281.
________ is the variable indicates the starting point for searching in the
allocation routine
(a) MEM_BLOCK
(b)ROVER
(c) AVAIL
(d) ITEM
282.
________ technique is a memory allocation algorithm that divides memory
into partitions to try to satisfy a memory request as suitably as possible.
(a) Free Memory allocation
(b) Dynamic Memory allocation
35 | P a g e

MCQ :Data Structure

(c) Buddy memory allocation
(d) None of these
283.
Buddy system makes use of __________ memory into halves to try to give a
best-fit.
(a) Splitting
(b) Merging
(c) Inserting
(d) Removing
284.
Buddy system was invented in 1963 by(a) Harry Markowitz
(b) Donald Kurth
(c) Kruskal
(d) Jim Kerry
285.
The buddy system has the advantage that it minimizes the _________
fragmentation
(a) Internal
(b) External
(c) Both Internal and external
(d) None of the above
286.
_______ is the systematic recovery of pooled computer storage that is being
used by a program when that program no longer needs the storage.
(a) Garbage Collection
(b) Memory Recovery
(c) Memory allocation
(d) Memory Management
287.
This frees the__________ for use by other programs (or processes within a
program).
(a) Storage
(b) Program
(c) Process
(d) All of the above
288.
Garbage collection is ____________feature in many modern programming
languages
(a) an automatic memory management
(b) Dynamic memory allocation
(c) Memory management
(d) None of these
289.
Garbage collection frees the ___________r from manually dealing with
memory deallocation.
(a) Programmer
(b) Database designer
(c) Database Administrator
(d) None of these
290.
___________ which occur when a piece of memory is freed while there are
still pointers to it, and one of those pointers is then used.
(a) Null pointer
(b) Unreferenced object bug
(c) Dangling pointer bug
(d) Free pointer bug
291.
__________ which occur when the program tries to free a region of memory
that has already been freed, and perhaps already been allocated again.
(a) Dangling Pointer bug
(b) Null pointer bug
36 | P a g e

MCQ :Data Structure

(c) Double free bugs
(d) Insufficient memory allocation
292.
In a program the objects which can not be reached is called (a) Garbage
(b) Un initialize object
(c) Syntactic Garbage
(d) Semantic Garbage
293.
The garbage collector can reclaim only objects that have no references.
(a) value
(b) Null
(c) References
(d) Data
294.
An object that is reachable cannot be garbage collected by the garbage
collector. Such a reference is known as (a) Pointer
(b)Strong reference
(c) Leak reference
(d) Null reference
295.
____________ are data structures that grow and shrink as you need them to
by allocating and deallocating memory from a place called the heap.
(a) Static data structure
(b)Dynamic data structure
(c) Linear data structure
(d) Non-linear data structure

37 | P a g e

MCQ :Data Structure

UNIT 11 - Searching and Sorting Techniques

296.

_________ is one of the most fundamental algorithmic problems.

(a) Sorting
(b) Traversing
(c) Reading
(d) Accessing
297.
_____can occur in any form and it is assumed that we are given a collection
of elements.
(a) Data
(b) Values
(c) Items
(d) Null values
298.
Bubble sort is a straightforward and simplistic method of sorting data that is
used very commonly.
(a) Traversing
(b)Bubble sort
(c) Quick sort
(d) Binary sort
299.
Bubble sort average case and worst case are both O(n).
(a) O(n)
(b)O(n2)
(c) OLog(n)
(d) O(n log n)
300.
is a general algorithm design paradigm
(a) Divide-and conquer
(b) Divide algorithm
(c) Simplifying
(d) Traversing and Searching
301.
____________ is one of the sorting techniques that is typically used for
sequencing small lists.
(a) Selection sort
(b) Merge sort
(c) Bubble sort
(d) Radix sort
302.
A balanced, left-justified binary tree in which no node has a value greater
than the value in its parent.
(a) Tree
(b) Heap
(c) Data structure
(d) List
303.
_______ is a much more effective type of selection sort, and is one of the
fastest sorting algorithms.
(a) Heap sort
(b) merge sort
38 | P a g e

MCQ :Data Structure

(c) Bubble sort
(d) Selection sort
304.
HEAPSORT() starts with finding the ___________ of the array stored at the
root
(a) Maximum element
(b) Minimum element
(c) Leaf node
(d) Internal node
305.
Sorting is the process of arranging the content in some order based on
__________ criterion.
(a) key
(b) Search element
(c) Value
(d)Ordering
306.
Merge sort uses ______________ technique to sort the elements.
(a) Divide and conquer
(b) Traverse and search
(c) sequential access
(d) Random search
307.
_________________ uses left-justified binary tree to sort the elements.
(a) Heap sort
(b) Bubble sort
(c) Binary search
(d) Selection sort
308.
Which algorithm uses MID value to search(a) Binary
(b) Linear
(c) Heap
(d) Merge
309.
In binary search mid element can be find using(a) mid=size/2
(b)mid=(low+high)/2
(c) mid=low+high/2
(d) mid=maxsize/n
310.
The simplest type of searching process is the
(a) sequential search
(b) Binary search
(c) Quick search
(d) All of these
311.
___________is one of the fastest ways to search the element in a sorted
array.
(a) Binary search
(b) Linear search
(c) Sequential search
(d) Searching
312.
In Binary search array must be(a) Small
(b)Sorted
(c) Large
(d) None of these
313.
If any search element is greater then mid element in binary search then
which of the following is true
(a) low=mid+1
39 | P a g e

MCQ :Data Structure

314.

315.

(b) high=mid+1
(c) low=mid-1
(d) high=mid-1
In the sequential search, each element of the array is compared to the key,
(a) Key
(b) Value
(c) Pointer
(d) Null value
Time complexity of Sequential search is
(a) O(n)
(b) LogN
(c) O(log n)
(d) None of these

40 | P a g e

MCQ :Data Structure

UNIT 12

: File Structure

316.
An external storage device may be defined as device other than the main
memory on which information or data can be stored and from which the
information retrieved for processing.
(a) External storage device
(b) Internal storage device
(c) Dynamic storage device
(d) Static storage device
317.
External storage devices are having ________ capacities and fewer expenses
to store compared to main memory.
(a) Larger
(b) Medium
(c) Small
(d) None of these
318.
Bubble, selection, insertion and heap are some
(a) Searching
(b)Sorting
(c) Traversing
(d) Insertion
319.
The capacity of m_________ain memory is limited by two factors, the cost of
main memory and the technical problem in developing a large capacity of main
memory.
(a) Hard disk
(b) Magnetic tape
(c) Main memory
(d) External memory
320.
_________ is an information storage medium consisting of a magnetisable
coating on a thin plastic strip.
(a) Compact disk
(b) Digital disk
(c) Magnetic tape
(d) Hard drive
321.
DAT stands for(a) Digital Audio Tape
(b) Digital Access Tape
(c) Direct Audio Tape
(d) Direct Access Tape
322.
Reel to-reel tape, compact audio cassette, digital audio tape, digital linear
tape or general purpose digital data storage are of type
(a) Internal Memory
(b) External memory
(c) Main memory
(d)Magnetic Tape
323.
Modern magnetic tape is most commonly packaged in cartridges and
cassettes.
(a) Cartridges
(b) Cassettes
41 | P a g e

MCQ :Data Structure

(c) Cartridges and Cassettes
(d) None of these
324.
The device that performs actual writing or reading of data is a (a) Hard disk
(b)Tape Drive
(c) Internal Drive
(d) All of these
325.
When storing large amounts of data______ can be substantially less
expensive than disk or other data storage options.
(a) Tape
(b) Hard disk
(c) Digital Disk drive
(d) Hard disk drive
326.
Tape storage has always been used with (a) Large computer system
(b) Internal memory
(c) Data structure
(d) Small storage option
327.
Early industry-standard magnetic tape was _________ in diameter.
(a) 10.5 inches
(b) 12 inches
(c) 5.5 inches
(d) 2.5 inches
328.
In modern magnetic tape systems the reels are much (a) Smaller
(b) Larger
(c) Thick
(d) Thin
329.
A typical recording density was _____ characters per inch(a) 523
(b) 500
(c) 700
(d)556
330.
Data is written to tape in ________ with _______ between them.
(a) Block , Inter block gaps
(b) bit , bit gape
(c) Inter block gape , Block
(d) Bit gape ,bit
331.
__________ may be combined into one physical block to reduce wastage.
(a) Logical records
(b) Physical records
(c) Records
(d) All of these
332.
_______a certain block on the tape generally involved reading sequentially
from the beginning, in contrast to magnetic disks.
(a) Finding
(b) Sorting
(c) Random access
(d) Insertion
333.
Tape is not suitable for (a) Linear traversing
(b) Sequential access
(c) Random access
42 | P a g e

MCQ :Data Structure

(d) All of these
334.
A ___________ is a direct-access or random-access storage device,
(a) Magnetic tape
(b) Magnetic drive
(c) Magnetic drum
(d) Magnetic disk
335.
Magnetic drums were once used as a _______ device but have since been
implemented as auxiliary storage devices.
(a) Permanent storage
(b)Primary storage
(c) Random storage
(d) Processing storage
336.
Magnetic drum is a metal cylinder coated with
(a) Magnetic iron-oxide
(b) Magnetic oxide
(c) Iron oxide
(d) Carbon Oxide
337.
The ____ on a magnetic drum are assigned to channels located around the
circumference of the drum.
(a) Track
(b) Record
(c) Data
(d) Sector
338.
A single drum can have up to______ tracks.
(a) 300
(b) 450
(c) 200
(d) 250
339.
The drum rotates at a speed of up to _____ rpm
(a) 2000
(b) 1000
(c) 3000
(d) 2500
340.
A magnetic drum differs from a magnetic disk in that the tracks in which the
data is stored are assigned to channels located around the circumference of the
drum
(a) Magnetic disk
(b) Magnetic Tape
(c) Hard disk
(d) Digital disk
341.
The tracks on each channel are grouped into sectors.
(a) Magnetic block
(b) Block
(c) Sectors
(d) Clusters
342.
_________are mounted in a horizontal position, while others are mounted in a
vertical position.
(a) Hard disk
(b)Magnetic drum
(c) Magnetic tape
(d) Magnetic disk
343.
The only significant time required when reading or writing is the _______ that
occurs in reaching a desired record location.
43 | P a g e

MCQ :Data Structure

(a) Rotation time
(b) Revolving time
(c) Rotation delay
(d) Revolving delay
344.
Today we have 3.5-inch floppy disks with a capacity of over (a) 1.4 mb
(b) 1.2 mb
(c) 2.5 mb
(d) 2.0 mb
345.
There are currently two types of disks(a) Magnetic disk and magnetic tape
(b)Hard disk and floppy disk
(c) Internal disk and external disk
(d) None of these
346.
_________ are small sealed units that contain one or more disk platters
(a) Fixed disk
(b) disk
(c) Magnetic disk
(d) All of these
347.
Fixed disks are used in minicomputers and personal computers.
(a) Super computer
(b) Personal computer
(c) Minicomputer
(d)Both b and c
348.
Dividing the disk is done so that data can be easily written and retrieved,
which is known as _________ the disk.
(a) Formatting
(b) Clustering
(c) Accessing
(d) None
349.
The format program divides each data surface into ______
(a) Tracks and sector
(b) small blocks
(c) Tracks
(d) Sectors
350.
Concentric rings, called ______ are written on the disk during the formatting
process.
(a) Tracks
(b) Sector
(c) Block
(d) None
351.
Each track is divided into (a) Track block
(b)Sectors
(c) Cluster
(d) All of these
352.
Magnetic tapes, magnetic disks, optical disks are all the kind of
_______________ storage devices.
(a) Processing devices
(b) Internal memory devices
(c) External storage devices
(d) Memory devices
44 | P a g e

MCQ :Data Structure

353.
A _____ should be organized in such a way that the records are always
available for processing with no delay.
(a) File
(b) Record
(c) Data
(d) None of these
354.
A____ is a meaningful collection of related characters.
(a) File
(b) Record
(c) Field
(d) Data
355.
It is the smallest logical data entity that is treated as a single unit in data
processing.
(a) Field
(b) Record
(c) Data structure
(d) File
356.
Fields are generally grouped together to form a (a) Database
(b)Record
(c) File
(d) Data
357.
A _________ is a group of related information uniquely identifiable and
treated as a unit.
(a) Label Record
(b)Logical record
(c) Physical record
(d) None of these
358.
A ______ is a physical unit of information whose size and record mode is
convenient for a particular input or output device for the storage of data.
(a) Logical record
(b) Data Record
(c) Physical Record
(d) Data value
359.
_______ are normally used for files that are stored on magnetic tape or direct
access devices.
(a) Label Record
(b) Physical record
(c) Data record
(d) Logical record
360.
There are ______ types of access on the files
(a) Two
(b) One
(c) Three
(d) Four
361.
Random and sequential are
(a) File access technics
(b) Storage technics
(c) Insertion technics
(d) Sorting technics
362.
In________ the files, data can be stored and accessed randomly
(a) random file access
(b) Linear access
45 | P a g e

MCQ :Data Structure

(c) Sequential access
(d) all of these
363.
In _________ files, the data or text can be stored or read back sequentially
(a) Random access
(b)Sequential
(c) both a and b
(d) Neither a not b
364.
Sequential processing is the access of records one after other in the
_______in which they appear on the file.
(a) Logical order
(b) Physical order
(c) Manually order
(d) none of these
365.
File organization is the methodology which is applied to _____________
computer files.
(a) Structured
(b) Unstructured
(c) Internal
(d) External
366.
Magnetic disks and drums supports both ________ and sequential access.
(a) Random
(b) Quick
(c) Physical
(d) Logical
367.
File organization refers primarily to the logical arrangement of data in a
____________.
(a) File
(b) Record
(c) Data
(d)File system
368.
________is a table or other data structure that holds addresses of other
individual records of a file which contain only two data
(a) Index File
(b)File
(c) Record
(d)Data
369.
It is that table which contains actual data.
(a) Master file
(b) Logical File
(c) Data base
(d) Transaction file
370.
In a sequential indexed organization records are stored sequentially by
_________value
(a) Data value
(b)Primary key
(c) foreign Key
(d) Key value
371.
_______ systems use a laser to read and write data
(a) Optical disk
(b) Digital disk
(c) Hard disk
(d) Floppy disk
46 | P a g e

MCQ :Data Structure

372.
________is a useful searching technique, which can be used for
implementing indexes.
(a) Hashing
(b) Sorting
(c) Deleting
(d) Searching

47 | P a g e

MCQ :Data Structure

48 | P a g e

MCQ :Data Structure

49 | P a g e