Which of the following is the biggest advantage of selection sort?

it requires only n swaps under any condition

Which of the following statement is true about stack?

pop operation removes the bottom most element

pop operation removes the top most element

pop operation removes the bottom most element

push operation adds new element at the bottom

push operation removes the top most element

In terms of Venn Diagram, which of the following expression gives LCM (Given A ê“µ B â‰ Ã˜)?

multiplication of a ê“µ b terms

What is the LCM of two coprime numbers?

addition of two coprime numbers

multiplication of two coprime numbers

In terms of Venn Diagram, which of the following expression gives GCD (Given A ê“µ B â‰ Ã˜)?

multiplication of a ê“µ b terms

Which of the following recurrence relations can be used to find the nth fibonacci number?

f(n) = f(n â€“ 1) + f(n â€“ 2)

Which of the following option is wrong?

fibonacci number can be calculated by using dynamic programming

fibonacci number can be calculated by using recursion method

fibonacci number can be calculated by using iteration method

no method is defined to calculate fibonacci number

Recursion is a method in which the solution of a problem depends on

smaller instances of different problems

larger instances of different problems

larger instances of the same problem

smaller instances of the same problem

smaller instances of different problems

397 + Mcqs in Design And Analysis Of Algorithms in Computer Science Engineering (CSE) Page 8 McqOptions

351.	Recursive selection sort is a comparison based sort.
A.	true
B.	false
Answer» B. false

Discussion

352.	What will be the best case time complexity of recursive selection sort?
A.	o(n)
B.	o(n2)
C.	o(log n)
D.	o(n log n)
Answer» C. o(log n)

Discussion

353.	Which of the following sorting algorithm is NOT stable?
A.	selection sort
B.	brick sort
C.	bubble sort
D.	merge sort
Answer» B. brick sort

Discussion

354.	Which of the following is the biggest advantage of selection sort?
A.	its has low time complexity
B.	it has low space complexity
C.	it is easy to implement
D.	it requires only n swaps under any condition
Answer» E.

Discussion

355.	What will be the recurrence relation of the code of recursive selection sort?
A.	t(n) = 2t(n/2) + n
B.	t(n) = 2t(n/2) + c
C.	t(n) = t(n-1) + n
D.	t(n) = t(n-1) + c
Answer» D. t(n) = t(n-1) + c

Discussion

356.	Which of the following sorting algorithm has best case time complexity of O(n2)?
A.	bubble sort
B.	selection sort
C.	insertion sort
D.	stupid sort
Answer» C. insertion sort

Discussion

357.	What will be the time complexity of the code to reverse stack recursively?
A.	o(n)
B.	o(n log n)
C.	o(log n)
D.	o(n2)
Answer» E.

Discussion

358.	What is the time complexity of the program to reverse stack when linked list is used for its implementation?
A.	o(n)
B.	o(n log n)
C.	o(n2)
D.	o(log n)
Answer» B. o(n log n)

Discussion

359.	Which of the following statement is true about stack?
A.	pop operation removes the top most element
B.	pop operation removes the bottom most element
C.	push operation adds new element at the bottom
D.	push operation removes the top most element
Answer» B. pop operation removes the bottom most element

Discussion

360.	How many recursive calls are there in Recursive matrix multiplication by Strassenâ€™s Method?
A.	5
B.	7
C.	8
D.	4
Answer» C. 8

Discussion

361.	What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
A.	o(n)
B.	o(n2)
C.	o(n3)
D.	o(n!)
Answer» D. o(n!)

Discussion

362.	What is the time complexity of the above recursive implementation used to reverse a string?
A.	o(1)
B.	o(n)
C.	o(n2)
D.	o(n3)
Answer» C. o(n2)

Discussion

363.	Which of the following methods can be used to find the sum of digits of a number?
A.	recursion
B.	iteration
C.	greedy algorithm
D.	both recursion and iteration
Answer» E.

Discussion

364.	Which algorithm is the most efficient numerical algorithm to obtain lcm?
A.	eulerâ€™s algorithm
B.	euclidâ€™s algorithm
C.	chebyshev function
D.	partial division algorithm
Answer» C. chebyshev function

Discussion

365.	Is lcm an associative function.
A.	true
B.	false
Answer» B. false

Discussion

366.	What is the following expression, lcm (a, gcd (a, b)) equal to?
A.	a
B.	b
C.	a*b
D.	a + b
Answer» B. b

