CSC 202 Syllabus
Division: Arts and Sciences Date: February 2014
Curricula in Which Course is Taught: Science
Course Number and Title: CSC 202 - Computer Science II
Credit Hours: 4 Hours/Wk Lecture: 4Hours/Wk Lab: Lec/Lab Comb:
I. Catalog Description: Examines data structures and algorithm analysis. Covers data structures (including sets, strings, stacks, queues, arrays, records, files, linked lists, and trees), abstract data types, algorithm analysis (including searching and sorting methods), and file structures. Prerequisite CSC 201. Corequisite MTH 174.
II. Relationship of the course to curricula objectives in which it is taught:
This course is required in the Engineering transfer program and will count as an elective in other transfer programs. The purpose of this course is to teach abstract data types, their specification, their application, and their implementation using the C++ programming language.
III. Required background:
Prerequisites: CSC 201 or EGR 126, and MTH 173
IV. Course Content:
Software Engineering Principles
Data Design and Implementation
ADT Unsorted List
ADT Sorted List
ADTs Stack and Queue
Programming with Recursion
Binary Search Trees
Priority Queues, Heaps, Graphs, and Sets
Sorting and Searching Algorithms
V. Learner Outcomes
The student will learn (to):
A. The general activities in the software life cycle.
B. Describe the logical level, application level, and implementation level of an ADT
C. Implement unsorted list operations using an array-based implementation.
D. Implement sorted list operations using an array-based implementation.
E. Implement the stack and the queue ADT, in two array-based implementation.
F. Implement a circular and a link list.
G. Recursion as another form of repetition.
H. Implement binary tree search algorithms in C++
I. Compare the implementations of a priority queue using a heap, a linked list, and a binary search tree.
J. Design and implement sorting algorithms.
Students will be evaluated by some combination of quizzes, tests, homework, programming assignments and exams as defined by faculty. Students will use calculators only after demonstrating mastery of essential deductive skills without them.
VII. This course supports the following objectives:
DCC Educational Objectives: