Final Report 2004 December 12
B.6.5 Curriculum C – Course Summaries
CSC
C
101: Discrete Structures for Computer Science
Review of propositional and predicate logic; methods of theorem proving; strong and weak induction; finite and infinite sets, set operations; introductions to computational complexity, theta and big-O notation;
combinatorics, including permutations and combinations; discrete probability and binomial distribution. Prerequisites: Pre-calculus or equivalent.
Credit Hours: 3 Lecture Hours: 42 Lab Hours: 0 Recitation Hours: 14
CE2004 BOK Coverage: CE-DSC 0-6. CSC
C
102: Programming I
Introduction to computer science with emphasis on problem solving, programming and algorithm design; use of a high-level programming language for solving problems and emphasizing program design and
development; topics include basic programming constructs, expressions, conditional statements, loop statements, functions, classes and objects, data types, arrays, and strings.
Prerequisites: Pre-calculus or equivalent. Credit Hours: 3
Lecture Hours: 42 Lab Hours: 0 Recitation Hours: 14 CE2004 BOK Coverage: CE-PRF 0-4; CE-SWE 0-1.
CSC
C
103: Programming II
Investigate the essential properties of data structures, abstract data types, and algorithms for operating on them; to use these structures as tools to assist algorithm design; introduction of searching and sorting
techniques. Prerequisites: CSC
C
102 Credit Hours: 3
Lecture Hours: 42 Lab Hours: 0 Recitation Hours: 14 CE2004 BOK Coverage: CE-PRF 5–8; CE-SWE 2-3.
CSC
C
201: Algorithms and Data Structures
The study of representations for lists, stacks, queues, trees, and graphs; fundamental algorithms and their implementation for sorting, searching, merging, hashing, graph theoretic models, and recursive procedures.
Prerequisites: CSC
C
101, CSC
C
103 Credit Hours: 3
Lecture Hours: 42 Lab Hours: 0 Recitation Hours: 0 CE2004 BOK Coverage: CE-ALG 0–6; CE-SWE 4-5.
CSC
C
202: Introduction to Computer Organization
Internal organization of computers; registers, organization, control mechanisms; instruction sets, microprogramming, hardware interfaces; datapaths and pipelining; structural, data, and branch hazards;
optimization; memory and caching; non-von Neumann designs. Prerequisites: CSC
C
101, ENG
C
202 Credit Hours: 3
Lecture Hours: 42 Lab Hours: 0 Recitation Hours: 0 CE2004 BOK Coverage: CE-CAO 0-4.
CSC
C
301: Operating Systems