Discussion

367.	What is the following expression, lcm (a, lcm (b, c) equal to?
A.	lcm (a, b, c)
B.	abc
C.	a + b + c
D.	lcm (lcm (a, b), c)
Answer» E.

Discussion

368.	Is 9 and 28 coprime number.
A.	true
B.	false
Answer» B. false

Discussion

369.	What is the lcm (a, b)?
A.	a + b
B.	gcd (a-b, b) if a>b
C.	lcm (b, a)
D.	a â€“ b
Answer» D. a â€“ b

Discussion

370.	What is the LCM according to the given Venn Diagram?
A.	2
B.	3 c) 180
C.	d) 6
Answer» D.

Discussion

371.	In terms of Venn Diagram, which of the following expression gives LCM (Given A ê“µ B â‰ Ã˜)?
A.	multiplication of a u b terms
B.	multiplication of a ê“µ b terms
C.	multiplication of a*b terms
D.	multiplication of a-b terms
Answer» B. multiplication of a ê“µ b terms

Discussion

372.	What is the LCM of two coprime numbers?
A.	1
B.	0
C.	addition of two coprime numbers
D.	multiplication of two coprime numbers
Answer» E.

Discussion

373.	Which of the following is also known as LCM?
A.	lowest common divisor
B.	least common multiple
C.	lowest common measure
D.	highest common multiple
Answer» B. least common multiple

Discussion

374.	Which is the smallest number of 3 digits that is divisible by 2, 4, 8?
A.	100
B.	102
C.	116
D.	104
Answer» E.

Discussion

375.	LCM is also called as
A.	gcd
B.	scm
C.	gcf
D.	hcf
Answer» C. gcf

Discussion

376.	What is the computational complexity of Binary GCD algorithm where a and b are integers?
A.	o (log a + log b)2)
B.	o (log (a + b))
C.	o (log ab)
D.	o (log a-b)
Answer» B. o (log (a + b))

Discussion

377.	Who gave the expression for the probability and expected value of gcd?
A.	james e. nymann
B.	riemann
C.	thomae
D.	euler
Answer» B. riemann

Discussion

378.	Is gcd an associative function.
A.	true
B.	false
Answer» B. false

Discussion

379.	If gcd (a, b) is defined by the expression, d=ap + bq where d, p, q are positive integers and a, b is both not zero, then what is the expression called?
A.	bezoutâ€™s identity
B.	multiplicative identity
C.	sum of product
D.	product of sum
Answer» B. multiplicative identity

Discussion

380.	Is 9 and 28 coprime number?
A.	true
B.	false
Answer» B. false

Discussion

381.	What is the GCD of 48, 18, 0?
A.	24
B.	2
C.	3
D.	6
Answer» E.

Discussion

382.	What is the GCD of a and b?
A.	a + b
B.	gcd (a-b, b) if a>b
C.	gcd (a+b, a-b)
D.	a â€“ b
Answer» C. gcd (a+b, a-b)

Discussion

383.	What is the GCD according to the given Venn Diagram?
A.	2
B.	3
C.	5
D.	6
Answer» D. 6

Discussion

384.	In terms of Venn Diagram, which of the following expression gives GCD (Given A ê“µ B â‰ Ã˜)?
A.	multiplication of a u b terms
B.	multiplication of a ê“µ b terms
C.	multiplication of a*b terms
D.	multiplication of a-b terms
Answer» C. multiplication of a*b terms

Discussion

385.	Which of the following is also known as GCD?
A.	highest common divisor
B.	highest common multiple
C.	highest common measure
D.	lowest common multiple
Answer» B. highest common multiple

Discussion

386.	If GCD of two number is 8 and LCM is 144, then what is the second number if first number is 72?
A.	24
B.	2
C.	3
D.	16
Answer» E.

Discussion

387.	Which of the following is coprime number?
A.	54 and 24
B.	4 and 8
C.	6 and 12
D.	9 and 28
Answer» E.

Discussion

388.	Which of the following gives the sum of the first n natural numbers?
A.	nc2
B.	(n-1)c2
C.	(n+1)c2
D.	(n+2)c2
Answer» D. (n+2)c2

Discussion

389.	Which of the following recurrence relations can be used to find the nth fibonacci number?
A.	f(n) = f(n) + f(n â€“ 1)
B.	f(n) = f(n) + f(n + 1)
C.	f(n) = f(n â€“ 1)
D.	f(n) = f(n â€“ 1) + f(n â€“ 2)
Answer» E.

