Data structure McQ Set-14

This section contains more frequently asked

Data Structure and Algorithms Fundamentals
Multiple Choice Questions Answers in the
various University level and competitive
examinations.

. Average case time complexity of binary

search is
A. On)
B.

D. bogn)

View Answe

D. e(logn

Merge sort invented by-

A. CARHOARE
B. HAMILTION
C. JOHN VON NEUMANN
D. STRASSENN
View Answer

C. JOHN VON NEUMANN

Quick sort invented by

A. CARHOARE
B. HAMILTON
C. JOHN VON NEUMANN
D. STRASSEN
View Answer

A. CARHOARE

. worst case time complexity oT Quick sOrt is

A.O(n2log7)

B Ofnlogn)
C.o(n*2)
D. Ologn)
View Answer

C. O(n*2)

. Best case time complexity of Quick sort is

A. O(n 2logn)
B. O(nlogn)
C. O(logn)
D. O(logn2)
View Answer

B. Onlogn)

OX

CAISPELLO BREAKING
rpello
EQUALSHARING
BUY NOW
Average case time complexity of Quick sort is

A. n i o g n )

. Ologn)

C. Onlogn)
D. e(logn)
View Answer

C. O(nlogn)

7. Which design strategy stops theexecution

when it find the solution otherwise starts the
problem from top
A. Back tracking
B. Divide and conquer
C. Branch and Bound

D. Dynamic programming

View Answer

A. back tracKing

.Graphical representation ofalgorithm is

A. Pseud0-code
B. Graph Coloring
.Flow hart
D. Dynamic programming
View Answer

C. Flow Chart

9. In pseudo-code conventions input express as

A. inpu
5. Reaa

C. Write
D. Return
View Answer

C. Write

10. In pseudo-code conventions output express

S-

A. input
B. Read
C. Write

Return
. e

View Answer

B. Read
Data structure MCQ Set-15

his section contains more frequently asked

Data structure MCQs in the various competitive
exams.

. Performance based criteria of algorithm,

which has to do with its computing time is

A. Time Complexity
B. Input
SpaceComplexiy
D. Finiteness
View AnsWEr

A. Iime Complexity

. Performance based criteria of algorithm

which has to do with its storage requirements is

A. Time Complexity
B. Input
C. Space Complexity
D. Finiteness
View AnSwer

C. Space Complexity

. O(1) means computing time iss

A. Constant

.
B.QuadratiC
Linedr

D. Cubic

View Answer

A. Constant

O(n) means computingtime is

A. Constant
B. Quadratic

Li
D. Cudic

View Answer

C. Linear

O(n*2) means computing time is

A. Constant
B. Quadrat
C. Linear
D. Cubic

View Answer

B. Quadratic

DA

CGRISPELLO BREAKIN
EUAL SHARING
BUY NOW
.O(n*3) means computingtime is

A. EXponential

B. Quadratic
C. Linear

D. Cubic
View Answer

D. Cubic

'. O2°n) means computing time iIs

A. Constant
B. Quadratic
C. Linear

D. Exponential
View Answer

D. Exponential

. Application of quicksort-
A. Graphic card
B. Data Processing

.apesorting
D. Card Sorting
View Answer

A. Graphic card

APplication or mergesort.

A. Graphic card
B. Networking
C. Card Sorting
D. Data Processing
View AnsWE

D. Data Processing

10. The method will choosing when sub

problems share sub problems
A. Divideand conguer
B. Greedy method
C. DynamiC programming
D. Back tracking
View AnsWer

C. Dynamic programming
Data structure MCQ Set-16

This section contains more frequently asked

ata Structure and Algorithms MCQs in the
jarious University level and competitive
examinations.

Time complexity of given algorithm Algorithm

