01 - CIS 121 Spring 2010 Data Structures and Introduction...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1 1/13/10 CIS121-Lecture Notes 1 1 CIS 121 Spring 2010 Data Structures and Introduction to Algorithms using JAVA Lecture Notes 1: Introduction, GCD programs © 1999-2010 S.Kannan, V.Tannen, S.Guha & K.Daniilidis © 2006 M.Goodrich & R.Tamassia (with permission) 1/13/10 CIS121-Lecture Notes 1 2 Website: www.seas.upenn.edu/~cis121 Textbook: “Data Structures and (RECOMMENDED) Problem Solving using Java” THIRD EDITION M. A. Weiss Addison Wesley 2006 ISBN 0-321-32213-4 Midterm1: Wed Feb 24 (rooms TBA) Midterm2: Wed Mar 31 (rooms TBA) Final: Mon May 10 (rooms TBA) Homework: - programming exercises (1-2 weeks long) - problems sets (math-style) - programming project (~3 weeks) No collaboration (see policy on website) Labs (recitations): attendance and participation are mandatory. They count towards 10% of the grade. Hwk 30% Labs 10% Mid 1 15% Mid 2 15% Final 30% Grade
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 1/13/10 CIS121-Lecture Notes 1 3 What is this course about? Problem solving with Java programs (as in cis120) Data structures (mostly!) Intro to analysis of algorithms (more algorithms in cis320) Some object-oriented design patterns Some software development good practices …………………………………………. . build better software! 1/13/10 CIS121-Lecture Notes 1 4 What makes a program better? Criteria for comparison? 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 Is the program easy to use? engineering: (users can’t be underestimated) Will the program be easy to change? (requirements/specifications inevitably change)
Background image of page 2
3 1/13/10 CIS121-Lecture Notes 1 5 An introductory example Problem: compute the greatest common divisor (gcd) of two integers, x and y. Recall some facts about divisibility of integers…
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 11

01 - CIS 121 Spring 2010 Data Structures and Introduction...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online