Intro to CIT 594 http www cis upenn

  • Slides: 15
Download presentation
Intro to CIT 594 http: //www. cis. upenn. edu/~matuszek/cit 594 -2006. html

Intro to CIT 594 http: //www. cis. upenn. edu/~matuszek/cit 594 -2006. html

Prerequisites n n n The formal prerequisite is CIT 591 was primarily a course

Prerequisites n n n The formal prerequisite is CIT 591 was primarily a course in Java If you did not take CIT 591. . . n n You must be a reasonably good Java programmer, including programming applications, applets, and Swing You must be familiar with, or prepared to learn quickly: n n JUnit testing The Eclipse IDE You are expected to have good Java programming style Other programming languages can not be used as a substitute for Java 2

What the course is about n There are four main, interrelated topics in CIT

What the course is about n There are four main, interrelated topics in CIT 594: n n n In addition, we will continue to explore good programming practices n n Recursion Data structures Algorithms Analysis of algorithms Good programming style Good habits, such as creating test cases Use of tools, such as Eclipse and JUnit It will also be necessary to cover more Java 3

Required textbook #1 n n n Data Structures & Algorithms in Java, Second Edition,

Required textbook #1 n n n Data Structures & Algorithms in Java, Second Edition, by Robert Lafore This book has the clearest and most understandable explanations of algorithms that I have ever seen (and I’ve seen a lot of Data Structures textbooks!) It does not, however, cover some of the essential math we will need 4

Recommended book #1 n n If you don’t have a book that describes the

Recommended book #1 n n If you don’t have a book that describes the new features in Java 5 (especially generics), you should get one Here’s my favorite:

Recommended book #2 n n The Elements of Java Style, by Alan Vermeulen (ed.

Recommended book #2 n n The Elements of Java Style, by Alan Vermeulen (ed. ) This book describes the style that will be expected of you 6

Java in this course n n This is a course in algorithms and data

Java in this course n n This is a course in algorithms and data structures, not a second course in Java But. . . n n n Java 5. 0 will be the primary programming language We will study Java Collections in detail, as they are extremely relevant to the course You will be expected to use Eclipse 3. 1 M 4 or newer (the current version is 3. 1. 1) n Eclipse 3. 0 does not support Java 5. 0 7

Java generics n n C++ programmers: Java generics are similar to C++ templates We

Java generics n n C++ programmers: Java generics are similar to C++ templates We will study generics in some detail, but for now, here’s all you need to know about generics: n n Generics have little or no relevance to the data structure concepts we will be studying in this course Generics completely change the way we code data structures

Java Collections n Java Collections implement many of the most important data structures for

Java Collections n Java Collections implement many of the most important data structures for you n n n A traditional data structures course would have you implement these yourself I don’t believe in re-inventing the wheel However, you need to know how these data structures are implemented, for the times when you need something more than Java gives you 9

Algorithms n n There are literally thousands of published algorithms We will cover: n

Algorithms n n There are literally thousands of published algorithms We will cover: n n n a few algorithms that are related to the data structures we are studying a few more algorithms that your instructor especially likes It’s usually better to find an existing algorithm than to re-invent it yourself n The Data Structures & Algorithms in Java textbook is an excellent textbook for beginning data structures and algorithms, but it completely ignores Java’s collections 10

Analysis of algorithms n n n Analysis of algorithms is a relatively small part

Analysis of algorithms n n n Analysis of algorithms is a relatively small part of this course, but it’s an important part Analysis can tell you how fast an algorithm will run, and how much space it will require A good algorithm, even if badly coded, can run circles around a poor algorithm that is carefully tuned and highly optimized 11

Assignments n Except as otherwise noted, all assignments: n Are to be done solo

Assignments n Except as otherwise noted, all assignments: n Are to be done solo (by yourself). As before, n n n n You may discuss the assignments with other students You may help (and get help with) debugging You may not give your source code to anyone Should be done in Eclipse Should include complete JUnit tests, and Should include complete javadoc documentation Late assignments will lose 5 points per day, and may not be accepted if more than a week late

Grading n We will have: n n n Grades will be weighted as follows:

Grading n We will have: n n n Grades will be weighted as follows: n n Approximately one assignment per week One midterm One final exam Grades will be curved We will use Blackboard to turn in assignments 50% assignments 20% midterm 30% final exam If you feel a grading error has been made, you have one week after grades have been posted to bring it to our attention 13

Office hours and (no) labs n I will be more available than last semester

Office hours and (no) labs n I will be more available than last semester n n n I will post office hours; these are the times that I will try hard to be in my office and available When my door is open, I’m probably available Please try to keep visits short The TA will also have office hours We will not have extra help sessions or labs this semester We will be doing all or almost all individual (solo) projects, but there may be some exceptions 14

The End 15

The End 15