CS 310-001 Home Page (Fall 1998)

This course is a continuation of CS 211 and is intended to provide you with additional experience building software and includes an introduction to basic tools and techniques that facilitate software development. You will also be further exposed to object-oriented techniques and gain additional experience with complex data structures and recursion. This course is programming intensive.

• Syllabus (and in postscript)
• Schedule (includes slides)
• Main&Savitch Book Code
• Programming Assignments
  • Assignment 1 - Radix Sort - Due: Sept. 15, 1998 at 9am
  • Assignment 2 - B-trees - Due: Oct. 22, 1998 at 9am
  • Assignment 3 - Hashing - Due: Nov. 12, 1998 at 9am
  • Assignment 4 - Graphs - Due: Dec. 10, 1998 at 11:59pm
• Homeworks
  • Homework 1 - Debugging (bst.C) - Due: Sept. 22, 1998
  • Homework 2 - Priority Queue ADT with Heaps - Due: Oct. 1, 1998
  • Homework 3 - Set class - partial implementation - Due: Oct. 8, 1998
• Programming Examples
  • AVL trees and sample input
• Related Documents
  • Notes on electronically submitting your programs
  • Project grading criteria
  • Prof. Wang's lecture on Unix ( postscript and pdf)
  • Prof. Wang's lecture on Make ( postscript and pdf)
• Useful links
  • Main & Savitch book supplements
  • Instructions on How to Use George Mason University Computers
  • The Programmer's Source pointers to various sources of information on programming languages
  • C/C++ Users Journal Web Site
  • UNIX reference desk contains pointers to various sources of information on unix systems
  • GNU manuals (and a few others)
  • GDB documentation. GDB is a debugging tool
  • Programming in C
  • The Standard Template Library
  • Ohio State make.info

Teaching Assistants:

Guido Cervone

Ashok Guntu