Primary Navigation
  • About
  • Academics
  • Continuing Education
  • Admission
  • Student Life
  • Student Services
  • Library
  • News and Events
  • Giving
Topics in Computer Science

I.     Course Prefix/Number: CSC 290

       Course Name: Topics in Computer Science

       Credits: 1-4 (0-4 lecture; 0-4 lab)

II.    Prerequisite

Varies depending on the specific topic.

III.   Course (Catalog) Description

This course will cover a variety of different topics during different semesters. Topics will be selected from among current advances in hardware and software technology. Typical course concentrations might be Introduction to Parallel Programming or Artificial Intelligence. Check with the instructor and the latest college class listings for details. The course may be repeated up to three times.

IV.   Learning Objectives

Students will learn issues, techniques, and/or applications related to the specific topic of the course section.

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:

• cheating,
• plagiarism (turning in work not written by you, or lacking proper citation),
• falsification and fabrication (lying or distorting the truth),
• helping others to cheat,
• unauthorized changes on official documents,
• pretending to be someone else or having someone else pretend to be you,
• making or accepting bribes, special favors, or threats, and
• any other behavior that violates academic integrity.

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 Academic Conduct can be found in the Student Handbook.

VI.   Sequence of Topics

A. Traditional computer architectures
1. functional units, banked memory, I/O processors
2. global optimization
a. strength reduction
b. loop unrolling
c. precision implications

B. Modern computer architecture
1. SIMD
a. array processors
b. vector processors
2. MIMD
a. shared memory
b. distributed memory
c. hybrid models
3. dependency analysis

C. Algorithms
1. recursive doubling
a. recurrence relations
b. associative binary operations
2. domain decomposition
a. numerical analysis
b. sorting methods
3. scheduling algorithms
a. computational linear algebra

D. Communications Issues & Performance
1. monitors and locks
2. processor/memory topologies
3. Bernstein's dependency conditions
4. Amdahl's Law

E. Languages
1. Fortran 90
a. array triplet notation
b. new intrinsic functions
i. linear algebra
ii. inquiry and construction
2. MPI
a. Makefiles
b. message passing methods (Fortran and C)
c. global operations
3. Shared memory compiler directives (Fortran and C)

VII.  Methods of Instruction

Lectures, class discussions, individual and group computer laboratory projects.
Course may be taught as face-to-face, media-based, hybrid or online course.

VIII. Course Practices Required

Reading of the text and/or handouts is required as a reference to the materials and the techniques under study.

IX.   Instructional Materials

Note: Current textbook information for each course and section is available on Oakton's Schedule of Classes.

Vary with individual sections. Will include texts and/or handouts.

X.    Methods of Evaluating Student Progress

Quizzes, examinations, final examination, individual and group computer laboratory assignments.

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 Access and Disability Resource Center at the Des Plaines or Skokie campus. 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.