Design And Analysis of Algorithms

Design And Analysis of Algorithms

University

25 Qs

quiz-placeholder

Similar activities

DSA - Q1

DSA - Q1

University

25 Qs

221 quiz questions exam 2 prep

221 quiz questions exam 2 prep

University

26 Qs

Data Structures and  Its Applications

Data Structures and Its Applications

University

30 Qs

Binary Numbers, Data Compression, and Data Extraction

Binary Numbers, Data Compression, and Data Extraction

9th Grade - University

20 Qs

Data Structures and Algorithms Quiz - BATCH 1

Data Structures and Algorithms Quiz - BATCH 1

University

23 Qs

Sorting algorithms (Y11)

Sorting algorithms (Y11)

8th Grade - University

20 Qs

Technical Assessment

Technical Assessment

University

20 Qs

Quiz on Standard Algorithms

Quiz on Standard Algorithms

10th Grade - University

20 Qs

Design And Analysis of Algorithms

Design And Analysis of Algorithms

Assessment

Quiz

Computers

University

Medium

Created by

Manzoor Ahmed

Used 1+ times

FREE Resource

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which is the 4th step in Algorithm design and Analysis process?

Understand the problem

code the algorithm

Prove correctness

Analyze the algorithm

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which is the best case notation to check the efficiency of the algorithm?

Ω (Omega) notation

O (Big Oh) notation

o (little oh) notation

Θ (Theta) notation

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Identify aymptotic notation given in the figure?

O (Big Oh) notation

Ω (Omega) notation

Θ (Theta) notation

None of the above

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The time complexity for TOH in best & worst case is given by _________

n

logn

n2(n-square)

2n

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the worst case time complexity of selection sort & bubble sort?

θ(n3)(n-cube)

θ(n2)(n-square)

θ(n)

θ(2n)

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What type of algorithm technique involves dividing the problems into sub-problems and combining the solution to get the final solution?

Divide & Decrease

Decrese & Transform

Divide & Conquer

Divide & Transform

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of Merge sort?

𝜽(𝒏)

𝜽(𝒍𝒐𝒈𝒏)

𝜽(𝒏𝒍𝒐𝒈𝒏)

𝜽(𝒏𝒍𝒐𝒈𝟐𝒏)

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?