IT 501 Software Systems
Fall 2004

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. Snell 214, TuTh 1:00-2:15.

Instructor. Alexis Maciel. Science Center 379, 268-2385,

Office Hours. M 2:00-4:00, Tu 9:30-11:00, W 9:30-11:00.

Required Text. None.

Course Objectives.

  1. To learn fundamental programming principles and techniques including data abstraction, elementary data structures, basic notions of object-oriented programming, analysis of algorithms and recursion.

  2. To further develop coding and debugging 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 concepts 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 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 and analyze basic algorithms for searching, sorting and, if time permits, tree traversal.

  7. 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, lists, vectors, stacks, queues, linked lists, iterators, templates, the STL, analysis of algorithms, recursion, 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:

15% A + 20% T1 + 5% SA1 + 20% T2 + 5% SA2 + 35% F

The final exam will be cumulative and can be used to make up for half of each test. 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 September 30 and November 4. 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.