New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

ADA unit 1 quiz

Quiz

Played 24

About this activity

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.

Created by

India

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
ADA unit 1 quiz
 

ADA unit 1 quizOnline version

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.

by Akash A
1

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

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?

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

4

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

5

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

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.