Course Catalog Search


Course Level:
Subject Area:        (Hold CTRL to Select Multiple Subject Areas)
Title:
Description:

Course ID:


 

Computer Science (CS)
CS-10001
COMPUTER LITERACY (3)
INTRODUCTION TO HISTORY, LANGUAGE, PROCEDURES,
APPLICATIONS, ABUSES AND IMPACT OF COMPUTERS.
HANDS-ON EXPERIENCE WITH MICROCOMPUTERS. NOT OPEN TO
STUDENTS WITH PREVIOUS EXPERIENCE. SPECIAL FEE:
$6.67/CR. HR. ; SUBJECT TO CHANGE. PREREQUISITE: NONE.

CS-62262
NUMERICAL SOLN OF PDES (3)
CROSS-LISTED WITH MATH 6/72262. DERIVATION AND
ANALYSIS OF DISCRETE METHODS (FINITE DIFFERENCES,
FINITE ELEMENTS) FOR THE NUMERICAL SOLUTION OF
ELLIPTIC, HYPERBOLIC AND PARABOLIC PARTIAL
DIFFERENTIAL EQUATIONS. SPECIAL FEE: $3.33/CR. HR.;
SUBJECT TO CHANGE. PREREQUISITE: MATH 4/52045 AND CS
4/52202. GRADUATE STANDING.

CS-10051
INTRO TO COMPUTER SCIENCE (4)
AN INTRODUCTORY, BROAD AND HANDS-ON COVERAGE OF
ASPECTS OF COMPUTER SCIENCE INCLUDING: ALGORITHMS,
PROBLEM SOLVING, OPERATING SYSTEMS CONCEPTS, COMPUTER
ARCHITECTURE AND PROGRAMMING LANGUAGES. THREE CREDIT
LECTURE WITH ONE CREDIT LAB. SPECIAL FEE: $5/ CR.HR.;
SUBJECT TO CHANGE. PREREQUISITES: MATH 11009 OR 11010
OR 11011 OR 12001, OR 2 YEARS OF HIGH SCHOOL ALGEBRA.

CS-62263
NUMER SOLN LRG SPARSE SYS (3)
CROSS-LISTED WITH MATH 6/72263. CONSTRUCTION AND
ANALYSIS OF ITERATIVE METHODS FOR LARGE SYSTEMS OF
LINEAR ALGEBRAIC EQUATIONS. JACOBI, GAUSS-SEIDEL,
SOR. POLYNOMIAL ACCELERATION METHODS, CONJUGATE
GRADIENTS. MULTI-GRID METHODS. PREREQUISITE: MATH
4/51021 AND CS 4/52202. GRADUATE STANDING.

CS-10061
INTRO TO COMPUTER PROG (3)
EMPHASIZES PROGRAMMING IN A HIGH-LEVEL LANGUAGE,
INCLUDES STRUCTURED PROGRAMMING, PROGRAM DESIGN,
EXPRESSIONS, DATA CONTROL, ARRAYS, RECORDS, STRINGS
AND FUNCTIONS. SPECIAL FEE: $6.67/CR. HR. ; SUBJECT
TO CHANGE. PREREQUISITE: MATH 11011 OR 12001, OR TWO
YEARS OF HIGH SCHOOL ALGEBRA.

CS-62264
NUMER SOLN OF NONLIN SYS (3)
CROSS-LISTED WITH MATH 6/72264. CONSTRUCTION AND
ANALYSIS OF NUMERICAL METHODS FOR SYSTEMS OF NON
LINEAR ALGEBRAIC EQUATIONS AND OPTIMIZATION PROBLEMS.
NUMERICAL IMPLEMENTATION AND SOFTWARE. SPECIAL FEE:
$3.33/CR. HR.; SUBJECT TO CHANGE. PREREQUISITE: MATH
4/52041 AND CS 4/52202 OR EQUIVALENT. GRADUATE
STANDING.

CS-19995
ST IN COMPUTER SCIENCE (1 TO 3)
SPECIAL TOPICS FROM ALL AREAS OF COMPUTER SCIENCE.
REPEAT REGISTRATION PERMITTED. PREREQUISITE:
PERMISSION.

