This course continues the broad introduction to computer science begun in CS21. It also provides a good general background for further study in the field. The underlying themes of the course will be program design, abstraction, analysis, and correctness. We will use the object-oriented programming language Java to implement and test programs. A brief introduction to Java will be provided, but some familiarity with programming is a pre-requisite usually satisfied by CS21. Topics covered in CS35 include data structures (queues, stacks, trees, hash tables, graphs, etc.), algorithms, software design and software verification.
Numerous lab exercises and a number of programming projects will help illustrate the concepts presented. We will use the Computer Science Labs (running Linux) in the Science Center as the classroom/laboratory for this course. If you work somewhere else, you are responsible for obtaining and learning how to use the software. Since one of the goals of the course is to learn how to write large, reliable programs, we emphasize (in class and grading) the development of clear, modular, well-documented programs that are easy to read, verify, analyze, debug, and modify.
Professor: Douglas Turnbull
Office: Science Center 255
Phone: (610) 597-6071
Office hours: TBA or by appointment
Ninjas: Ninja Session: TBA
Room: Science Center 240
Time: Monday, Wednesday, Friday 9:30pm–10:20pm
Text: Goodrich and Tamassia. Data Strucutures and Algorithms in Java (4th edition).
|WEEK||DAY||ANNOUNCEMENTS||TOPIC & READING||LAB|
|1||Jan 19||Intro to Java
|2||Jan 26||More Java
|Jan 30||Drop/Add Ends|
|3||Feb 02||Complexity Analysis
|4||Feb 09||Stacks & Queues
|5||Feb 16||Vectors, Lists, Iterators
Chapter 6, 9.3.3, 9.4
Chapter 7, 8.1.1, 8.1.2, 10.1, 10.4, 10.5
|7||Mar 02||More Trees
|8||Mar 16||Priority Queues & Heaps
|Mar 25||Maps & Hashing
|Mar 27||Last Day for
CR/NC or Withdraw
|13||Apr 20||Graph Algorithms
Final exam :: May 11 :: 9am-12pm :: SC 240
Programming is not a dry mechanical process, but a form of art. Well written code has an aesthetic appeal while poor form can make other programmers and instructors cringe. Programming assignments will be graded based on style and correctness. Good programming practices usually include many of the following principles:
Academic honesty is required in all work you submit to be graded. With the exception of your lab partner on lab assignments, you may not submit work done with (or by) someone else, or examine or use work done by others to complete your own work. You may discuss assignment specifications and requirements with others in the class to be sure you understand the problem. In addition, you are allowed to work with others to help learn the course material. However, with the exception of your lab partner, you may not work with others on your assignments in any capacity.
All code you submit must be your own with the following permissible exceptions: code distributed in class, code found in the course text book, and code worked on with an assigned partner. In these cases, you should always include detailed comments that indicates which parts of the assignment you received help on, and what your sources were.
``It is the opinion of the faculty that for an intentional first offense, failure in the course is normally appropriate. Suspension for a semester or deprivation of the degree in that year may also be appropriate when warranted by the seriousness of the offense.'' - Swarthmore College Bulletin (2007-2008, Section 7.1.2)
Please see me if there are any questions about what is permissible.
Using Unix Improved
Vim quick reference
Vim tips and tricks
From Python to Java
Sun's Java tutorial
Professor Newhall's Tips on How to Compile, Run and Debug Java Programs
Common Java Error Messages