Computer Science 122

Week

Date

Topic

1

Sep 4, 9

Java review: packages, projects, objects, references, Strings, sequential files, arrays

2

Sep 11, 16

Java review: Sequential files, reading from a file into an array of objects,

Chapter 7: Inheritance, polymorphism

3

Sep 18, 23

Chapter 9: Graphical user interfaces: Windows, Labels, Text Fields

Events, Buttons, Panels and Grid Layout.

4

Sep 25, 30

Chapter 12: Linked data structures: stacks, queues, lists

5

Oct 2, 7

Stacks and Lists

6

Oct 9, 14

Lists, adding to front, middle and rear

7

Oct 16, 21

Chapter 9: More components: Text Areas, Lists, Choices, Scrollbars.

Review

8

Oct 23

Exam

8, 9

Oct 28, 30

Chapter 11: Recursion

9, 10

Nov 4, 6

Prefix, infix and postfix expressions

10, 11

Nov 11, 13

Chapter 9: Layout managers: Flow Layout, Border Layout, Card Layout, and Grid Bag Layout, Threads, Review

11

Exam

12

Nov 20, 25

Introduction to algorithm analysis, counting loops

Chapter 6: Searching, sequential, binary

13

Dec 2

Chapter 6: Sorting, selection, Shell sort, quicksort

13

Dec 4

Review.

Dec 18

Final Exam, 10:55-12:35

Each exam will count 100 points including the final. Programs are to be worked on the computer. They will be worth between 5 and 15 points each. All points earned either from programs or exams will be totaled and averaged. Final grading will be based on this course average. Late homework will be accepted without penalty for one week. After that grades will be reduced. All programs must be completed before the end of the semester. Attendance is required. Over 3 unexcused absences will result in a reduction in grade for the semester

Week	Date	Topic
1	Sep 4, 9	Java review: packages, projects, objects, references, Strings, sequential files, arrays
2	Sep 11, 16	Java review: Sequential files, reading from a file into an array of objects, Chapter 7: Inheritance, polymorphism
3	Sep 18, 23	Chapter 9: Graphical user interfaces: Windows, Labels, Text Fields Events, Buttons, Panels and Grid Layout.
4	Sep 25, 30	Chapter 12: Linked data structures: stacks, queues, lists
5	Oct 2, 7	Stacks and Lists
6	Oct 9, 14	Lists, adding to front, middle and rear
7	Oct 16, 21	Chapter 9: More components: Text Areas, Lists, Choices, Scrollbars. Review
8	Oct 23	Exam
8, 9	Oct 28, 30	Chapter 11: Recursion
9, 10	Nov 4, 6	Prefix, infix and postfix expressions
10, 11	Nov 11, 13	Chapter 9: Layout managers: Flow Layout, Border Layout, Card Layout, and Grid Bag Layout, Threads, Review
11	Exam
12	Nov 20, 25	Introduction to algorithm analysis, counting loops Chapter 6: Searching, sequential, binary
13	Dec 2	Chapter 6: Sorting, selection, Shell sort, quicksort
13	Dec 4	Review.
	Dec 18	Final Exam, 10:55-12:35