This preview shows pages 1–7. 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 DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1/8/2007 Lecture Notes CSE121 1 CSE 121 Data Structures and Algorithms with JAVA Spring 2007 Lecture Notes 1 19992006 S.Kannan, S.Guha, V.Tannen, K. Daniilidis 1/8/2007 Lecture Notes CSE121 2 Website: www.seas.upenn.edu/~cse121 Textbook: Data Structures and (REQUIRED) Algorithms with Java 4th EDITION M. Goodrich and R. Tamassia John Wiley and Sons 2006 Midterm1: Wed Feb 21 (rooms TBA) Midterm2: Wed Apr 04 (rooms TBA) Final: date and rooms TBA by the university Homework: programming exercises (12 weeks long) problems sets (mathstyle) programming project No collaboration unless announced (see policy on website) Labs: attendance is mandatory and it counts as 10% of the grade 1/8/2007 Lecture Notes CSE121 3 What is this course about? Problem solving with programs (as in cse120) Java (as in cse120) Data structures (mostly!) Intro to analysis of algorithms (more in cse320) Some objectoriented design patterns Some software engineering .. build better software! 1/8/2007 Lecture Notes CSE121 4 What makes a program better ? correctness: Programs are designed with a goal in mind. Is this goal (specification) met? efficiency: How long does the program run ? What is the response time ? (experimental test and/or theoretical analysis) good engineering: Is the program easy to use? (users cant be underestimated) Will the program be easy to change? (requirements/specifications inevitably change) http://marsrovers.nasa.gov/home/ 1/8/2007 Lecture Notes CSE121 5 An introductory example Problem: compute the greatest common divisor ( gcd ) of two integers, x and y. Recall some facts about divisibility of integers Then think about a solution! 1/8/2007 Lecture Notes CSE121 6 Computing the GCD Idea 1: Enumerate all the numbers smaller than x and y and keep only those that divide both x and y . Then we find the greatest of these and we are done....
View
Full
Document
This note was uploaded on 02/13/2011 for the course CSE 2011 taught by Professor Someone during the Winter '10 term at York University.
 Winter '10
 someone
 Computer Science, Algorithms, Data Structures

Click to edit the document details