COURSE OUTLINE

Spring Semester 2010

Principles of Algorithm Design I

The topics to be covered in this course include, but are possibly not limited to, the following list. For additional information, please contact Dr. Eggen.

• Introduction
• Decimal, Binary and Hexadecimal Number Systems
• Integers, Characters, Floats: Information Representation
• Introduction to Unix
• Introduction to the VI Editor
• Programming in C using Unix
• Introduction to Input/Output
• Arithmetic Operators, Expressions
• Relational Operators
• Logical Operators
• Decisions: if else
• Loops: while, do, for
• Complete Programs: the C philosophy
• Complete Programs: C Program Structure
• Characters, Strings, String Manipulation Functions
• More Data Structures: Arrays
• Random Number Generation
• Functions and Subroutines: Parameter Passing
• Modularization and Software Engineering
• Introduction to Pointers. Call by Reference
• Introduction to Recursion
• Files. Sequential Files. File Access
• Files. Random Access Files. File Access
• Sorting. Introduction to Algorithm Analysis
• Searching. Sequential Search. Binary Search
• Arrays Revisited: Two Dimensional Arrays
• Records. Record Structures.
• Direct access files
• Advanced uses of Pointers: Dynamic Memory Allocation
• Arrays Once Again: Dynamic Array Allocation
• Introduction to parallelism
• Advanced Topics

Return to Dr. Eggen's Home Page