DAA_PYQP_2023_______, Exams of Design and Analysis of Algorithms

Download DAA_PYQP_2023_______ and more Exams Design and Analysis of Algorithms in PDF only on Docsity!

a ‘Total No. of page: 02 , i Roll No. Degree: B, TECH Semester: DI MID-SEMESTER EXAMINATION, September 2023 Max Marks: 15 Course Title: Design and Analysis of Algorithms Duration: 1:30 Hours Course Code: COCSC06/ CACSCO6/CDCSC06 * . CMCSC06 Note: Attempt all questions in given order only. Missing data/infnrmation (if any) may be suitably © assumed & mentioned i in the answer, Marks | CO Q. No. . Question Let A be a unsorted array of n integers. Devise the most efficient . algorithm which detertnine whether two elements whose sum is less i 5 cos than 10° exists in’ A or not. Moreover, compute asymptotic tight bound : a of time complexity for the devised algorithm. : The following diagram shows the flowchart for a recursive function f(n), Assume that all statements, except for the recursive calls, have O(1) time complexity. Ifthe worst case time complexity of this function is O(n, then compute the least possible value: facourate “lup to two: decimal positions) of C, ffnia} 1” eninets En A fect ial Last ae ee poe coy ‘ 1b. . [ 0 4 ae ir | | fo + rem | 18 | COL