CS 240.002
Introduction to
Computing III
Fall 2005
Tentative Syllabus
Days & Times: Monday/Wednesday 4:30-5:45PM
Location:
Instructor: Bill White
Office:
Office Hours: Mon/Wed 10AM-1PM;
Tues/Thurs 11AM-1PM; and by appointment.
Telephone: (618)650-3483
E-mail: wwhite@siue.edu
Course
Description: Basic software engineering
concepts, elementary data
structures and
algorithms, fundamentals of object-oriented programming.
Prerequisite: CS 150.
Course Objectives: To provide programming students with an overview
of object oriented design principles, an examination of abstractdata types and their application to complex problem solving,and an introduction to the concept of algorithm analysis.
|
Date |
Topic |
Due |
|
8/22 |
Linked List Recursion (
|
|
|
8/24 |
Linked List Variations/Applications (
|
Quiz #1
|
|
8/29 |
Recursion (Ch. 5) |
|
|
8/31 |
Mathematical Induction ( |
Quiz #2 |
|
9/5 |
Labor Day Holiday |
|
|
9/7 |
Recursion Applications (Ch. 5) |
Program #1 |
|
9/12 |
Stack Abstract Data Type ( |
Quiz #3 |
|
9/14 |
Stack Implementations/Applications ( |
|
|
9/19 |
Queue Abstract Data Type ( |
Quiz #4 |
|
9/21 |
Inheritance (Ch. 8) |
|
|
9/26 |
Virtual Functions & Friends ( |
Program #2 |
|
9/28 |
Class Templates ( |
Quiz #5 |
|
10/3 |
Overloaded Operators ( |
|
|
10/5 |
Exam #1 (Chapters 4-8) |
|
|
10/10 |
Algorithm
Efficiency (
|
|
|
10/12 |
Algorithm
Growth Rates (
|
Program #3
|
|
10/17 |
Big-O Notation ( |
Quiz #6 |
|
10/19 |
Logarithmic Time Complexity ( |
|
|
10/24 |
Search Algorithm Efficiency ( |
|
|
10/26 |
Sorting Algorithms ( |
Quiz #7 |
|
10/31 |
Binary Tree Abstract Data Type ( |
Program #4 |
|
11/2 |
Binary Tree Implementations ( |
|
|
11/7 |
Binary Search Tree ( |
Quiz #8 |
|
11/9 |
Binary Search Tree Efficiency ( |
|
|
11/14 |
Table Abstract Data Type ( |
Quiz #9 |
|
11/16 |
Priority Queues & Heaps ( |
Program #5 |
|
11/21 |
Thanksgiving |
|
|
11/23 |
Thanksgiving
|
|
|
11/28 |
Graph Abstract Data Type ( |
Quiz #10 |
|
11/30 |
Graph Applications (Ch. 13) |
|
|
12/5 |
Exam #2 (Chapters 9-11, 13) |
|
|
12/7 |
Final Review & Course
Evaluation |
Program #6 |
|
12/12 |
Comprehensive
Final Exam (4:30-6:10 PM) |
|
|
|
Six 75-Point Programming Assignments
|
450 |
|
|
Ten 15-Point Quizzes |
150 |
|
Grading: |
Two 100-Point Non-Comprehensive Exams |
200 |
|
|
One 200-Point Comprehensive Final exam |
200 |
|
|
Total Points for Course |
1000 |
|
|
900-1000
|
A |
|
|
800-899 |
B |
|
Scale: |
700-799 |
C |
|
|
600-699 |
D |
|
|
0-599 |
E |
Late assignments will not be
accepted unless verifiable documentation of a
legitimate reason for
their lateness is provided to the instructor.
Legitimate
reasons are limited to documented medical problems. If you are unable to
attend on assignment due dates for
illegitimate reasons, then you will be
expected to
submit the assignment early.
Late (or early) exam arrangements
must be made in writing with the instructor.
Collaboration on program design
is encouraged on all programming
assignments, but showing your
code to another student is considered
academic
misconduct by both students.
Whether receiving assistance
from classmates, tutors, or the
instructor, you are expected to write
your own code in order to
demonstrate your understanding of the
concepts being
explored.