CS-63005
ADV DATABASE SYSTEM DESIGN (3)
INTRODUCTION TO A VARIETY OF ADVANCED DATABASE TOPICS
AND ON-GOING TRENDS IN MODERN DATABASE SYSTEMS. THE
COURSE INCLUDES ADVANCED ISSUES OF OBJECT-ORIENTED
DATABASE, XML, ADVANCED CLIENT SERVER ARCHITECTURE,
AND DISTRIBUTED DATABASE TECHNIQUES. PREREQUISITE: CS
4/53005 AND GRADUATE STANDING.

CS-23021
COMPUTER SCIENCE I (4)
COMPUTER SCIENCE CONCEPTS INCLUDING ALGORITHM
DEVELOPMENT AND PROBLEM SOLVING STRATEGIES FOCUSED ON
PROCEDURAL ABSTRACTION. HIGH-LEVEL PROGRAMMING
CONCEPTS INCLUDING DATA TYPES, EXPRESSIONS, PROGRAM
STRUCTURES, FUNCTIONS, PARAMETER PASSING, SCOPE,
EXTENT, ARRAYS, INTRODUCTION TO RECURSION AND AN
INTRODUCTION TO OBJECT-ORIENTED CONCEPTS. COURSE IS
THREE HOURS LECTURE AND ONE HOUR LAB. SPECIAL FEE:
$6.67/CR. HR.; SUBJECT TO CHANGE. PREREQUISITE: C
(2.0) OR BETTER IN CS 10051.

CS-63015
DATA MINING TECHNIQUES (3)
CONCEPTS AND TECHNIQUES OF DATA MINING. DATA MINING
IS A PROCESS OF DISCOVERING INFORMATION FROM A SET OF
LARGE DATABASES. THIS COURSE TAKES A DATABASE
PERSPECTIVE ON DATA MINING. PREREQUISITE: CS 53005 AND
MATH 50011 OR EQUIVALENT; GRADUATE STANDING.

CS-23022
DISCRETE STRUCTURES FOR CS (3)
DISCRETE STRUCTURES FOR COMPUTER SCIENTISTS WITH A
FOCUS ON: MATHEMATICAL REASONING, COMBINATORIAL
ANALYSIS, DISCRETE STRUCTURES, ALGORITHMIC THINKING,
APPLICATIONS AND MODELING. SPECIFIC TOPICS INCLUDE
LOGIC, SETS, FUNCTIONS, RELATIONS, ALGORITHMS, PROOF
TECHNIQUES, COUNTING, GRAPHS, TREES, BOOLEAN ALGEBRA,
GRAMMARS AND LANGUAGES. PREREQUISITES: CS 10051; A
GRADE OF C (2.0) OR BETTER IN MATH 12001, OR IN MATH
11022 AND ONE OF 11010 OR 11011, OR APPROPRIATE
PLACEMENT TEST SCORE INTO MATH 12002; NO CREDIT FOR
MATH 31011.

CS-63101
ADV PROGRAMMING LANGUAGES (3)
TOPICS SUCH AS PROGRAMMING LANGUAGE DESIGN PROBLEMS,
FORMAL SEMANTICS, LANGUAGE DEFINITIONS, FUNCTIONAL
PROGRAMMING, SPECIALIZED OR VERY HIGH-LEVEL LANGUAGES,
CORRECTNESS CONSIDERATIONS, PARALLELISM AND
CONCURRENCY. PREREQUISITE: CS 4/53101 AND GRADUATE
STANDING.

CS-29995
ST IN COMPUTER SCIENCE (1 TO 3)
SPECIAL TOPICS FROM ALL AREAS OF COMPUTER SCIENCE.
REPEAT REGISTRATION PERMITTED. PREREQUISITE:
PERMISSION.

CS-63111
ADVANCED COMPILER DESIGN (3)
EXPLORES IMPLEMENTATION ISSUES SUCH AS OPTIMIZATION
TECHNIQUES, CODE GENERATION, ERROR HANDLING, AUTOMATIC
COMPILER GENERATION. MAY INCLUDE COMPILER PROJECT
PARALLELIZATION. SPECIAL COURSE FEE - $6.67/CR.HR. -
SUBJECT TO CHANGE Y PREREQUISITE: CS 4/53111 AND
4/55101. GRADUATE STANDING.

CS-31045