Oriental Institute of Science & Technology, Bhopal Department of Information Technology
The document is an assignment from the Department of Information Technology at Oriental Institute of Science & Technology, Bhopal for the subject ADA. It contains 5 questions related to algorithms and data structures. The questions cover topics like analysis of algorithms including solving recurrences, sorting algorithms, binary trees, greedy algorithms and dynamic programming. Students are required to solve the questions which map to different course outcomes on algorithm design and analysis.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
102 views2 pages
Oriental Institute of Science & Technology, Bhopal Department of Information Technology
The document is an assignment from the Department of Information Technology at Oriental Institute of Science & Technology, Bhopal for the subject ADA. It contains 5 questions related to algorithms and data structures. The questions cover topics like analysis of algorithms including solving recurrences, sorting algorithms, binary trees, greedy algorithms and dynamic programming. Students are required to solve the questions which map to different course outcomes on algorithm design and analysis.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2
ORIENTAL INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL
DEPARTMENT OF INFORMATION TECHNOLOGY
ASSIGNMENT-I
Branch/Semester Session JUN-DEC 2017
IT/III Name of Faculty Subject ADA ANAMIKA JOSHI Units Sub Code IT-3002 2.5 Date of Submission 15/11/17
S.No Question Marks CO Attainment
1 a) Show that the solution of T(n)=T(n/2)+1 is O(log n). CO1
b) Apply quick sort algorithm for the following array and sort the element.(Take first element of the list as the pivot element): 24 56 47 35 10 90 82 31 2 a) What is the purpose of Strassen’s Matrix CO1 Multiplication? b) What is the procedure of merge sort and sort the given array of 8 elements step by step using mergesort 35 18 7 12 5 23 16 3 3 a) Find the optimal binary merge tree (pattern) for ten CO2 files whose length are 28, 32, 12, 5, 84,53, 91, 35, 3 and 11. Also find its weighted external path length. b) Explain the concept behind greedy strategy. Also discuss job sequencing problem with example 4 a) Consider n=7, m=15, (P1,P2,P3,……,P7) = CO2 (10,5,15,7,6,18,3) and (W1,W2,W3,…..W7) = (2,3,5,7,1,4,1). Obtain the optimal solution using fractional knapsack. 5 a) Explain how a reliability design can be obtained using CO3 dynamic programming.