Display (A) { For -0 to n-1 (For J-0 to n-1 {
wnte A,

2n*24-4n+4
5.2

. 2n*2+4n+2

D. 2n°2-1

View Ans

. The sorting, which works very well for small

A. Count sort

Quick sor
View AlsWE

. Selection sort

. Merge sort is

A. Externalsorting
B. Insertion sorting
C. Internal sorting
D. Exponential sorting
View A er

A. Externalsorting

. IS a step-by-step procedure for

dicuiduons

A. Prograi
. Algorithm
C. Greedy Method
D. Problem
View AnsWe

B. Algorithm

. AQvantage Or Tinding maximum and

minimum using divide and conquer method

nstead of using conditional operators is

A. NEddee opace complexity

B. Get accurate value

C. Reduce Time complexity

D. Simple calculations
View AlsE

C. Reduce Time complexity

OX

CRISPELLO BREAKING
Spelo
EQUAL HARING
BUY NOW
. Gven two non-negative functions f(n
5n2+6n+1 and gn)=n2. Calculate upper bound
diue

A. C.

B. C12

D. C=11

View Answer

B. C=12

Gven two non-negaive Tunetions T(

n2+5n*1 and gn)=n2 . Calculate lower bound

aue

A. CFo

. CEIZ

D. C=11
View Answer

C. CFbp

8. The functions f &g are non-negative

unctions. Ihe Tunction f(n)=O(g(M) if and only
f there exist positive constants c& n0 such that
T O r all n, n2 n0

A. f(n)sC
sC*g(n)
8. f(n) C*g(n)
: C*g(n)
D. f(n) != C*g(n)

View Answer

A. f(n)sC°g()

.The functions f& g are non-negative

functions. The function f(n)=0(gn) if and only
if there exist positive constants c& no such that
- T o r all n, ne no

A. fn) s C*g()
B. f(n) =
Cgln
C. T)2C°g(n)
D. T(M) = C°g(n)

View Answer

C. f(n) 2 Cgn)

0. The functions f & g are non-negative

functions. The function f(n)=0(g(n) if and only
f there exist positive constants c1,c2 & nO such
that f o r all n, ne n0
A. C2*g(n)s f(n) s C1*g(n
B. C2*g(n)e f(n) = C1*g(n)

C. C2'g(n)= f(n) = C1*g(n

D. c2*g(n)s f(n) = C1*g(n)

View Answer

A C2*g(n)s f() s C1"g(m)

Data structure MCQ Set-17

This section contains more frequently asked

Data Structure and Algorithms Multiple Choice
Questions Answers in the various University
level and competitive examinations.

Ight bound is denoted as .

B. 6
C.

D. O

ViewIAnswer

B.

Upper bound is denoted as-

A.

B. O
C. w
D. O

View Answer

D. O

. lower bound is denoted as

A.

5. O

C. W

D. O
View Answer

A.

1. The function f(n)=o(g(n) if and oniy if Limit

(n/gn)=Un->00

A LIttle on
B. Little omega
. Big oh
D. omega

View Answer
A. Little oh

. The functionf(n)=o(g(n)) if and only if Limit

n)/f[n)=0 n->00

A Lrttle oh
B. Little omega
C. Big oh
D. Omega
ViewAnswer

B. Little omega

OX

CRISPELLOBREAMKING
EQUALSHARING
BUY NOW
. Thegeneralcriteriaof algorithm;zero or more
uantities are externally supplied is
A. Output
B. Finiteness
C. Effectiveness
D. Input
View Answer

D. input

. The general criteria of algorithm, at least one

juantity Is producea
A. Output
B. Finiteness
C. Effectiveness
D. Input
View Answer

A. Output

. Ine general criteria of algorithm; Each

nstruction is clear and unambiguous
A..Output
B. Definiteness
C. Etfectiveness

D. Input
View Answer

B. Definiteness

9. The general criteria of algorithm, algorithm

must terminates after a finite number of steps

A..Output
B. Finiteness
C. Efectiveness
D. input

View Answer

B. Finiteness

10. Which is not a criteria of algorithm

A. Input
B. Output
C. Time complexity

D.bestCase
ViewAnswer

D. Best case
Data structure MCQ Set-18

A
This section contains more frequently asked
Data Structure and Algorithms Objective
Questions Answers in the various University
level and competitive examinations.

Which is not in general criteria of algorithm

. Input
B. OutputT
C. Time complexity
D. Effectiveness
View Answer

C. Time complexity

. Time complexity of given algorithm Algorithm

Display(A) { S:=0.0; For i'=-0 to n-1 (S:=S+A[|l;
Return S

A. 4n+4
B. 4n 2+4
C. 2n 2+2n+2
D. 4 n 4

ViewAnswer

A. 4n+4

. Time complexity of given algorithm

AlgorithmSum(A,S) { for i:=1 to n-1 { for j:=2 to
11S=S+ItJ; return s,}}}
A. 6n2-1 4n+4
B. 4n2+6n+12
.on2+14n+10

D. 6n*2-14n+10
View Answer

D. 6n2-14n+10

. kruskal algorithm is based on

method
A. Divide and conquer method
5. Greedy method
C. Dynamic programming
D. Branch and bound

ewV Answer

B. Greedy method

. Prims algorithm is based on

method
A. DVide and conquer method
B. Dynamic programming
C. Greedy method
D. Branch and bound
View Ansvwer

. Greedyn
metnod

CRISPELLOBREAKING)
EQUALSHARING
BUY NOW
The output of Kruskal and Prims algorithm is

A. Maximum spanning tree

B. Spanning tree
C. Minimum spanning tree
D. None of these
View Answer

C. Minimum spanning tree

. which is not feasible solution in the case of

oD sequence problem item: 1 23 4 profit : 100
10 152/ deadline: 2121
A. (1,4)
B. (4.21

C. (24)

D.(1,2)
View Answer

C.(2,4)

. which isoptimal value in the case of job

sequence problem item :12345 proft: 20 15
10 51 deadline: 223 33

A.(1,3,4)
. (4,2.3)

.(1,2,4)
D. (1,5,2)
View Answer

C. (1,2,4)

9. which is optimal value in the case of job

sequence problem item:12345667 profit : 3 5
20 18 1 6 30 deadline: 1 343212
A.(1,5,6,4)
5. (7,6,4,3)
C. (2,3,1,7)
D. (1,2,3,4)
View Answer

B.(7.6,4,3)
Data structure MCQ Set-19

This section contains more frequently asked

ata Structure Basics MCQs In the vari0us
University level and compettive examinations.

. wnich is optimal value in the case or

fractional knapsack problem, capacity of

knapsack is 20 ttem : 1 23 profit: 25 24 15
weight : 18 15 10
A.

5, 4
+80

C. 499
D. 485
View Answer

A. 498

2. which is optimal value in the case of

ractional knapsack problem, capacity o
Iapsack iS 10 tem:2345 profit:12 32 40
0 0welgnt 4 8 2 6

A. 345

5. 384

C. 354

D. 350
View Answer

C. 354

3. 4 -Queen problem what is the space

complexity
A. O(V)
B. O(EI)
C. O(VI+|E|)
D. O(V2|)
View Answer

A. O(V)

4. In the case of FibnocCl heap tne running une

OT Prims digonu

A. O(E log V)
B. O(V log E)
C. C log V)
D. O(E log E)
view Answer

A. O(E log V)

ime complexity of 4-queen problem

A. O(V)
B. O(E)
C. o(Vl+|E|)
D. O(V21)
View Answer

. o(V+lE)

Ox

CRISPELL BREAKING)
EUUAL SHARING

BUY NOW
Ifthe graph is represented as an adjacency
matrix then the time complexity or Kruskals

algorithm is.
A. O(EOg v
B. OviogE)
C. O(v2)
D. O(logE)
View Answer

A. O(E log V)

, BFS is best compared to DFS in the case of

A. The graphs width is large

5. The
Tne

gp
grap COnsists
e of many nodes
D. Ine grapn is complex

VIE
B. The graph's depth is large

The timecomplexity of Strassen's algorithm is

A. O(E log V)
B. O(V2)
C. O(nlog/)
D. O(log n7)
View Answer

C. Onlog/

. By strassens equation what is wrong in the

following e tion

( e + h )

8. ps=(a-c)le+)

