---

CS202 Computer Science II

FAQ	Newsboard	Telnet	Email TA	Lectures	Assignments	Man pages	Help

---

• The Syllabus.
• Code from the textbook and other code that may come in useful.
• And now for something completely different to lighten your day --- Quotes
• Link to TA's page with grading policy, assignment test cases, and more....
• Answers to entrance quiz. Getting less than 4 out of 6 correct is not good.

---

Assignment 7 is due Dec 7, 1998 before class.

---

• Introduction Read Chapter 1
• Passing parameters
• Modules Read Chapter 2.
• Design and Testing: Read the textbook, pages 18 - 31.
• Assertions, Invariants, Preconditions, and Post conditions .
• Data Abstraction & Classes
• Friends, and operator overloading.
• Command Line Arguments. pgs 298 - 301.
• Structures in C++. Chapter 5. pgs 203 - 213.
• Read pgs 213 - 219. Designing a PBX telephone exchange.
• Unions and Variant Records. Chapter 5. pgs 220 - 229.
• Recursion is here.
• Pointers. Read chapter 7 for dynamic allocation.
• Read chapter 8 for dynamic memory and overloading operators
• Linked Lists, Stacks, Queues, Sequences, and their implementations Read Chapter 9. No electronic notes.
• The java tutorial for Java 1.1. All that you want to learn about java.
  • The core Java 1.1 API specification. All packages and classes only supported by recent browsers.
  • Trails to follow. You should go through the Getting Started trail that introduces and explains the HelloWorld application and applet.
  • The nuts and bolts of Java. All about syntax, another trail you must follow.
    • Pay particular attention to Arrays and Strings. Otherwise, Java syntax is very much like C/C++
  • The core Java 1.0 API specification. All packages and classes, currently supported by (almost) all browsers