Search Header Logo

DAA-Quiz1

Authored by Amit Chaurasia

Computers

University

DAA-Quiz1
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

10 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

What value does function mystery return when called with a value of 4?

  int mystery ( int number )

  {

  If ( number <= 1 )

  return 1;

  else

  return number * mystery( number – 1 );

  }

.

2.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

At most, how many comparisons are required to search a sorted vector of 1023 elements using the binary search algorithm?

3.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

The height of the shortest binary search tree of size n is .........................

4.

FILL IN THE BLANK QUESTION

1 min • 1 pt

1/2 n2 – 3n = O (n2).

Find the value of constant n0 if c =1, for this relation to hold, if found valid.

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The running time of your program will depend upon:

1.  The algorithm, The input

2. Your implementation of the algorithm in a programming language

3. The compiler you use, The OS on your computer and Your computer hardware

4. Maybe other things: other programs on your computer

1 False and 2 True

3  False and 4 true

All true

All false

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Give asymptotic tight bounds for the followings using master method. 

    T(n) = 9T(n/4) + n2

n

n2

n2logn

None of the above

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Give asymptotic tight bounds for the followings using master method. 

    T(n) = 9T(n/3) + 2n2 + n/3

n2

n2logn

n3

None of the above

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?