Export

You might also like

Download as txt, pdf, or txt
Download as txt, pdf, or txt
You are on page 1of 2

Hained i Z4 Roll Noa

Department of Computer Science


Quiz # 1 of MCS Semester IV (Evening)
Marks: 5

Subject: Design and Analysis of Algorithms

Time: 20 min Instructor: Dr. Humaira Afzal Date: 12-10-2023

Q1. Following is a statement that is to be proved by Induction .

n<2" forallne Z"


In the following inductive step which 0
k+1< _s2t+ 2's 2.28

Ae} ff N
a) 2" by tt+1 yer. § dt-1 / Ke
Q2. Following is a statement that is to be proved by Induction . C /
in themissi

Ae ee

f the following option will be filled in the missing place? }

+ ss

“For n any positive integer, 6"~I is divisible by 5” ;


In the following inductive step which of the following option will befilled
61-1 = 6(65)-1 = = 6(6' -1)+5. .
k k Qs Ko k k
a) 6(6°-1)-1+6 b) 6(65-1)-1 t+ 3X: ¢) 6(6° -1)-5 +5 d) (6° -1)-6 +6
Q3. Which of the following és true for the expression Sn+10 0 | om,
a) €Q(n) - b) € O(n) Oe Ge d)bothaandb —e) both b andc f) both a and c
Q4. In order to prove n? +n= O(n?) , What wil bé the values nd no?
a) no=2,ande=2 b) no= 2, and cg 1- Mo=l,ande=2 d)no=1,andc=1
Q5. After applying Master Theorem on the followir.2 recurrence, Which of the
following will be result?
T(n) = 9T(n/3) +n pwning
mn 4s v :
) Sta ) = Sy th
&
F
a) O(n’) b) ©(n’lgn) !

You might also like