DAA IA2 Test 50 1 marks , 25 2 marks total 100

DAA IA2 Test 50 1 marks , 25 2 marks total 100

University

75 Qs

quiz-placeholder

Similar activities

Midterms O&M (BME 311)

Midterms O&M (BME 311)

University

80 Qs

GEEC 101: ENVIRONMENTAL SCIENCE MIDTERM EXAM

GEEC 101: ENVIRONMENTAL SCIENCE MIDTERM EXAM

University

75 Qs

Microeconomics

Microeconomics

University

70 Qs

End of the year 3

End of the year 3

KG - University

70 Qs

Coach Lawry Part 2

Coach Lawry Part 2

1st Grade - University

70 Qs

La Bicicleta, Sumativo de vocabulario

La Bicicleta, Sumativo de vocabulario

5th Grade - University

77 Qs

Regional Anesthesia Pain/Receptors

Regional Anesthesia Pain/Receptors

University

72 Qs

MSR_Digital Marketing

MSR_Digital Marketing

University - Professional Development

70 Qs

DAA IA2 Test 50 1 marks , 25 2 marks total 100

DAA IA2 Test 50 1 marks , 25 2 marks total 100

Assessment

Quiz

Other

University

Practice Problem

Hard

Created by

Rakesh Sivalingam

Used 5+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

75 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

You are running a library catalog. You know that the books in your collection are almost in sorted ascending order by title, with the exception of one book which is in the wrong place. You want the catalog to be completely sorted in ascending order.

Insertion Sort

Merge Sort

Radix Sort

Heap Sort

Counting Sort

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following sorting methods would be most suitable for sorting a list which is almost sorted?

Bubble Sort

Insertion Sort

Binary Sort

Quick Sort

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

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

O(1)

O(n)

O(n2)

O(n3)

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?

5

7

8

4

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following statement is true about stack?

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

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is considered as the top of the stack in the linked list implementation of the stack?

Last node

First node

Random node

Middle node

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

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

It has low time complexity

it has low space complexity

it is easy to implement

it requires only n swaps under any condition

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?