This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Design and Analysis of Algorithms CSE 101 Sample Final Examination NAME: Student ID: Answer all the following questions: 1. 8 points Formulate the following problem as a directed or undirected graph problem. Clearly indicate the set of vertices, edges and any weights associated with the vertices and/or edges. A job consists of a series of tasks S 1 , S 2 , , S n where the amount of time required by task S i is t i for 1 i n . A list of m pairs ( S i , S j ) is given such that, if ( S i , S j ) is not the list, task S i must be completed before task S j is begun. Pairs that would imply transitivity are not on the list. Assume that there is an unlimited number of processors available so that several tasks can be done at the same time. How much time is needed to complete the job? Describe an efficient algorithm to compute the minimum time required to complete the job. Present a high-level description of the algorithm followed by pseudo-code. Analyze the time complexity of your algorithm in terms of n and m . Make sure to argue the correctness of your algorithm. 2.2....
View Full Document
This note was uploaded on 03/16/2010 for the course CSE 101 taught by Professor Staff during the Winter '08 term at UCSD.
- Winter '08