Course Outline

About this page

Lectures are at 10:00 am on Mondays and Wednesdays. The recitation is at 11:30 am on Monday. Each row in the table below shows the material for that week, with:

• Week of... -- the date of Monday of that week.
• Topic -- link to PowerPoint slides giving more information about the day's material. These slides will be in roughly the order I'll cover things in class. You can download them by right-clicking on the link. If you print them out, you may want to use the "handouts: 9 slides per page" setting to save paper, or the "handouts: 3 slides per page" to save paper but still leave space to add notes of your own.

  The order of the topics is tentative. Changes may be made right up to the beginning of class. Links will be activated as the material becomes ready.

• Assignment -- a link to the assignment due that week (by midnight at the end of Thursday). Each assignment is on material from lectures of the previous week.

  Passing in assignments: Links to pass in assignments are on the assignment description page. You will also find on that page a check link to see what you've passed in. (As we grade the submissions, we may create extra files in your submission folder. They will appear in your list of "passed in" files. You can review these extra files to see what tests we carried out and how your code did on them.)

• Recitation -- link to the recitation exercise due that week (by the end of the recitation meeting).

  Links to pass in the exercise are on its description page.

Other links

Review Notes: link to material from CSCI 1226 and 1228.
Sample Code: programs with (almost) all the code from the slides, arranged by topic.

Hide this again

Review Notes Sample Code

Recitation exercises are due at the end of the recitation meeting. Assignments are due by midnight at the end of Thursday. The test is during lecture period on Wednesday.

Mon Wed Topic Recitation Assignment September - 9th Intro + AI Experiment the course and its website; working with AIs L00 - 14th 16th Review of CSCI 1226 programs, input, branches, loops, methods, arrays, objects Review of CSCI 1228 exceptions, inheritance, polymorphism L01 A01 21st 23rd Java Collections Lists, Sets, ADTs, and a Bag L02 A02 28th 30th Reconciliation More on Interfaces Adding default and static methods to interfaces L03 A03 October 5nd 7th Array Implementations Using an array to back a collection L04 A04 12th Thanksgiving 14th Linked Implementations Using a chain to back a collection - A05 now due next week 19th 21st Notes with Sample Test L05 Test A05 26rd 28th Algorithmic Analysis calculating work and run times L06 A06 November 2nd 4th Sorting Lists Simple sorting methods: bubble, insertion, selection, shell L07 A07 9th 11th Fall Break 16th 18th Recursion Recursion; recurrence relations; proof by induction L08 A08 23rd 25th Faster Sorting Merge-, quick- and heap-sorts L09 A09 30th 2nd Limited Access Collections Queues, Stacks, Priority Queues L10 A10 December 7th 9th,10th More Implementation Using trees and hash tables to back collections L11,L12 - Exam Period 12th to 21st Final Exam: IN PERSON from 10:00 to 13:00, Sat. 19 December; Loyola 177 On all material, with extra weight on material not on the midterm

Review Notes Sample Code