Data Structure MCQ
#Data Structure#
MCQ Bunch
1) Which type of values data item contain?
a) Set of alphabets.
b) Set of numbers.
c) Set of symbols.
d)
All
of the above.
2) Data structure is nothing but the _________representation of values or the content.
a) Database
b)
Structural
c) Numerical
d) Geometrical
3) Field may contain __________.
a) Single value
b) Set of value
c) Two value
d)
Both
a. and b.
4) Popularly there are ________data structures are used for the collection and organization of data.
a) Four
b) Five
c)
Six
d) Seven
5) Following which is linear data structure.
a) Array
b) Graph
c) Queue
d)
Both
a. and c.
6) Array is widely known as ___________.
a)
One
dimensional
b) Non linear
c) Linked
d) None of the above.
7) For the linking purpose we have to use link which is popularly called as____________.
a) Link
b)
Pointer
c) Notation
d) Number
8) In the tree data structure the children node also called as______.
a)
Successor
b) Parental
c) Root
d) Tree
9) Inserting data element in stack this process is known as_________.
a) Insertion
b) Updating
c) Push function
d) Pop function
10) Which technique is used in stack?
a) LIFO
b) FIFO
c) FOFI
d) FOLI
11) Queue is like
a) Pipe
b) Container
c) Can
d) Drum
12) Queue is opened from
a) One end
b)
Two
end
c) Three end
d) None of above
13) Which technique is used in queue?
a) LIFO
b) FIFO
c) FILO
d) FOLI
14) What is used to show the flow of data in the graph data structure
a) End point
b) Nodes
c) Symbols
d) Both a. and b.
15) Algorithm is a step by step representation of
a) Program
b) Program logic
c) Flowchart
d) Data structure
16) Deleting data element from the stack this process is known as____________.
a) Deletion
b) Updating
c) Push function
d) Pop function
17) Data structure is classified as __________.
a) Linear and nonlinear
b) Array and tree
c) Queue and stack
d) None of the above
18) Linear array contain __________data elements.
a) Homogeneous
b) Heterogeneous
c) Different
d) Both b) and c)
19)
Bracket notation used
in______language.
a) Pascal
b) Java
c) HTML
d) CSS
20)
What is Linear Array?
a) Collection of infinite data.
b) Collection of similar type of data.
c) Collection of different type of data.
d) None of the above.
21)
What is traversing?
a) Accessing record
b) Visiting record
c) Processing record
d) All of the above
22)
Which operation is
used to add new element into an array?
a) Updating
b) Inserting
c) Deleting
d) Searching
23)
Which operation is
used to remove an element from an array?
a) Updating
b) Inserting
c) Deleting
d) Searching
24)
Which operation is
performed for finding the element?
a) Searching operation
b) Deleting operation
c) Traversing operation
d) Inserting operation
25)
Which of the following are searching
methods?
a) Binary search
b) Linear search
c) Nonlinear search
d) Both a) and b)
26)
Linear searching
method is also known as
a) Continuous search
b) Sequential search
c) One dimensional search
d) None of the above
27)
In which type of
searching method we have to compare that
element with each and every element
a) Binary search
b) Linear search
c) Nonlinear search
d) Both a) and b)
28)
The basic mechanism of
binary search is
a) Finding
b) Allocation
c) Deleting
d) Dividing and conquer
29)
Purpose of sorting
operation
a) to arrange in order and sequence
b) To arrange as it is.
c) For selecting
d) None of the above
30)
Which are the
following sorting methods
a) Selection sort
b) Bubble sort
c) Insertion sort
d) All of the above
31)
The name bubble sort
is used because values or element are
a) Linked
b) Swapped
c) Attached
d) Arranged
32)
Linking of linked list
is done with the help of
a) Pointer
b) Number
c) Arrow
d) None of the above
33)
In linked list
_______pointer is used which stores the location of 1st element
a) Number
b) Start
c) First
d) Last
34)
For which purpose start
pointer is used
a) To start the location of 1st element
b) To store the location of last element
c) To store the data of first element
d) Both a) and c)
35)
The pointer is also
known as
a) Number
b) Arrow
c) Link
d) Symbol
36)
Traversing means
a) Accessing
b) Visiting
c) Inserting
d) Both a) and b)
37)
In two way list there
is a linear collection of data elements
called
a) Nodes
b) Pointer
c) Data
d) Address
38)
In two ways list there
is _________part in each nodes.
a) One
b) Two
c) Three
d) Four
39)
Stack has _______ ends.
a) One
b) Two
c) Three
d) Four
40)
Where the insertion and deletion process
takes place is called ___________ of the stack.
a) Push
b) Pop
c) Top
d) Bottom
41)
LIFO stands for
a) Last in first out
b) Linear in first out
c) Low in first out
d) None of the above
42)
Push operation is used for
a) Insertion
b) Deletion
c) Updating
d) Searching
43)
Pop operation is used for
a) Insertion
b) Deletion
c) Updating
d) Searching
44)
MAXSTK is used for
a) Size of stack
b) Last element of stack
c) First element of stack
d) All of the above
45)
While solving any arithmetic equation or
problem we have to apply ________ rule.
a) BEDMAS
b) BODMAS
c) BDOMAS
d) BSEDMA
46)
Fill in the blanks
B – Bracket
E - ____________
D – Division
M - Multiplication
A - Addition
S – Subtraction
a) Equation
b) Equal
c) Exponents
d) All of the above
47)
Priority index is known as
_______________ rule.
a) Precedence
b) Permanent
c) BEDMAS
d) None of the above
48)
Which of the following is infix notation
a) +ab
b) a+b
c) ab+
d) –ab
49)
Infix notation is also known as
a) Polish
b) First notation
c) both a) and b)
d) All of the above
50)
Which of the following is prefix notation
a) +ab
b) a+b
c) ab+
d) all of the above
51)
which of the following is postfix ntation
a) +ab
b) a+b
c) –ab
d) ab+
52)
If an operator is present in between two
operands then the expression is
a) Postfix
b) Prefix
c) Infix
d) All of the above
53)
If an operator is present in front of
operands then the expression is
a) Postfix
b) Prefix
c) Infix
d) All of the above
54)
If an operator is present at end of the
operands then the expression is
a) Postfix
b) Prefix
c) Infix
d) All of the above
55)
In queue firstly entered think will exit
a) Lastly
b) Firstly
c) End of the element
d) All of above
56)
How many entry points are there in queue
a) One
b) Two
c) Three
d) Four
57)
How many exit points are there in queue
a) One
b) Two
c) Three
d) Four
58)
The entry point of queue known as
________end
a) Start
b) Rear
c) Front
d) All of above
59)
In queue insertion takes place at
a) Front end
b) Backend
c) Rear end
d) None of the above
60)
Exit point of a queue known as
a) Front side
b) Rear side
c) Back side
d) None of the above
61)
In queue deletion process takes place at
a) Front side
b) Rear side
c) Back side
d) None of the above
62)
FIFO stands for
a) First In First Out
b) First Out First In
c) First In First In
d) First Out First Out
63)
Dqueue is known as
a) Double ended
b) Dimensional
c) Both a) and b)
d) None of the above
64)
It allow insertion at only one end of the
list but deletion at both ends
a) Queue
b) Dqueue
c) Input restricted dqueue
d) Output restricted dqueue
65)
It allow deletion at only one end of the
list but insertion at both ends
a) Queue
b) Dqueue
c) Input restricted dqueue
d) Output restricted dqueue
66)
In priority queue we can execute these
elements as per their _____
a) Order
b) Priority
c) Sequence
d) All of the above
67)
Tree considered as ___________ data
structure
a) Linear
b) Nonlinear
c) Sequential
d) Ordered
68)
Tree data structure contain________ of
data elements.
a) Hierarchical relationship
b) Relationship
c) Both a) and b)
d) None of the above
69)
T is defined as ____ set of elements
a) Infinite
b) First
c) Finite
d) All of the above
70)
T is defined as finite set of elements
called as _____________ (node)
a) Start
b) First element
c) Side
d) None of the above
71)
Types of binary tree
a) Complete binary tree
b) Extended binary tree
c) Both a) and b)
d) Rooted tree
72)
Which are the following tree traversing
methods
a) Preorder
b) Postorder
c) Inorder
d) All of the above
73)
In which traversing the root node will be
accessed initially then left children node and finally right children node.
a) Preorder
b) Postorder
c) Postorder
d) All of the above
Comments
Post a Comment