10-11 - Following Paper ID and Roll No to be filled in your Answer Book Roll M.C.A(SEM III ODD SEMESTER THEORY EXAMINATION 2010-11 DESIGN AND

10-11 - Following Paper ID and Roll No to be filled in...

This preview shows page 1 - 3 out of 3 pages.

Foll ow ing Pap er I Dand Ro l l No . to be f il l ed in y ou r A nswe r Bo o k ) Ro l l M.C . A. (S E M . III ) ODD S E M E S TE R THEO RY E X A M INATION 2010 - 11 DESIGN A N D A N A LYSIS OF ALGORITHMS Note . : (l) Attem pt al l t h e qu e st i o n s . . i . ~ (2) A l l quest i ons ca rr y eq ual m arks . . " - \ ' Wr it e the esse n tial c h aracteristi cs of a good algor i t hm . I Exp l ain big-oh comple x it y order classification inincreas ing o r der of time . ( b) I l lustrate the opera tio n s o f merge sort on t he giv~n array I A = {3,41,52 , 26 , 3 8 , 57 , 9, 49} . (c) Let fen) and g(n) beas y mptotically nonnegative function s . Using the basic definition of e notation, prove that max (f (n), g (n» =; ; e (f (n) + g(n» . (d) Give asymptoti " c upper bound of the recurrence relation T(n) = T(7n/l 0) + n . As s ume that T(n ) is constant for n ~ 2 . ( e ) Analyze the quick sort al go rithm when all element s of a r ray A h ave the same value.
a ) . th e difference between the binary search tree , and the min-heap property? Can the min - heap per t y b e used to print the keys of an n- n o de tree in s on e d

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture