Main.Syllabus History
Hide minor edits - Show changes to markup
| Lecture | 9:30-10:45am TR at 113 Gifford |
| Lecture | 12:30-13:45am TR at 113 Gifford |
Textbooks:
Textbook:
| Artificial intelligence: a modern approach, 2nd edition Stuart Russell and Peter Norvig | ![]() |
| TAs | Doug Hains |
| TA | Doug Hains |
Course objectives
A student completing this course should be able to:
- Implement object oriented programs and understand the underlying principles such as encapsulation, abstraction and reuse.
- Design and build more complex programs (multiple files and multiple objects) that solve non-trivial problems.
- Relate concepts from theory to programming and architecture, such as how recursion is implemented in the system, and when it is an appropriate programming technique.
Topics
- Objects: creating, instantiating, basic operations
- Inheritance, interfaces, exceptions, polymorphism
- Induction and recursion
- Mechanics of recursive programs; method invocation and activation records
- Assertions
- File IO
- Sorting
- Arrays, lists (dynamic arrays), and binary search
- Counting
- Binding and scope
- Parameter passing
- Graphical User Interfaces
- Linked lists
| TAs | TBD |
| Tutors | TBD |
| Lecture | 12:30-1:45pm TR at Micro A 101 |
| TAs | Doug Hains |
| Lecture | 9:30-10:45am TR at 113 Gifford |
| Recitation | Wed 5:00-6:40pm Thu 1:00-2:40pm Thu 5:00-6:40pm Fri 12:00-1:40pm Thu 2:00-3:40pm |
| All recitations are in comsc 215 |
CS160 or CS153 with a C or better; M124, M126 (both with a C or better).
CS253 and CS301 or permission of instructor.
Data Abstraction and Problem Solving with Java: Walls & Mirrors, 2nd edition
Frank M. Carrano and Janet J. Prichard
Discrete Mathematics and Its Applications, Sixth Edition
Kenneth Rosen
Your cs160 Java book:
Java: an introduction to problem wolving and programming, Fifth edition
Walter Savitch and Frank M. Carrano
| Assignments | 40% | Programing and written assignments |
| Quizzes | 10% | |
| Recitations | 10% | Attending and completing labs |
| Midterms (2) | 20% | |
| Final Exam | 20% | Comprehensive |
Note: in order to pass the class you need to have a passing grade
| Assignments | 30% | Programing and written assignments |
| Project | 30% | |
| Midterm | 15% | |
| Final Exam | 25% | Comprehensive |
Note: in order to pass the course you need to have a passing grade
There will be a programming exam as part of the final exam
Quizzes will typically be given during one lecture class each week, except those weeks in which a midterm exam is being given. No makeups will be given for quizzes, but two quiz grades will be dropped.
Class participation is strongly encouraged. Students who ask or answer a question during lecture will be given a chit (maximum of one per student per class session). Three chits earned translate into 10 additional points on the next quiz.
Late assignments are accepted in class on the first MWF after the original due date, and will receive a 20% late penalty.
First Midterm: TBD
Second Midterm: TBD
Final Exam: Dec 16th 9:10am-11:10am
Midterm: TBD
Final Exam: Dec. 17, 1:30-3:30p
Course objective
Course objectives
Data Abstraction and Problem Solving with Java, 2nd edition
Frank Carrano and Janet Prichard
Data Abstraction and Problem Solving with Java: Walls & Mirrors, 2nd edition
Frank M. Carrano and Janet J. Prichard
Your cs160 Java book:
Course Description
CS200 revisits and extends the principles of programming and discrete math that are introduced in CS161 and applies them to the development, analysis and implementation of data structures and efficient software. The course is taught using the Java language and emphasizes an object oriented approach to data structures. Specific topics in data structures/algorithms include advanced sorting, queues, stacks, hashing, trees, and graphs. Complementary topics from theory include recurrence relations, trees, and graphs. The course requires larger programs and team programming.
Course objective
A student completing this course should be able to:
- Implement object oriented programs and understand the underlying principles such as encapsulation, abstraction and reuse.
- Design and build more complex programs (multiple files and multiple objects) that solve non-trivial problems.
- Relate concepts from theory to programming and architecture, such as how recursion is implemented in the system, and when it is an appropriate programming technique.
- Arrays, lists, and binary search
- Arrays, lists (dynamic arrays), and binary search
- Parameter Passing
- Parameter passing
Binding and scoping
- Binding and scope
Graphical User Interfaces
- Graphical User Interfaces
CS161 (Object Oriented Problem Solving) AND MATH160 or MATH141 or MATH155 (all with a C or better)
CS160 or CS153 with a C or better; M124, M126 (both with a C or better).
Thu 2:00-3:40pm ||
Thu 2:00-3:40pm ||
- Linear Data Structures: Stacks and Queues
- Advanced Sorting
- Trees
- Graphs
- Hash Tables
- Computational Complexity
- Objects: creating, instantiating, basic operations
- Inheritance, interfaces, exceptions, polymorphism
- Induction and recursion
- Mechanics of recursive programs; method invocation and activation records
- Assertions
- File IO
- Sorting
- Arrays, lists, and binary search
- Counting
Binding and scoping
- Parameter Passing
Graphical User Interfaces
- Linked lists
| Data Abstraction and Problem Solving with Java, 2nd edition Frank Carrano and Janet Prichard | ![]() |
We will also use:
Data Abstraction and Problem Solving with Java, 2nd edition
Frank Carrano and Janet Prichard
Java: an introduction to problem wolving and programming, Fifth edition
Walter Savitch and Frank M. Carrano
| Recitations | 5% | Attending and completing labs |
| Recitations | 10% | Attending and completing labs |
| Final Exam | 25% | Comprehensive |
| Final Exam | 20% | Comprehensive |
Assignments will be done individually, except selected programming assignments
There will be a programming exam as part of the final exam
Assignments will be done individually.
First Midterm: 2/25/09
Second Midterm: 4/8/09
Final Exam: May 14th 7am-9am
First Midterm: TBD
Second Midterm: TBD
Final Exam: Dec 16th 9:10am-11:10am
Course withdrawal date: 3/23/09
Course withdrawal date:
| TAs | TBD |
| TAs | TBD |
| Recitation | Wed 5:00-6:40pm |
| Thu 1:00-2:40pm | |
| Thu 5:00-6:40pm | |
| Fri 12:00-1:40pm | |
| Thu 2:00-3:40pm |
| Recitation | Wed 5:00-6:40pm Thu 1:00-2:40pm Thu 5:00-6:40pm Fri 12:00-1:40pm Thu 2:00-3:40pm |
Office: 448 in the new computer science building
Office Hours: Tue 10-11, Wed 10-11:30 ||
| TAs | Mike Hamilton email: hamiltom (at) cs (dot) colostate (dot) edu |
| Office: Computer Science BLDG 245 | |
| Office Hours: Tue 9-11am, Wed 10-12pm in Room 120 (1st floor CS Lab) | |
| Nick Parrish email: njamesp (at) gmail (dot) com | |
| Office: Computer Science BLDG 435 | |
| Office Hours: Thu 3-5pm in Room 120 (1st floor CS Lab) |
Office: 448
Office Hours: TBD ||
| TAs | TBD |
| Tutors | Monday 3-6pm (Zach Hoekstra) |
| Tuesday 11am-1pm (Zach Hoekstra) 3-4pm (Erin Nagoshi) | |
| Wednesday 11-1pm (Erin Nagoshi) | |
| Thursday 11am-7pm (Zach Hoekstra, Erin Nagoshi, Ryan Moore) | |
| Saturday 3-6pm (Erin Nagoshi) | |
| Sunday 4-7pm (John Herndon) | |
| All tutoring is in room 120 in the new building | |
| Lecture | MWF 2-3pm at Wagar 231 |
| Tutors | TBD |
| Lecture | 12:30-1:45pm TR at Micro A 101 |
| Recitation | Mon 5:00-6:40pm |
| Tue 5:00-6:40 | |
| Thu 6:00-7:40pm |
| All recitations are in room 215 in the new computer science building |
| Recitation | Wed 5:00-6:40pm |
| Thu 1:00-2:40pm | |
| Thu 5:00-6:40pm | |
| Fri 12:00-1:40pm | |
| Thu 2:00-3:40pm |
| All recitations are in comsc 215 |
Office Hours: Tue 10-11, Wed 10-11:30
Office Hours: Tue 10-11, Wed 10-11:30 ||
| Instructor | Asa Ben-Hur |
| Office: 448 in the new computer science building | |
| Office Hours: Tue 10-11, Wed 10-11:30 |
| Instructor | Asa Ben-Hur Office: 448 in the new computer science building Office Hours: Tue 10-11, Wed 10-11:30 |
| Tuesday 11am-1pm (Zach Hoekstra) 3-5pm (Erin Nagoshi) | |
| Wednesday 3-5pm (Erin Nagoshi) |
| Tuesday 11am-1pm (Zach Hoekstra) 3-4pm (Erin Nagoshi) | |
| Wednesday 11-1pm (Erin Nagoshi) |
| Saturday 3-6pm (Erin Nagoshi) | |
| Sunday 4-7pm (John Herndon) |
| All tutoring is in room 120 in the new building |
| Tutors | |
| Monday 3-6pm (Zach Hoekstra) |
| Tutors | Monday 3-6pm (Zach Hoekstra) |
| Monday 3-6pm (Zach Hoekstra) | |
| Tuesday 11am-1pm (Zach Hoekstra) 3-5pm (Erin Nagoshi) | |
| Wednesday 3-5pm (Erin Nagoshi) | |
| Thursday 11am-7pm (Zach Hoekstra, Erin Nagoshi, Ryan Moore) |
| Office Hours: Tue 9-11am, Wednesday 10-12pm in Room 120 (1st floor CS Lab) |
| Office Hours: Tue 9-11am, Wed 10-12pm in Room 120 (1st floor CS Lab) |
| Office Hours: Tue 9-11am, Thu 10-12pm in Room 120 (1st floor CS Lab) |
| Office Hours: Tue 9-11am, Wednesday 10-12pm in Room 120 (1st floor CS Lab) |
| Office: | |
| Office Hours: |
| Office: Computer Science BLDG 435 | |
| Office Hours: Thu 3-5pm in Room 120 (1st floor CS Lab) |
| TAs | Mike Hamilton email: hamiltom (at) cs (dot) colostate (dot) edu |
| TAs | Mike Hamilton email: hamiltom (at) cs (dot) colostate (dot) edu |
| Office: 245 |
| Office: Computer Science BLDG 245 |
| TAs | Mike Hamilton email: hamiltom (at) cs (dot) colostate (dot) edu |
| TAs | Mike Hamilton email: hamiltom (at) cs (dot) colostate (dot) edu |
| TAs | Mike Hamiton email: hamiltom (at) cs (dot) colostate (dot) edu |
| TAs | Mike Hamilton email: hamiltom (at) cs (dot) colostate (dot) edu |
| Office Hours: Tue 9-11am, Thu 10-12pm in Room 120 |
| Office Hours: Tue 9-11am, Thu 10-12pm in Room 120 (1st floor CS Lab) |
| Office: | |
| Office Hours: Tue 9-11am, Thu 10-12pm |
| Office: 245 | |
| Office Hours: Tue 9-11am, Thu 10-12pm in Room 120 |
| Office Hours: |
| Office Hours: Tue 9-11am, Thu 10-12pm |
| Office Hours: TBA |
| Office Hours: Tue 10-11, Wed 10-11:30 |
| Office: |
| Office: |
| Labs | 5% | Attending and completing labs |
| Recitations | 5% | Attending and completing labs |
| Midterms (2) | 25% | 1st Midterm: 12% 2nd Midterm: 13% |
| Final Exam | 20% | Comprehensive |
| Midterms (2) | 20% | |
| Final Exam | 25% | Comprehensive |
| Labs | 5% | Attending and completing lab assignments |
| Labs | 5% | Attending and completing labs |
First Midterm: TBA
Second Midterm: TBA
First Midterm: 2/25/09
Second Midterm: 4/8/09
| Assignments | 45% | Programing and written assignments |
| Quizzes | 10% |
| Assignments | 40% | Programing and written assignments |
| Quizzes | 10% | |
| Labs | 5% | Attending and completing lab assignments |
Final Exam: TBA
All midterm exams are in the same room as the lecture.
Final Exam: May 14th 7am-9am
All exams are in the same room as the lecture.
Course withdrawal date:
Course withdrawal date: 3/23/09
| Data Abstraction and Problem Solving with Java, 2nd edition Frank Carrano and Janet Prichard | ![]() |
| Data Abstraction and Problem Solving with Java, 2nd edition Frank Carrano and Janet Prichard | ![]() |
| Data Abstraction and Problem Solving with Java, 2nd edition Frank Carrano and Janet Prichard | ![]() |
| Data Abstraction and Problem Solving with Java, 2nd edition Frank Carrano and Janet Prichard | ![]() |
We will also use:
CS161 (Object Oriented Problem Solving) AND MATH160 or MATH141 or MATH155 (all with a C or better)
CS161 (Object Oriented Problem Solving) AND MATH160 or MATH141 or MATH155 (all with a C or better)
Note: in order to pass the class you need to have a passing grade for the average of the exams.
| Office #448 in the new computer science building |
| Office: 448 in the new computer science building |
| TAs | email: (at) cs (dot) colostate (dot) edu |
| TAs | Mike Hamiton email: hamiltom (at) cs (dot) colostate (dot) edu |
- Prerequisites:**
- Prerequisites:**
Prerequisites:
| All recitations are in COMSC 215 |
| All recitations are in room 215 in the new computer science building |
- Prerequisites:**
- Prerequisites:**
Textbooks:
| Data Abstraction and Problem Solving with Java, 2nd edition | ![]() |
| Data Abstraction and Problem Solving with Java, 2nd edition Frank Carrano and Janet Prichard | ![]() |
| Data Abstraction and Problem Solving with Java, 2nd edition | ![]() |
| Data Abstraction and Problem Solving with Java, 2nd edition | ![]() |
| TAs | email: (at) cs (dot) colostate (dot) edu |
| TAs | email: (at) cs (dot) colostate (dot) edu |
| email: (at) cs (dot) colostate (dot) edu | |
| Office Hours: Tue 10am - 12pm |
| Lecture | MWF 2-3pm at Wagar 231 |
| Lecture | MWF 2-3pm at Wagar 231 |
| Office #448 in the new computer science building | |
| Office Hours: TBA |
| TAs | email: (at) cs (dot) colostate (dot) edu |
| Office #448 in the new computer science building | |
| Office Hours: TBA | |
| TAs | email: (at) cs (dot) colostate (dot) edu |
| email: (at) cs (dot) colostate (dot) edu |
| email: (at) cs (dot) colostate (dot) edu |
Who, Where, When
| Instructor | Asa Ben-Hur |
| Office #448 in the new computer science building | |
| Office Hours: TBA |
| TAs | email: (at) cs (dot) colostate (dot) edu |
| Office Hours: | |
| email: (at) cs (dot) colostate (dot) edu | |
| Office Hours: Tue 10am - 12pm | |
| Nick Parrish email: njamesp (at) gmail (dot) com | |
| Office Hours: |
| Tutors | |
| Lecture | MWF 2-3pm at Wagar 231 |
| Recitation | Mon 5:00-6:40pm |
| Tue 5:00-6:40 | |
| Thu 6:00-7:40pm |
| All recitations are in COMSC 215 |
Course Description
CS200 revisits and extends the principles of programming and discrete math that are introduced in CS161 and applies them to the development, analysis and implementation of data structures and efficient software. The course is taught using the Java language and emphasizes an object oriented approach to data structures. Specific topics in data structures/algorithms include advanced sorting, queues, stacks, hashing, trees, and graphs. Complementary topics from theory include recurrence relations, trees, and graphs. The course requires larger programs and team programming.
Topics
- Linear Data Structures: Stacks and Queues
- Advanced Sorting
- Trees
- Graphs
- Hash Tables
- Computational Complexity
CS161 (Object Oriented Problem Solving) AND MATH160 or MATH141 or MATH155 (all with a C or better)
| Data Abstraction and Problem Solving with Java, 2nd edition | ![]() |
Discrete Mathematics and Its Applications, Sixth Edition
Kenneth Rosen
Grading:
| Assignments | 45% | Programing and written assignments |
| Quizzes | 10% | |
| Midterms (2) | 25% | 1st Midterm: 12% 2nd Midterm: 13% |
| Final Exam | 20% | Comprehensive |
Assignments will be done individually, except selected programming assignments
Quizzes will typically be given during one lecture class each week, except those weeks in which a midterm exam is being given. No makeups will be given for quizzes, but two quiz grades will be dropped.
Class participation is strongly encouraged. Students who ask or answer a question during lecture will be given a chit (maximum of one per student per class session). Three chits earned translate into 10 additional points on the next quiz.
The assignment of letter grades will be made as follows:
| Letter Grade | Point Range |
| A | 90-100 |
| B | 80-89.9 |
| C | 70-79.9 |
| D | 60-69.9 |
| F | below 60 |
NOTE: We will NOT cut higher than these points (but may cut lower).
Late and Makeup Policy
Midterm and Finals: Make-up exams are only given in extraordinary circumstances (e.g., illness, death of family member). Students must consult with the instructor as soon as possible, preferably before the start of the exam. Course examination dates are listed in the syllabus; be aware of them and plan accordingly.
No make-ups will be given for missed quizzes.
Programming assignments are to be submitted electronically using the checkin program. Always check the assignment page for due dates. Late assignments submitted within 48 hours of the time required (or otherwise specified) will receive a 20% late penalty. Electronic submission is closed 48 hours after assignments are due (or as otherwise specified); students not having submitted programs receive an automatic zero on the assignment.
Written assignments are to be submitted in class. These may be handwritten, but must be legible. The instructors and TAs reserve the right to decide whether or not a paper is legible. Late assignments are accepted in class on the first MWF after the original due date, and will receive a 20% late penalty.
Assignment will be returned within 5 working days of the end of the late period.
Important Dates
First Midterm: TBA
Second Midterm: TBA
Final Exam: TBA
All midterm exams are in the same room as the lecture.
Course withdrawal date:
Professional Conduct
All students are expected to conduct themselves professionally. We assume you are familiar with the policies in the student information sheet.
Additionally, you are (beginning) computing professionals, so you should be familiar with the code of conduct for the primary professional society, the Association for Computing Machinery (ACM).
You MAY discuss assignments but the work you turn in must be your own.
We work to maintain an environment supportive of learning in the classroom and laboratory. Towards this end, we require that you be courteous to and respectful of your fellow participants (i.e., classmates, instructors, TAs and tutors). In particular:
- Please turn off the ring on your cell phone. If you are expecting an emergency call, sit near the door and slide out discretely to take it.
- If you plan to use a laptop during class, please sit at the back of the classroom and turn off any sound from the machine. The tap-tap of the keyboard and the images showing on a screen can be distracting to those sitting around you. Also, be aware if you IM during class, that giggles, snorts or other reactions to what you are reading can be heard by the class and instructors and may be completely inappropriate with what is going on in the classroom.
- Laptops and other personal computing devices must be shut during exams and quizzes.


