BSNL TTA Computer Structure Data And Algorithm
Category –BSNL Online Test
Telegram-Join Us On Telegram
Attempt Free BSNL TTA Computer Structure Data And Algorithm Here. Read The Important BSNL MCQ From Below.
1) The in order traversal of tree will yield a sorted listing of elements of tree in
a Binary trees
b Binary search trees
c Heaps
d None of these
Ans. b
2) Binary search algorithm can not be applied to
a Sorted linked list
b Sorted binary trees
c sorted linear array
d pointer array
Ans. a
3) The term “push” and “pop” is related to the
a Arrays
b lists
c stacks
d All of these
Ans. a
4) Which of the following sorting algorithm is of divide-and-conquer type?
a Bubble sort
b Insertinon sort
c Quick sort
d All of above
Ans. c
BSNL TTA Computer Structure Data And Algorithm
5) An algorithm that calls itself directly or indirectly is known as
a Sub algorithm
b Recursion
c Polish notation
d Traversal alogorithm
Ans. b
6) Which of the following data structure is linear type?
a Strings
b Lists
c Stacks
d None of these
Ans. d
7) Which data structure allows deleting data elements from front and inserting at rear?
a Stacks
b Queues
c Deques
d Binary search tree
Ans. b
BSNL TTA Computer Structure Data And Algorithm
8) Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
a Elementary items
b atoms
c Scalars
d All of these
Ans. d
9) A data structure where elements can be added or removed at either end but not in the middle
a Linked lists
b Stacks
c Queues
d Deque
Ans. d
10) In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
a Leaf
b Branch
c Path
d Thread
Ans. d
11) To represent hierarchical relationship between elements, which data structure is suitable?
a Deque
b Priority
c Priority
d All of these
Ans. c
BSNL TTA Computer Structure Data And Algorithm
12) Which of the following name does not relate to stacks?
a FIFO lists
b LIFO list
c Piles
d Push-down lists
Ans. a
13) A connected graph T without any cycles is called
a A tree graph
b Free tree
c A tree
d All of these
Ans. d
14) The situation when in a linked list START=NULL is
a underflow
b overflow
c housefull
d saturated
Ans. a
15) A binary tree whose every node has either zero or two children is called
a Complete binary tree
b Binary Search tree
c Extended binary tree
d None of these
Ans. c
16) 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
Ans. a
BSNL TTA Computer Structure Data And Algorithm
17) Which of the following data structure store the homogeneous data elements?
a Arrays
b Records
c Pointers
d None
Ans. b
18) Which of the following data structure can’t store the non-homogeneous data elements?
a Arrays
b Records
c Pointers
d None
Ans. a
19) 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 Housefull
d saturated
Ans. b
20) Which of the following data structure is non-linear type?
a Strings
b Lists
c Stacks
d None of these
Ans. d
BSNL TTA Computer Structure Data And Algorithm
21) In a graph if e=(u, v) means
a U is adjacent to v but v is not adjacent to u
b E begins at u and ends at v
c U is processor and v is successor
d Both e begins at u and ends at v and u is processor and v is successor
Ans. d
22) If every node u in G is adjacent to every other node v in G, A graph is said to be
a Isolated
b Complete
c Finite
d Strongly connected
Ans. b
23) Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
a Input-restricted deque
b Output-restricted deque
c Priority queues
d None of these
Ans. a
BSNL TTA Computer Structure Data And Algorithm
24) Which of the following is two way list?
a grounded header list
b circular header list
c linked list with header and trailer nodes
d None of above
Ans. d
25) When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
a FAEKCDBHG
b FAEKCDHGB
c EAFKHDCBG
d FEAKDCHBG
Ans. b
BSNL TTA Computer Structure Data And Algorithm
