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
A study of the internal design of operating systems; topics include memory management, multiprogramming, virtual memory, paging and segmentation; job and process scheduling; multiprocessor systems; device and
file management; thrashing, cache memory. Prerequisites: CSC
C
201, CSC
C
202 Credit Hours: 3
Lecture Hours: 14 Lab Hours: 0 Recitation Hours: 0 CE2004 BOK Coverage: CE-DBS 0-3; CE-OPS 0-8.
CSC
C
302: Computing, Ethics, and Society
Critical examination of ethical problems associated with computer technology; discussion of these problems conducted within the framework of classical philosophical ethical theories; legal and quasi-legal i.e., policy
and regulative issues; topics addressed include the process of ethical decision-making, privacy and confidentiality, computer crime, professional codes and responsibilities, software piracy, the impact of
computers on society.
Prerequisites: Sophomore standing Credit Hours: 1
Lecture Hours: 42 Lab Hours: 0 Recitation Hours: 0 CE2004 BOK Coverage: CE-HCI 0-1; CE-SPR 0-9.
- B.20 -
Final Report 2004 December 12
CSC
C
303: Computer Networks
Technical introduction to data communication; OSI reference model, layer services, protocols, LANs, packet switching and X.25, ISDN; file transfer, virtual terminals, system management and distributed processing.
Prerequisites: CSC
C
103, MTH 101 Credit Hours: 3
Lecture Hours: 42 Lab Hours: 0 Recitation Hours: 0 CE2004 BOK Coverage: CE-NWK 0-8.
CSC
C
304: Applied Probability and Statistics
Systematic development of the concept of probability and random process theory; topics include probability and set theory, random variables, density and distribution functions, multivariate distributions, sampling
statistics and distributions, central limit theorem, estimation and the philosophy of applied statistics; application to problems in the physical sciences and engineering.
Prerequisites: MTH 102
Credit Hours: 3 Lecture Hours: 42 Lab Hours: 0 Recitation Hours: 0
CE2004 BOK Coverage: CE-PRS 0-8 CSC
C
401: Computer Architecture
