Sem 6

Information Technology

Year 3

Third Year

`UNIT 1<ol style="padding-left:0pt; "><li style="font-family:Rockwell; font-weight:bold; color:#ff0000; margin-left:12pt; line-height:150%; text-align:justify; font-size:12pt">Difference between non recursive and recursive algorithm.</li><li style="font-family:Rockwell; font-weight:bold; color:#ff0000; margin-left:12pt; line-height:150%; text-align:justify; font-size:12pt">What is asymptotic notations?</li><li style="font-family:Rockwell; font-weight:bold; color:#ff0000; margin-left:12pt; line-height:150%; text-align:justify; font-size:12pt">How to calculate time complexity give example.</li><li style="font-family:Rockwell; font-weight:bold; color:#ff0000; margin-left:12pt; line-height:150%; text-align:justify; font-size:12pt">What component required to calculate the space and time complexity?</li><li style="font-family:Rockwell; font-weight:bold; color:#ff0000; margin-left:12pt; line-height:150%; text-align:justify; font-size:12pt">Uses of time and space complexity.</li><li style="font-family:Rockwell; font-weight:bold; color:#ff0000; margin-left:12pt; line-height:150%; text-align:justify; font-size:12pt">Compare homogeneous and non-homogeneous recurrence of equation.</li><li style="font-family:Rockwell; font-weight:bold; color:#ff0000; margin-left:12pt; line-height:150%; text-align:justify; font-size:12pt">Explain amortized analysis.</li><li style="font-family:Rockwell; font-weight:bold; color:#ff0000; margin-left:12pt; line-height:150%; text-align:justify; font-size:12pt">How analysis of algorithm helpful ?</li></ol>`

` `