Discussion

390.	Which of the following option is wrong?
A.	fibonacci number can be calculated by using dynamic programming
B.	fibonacci number can be calculated by using recursion method
C.	fibonacci number can be calculated by using iteration method
D.	no method is defined to calculate fibonacci number
Answer» E.

Discussion

391.	Which of the following is not a fibonnaci number?
A.	8
B.	21
C.	55
D.	14
Answer» E.

Discussion

392.	Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?
A.	5
B.	6
C.	7
D.	8
Answer» B. 6

Discussion

393.	Which of the following recursive formula can be used to find the factorial of a number?
A.	fact(n) = n * fact(n)
B.	fact(n) = n * fact(n+1)
C.	fact(n) = n * fact(n-1)
D.	fact(n) = n * fact(1)
Answer» D. fact(n) = n * fact(1)

Discussion

394.	In general, which of the following methods isnâ€™t used to find the factorial of a number?
A.	recursion
B.	iteration
Answer» B. iteration

Discussion

395.	Which of the following problems canâ€™t be solved using recursion?
A.	factorial of a number
B.	nth fibonacci number
C.	length of a string
D.	problems without base case
Answer» E.

Discussion

396.	Recursion is a method in which the solution of a problem depends on
A.	larger instances of different problems
B.	larger instances of the same problem
C.	smaller instances of the same problem
D.	smaller instances of different problems
Answer» D. smaller instances of different problems

Discussion

397.	Recursion is similar to which of the following?
A.	switch case
B.	loop
C.	if-else
D.	if elif else
Answer» C. if-else

Discussion

Explore topic-wise MCQs in Computer Science Engineering (CSE).

Recursive selection sort is a comparison based sort.

What will be the best case time complexity of recursive selection sort?

Which of the following sorting algorithm is NOT stable?

Which of the following is the biggest advantage of selection sort?

What will be the recurrence relation of the code of recursive selection sort?

Which of the following sorting algorithm has best case time complexity of O(n2)?

What will be the time complexity of the code to reverse stack recursively?

What is the time complexity of the program to reverse stack when linked list is used for its implementation?

Which of the following statement is true about stack?

How many recursive calls are there in Recursive matrix multiplication by Strassenâ€™s Method?

What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?

What is the time complexity of the above recursive implementation used to reverse a string?

Which of the following methods can be used to find the sum of digits of a number?

Which algorithm is the most efficient numerical algorithm to obtain lcm?

Is lcm an associative function.

What is the following expression, lcm (a, gcd (a, b)) equal to?

What is the following expression, lcm (a, lcm (b, c) equal to?

Is 9 and 28 coprime number.

What is the lcm (a, b)?

What is the LCM according to the given Venn Diagram?

In terms of Venn Diagram, which of the following expression gives LCM (Given A ê“µ B â‰ Ã˜)?

What is the LCM of two coprime numbers?

Which of the following is also known as LCM?

Which is the smallest number of 3 digits that is divisible by 2, 4, 8?

LCM is also called as

What is the computational complexity of Binary GCD algorithm where a and b are integers?

Who gave the expression for the probability and expected value of gcd?

Is gcd an associative function.

If gcd (a, b) is defined by the expression, d=a*p + b*q where d, p, q are positive integers and a, b is both not zero, then what is the expression called?

Is 9 and 28 coprime number?

What is the GCD of 48, 18, 0?

What is the GCD of a and b?

What is the GCD according to the given Venn Diagram?

In terms of Venn Diagram, which of the following expression gives GCD (Given A ê“µ B â‰ Ã˜)?

Which of the following is also known as GCD?

If GCD of two number is 8 and LCM is 144, then what is the second number if first number is 72?

Which of the following is coprime number?

Which of the following gives the sum of the first n natural numbers?

Which of the following recurrence relations can be used to find the nth fibonacci number?

Which of the following option is wrong?

Which of the following is not a fibonnaci number?

Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?

Which of the following recursive formula can be used to find the factorial of a number?

In general, which of the following methods isnâ€™t used to find the factorial of a number?

Which of the following problems canâ€™t be solved using recursion?

Recursion is a method in which the solution of a problem depends on

Recursion is similar to which of the following?

If gcd (a, b) is defined by the expression, d=ap + bq where d, p, q are positive integers and a, b is both not zero, then what is the expression called?