D. pasla-D)n

View A

. p2=(-e+g)d

10. By Strassen's equation what is Wrong in the

rollowing equation
A. p1=(a+d)(e+n)
5. ps=(a-0) e+i)
C.p7(e+g)d
D. p4=(a-b)h
View Answer

.p4=(a-b)hh
Data structure MCQ Set-21

This section contains more frequenty asked

Data Structure and Algorithms Basics MCQs n

the various University level and competitive

xaminations.

job sequencing with deadline is based on

method
A. greedy method
B. branch and bound
C. dynamic programming
D. divide and conquer
View Answer

A. greedy method

fractional knapsack is based on

method
A. greedy metnoa

B. branch and bound 2 8713564

C. dynamic programming
D. aivde and conquer

View Answer

A. greedy metnod

.0/1 knapsack is based on

metnod
A. greedy method

B. branch and bound

C. dynamic programming
D. divide and conquer
View Answer

C. dynamic programming

Thefiles x1,x2,X3 are 3 files of length

S0,20,10 records each. What is the optimal
merge pattern value?
A. 110

B. 60
C. 90
D. 50
View Answer

C. 90

. he optimal merge pattern is based on

- method

A. Greedy methoa
B. Dynamic programming
C. Knapsackmethod
D. Branch and bound
View Answer

