Search Header Logo

DAA B3 Batch

Authored by Ms. Shweta Sunil Pardeshi .

others

DAA B3 Batch
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

12 questions

Show all answers

1.

OPEN ENDED QUESTION

30 sec • Ungraded

Name

Evaluate responses using AI:

OFF

2.

OPEN ENDED QUESTION

30 sec • Ungraded

Roll No

Evaluate responses using AI:

OFF

3.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

1.Which of the following algorithms are used to find the shortest path from a source node to all other nodes in a weighted graph?

BFS
Prim's Algorithm
Kruskal's Algorithm
Djikstra's Algorithm

4.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

2.What is the maximum number of swaps that can be performed in the Selection Sort algorithm?

n-1
n-2
n
1

5.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

3.What is the technique called in which it does not require extra memory for carrying out the sorting procedure?

Stable
Unstable
In-Place
In-Partition

6.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

4.What is the time complexity of the binary search algorithm?

O(n)
O(1)
O(log2n)
O(n^2)

7.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

5. Which of the following is a Divide and Conquer algorithm?

Bubble Sort
Selection Sort
Heap Sort
Merge Sort

Access all questions and much more by creating a free account

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

Already have an account?