ADA unit 1 quiz

Test

Jugadas 24

Crear copia

Sobre esta actividad

An ADA (Analysis and Design of Algorithms) Quiz is designed to test students’ understanding of algorithm concepts, their efficiency, and problem-solving ability. The quiz typically covers topics such as sorting and searching algorithms, time and space complexity (best, average, and worst cases), asymptotic notations (Big O, Θ, Ω), and algorithm design techniques like Divide and Conquer.

Creada por

Akash A

India

Descarga la versión para jugar en papel

Top 10 resultados

#	Jugador	Acierto	tiempo
1	Dont care 10 de Febrero de 2026	% 60	00:55
2	Aditya gupta 10 de Febrero de 2026	% 60	01:04
3	Jeffrey modi 10 de Febrero de 2026	% 40	00:42
4	h 10 de Febrero de 2026	% 40	00:48
5	he he 10 de Febrero de 2026	% 40	00:49
6	Jethalal 10 de Febrero de 2026	% 40	00:59
7	Deepu 10 de Febrero de 2026	% 40	01:06
8	Hio 10 de Febrero de 2026	% 20	00:39
9	Hii 10 de Febrero de 2026	% 20	00:59
10	BHIDE MASTER 🤡 10 de Febrero de 2026	% 20	00:59

¿Quieres aparecer en el Top 10 de este juego? Inicia sesión para identificarte.

Crea tu propio juego gratis desde nuestro creador de juegos

Compite contra tus amigos para ver quien consigue la mejor puntuación en esta actividad

Crear reto


ADA unit 1 quizVersión en línea An ADA (Analysis and Design of Algorithms) Quiz is designed to test students’ understanding of algorithm concepts, their efficiency, and problem-solving ability. The quiz typically covers topics such as sorting and searching algorithms, time and space complexity (best, average, and worst cases), asymptotic notations (Big O, Θ, Ω), and algorithm design techniques like Divide and Conquer. por Akash A 1 Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms. a Insertion Sort b Heap sort c Merge sort d Selection sort 2 Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes? a 256 b 512 c 2048 d 1024 3 Given two sorted list of size m and n respectively. The number of comparisons needed the worst case by the merge sort algorithm will be a m x n b maximum of m and n c minimum of m and n d m + n - 1 4 Which of the following sorting algorithms has the lowest worst-case complexity? a Merge sort b Bubble sort c Quick sort d Insertion sort 5 You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate? a Heap sort b Merge sort c Quick sort d Insertion sort

ADA unit 1 quizVersión en línea

por Akash A

Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms.

Insertion Sort

Heap sort

Merge sort

Selection sort

Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?

256

512

2048

1024

Given two sorted list of size m and n respectively. The number of comparisons needed the worst case by the merge sort algorithm will be

m x n

maximum of m and n

minimum of m and n

m + n - 1

Which of the following sorting algorithms has the lowest worst-case complexity?

Merge sort

Bubble sort

Quick sort

Insertion sort

You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?

Heap sort

Merge sort

Quick sort

Insertion sort

Puedes integrar el juego en un LMS compatible con LTI 1.1 o LTI 1.3 como Canvas, Moodle, o Blackboard. De esta manera podrás guardar las puntuaciones automáticamente en el libro de calificaciones de esa plataforma.

ADA unit 1 quiz

Test

Sobre esta actividad

Creada por

Descarga la versión para jugar en papel

Top juegos

Test

Verbos irregulares en Inglés

Test

cuanto sabes de Futbol

Test

Cultura general española

Test

Tipos de sintagmas (II)

Test

Brawl stars preguntas

ADA unit 1 quizVersión en línea

por Akash A

Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms.

Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?

Given two sorted list of size m and n respectively. The number of comparisons needed the worst case by the merge sort algorithm will be

Which of the following sorting algorithms has the lowest worst-case complexity?

You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?

		%
	Anónimo	%
		%
		%