CS 162 Introduction to
Computer Science II (Home)
Course Schedule* Spring 2012
Reading assignments should be completed by the beginning of the next lecture.
| Week | Lab (T/W/R) | Monday | Wednesday | Friday |
| #1
04/02 - 04/06 Program #1 is assigned |
Lab #1: No Lab this week |
Lecture #1: Introductions, etc. Review: Chapters 5 - 6 Recommended activity: Monday |
Lecture #2: Java fundamentals, objects, classes, common errors Recommended activity: Wednesday |
Lecture #3: Program #1, instantiation, parameters, this, aliasing, common errors Recommended activity: Friday |
| #2
04/09 - 04/13 |
Lab #2: Eclipse, UserInterface |
Lecture #4: static variables/methods, arrays, null Review: Chapter 7 Quiz #1 Recommended activity: Review the exercises from last week's recommended activities. |
Lecture #5: More arrays Read: Chapter 8.1 - 8.2 Recommended activity: Finish Project #1 |
Lecture #6: Designing/debugging classes, Read: Chapter 8.3 - 8.4 Program #1 is due Recommended activity: Friday |
| #3
04/16 - 04/20 Homework #1 is assigned |
Lab #3: Debugging, JUnit Testing |
Lecture #7: Interfaces, polymorphism, signatures Read: Chapter 10.1 - 10.2 Recommended activity: Monday |
Lecture #8: More polymorphism, generics Homework #1 is due before class Recommended activities: Wednesday |
Midterm Exam #1 |
| #4
04/23 - 04/27 Program #2 is assigned |
Lab #4: File I/O, Data files, Exception-handling, Comparable interface |
Lecture #10: Inheritance Read: Chapter 9.1 - 9.3 Recommended activity: Monday |
Lecture #11: Abstract classes, Exceptions/exception-handling Review: Chapter 9 Recommended activity: Wednesday |
Lecture #12: Software life-cycle, software testing, Development models Read: Chapter 11 |
| #5
04/30 - 05/04 Homework #2 is assigned Program #3 is assigned |
Lab #5: Recursion |
Lecture #13: Intro to Recursion Re-read: Chapter 11 Recommended activity: Monday Program #2 is due |
Lecture #14: More recursion Quiz #2 Recommended activity: Wednesday |
Lecture #15: Sorting algorithms, algorithm efficiency Recommended activity: Friday: |
| #6
05/07 - 05/11 Homework #3 is assigned |
Lab #6: Sorting, Algorithm efficiency |
Lecture #16: Analysis of algorithms Homework #2 is due before class Read: Big-O notation Recommended activity: |
Lecture #17: More algorithm analysis, selection sort, insertion sort, expected time Homework #3 is due before class Recommended activity: Study for Friday's exam Program #3 is due |
Midterm Exam #2 |
| #7
05/14 - 05/18 Homework #4 is assigned Program #4 is assigned Friday is the last day to withdraw from course with 'W' |
Lab #7: C fundamentals |
Lecture #19: Advanced sorting algorithms, Introduction to C Re-re-read: Chapter 11.2 Recommended activity: Monday |
Lecture #20: Shell Sort, Quick Sort, more C Recommended activity: Wednesday |
Lecture is cancelled due to Engineering Expo Recommended activity: Friday Last day to withdraw from course with 'W' |
| #8
05/21 - 05/25 |
Lab #8: More C |
Lecture #22: Binary search, more C Homework #4 is due before class Recommended activity: Monday |
Lecture #23: Iindexing, array-based lists. Quiz #3 Read: Chapter 12.1 - 12.2 Recommended activity: Wednesday |
Lecture #24: Array-based list implementations, list ADT Read: Chapter 12.3 Program #4 is due Recommended activity: Friday |
| #9
05/28 - 06/01 Program #5 is assigned |
Lab #9: C Pointers, Java References |
Memorial Day Holiday |
Lecture #26: Dynamically-linked lists Recommended activity: Wednesday |
Lecture #27: Stack / Queue applications/implementations Recommended activity: Friday |
| #10
06/04 - 06/08 Homework #5 is assigned |
Lab #10: Linear structures in C |
Lecture #28: Linear-linked structures, header nodes, applications Recommended activity: Monday |
Lecture #29: Double-linking, list algorithms, efficiency Quiz #4 (optional) Recommended activity: Wednesday |
Lecture #30: Review for final exam Practice Problems Homework #5 is due before class Program #5 is due |
| Finals
Week 06/11 - 06/15 |
Final Exam Tuesday, June 12, 12:00 - 1:50 pm, CORD 1109 |
|||
*Note: The calendar may be adjusted if it becomes apparent that more/less time is needed for some of the topics.