CSCI 161 Topics and Supplementary Notes

Below is an approximate list of the topics we will cover and the (planned) order for covering them. The details will undoubtedly change as the semester progresses.

Reference material

Course overview

Review/refresher

Misc. topics I

Intro to Object oriented programming

Queues
Enqueue, Dequeue, Print
Applications (message queues, update queues, tickers/status updates)
Version 1: using linked list as internal data field
Version 2: using arrays (circular buffers)
  - what happens on overflow (reject, or drop off front)
  - dynamically resizing arrays


Midterm 1 (Feb. 13)


Stacks
Pop, Top, Push, Print
Applications (back buttons, undo options, bracket matching)
using linked list as internal data field
array based implementation


Reading break


Trees

OO part II


Midterm 2 (Mar. 20)


Sorting, searching, and recursion

Misc topics II

Wrap up


Extras if we have the time


OO part III

Misc. topics III