IT 501 Software Systems
Spring 2006

Official Course Description. This course is an introduction to software design and implementation. After a review of basic programming concepts, students will be introduced to procedural and data abstraction, object-oriented design, recursion and dynamic data structures. Abstract data types such as lists, stacks, queues, and trees will be studied. Algorithms for searching and sorting will be explored along with methods for comparative analysis. Programming concepts will be demonstrated in a language like C++. The course will also include an introduction to the Unix operating system.

Prerequisites. Programming experience.

Location and Times. Science Center 354, TuTh 11:00-12:15.

Instructor. Alexis Maciel. Science Center 379, 268-2385, alexis@clarkson.edu.

Office Hours. M 2:30-4:00, Tu 3:30-5:00, W 1:00-3:00.

Teaching Assistant. Todd Deshane. Office Hours: Tu 9:00-10:00 and 2:30-3:30 in the ITL (SC334), Th 9:00-10:00 and 2:30-3:30 in COSI (SC336).

Required Text. None.

Course Objectives.

  1. To learn principles and techniques fundamental to the design and development of computer software. These include data abstraction, object-oriented design, elementary data structures and algorithms, analysis of algorithms, and recursion.

  2. To further develop coding, documentation, debugging and testing skills.

  3. To become familiar with programming in a Unix environment.
Demonstrable outcomes. By the end of the semester,
  1. You will have a good understanding of the principles and techniques mentioned in Objective 1 above.

  2. You will be able to use them in the design and implementation of C++ programs of a moderate size.

  3. You will be able to implement elementary data structures including vectors, linked lists, stacks and queues.

  4. You will understand the importance of using standard software components and will be familiar with the basic data structures and algorithms provided in the C++ Standard Template Library.

  5. You will be able to analyze the running time of simple algorithms.

  6. You will be able to implement simple recursive algorithms.

  7. You will be able to implement and analyze basic algorithms for searching, sorting and, if time permits, tree traversal.

  8. You will be able to develop software on a computer system running the Unix operating system.

Topics to be covered. Data abstraction, classes, object-oriented design, exceptions, linked lists, vectors, stacks, queues, iterators, templates, the STL, analysis of algorithms, recursion, binary search, quicksort, mergesort, sound programming principles, basic Unix concepts and commands. If time permits, inheritance, polymorphism, trees and binary search trees.

Grading. Your evaluation will be based on several homework assignments, which will be mostly programming assignments, two tests, two self-assessments of your performance on the tests, one for each test, and a final exam. Your course grade will be computed using the following formula:

25% A + 20% T1 + 5% SA1 + 20% T2 + 5% SA2 + 25% F

At the final exam, you will have the option of writing a make-up exam that can replace half of each of the two tests. The minimum grade you can get on a self-assessment is the grade you got on the corresponding test. Tentative dates for the tests are March 1 and April 5. These will be evening exams. All students are required to write the final exam (no exemptions).

Policy for missed work. There will be no make-up assignments. Late assignments may be accepted if a good excuse is provided and if arrangements are made at a reasonable time, in advance, if possible. Make-up tests can be arranged under the same conditions. Other special arrangements can be made for students forced to miss more than a few days of class.