A. Greedy method

X|

GRISPELLO BREAKING
EQDAL SHARING
BUYNOW
Who invented the word Algorithm
A. Abu Jafar Mohammed ibn Musa
B. Abu Mohammed Knan
C. Abu Jafar Mohammed Kasim
D. Abu Jafar Mohammed Ali Khan
View Answer

A. Abu Jatar Mohammed ibn Musa

. In Aigorithm comments begin

A.

C. */
D.
View Answer

D. /

. he of an algorithm is the amount

t memory it needs to run to completion.,
A. Space omplexity

B. Best Case
C. Time Complexity
D. Worst Case
iew Answ
EW

A. Space Complexity

-IS tne process of executinga

correct program on data sets arnd measuring

the time and space it takes tocompute the

resuts.

A Debugging
B. Combining
C. Profiling
D. Conqure
View Answer

C. Profiling9

10. In Algorithm Specification the blockes are

indicated WIth matcning

A.Braces
B. Square Brackets
C. Parenthesis
D. Slashes
View Answer

A. Braces
Data structure McQ Set-22

nis Secuon contains more irequenuy asked

Data structure and Algorithms 5asiCs Mutiple

nuvetsiy evel dind compeive ekanmnaons

. Humancodes are the applications of

with minimal weighted external patn
ength obtained by an optimal set.

A. BST
B. MST
. DSinary tree

D. Weighted Graph

View Answer

Binary ree

2. From the following which is not return

optimal solution
A. Dynamic programming

B. Backtracking

C. Branch and bound

Greedy nethod
View Answer

. Backtracking

I s an algorithm design method

hat can be used when the solution to a problem

an be viewed as the resuft of a sequence of

uecisiOs

A. Dynamic programming9

B. Backtracking
C. Branch and bound

D. Greedy method

View Answer

A. Dynamic programming

. Ine name Dacktrack Was Tirst colned by

A. D.H.Lehmer
3. L.Eaumert

C. R.J.W
Walker
D. S. Golomb
View Answer

A. D.H.Lehmer

. The term r e f e r s to all state space

search methods in which all hildren of the-

nodes are generated before any other live node
can becomethe E-node.

A. Backtacki
King

5. Depth First Searcn

. Breadth First searcn

View Answe

Branch and Bouna

CRISPELLOBREAKING
EUDAL ARING
BUY NOW
6. A i s a round trip path along n
ages or G tnat visits every vertex once and

erurns to ts starting position.

A. M

B. TSP

c. Multistage orapn
D. Hamiltonian ycle
View Answer

D. Hamiltonian Cycle

7. Graph Coloring is which type of algorithm

lesign str

. Backtacking

B. Greedy
C. Branch and Bound

D. Dynamic programming

View Answ

A. Backtacking

8. Which of the following is not a limitation of

binary search algorithm?
A. must use a sorted array

3. requirement of sorted array is expensive

when a lot of insertion and deletions are
eeded

u ust De d ieldusin to access

niddle elemen uuy

hi s not efficient
ne ddld eieiens die o d

1000
View Answer

. binary search algorithm is not efficient

when the data elements are more than

000

. Binary Search Algorithm cannot be applied to

A. Sorted linked list
3. Sorted linear array
C. Sorted binary tree
D. Pointer a rray
View Answer

. Sorted linked list

10. Two main measures for the efficiency of an

algoritnmare
A. Processor and memory

B. Time and space

omplexIy and capacity

D. Data and space
lew Answer

. ime and space

Data structure MCQ Set-23
(A)(A) A)
his section contains more Trequentiy asked

Data Structure Fundamentals MCQs in the

various university evel and competitive

The space factor when determining the

