CSC 307 in Fall 2008: Data Structures

http://www.cs.usm.edu/~jsun/08s307.html

 

Prof. Jonathan Zheng Sun jonathan.sun(at)usm.edu

Anjan Goje grader307(at)gmail.com 

 

General Information

 

Coursework. Coursework will consist of homework assignments, a take-home programming midterm exam, and a comprehensive final exam. The course letter grade will be determined on a curve, combining numerical scores for homework (30%), midterm (40%) and final (30%).

 

Submission. Email to grader and CC instructor, with your name, ID, and the sequential number of the assignment in Subject. Attach only Header files and C++ files, not any executable files. Programs do not compile are considered totally flawed.

 

Text. Data Structures & Other Objects Using C++, 3rd ed., Michael Main and Walter Savitch.

 

Download.

 

Time/Place. The course meets TT, 11:00am - 12:15pm in TEC 101.

 

Prerequisite. The prerequisite and a brief course description of CSC307 are available in http://www.usm.edu/computing/cs/programs.php.

 

Plagiarism. The university policy about academic honesty is in page 31-32 of the Student Handbook. A failure with dignity is much better than an abject success. Nevertheless, I will not fail anyone who has tried the best of his/her talents.

 

Tentative Schedule

 

Week 1

Jan. 15, 17

Introduction, ADT, algorithm, Object-Oriented programming

Pseudo code and running time analysis

Week 2

Jan. 22, 24

Pseudo code and running time analysis

C++ classes and Functions

Week 3

Jan. 29, 31

C++ classes and Functions

(Homework 1 assigned, due on 2/8)

The Container Class

Week 4

Feb. 05, 07

Mardi Gras holiday

Stacks

Week 5

Feb. 12, 14

Queues

The array implementation of containers, stacks, and queues

Week 6

Feb. 19, 21

Linked Lists

(Homework 2, due on 2/29)

The linked list implementation of containers, stacks, and queues

Week 7

Feb. 26, 28

Templates

Implementing linked lists as templates

Week 8

Mar. 04, 06

Recursion

Trees

(Take Home Midterm, due on 3/21)

Week 9

Mar. 11, 13

Spring Break holidays

Spring Break holidays

Week 10

Mar. 18, 20

Binary Search Trees

Binary Search Trees

Week 11

Mar. 25, 27

Midterm and Homework Critics

Priority Queues

Week 12

Apr. 01, 03

Priority Queues

(Homework 3, due on 4/11)

B-tree and other search tree variations

Week 13

Apr. 08, 10

Hashing

Hashing

Week 14

Apr. 15, 17

Sorting

Sorting

Week 15

Apr. 22, 24

Selected topics

Selected topics

Week 16

Apr. 29, May 01

Review

Review


 Final Exam Time = Thursday, May 8, 8:00am-10:30am