This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Massachusetts Institute of Technology Department of Aeronautics and Astronautics Cambridge, MA 02139 16.03/16.04 Unified Engineering III, IV Spring 2004 Problem Set 10 Name: Due Date: 4/21/04 Time Spent (min) CP11_12 P3 P4 S10 S11 S12 Study Time Announcements: Q5S will be on Friday, April 23. CP1112 The problems in this problem set cover lectures C11 and C12 1. a. Define a recursive binary search algorithm. b. Implement your algorithm as an Ada95 program. c. What is the recurrence equation that represents the computation time of your algorithm? d. What is the BigO complexity of your algorithm? Show all the steps in the computation based on your algorithm. Turn in a hard copy of your algorithm, recurrence equation, and BigO analysis, and code listing, and an electronic copy of your code. 2. What is the BigO complexity of: a. Heapify function b. Build_Heap function c. Heap_Sort Show all the steps in the computation of the BigO complexity. Note: the code for heap_sort, build_heap and heapify was shown in lecture C11 and has been distributed via email. U nified Engineering Spring Term 2004 Problem P3. (Propulsion) (LO A & B) An incompressible fluid flows steadily through a twodimensional infinite row of fixed airfoils (e.g. a stator blade row). The blade row is contained in a constant area annulus, as shown on the right side of the figure below. The spacing between the airfoils is s....
View
Full
Document
This note was uploaded on 01/28/2012 for the course AERO 16.01 taught by Professor Markdrela during the Fall '05 term at MIT.
 Fall '05
 MarkDrela
 Aeronautics, Astronautics

Click to edit the document details