ticiency of algorithm is measured by
. Counting the maximum memory needed
bythe algoritnm
B. Counting the minimum memory needed

y ne algorithm
. Counting the average memory needed

y the algorithm

. Counting the maximum disk space

needed by the algorithm

View Answer

A. Counting the maximum memory

needed by the algorithm

. Which of the following case does not exist in

complexity theory
. Best case

3. Average case
. Worst case

. Nu case

View A

. Nuil case

.The Worst case occur in linear search

lnorit

*A ltom is sonewnere in the middle of

3. Item is the last element in the array the

array

. Item is the last element in the array

. Item is not in the array at all or is not

there at all
View Ans

. tem is not in the array at all or is not

there at al

+. The Average case ocCur in linear search

lgorithm
A. When Item is somewhere in the middle
of the array

3. When item is the last element in the

middle of the array array

. Whenltem is not in the array at all

. when item is the last element in the

diay O not nere at aii

VieW A

When ltem is somewhere in the middle

of the array

The complexity of the average case or an

algorith
. Much more complicated to analyze
B. Sometimes more complicated and than
that of worst case some other times
simpler than that of
. Much more simpler to analyze than
Worst case that of worst case

. None or above

View Answer

C. Much more simpler to analyze than

worst case that of worst case

DIX

CRISPELLO BREAKING
EQUALLSHARIDO
BUY NOW
Ihe complexity of linear search algorithm is

A. O )

3.o

C. Olog n)

D. O(n log n)
View Answer

. O(n)

I n e complexity or Binary search algorithm is

A. O(n)
on°2)
c. O(log n)
D. O(n log n)
View Anse

. O(log n)

The complexity of Bubble sort algorithm is

A. O(n)

B. On2)

C.OOg n)
. og

View AnsWE

. O)

. The complexity of merge sort algorithm is

B. O(n2)
. o(log n)
D. On log n
View Answer

D. On iog

10. The time factor when determining the

emiciency of algorithm is measured by

A. Counting microseconds

B. Counting the number of statements

C. Counting the numberot key operations

D. Counting the kilobytes of algorithm

operations
View Answer

C. Counting the number of key operations

 Data structure McQ Set-24

A) (A)
his sectlon contains more frequently asked

Data Structure Fundamentals Multiple Choice

Questions Answers in the various University

level and competitive examinations.

1. Which of thefollowing sorting algorithm is of

vide-and-conquer type
A. 5uDDle sort

. Insertion sort

. All of above

8. Quick sort

. An algorithm that calls Itselt directly or

directiy is Known as

Recursion
. Traversa algorithm

iew Answer

C. Recursion

3. The running time of quick sort depends

eavily on the selection of

A. No of inputs

. Arrangement of elements in array

. Pivot element

View AnsWer

D. Pivot element

4. In stable sorting algorithm

A. One array is used

3. More then one arrays are require

D. Duplicatinq elemante romain in no

handled. same relative position after
sorting
iew Answer

D. Duplicating elements remain in no

handled. same relative position after

sorting

Which sorting
y algorithn
d o is faster
s Taster

B. O(n+k)
. Onlogn)

D. O(n3)

View Answer

B. O(n+k)

CRISPELLO BNEANINO
AL SHARID
BUY NOW
6. In Quick sort algorithm.constants hidden in

(n ig n) are

A. Laige

3. Not knov

. Medium

. Small

. Small

'. Quick sort is based on divide and conquer

aradigm, we divide the problem on base of

p ivotelementan

A. Ihere Is explicit Combine process as

well to conquer the solution.

No work is needed to combine the sub

arrays, the array is already sorted

Dalays
. None of above
View Answer

8. Diykstras algorithm :

A. Has eeay pproach to find all shortest

paths
to find all shorhant OpprOacn

. Has greedy approach to compute single

source shortest paths to all other

VEertices
. Has both greedy and dynamic approach

to compute single source snorest

paths to all other vertices.

View Answer

. Has greedy approach to compute

single source shortest paths to all other

ertices

. What algoritnm technique is used in the

mplementation of Kruskal'ssolution for

theMST?
. Greedy Technique

. DVIde-andOnquere

D. The algorithm combines more than one

of the above techniques

View Answer

A. Greedy Technique

Which is true statement in the following ?

. Kruskal'salgorithm is muitiple source

