Primary Navigation
  • About
  • Academics
  • Continuing Education
  • Admission
  • Student Life
  • Student Services
  • Library
  • News and Events
  • Giving
Objects and Algorithms

I.     Course Prefix/Number: CSC 255

       Course Name: Objects and Algorithms

       Credits: 3 (3 lecture; 1 lab)

II.    Prerequisite

Recommended: MAT 144, CSC 240 or CSC 241.

III.   Course (Catalog) Description

Course continues CSC 240 or CSC 241. Contents include survey of introductory algorithms in programming language. Object-oriented methodologies are used to implement algorithms that exhibit backtracking, divide and conquer, the greedy method and branch and bound techniques; analysis of time and memory complexity using discrete metrics.

IV.   Learning Objectives

A. Continue the development of object-oriented programming methodologies.
B. Analyze algorithmic complexity using discrete mathematical metrics.
C. Implement algorithms using a variety of abstract data types.
D. Study and implement sorting and searching algorithms.
E. Study and implement elementary semi-numerical algorithms.
F. Survey introductory distributed algorithms.

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. Object-Oriented Programming
    1. inheritance
    2. polymorphism
    3. encapsulation

B. Algorithmic Complexity Metrics
    1. big and little O
    2. big omega and theta
    3. recurrence relations

C. Abstract Data Types
    1. sets and multisets
    2. graphs
    3. heaps
    4. hash tables

D. Algorithmic Paradigms
    1. divide and conquer
    2. greedy methods
    3. back-tracking
    4. random number generators
    5. distributed algorithms

VII.  Methods of Instruction

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

VIII. Course Practices Required

Reading of the text is required for understanding the material. Use of a computer laboratory is necessary to learn the design of software.

IX.   Instructional Materials

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

Applied Data Structures with C++ by Smith, Jones and Bartlett, 2004.

X.    Methods of Evaluating Student Progress

Quizzes, written homework, computer assignments, major examinations and a final examination will be used.

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.