I.

II.

Prerequisite:

See recommendation in Course (Catalog) Description

III.

Course (Catalog) Description:

Course examines various data structures in a variety of business problems. Content includes stacks, queues, lists and linked lists, trees, and heaps; sorting techniques, search methods, and graphs. Recommended: CIS 220 or comparable knowledge.  

IV.

Learning Objectives:

The goals of this course are to develop a proficiency in C by:

1. Creating program libraries
2. Designing and creating header files
3. Mastering memory allocation techniques
4. Lists
   a. Stacks
   b. Queues
       1. LIFO
       2. FIFO
       3. Circular queues
   c. Linked lists
   d. Doubly linked lists
   e. Lists of lists
5. Using recursive techniques
6. Using trees
7. Using sorting techniques
8. Using searching techniques
9. Using graphs and their applications
10. Using graphics

V.

Academic Integrity:

Students and employees at Oakton Community College are required to demonstrate academic integrity and follow Oakton's Code of Academic Conduct. This code prohibits:

There are serious consequences to violations of the academic integrity policy. Oakton's policies and procedures provide students a fair hearing if a complaint is made against you. If you are found to have violated the policy, the minimum penalty is failure on the assignment and, a disciplinary record will be established and kept on file in the office of the Vice President for Student Affairs for a period of 3 years.

Details of the Code of Conduct can be found in the Student Handbook.

VI.

Outline of Topics:

1. Programming aides
   A. Preprocessor
   B. Debugging aides
2. C Libraries
   A. Library availability and application
   B. Library creation
   C. Library content
3. Header Files
   A. Standard and special files
   B. Creating header files
   C. Contents
   D. Application specific
4. Data Structures
   A. Lists
   B. Stacks
   C. Queues
   D. Linked Lists
        1. Singly linked lists
        2. Doubly linked lists
        3. Nested lists
5. Trees 
   A. Graphs
   B. Mode
   C. Tree traversal
6. Graphics [This topic should be deleted]
   A. Color Management
   B. Cursor Control
   C. Windows
   D. Images and scenes

VII.

Methods of Instruction:

1. Lectures
2. Class discussion
3. Problem analysis
4. Analysis of case studies
5. Programming assignments

VIII.

Course Practices Required:

Reading:  Primary reading material will be the required text and needed lab              manuals. Additional reading will include magazines, journals, and other              texts available in the library.

Writing:  All programs must be documented to explain the algorithms being                             used, how the program is to be run, expected input and output.               Exceptional programming errors must be described as to the cause and               the required fix.

Oral presentations:   Optional.

Mathematics:    High school algebra.

Computer use:   All lab assignments must be done on any available computer                          using any C compiler.

Lab practices:   The students will be allowed to develop their programs on                          whatever computer is available to them but will be required                          to demonstrate capability on the current equipment in the                          assigned lab.

IX.

Instructional Materials:

TEXTBOOK: TBA

X.

Methods of Evaluating Student Progress:

1. Examinations and quizzes.
2. Lab (programming) assignments.
   8-10 per semester

XI.

Other Course Information:

If you have a documented learning, psychological, or physical disability you may be entitled to reasonable academic accommodations or services. To request accommodations or services, contact the ASSIST office in Instructional Support Services. All students are expected to fulfill essential course requirements. The College will not waive any essential skill or requirement of a course or degree program.