CSCI A201/A597

Calendar and Exams

Second Summer 2000


Evaluations: Adrian Aseem Francisco

Mon Day Lec Read Notes New Due Lab
Jun 16 Fr
17 Sa
18 Su
19 Mo 1 1-31 Introduction to computers and Java. Program1, THQuiz1 1
20 Tu 2 31-42 Algorithms. Introduction to the mechanics of implementation in Java.
21 We 3 47-75 Primitive types: numbers. Arithmetic, variables, declarations, assignments.
22 Th 4 75-91 Reference types. Working with Java String class. Using ConsoleReader for user input. Program2, THQuiz2 THQuiz1 2
23 Fr Program1
24 Sa
25 Su
26 Mo 5 103-112 Introduction to classes. Developing a simple BankAccount class: determining object behaviour. Instance variables and methods. Program3, THQuiz3 3
27 Tu 6 112-120 BankAccount example continued. Constructors. Putting a class to work. THQuiz2
28 We 7 120-134 Object-oriented design: discovering classes. More examples. Program2
29 Th 8 140-150 Applets and graphics. Brief intro to HTML, web servers, applets, browsers and appletviewers. Program4, THQuiz4 4
30 Fr
Jul 1 Sa
2 Su
3 Mo 9 150-165 Graphical shapes, colors, fonts. Simple drawings. Using modal dialogs to read text input in applets. THQuiz3 5
4 Tu INDEPENDENCE DAY Program3
5 We 10 166-177 Developing a few examples: comparing visual and numerical information; choosing useful units for plotting graphs on screen.
6 Th 11 183-199 Decisions. The if statement. Relational operators. Boolean expressions and variables. Program5, THQuiz5 THQuiz4 6
7 Fr Program4
8 Sa
9 Su
10 Mo 12 199-215 Sequences of comparisons and the switch statement. Nested branches. The dangling else problem. Preparing test cases. 7
11 Tu 13 207-231 Review of boolean values and operators. Iteration: while and for loops.
12 We 14 223-237 More about loop constructs. Nested loops. Examples and exercises. Program6, THQuiz6 THQuiz5
13 Th 15 237-246 Loops in practice: processing input; the loop and a half problem; detecting a sentinel. Program5 8
14 Fr
15 Sa
16 Su
17 Mo 16 246-259 More loops: string tokenization for processing input. Traversing characters in a string. Random numbers and simulations. Loop invariants. 9
18 Tu 17 269-298* More about methods. Method parameters. Static methods. Static variables. Variable lifetime, initialization and scope. THQuiz6
19 We 18 298-300 Recursion. Program6
20 Th 19 1-311* Midterm review (chapters 1-7). Program7, THQuiz7 10
21 Fr MIDTERM EXAM
22 Sa
23 Su
24 Mo 20 341-357* Introduction to inheritance. Inheritance hierarchies. Inheriting instance variables and methods. 11
25 Tu 21 366-387* Subclass construction. Polymorphism. Method overriding. Abstract classes and interfaces. Packages. Program8, THQuiz8 THQuiz7
26 We 22 395-410* Events, event listeners, and event sources. Listeners and adapters. Mouse input. Program7
27 Th 23 410-426* 12
28 Fr
29 Sa
30 Su Program9, THQuiz9
31 Mo 24 479-510* Graphical user interfaces (GUIs). Program8, THQuiz8 13
Aug 1 Tu 25 432-443 Using arrays to store data: declaration, initialization, access. Array parameters and return values.
2 We 26 443-470* Simple array algorithms: search, count, remove, insert (values). Vectors. Parallel arrays. Two-dimensional arrays.
3 Th 27 613-622 Selection sort: analysis and profile. THQuiz9 14
4 Fr
5 Sa Program10, THQuiz10 Program9
6 Su
7 Mo 28 635-636 Sorting and searching real data. 15
8 Tu 29 Software life cycle. Object-oriented design. Example: printing an invoice.
9 We 30 Object-oriented design: the automatic teller machine
10 Th 31 1-600* Final Exam Review Program10, THQuiz10 16
11 Fr FINAL EXAM

*) Readings marked with a star will be refined during the semester. Your will only be responsible for selected parts of the identified material.