CS 2223 B Term Outline

Let us from point to point
this story know,
To make the even truth
in pleasure flow.

Shakespeare
All’s Well That Ends Well

1 Course Outline

The following list identifies the major deliverables in the class. As each homework is assigned, its links will become active (all except for the respective solution!). Once homeworks have been graded, the solutions will be posted for your review.

Click here to return to the course structure.

1.1 Module 1: Oct 27 2015 - Nov 23 2015

This module introduces the fundamental concepts of algorithms as applied to numerical computations and array-based structures.

There are three weeks in this module

• Week 1 [Oct 27 2015] - day01 day02 day03

• Week 2 [Nov 02 2015] - day04 day05 day06 day07

• Week 3 [Nov 09 2015] - day08 day09 day10 day11

• Week 4 [Nov 16 2015] - day12 day13

There are three homeworks during this module:

• Homework 1 – Nov 06 2015 Assignment Rubric Solution

• Homework 2 – Nov 13 2015 Assignment Rubric Solution

• Homework 3 – Nov 20 2015 Assignment Rubric Solution

Assessed by Exam1 on Nov 19 2015 on day14. Solution and rubric is available.

1.2 Module 2: Nov 19 2015 - Dec 18 2015

This module continues with non-linear data structures, such as binary search trees and graphs.

• BST

• Graphs

There are five weeks in this module (technically, because I am counting the day after Exam1).

• Week 4 [Nov 20 2015] - day15

• Week 5 [Nov 23 2015] - day16 day17

• Week 6 [Nov 30 2015] - day18 day19 day20 day21

• Week 7 [Dec 07 2015] - day22 day23 day24 day25

• Week 8 [Dec 14 2015] - day26 day27

There are two homeworks during this module:

• Homework 4 – Dec 04 2015 Assignment Rubric Solution

• Homework 5 – Dec 11 2015 Assignment Rubric Solution

Assessed by Exam2 on Dec 17 2015.

1.3 Version : 2015/12/08

(c) 2015, George Heineman