Mailam Engineering College MAILAM - 604 304: Department of Computer Applications Internal Assessment Test - I
1. The document provides instructions for an internal assessment test on the design and analysis of algorithms. It contains 20 multiple choice questions to be answered in 50 marks.
2. The questions cover topics like defining algorithms, comparing merge and quicksort, analyzing time complexity, recursion, and mathematical analysis of recursive and non-recursive algorithms.
3. It also asks students to explain problem solving steps, analyze example algorithms using asymptotic notations, and measures used to analyze algorithms.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
17 views2 pages
Mailam Engineering College MAILAM - 604 304: Department of Computer Applications Internal Assessment Test - I
1. The document provides instructions for an internal assessment test on the design and analysis of algorithms. It contains 20 multiple choice questions to be answered in 50 marks.
2. The questions cover topics like defining algorithms, comparing merge and quicksort, analyzing time complexity, recursion, and mathematical analysis of recursive and non-recursive algorithms.
3. It also asks students to explain problem solving steps, analyze example algorithms using asymptotic notations, and measures used to analyze algorithms.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2
MAILAM ENGINEERING COLLEGE
(Approved By AICTE New Delhi, Affiliated To Anna niver!ity Chennai
" a##redited By Nation Board of A##reditation (NBA$ New Delhi$ MAILAM % &'( )'( Depart*ent of Co*p+ter Appli#ation! Internal A!!e!!*ent Te!t % I Sub/Code: Design and Analysis of Algorithms / MC9223 Date: 05.03.203 Sem: !! "ime: 9.25 to 0.50 am Mar#s: 50 An!wer all the ,+e!tion! -art A (.' / 0 1 0'$ . Define algorithm. $ist out ho% to de&elo' an algorithm. 2. Differen(e bet%een Merge ) *ui(# sort. 3. +hat are the (riteria are used to identify the %orst algorithm, -. +rite the (onditions to be satisfied for the notations ./ and 0 on the fun(tion g1n2 to e3uate it to f1n2. 4D5C 200 ) 2026 5. 7rder the follo%ing time (om'le8ity fun(tions &alues in as(ending order. 2 n / nlog2n/ n 3 / n/ n 2 / log2n/ n9 :. ;or the follo%ing algorithm/ find the in'ut si<e ) =asi( 7'eration. 4>?@ 20096 for i 0 to nA2 do for B iC to nA do for # BA to n do A4B/#6 A4B/#6 D A4i/#6 E A4B/i6 A4i/i6 F. +hat is meant by ;or%ard ) =a(#%ard substitution, 4D5C 2026 G. Distinguish bet%een +orst (ase and =est (ase effi(ien(y. 4D5C 206 9. +rite the Heneral 'lan for analy<ing the effi(ien(y for non re(ursi&e algorithms,
0. +hat are the measures used to analy<e an algorithm, 4D5C 2006 -art B (0 / .2 1 )'$ . a2 $ist out the fundamentals ste's of Iroblem sol&ing algorithm. Dis(uss briefly about analy<e 'hase of algorithm. 4D5C J/ >?@5 ) D5C J26 152
17K2 b1i2 5numerate and e8'lain briefly im'ortant ty'es of 'roblem. 4>?@ J6 1F2 1ii2Com'ute the time (om'le8ity of the merge algorithm in merge sort %ith follo%ing e8am'le. 40/ 2/ A/ / 0/ A0/ A26 1G2 2. a2 Des(ribe briefly about 3 mathemati(al analysis of non re(ursi&e algorithms. 4D5C 20 ) >?@5 2026 152 17K2 b1i2 Define Ke(ursi&e algorithm. 58'lain the 2 mathemati(al analysis 'ro(edures %ith "o%ers of Lanoi 'u<<le 1Dis# M 32 e8am'le. 4D5C 200 ) >?@5 2026 102 1ii2 =riefly e8'lain asym'toti( @otations and ty'es %ith its gra'hs. 152 -repared By Approved By Mr!3 A3 4+5athra Devi3, A!!t3 -rof3 6 MCA Dr3 R3 Mariappan3 7OD6MCA