CSCI 150-03 Course Schedule

CSCI 150-03, Spring 2003

This schedule is likely to change, but it will give you an idea of the order of topics and chapters that will be covered. Please take note of the scheduled lab dates--we will meet in Haberlin 408 on these days. These may be modified during the semester, so pay attention to class announcements.

Day     Date    (Lab)     Chapters        Topic
Wed     1/15                   1          Administrivia, Intro to CS
Fri     1/17                              Pascal Intro, writeln, readln, identifiers

Mon     1/20     NO CLASS--MLK HOLIDAY
Wed     1/22     Lab 1                    First Pascal programs
Fri     1/24                   2          Decision trees, Conditionals

Mon     1/27                              Compound statements, Text manipulation
Wed     1/29     Lab 2                    Conditionals, Text manipulation
Fri     1/31                              Algorithms, While Loops

Mon     2/03                              While loops, Simple Expressions
Wed     2/05     Lab 3                    Practice with loops and expressions
Fri     2/07                   3          Arrays

Mon     2/10                              For loops
Wed     2/12     Lab 4                    Practice with arrays and for loops
Fri     2/14                              Mathematical functions

Mon     2/17                              Review/Catchup
Wed     2/19   EVENING MIDTERM  6:30 - 8:30 p.m.  NO LECTURE
Fri     2/21                   4           Procedures

Mon     2/24                               Procedures, parameters and variables
Wed     2/26     Lab 5                     Procedures
Fri     2/28                               Recursion, Church Markov Turing Hypothesis

Mon     3/3 - 3/7    SPRING BREAK

Mon     3/10                               Review procedures, recursion
Wed     3/12     Lab 6         5           Simulation
Fri     3/14                   7           Binary and hexadecimal numbers

Mon     3/17                               Binary addition, Digital circuits
Wed     3/19     Lab 7                     Circuit Maker
Fri     3/21                               Binary Arithmetic with digital circuits

Mon     3/24                               Binary Arithmetic II
Wed     3/26     Lab 8                     Binary addition, truth tables and circuits
Fri     3/28                               Review for exam

Mon     3/31    EVENING MIDTERM 6:30 - 8:30 p.m.  NO LECTURE
Wed     4/02                   8           Computer Architecture, Assembly language
Fri     4/04                               Networks, Internet/HTML

Mon     4/07                               No lecture
Wed     4/09    Lab 9                      Build a web page
Fri     4/11                               HTML/Graphics formats

Mon     4/14                   12          Tractable/Intractable problems
Wed     4/16                               Intractable problems/the Halting problem
Fri     4/18   NO CLASS--EASTER BREAK

Mon     4/21   NO CLASS--EASTER BREAK
Wed     4/23                   14          The halting problem
Fri     4/15                               Ethics in Computer Science

Mon     4/28                               Review/Catchup

Constance Royden--croyden@mathcs.holycross.edu
Computer Science 262--Data Structures
Date Created: September 1, 2002
Last Modified: January 8, 2003
Page Expires: January 14, 2004