technique rOr finding Msl.

to find
minimum spanning tree of a graph, time
complexity of this algorithm is O(EV)

Both of above
. Kruskal's algorithm (choose best non-
cycle edge) is better than Prims

(choose best Tree edge) wnen the grapn

has relatively few edges)

View Answer

. Kruskals algorithm (choose best non

ycle edge) is better than Prim's (choOse

est iree edge) wnen the grapn has

ciduivEly Ew eages
Data structure MCQ Set-25

This section contains more frequently asked

Data Structure and Algorithms Fundamentals
MCQs in the various University level and
competitive examinations.

Data by itselfis not useful unless

A. It is massive
B. It is processed to obtain information
C. It is collected from diverse sources
D. It is properiy stared

View Answer

B. It is processed to Obtain information

2. Which of the following data structure is not

linear data structure?
A. Arrays
B. Linked lists
C. Both of the above
D. None of the above
View Answer

D. None of the above

. The disadvantage in using a cirCular linked

ist is .

A. It is possible to get into infinite loop.

B. Last node points to first node.
C. Time consuming
D. Requires more memory space
View AnsWE

A. It is possible to get into infinite loop.

. A linear list in which each node has pointers

to point to tne predecessor and successors

nodes is called as.

A. Singly Linked List
B. Circular Linked List
C. Doubly Linked List
D. Linear Linked List

View Answer

C. Doubly Linked List

5. A s a linear list in which insertions

and deletions are made to from either end of
the structure.
A. Circular queue

B. random of queue

C.priority
D. dequeue
View Answer

D. dequeuee

OX

CRISPELLO BREAKING%

EQUAL SHARING
CINpel o
BUYNOW
. In a priority queue, insertion and deletion
takes place at ...
A. Tront, rear end
B. only at rear end
C. only at front end
D. any position

View Answer

D. any position

7. Which of the following is an application of

stack?
A. finding factorial
B. tower of Hanoi
C. infix to postfix conversion
D.all of the above

View Answ

B. tower of Hanoi

8. The data structure which is one ended is

A. queue
B. stack

C. tree

D. grapn

View Answer

B. stack

9. A list which displays the relationship of

adjacency between elements is said to be
A. linear

B. non linear
C. linked list
D. trees

View Answer

A. linear
Data structure MCQ Set-26

This section contains more frequently asked

Data Structure and Algorithms Fundamentals
Multiple Choice Questions Answers in the

various University level and competitive

examinations.

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 above
Swer

A. Complete binary tree

2. When converting binary tree into extended

binary tree, all the original nodes in binary tree
re

A. internal nodes on extended tree

B. external nodes on extended tree
C. vanished on extended tree
D. None of above
Answer

B. external nodes on extended tree

3. An algorithm that calls itself directly or

indirectly iS known as

A. Sub algorithm
B. Recursion
C. Polish notation
D.1Traversal lgornithm
View Answer

3. Recursio

4. In a Heap tree
A. Values in a node is greater than every
value in lert Sud tree and smaller tnan

right sub tree

3. Values in a node is greater tnan every

value in children ot it

C. Both of above conditions applies

D. None of above conditions applies

VIEw ASWE

B. Values in a node is greater than every

value in children of it

5. A connected graph T without any cycles is

called

A. a tree graph
3. Tree tree

.atree
D. All ofabove
View Answer

. a tree grapn

Python Data Science Projects

Get started rignt avway

Aaa atractve practica SKIHs iKe WeD

P NEOI A, nOre, tO y o u r

esum

rio.do

FEN

. The in order traversal of tree willyield a

sorted listing of elements of tree in
Dimae
A.Binaiyu
"oedrchtrees

D. None f abo
VAnswer

3. 5inary search trees

Ihe application of heap tree is

A. To Sort the elements in array

B. To evaluate the mathematical
ression

C. lo search the element in array

D. None of these
View Answer

A. To Sort the elementS in array

8. The deletion mechanism in the stack is called

as

A. PUSH
B. POP
C. Delete
D. None of these
View Answer

B. POP

IFO mecnanism is used in

A. Stack

B. Queue
C. Array
D. linked list
View AS

A. StaCK

10. The element which is inserted first will be

emoved last in the
A. Queue

8. Array

C. Linked list
D. None f these
View Answer

. NOne or tnese