CSC 255 Generic course syllabus

I. Course
II. Prerequisite
III. Course (Catalog) Description
IV. Course Objectives
V. Academic Integrity

VI. Outline of Topics
VII. Methods of Instruction
VIII. Course Practices Required
IX. Instructional Materials
XI. Other Course Information


I. Course Prefix	Course Number	Course Name	Credit	Lecture	Lab
CSC	255	Objects and Algorithms	3	3	1

II. Prerequisite

Recommendations MAT 144 and one of CSC 240 or CSC 241

III. Course 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. Course 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. Outline 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.

VIII. Course Practices Required:

Reading of the text is necessary to understand the course materials. Use of a computer laboratory is required to complete the assigned machine exercises.

IX. Instructional Materials:

Required Textbooks:
1. Data Structures, Algorithms and Applications in C++ by Sahni, McGraw-Hill, 1998.

2. Data Structures, Algorithms and Applications in Java by Sahni, McGraw-Hill, 2000.

One floppy diskette.

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 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.

Top of the page

PROGRAM INFO