Search Header Logo

DSA Quiz 2cse2

Authored by tarul kamboj

Computers

University

Used 4+ times

DSA Quiz 2cse2
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following sorting algorithms is not an in-place sorting algorithm?


A. Merge Sort

B. Quick Sort

C. Shell Sort

D. Heap Sort

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is time complexity of fun()?

int fun(int n)

{

    int count = 0;

    for (int i = n; i > 0; i /= 2)

        for (int j = 0; j < i; j++)

           count += 1;

    return count;

}


(A)O(n2)

(B)O(n*log(n))

(C)O(n)

(D)O(n*log(n*Log(n)))

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of Huffman Coding?

(A)O(N)


(B)O(NlogN)

(C)O(N(logN)^2)

(D)O(N^2)

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the time complexity of Strassen's algorithm for matrix multiplication?

O(n)

O(nlogn)

O(n^2)

O(n^2.81)

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The Bellman-Ford algorithm is used to solve:

Single-source shortest path problem

All-pairs shortest path problem

Maximum flow problem

Minimum spanning tree problem

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The Master Theorem is used to solve recurrences of which type?

Linear recurrences

Quadratic recurrences

Exponential recurrences

Divide and Conquer recurrences

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which greedy algorithm solves the knapsack problem?

Dijkstra's algorithm

Prim's algorithm

Kruskal's algorithm

Fractional knapsack algorithm

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?