Detailed Descriptions of the BA and BS Computer Sciences Degrees from the 2008-2010 University Undergraduate Catalog.
Introductory logic in the context of computing; introduction to formal notations; basic proof techniques; sets, relations, and functions. Three lecture hours a week for one semester. Some sections also require one discussion hour a week; these are identified in the Course Schedule.
An introduction to the fundamental concepts of computing: how computers work, what they can do, and how they can be used effectively. Some programming is required. Three lecture hours and one discussion hour a week for one semester. Credit for CS 302 may not be earned after a student has received credit for CS 303E, 305J, or 307.
Problem solving and fundamental algorithms for various applications in science and business and on the World Wide Web. Introductory programming in a modern object-oriented programming language. Three lecture hours a week for one semester. CS 303E and 305J may not both be counted. Credit for CS 303E may not be earned after a student has received credit for CS 307.
An introduction to programming in a particular computer language. Students design and implement programs. One lecture hour a week for one semester. May be repeated for credit when the languages vary. Prerequisite: 307, 313E, or EE 322C with a grade of at least C.
Introduction to computer science concepts. Programming in a modern object-oriented programming language. Three lecture hours and one discussion hour a week for one semester. CS 303E and 305J may not both be counted. Credit for CS 305J may not be earned after a student has received credit for CS 307. Prerequisite: Some knowledge of and experience in computer programming; and credit with a grade of at least C or registration for M 305G, or equivalent score on the SAT Mathematics Level 1 or Level 2 test.
Fundamental computer science concepts: data types, data structures, algorithms, and programming; functions and recursion; abstraction and encapsulation. Correctness: specification, testing, and proving. Simple sorting and searching algorithms. Introduction to analysis of algorithms. Three lecture hours and one laboratory hour a week for one semester. Prerequisite: One of the following: One year of programming in high school, CS 303E or 305J with a grade of at least C, or consent of instructor; and credit or registration for M 408C or 408K, or a score of at least 520 on the SAT Mathematics Level 1 or Level 2 test.
Introduction to the use of a particular software system. Students build applications that exploit the system being studied. One lecture hour a week for one semester. May be repeated for credit when the topics vary. Offered on the pass/fail basis only. Prerequisite: CS 307, 313E, or EE 322C with a grade of at least C.
For each semester hour of credit earned, one lecture hours a week for one semester. May be repeated for credit when the topics vary. Some sections are offered on the pass/fail basis only; these are identified in the Course Schedule. Only one hour may be counted toward a degree in computer sciences. Prerequisite: Varies with the topic and is given in the Course Schedule.
Basic computer organization; machine representation of instructions and data; hardware/software interface. Three lecture hours and one discussion hour a week for one semester. CS 310 and 310H may not both be counted. Prerequisite: CS 307 with a grade of at least C.
Basic computer organization; machine representation of instructions and data; hardware/software interface. Three lecture hours and one discussion hour a week for one semester. CS 310 and 310H may not both be counted. Prerequisite: CS 315 or 315H with a grade of at least C, and consent of the honors director.
Object-oriented design of software in a modern high-level language, using software library packages. Introduction to elementary data structures and complexity of algorithms. Three lecture hours a week for one semester. May not be counted toward a degree in computer sciences. Prerequisite: CS 303E or 305J with a grade of at least C.
Set, relations, functions, sentential and predicate logic, proof techniques, algorithms, and elementary metatheory. Introduction to analysis of algorithms and techniques for proving properties of programs. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: CS 313H, 3131K, PHL 313, 313K, 313Q. Prerequisite: Consent of the honors director.
Propositional and predicate logic; proof techniques, including induction, sets, relations, and functions. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: CS 313H, 313K, PHL 313, 313K, 313Q. Prerequisite: Credit or registration for M 408C or 408K.
Implementation of basic data structures, including stacks, queues, lists, priority queues, trees, binary search trees, graphs, and sets. Recursion. Efficient sorting and searching algorithms. Hashing. Multithreaded programs. Three lecture hours and one laboratory hour a week for one semester. CS 315 and 315H may not both be counted. Prerequisite: CS 307 with a grade of at least C, and credit or registration for CS 313K.
Data types, data structures, algorithms, and programming; functions and recursion; abstraction and encapsulation. Correctness: specification, testing, proving. Introduction to analysis of algorithms. Implementation and use of basic data structures, including stacks, queues, lists, priority queues, trees, binary search trees, graphs, sets. Efficient sorting and searching algorithms. Hashing. Multithreaded programs. Three lecture hours and one discussion hour a week for one semester. CS 315 and 315H may not both be counted. Prerequisite: Consent of the honors director.
This course is used to record credit the student earns while enrolled at another institution in a program administered by the University's Study Abroad Office. Credit is recorded as assigned by the study abroad adviser in the Department of Computer Sciences. University credit is awarded for work in an exchange program; it may be counted as coursework taken in residence. Transfer credit is awarded for work in an affiliated studies program. May be repeated for credit when the topics vary.
For each semester hour of credit earned, one lecture hour a week for one semester. May be repeated for credit when the topics vary. May not be counted toward a degree in computer sciences.* Prerequisite: Varies with the topic and is given in the Course Schedule.
*Computer Sciences majors may substitute C S 320N (Topic: Practical Linear Algebra I only) for M 340L as part of their degree plan.
Introduction to functional and symbolic programming and to the use of these concepts throughout computer science. Three lecture hourse a week for one semester. Prerequisite: Credit with a grade of at least C or registration for CS 337 or 337H, and consent of the honors director.
Fundamentals of software issues related to scientific computing. Topics include floating-point computations, numerical computation errors, interpolation, integration, solution of linear systems of equations, optimization, and initial value problems of ordinary differential equations. Implementation of algorithms are investigated using MATLAB for matrix and vector computations. Examples are drawn from a variety of science and mathematics areas. Three lecture hourse a week for one semester. May not be counted toward a degree in computer sciences. CS 323E and 323H may not both be counted. Prerequisite: CS 303E or the equivalent, M 408C or 408K, 408D, 408M, and credit with a grade of at least C or registration for M 341 or 340L.
Fundamentals of software issues related to scientific computing. Topics include floating-point computations, numerical computation errors, interpolation, integration, solution of linear systems of equations, optimization, and intitial value problems of ordinary differential equations. Implementation of algorithms are investigated using MATLAB for matrix and vector computations. Examples are drawn from a variety of science and mathematics areas. Three lecture hours a week for one semester. May not be counted toward a degree in computer science. CS 323E and 323H may not both be counted. Prerequisite: CS 303E, 305J, or 307; M 408D or 408M; credit with a grade of at least C or registration for M 341 or 340L; and consent of the honors director.
Basics of two- and three-dimensional computer graphics systems, modeling and rendering, and selected graphics software APIs. Other topics may include interactive graphics, animation, graphical user interfaces, and the graphical presentation of information. Three lecture hours a week for one semester. May not be counted toward a degree in computer sciences. Prerequisite: CS 307, 313E, and or EE 322Cwith a grade of at least C.
Introduction to the principles and basic concepts of the Internet. Networking applications and protocols. Simple client/server applications. Other topics may include network technologies and topologies, packet and circuit switching, LANS and WANS, Internet security, and network management. Three lecture hours a week for one semester. May not be counted toward a degree in computer sciences. Prerequisite: CS 307, 313E or EE 322C with a grade of at least C.
A practical introduction to database management systems, with discussion of database administration and management. Survey of logical modeling, database design with a focus on relational databases, SQL query language, and current applications. Topics may include data integrity, performance, concurrency, transaction processing, recovery, security, and Web applications. May not be counted toward a degree in computer sciences. Prerequisite: CS 307, 313E or EE 322C with a grade of at least C.
Three lecture hours a week for one semester. May be repeated for credit when the topics vary. May not be counted toward a degree in computer sciences. Prerequisite: CS 307, 313E or EE 322C with a grade of at least C.
This course is used to record credit the student earns while enrolled at another institution in a program administered by the University's Study Abroad Office. Credit is recorded as assigned by the study abroad adviser in the Department of Computer Sciences. University credit is awarded for work in an exchange program; it may be counted as coursework taken in residence. Transfer credit is awarded for work in an affiliated studies program. May be repeated for credit when the topics vary.
This course covers the work period of computer sciences students in the Cooperative Education program, which provides supervised work experience by arrangement with the employer and the supervising instructor. Forty laboratory hours a week for one semester. The student must repeat the course each work period and must take it twice to receive credit toward the degree; at least one of these registrations must be during a long-session semester. However, no more than three semester hours may be counted toward the major requirement. The student's first registration must be on the pass/fail basis; the second must be on the letter-grade basis. Prerequisite: CS 336 or 336H with a grade of at least C, and consent of the undergraduate adviser.
Application of techniques and strategies of effective technical writing, and of conventions used in documents such as letters, memos, proposals, abstracts, and reports. Two lecture hours a week for one semester. CS 234 and178 (Topic: Technical Writing) may not both be counted. May not be counted toward the number of hours in computer sciences required for the Bachelor of Science in Computer Sciences degree. Prerequisite: CS 310 or 310H with a grade of at least C.
Proofs of program correctness and a survey of mathematical techniques useful in the analysis and verification of programs. THree lecture hours a week for one semester. CS 336 and 336H may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 313H or 313K, 315 or 315H, and M 408C or 408L.
A survey of mathematical techniques useful in the analysis and verification of programs. Three lecture hours a week for one semester. CS 336 and 336H may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 313H or 313K, 315 or 315H, and M 308C or 408L; and consent of the honors director.
Application of program-analysis theory to program design. Methodologies for large-scale program design. Designed to help students bring together theoretical and programming skills. Three lecture hours and one discussion hour a week for one semester. CS 337 and 337H may not both be counted. Prerequisite: CS 315 or 315H with a grade of at least C; CS 336 or 336H with a grade of at least C, or consent of the honors director; and M 408C or 408L with a grade of at least C.
Application of program-analysis theory to program design. Methodologies for large-scale program design. Designed to help students bring together theoretical and programming skills. Three lecture hours and one discussion hour a week for one semester. CS 337 and 337H may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 315 or 315H, 336 or 336H, and M 408C or 408L; and consent of the honors director.
Introduction to the formal study of automata and of related formal languages with applications in computer science. Three lecture hours a week for one semester. Only one of the following may be counted: CS 341, 341H, LIN 340. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, 337 or 337H, and M 408D or 408M.
Introduction to the formal study of automata and of related formal languages with applications in computer science. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: CS 341, 341H, LIN 340. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, 337 or 337H, and M 408D or 408M; and consent of the honors director.
Biological information processing; architectures and algorithms for supervised learning, self-organization, reinforcement learning, and neuro-evolution; hardware implementations and simulators; applications in engineering, artificial intelligence, and cognitive science. Three lecture hours a week for one semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M.
A survey of current artificial intelligence issues, including search, production systems, knowledge representation, knowledge-based systems, planning, natural language processing, and machine learning. Artificial intelligence programming projects are required. Three lecture hours a week for one semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M.
Introduction to autonomous agents, with an emphasis on multiagent systems. Students use a robotics simulator. Emphasis on computer science research activities, including speaking, writing, programming, and working in groups. Three lecture hours a week for one semester. CS 344M and 378 (Topic: Autonomous Multiagent Systems) may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M.
A survey of methods and techniques important for intelligent robotics. Students work in teams, applying these methods to get intelligent behavior from physical robots. Three lecture hours a week for one semester. CS 344R and 378 (Topic: Robotics) may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or M 408M.
Survey of significant concepts underlying modern programming languages, including syntax, functions, expressions, types, polymorphism, assignment, procedures, pointers, encapsulation, classes, and inheritance, with some discussion of implementation issues. Prominent programming paradigms, such as sequential, concurrent, object-oriented, functional, and logic programming. Illustrative examples drawn from a variety of current languages. Three lecture hours a week for one semester. CS 345 and 345H may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or M 408M.
A theoretical introduction to cryptography. Topics include private key cryptosystems, public key cryptosystems, digital signatures, secret sharing schemes, and the necessary mathematical background. Three lecture hours a week for one semester. CS 346 and 378 (Topic: Cryptography) may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or M 408M.
Concepts of database design and database system implementation. Data models, query processing, database design theory, crash recovery, concurrent control, and distributed databases. Three lecture hours a week for one semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or M 408M.
Social, professional, and ethical issues involved in the use of computer technology. Topics may include software engineering ethics, computer safety and reliability, constitutional issues, intellectual property, computer crime, societal impact, emerging technologies, philosophical issues. Three lecture hours a week for one semester. CS 349 and 378 (Topic: Contemporary Issues in Computer Science) may not both be counted. Prerequisite: CS 315 or 315H with a grade of at least C.
Symbolic computation for artificial intelligence, such as pattern-matching, unification, frames, flavors, semantic networks, deductive retrieval, rule-based and constraint-based inference. Substantial programming projects in LISP. Three lecture hours a week for one semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or M 408M.
Computer architecture and organizational issues; structural and behavioral characteristics of system components. Processor, memory hierarchy, and input/output issues. Evaluation of design alternatives. The relationship between hardware and software. Three lecture hours a week for one semester. CS 352 and 352H may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, EE 316, and M 408D or 408M
Computer architecture and organizational issues; structural and behavioral characteristics of system components. Processor, memory hierarchy, and input/output issues. Evaluation of design alternatives. The relationship between hardware and software. CS 352 and 352H may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, EE 316, and M 408D or 408M; and consent of the honors director.
A survey of the theoretical bases of computation: computational complexity (including the classes P and NP) and formal models of the semantics of programming languages. Three lecture hours a week for once semester. Prerequisite: CS 341 or 341H with a grade of at least C.
Introduction to techniques for human-machine communication through imagery. Topics include display hardware, transformations, interactive techniques, geometric modeling, two- and three-dimensional display algorithms, graphics software systems architecture, and hidden-line and surface elimination. Projects are assigned and in-depth exploration is encouraged. Three lecture hours a week for once semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, M 408D or 408M, and M 341 or 340L.
Introduction to computer networks, including common terminology, basic design issues, and types of networks and protocols.Three lecture hours a week for once semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M; and credit with a grade of at least C or registration for CS 352 or 352H.
Algorithmic paradigms: divide and conquer, greedy algorithms, dynamic programming, branch and bound. NP-completeness and topics selected from the following: cryptography algorithms, approximation algorithms, randomized algorithms, parallel algorithms, lower bounds. Three lecture hours a week for once semester. CS 357 and 357H may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, 337 or 337H, and M 408D or 408M.
Algorithmic paradigms: divide adn conquer, greedy algorithms, dynamic programming, branch and bound. NP-completeness and topics selected from the following: cryptography algorithms, parallel algorithms, lower bounds. Three lecture hours a week for one semester. CS 357 and 357H may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, 337 or 337H, and M 408D or 408M; and consent of the honors director.
Computer security, both in the abstract and in the context of real systems, including recognizing potential threats to confidentiality, integrity and availability, and developing familiarity with current security-related issues in computer science. Three lecture hours a week for one semester. CS 361 and 378 (Topic: Introduction to Security) may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M.
Topics include systems of linear equations, numerical integration, ordinary differential equations, and nonlinear equations. Construction and use of large numerical systems. Influence of data representation and computer architecture on algorithm choice and development. Three lecture hours a week for one semester. Only one of the following may be counted: CS 367, M 368K, PHY 329. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, M 408D or 408M, and M 341 or 340L.
Introduction to performance modeling, with emphasis on computer systems. Modeling methodology, queueing network models, simulation, analysis of results. Three lecture hours a week for one semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 362K.
Supervised study of selected problems in computer sciences, by individual arrangement with supervising instructor. The equivalent of three lecture hours a week for one semester. No more than three semester hours may be counted toward a degree in computer science. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M; and consent of the undergraduate adviser.
Models, principles, and fundamental protocols, including event ordering and global predicate detection, atomic commit, state-machine replication, rollback recovery, primary backup, consensus for synchronous and asynchronous systems, and byzantine fault-tolerance. Three lecture horus a week for one semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, 372 or 372H, and M 408D or 408M.
Programming using class derivation, inheritance, and dynamic polymorphism. Application of a simple object-oriented design methodology to several software development problems. Three lecture horus a week for one semester. CS 371P and 378 (Topic: Object-Oriented Design and Programming) may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, 337 or 337H, and M 408D or 408M.
Introduction to traditional and recent methodologies for indexing, processing, querying, and classifying unstructured and semistructured textual data, including hypertext and World-Wide Web documents. Three lecture horus a week for one semester. CS 371R and 378 (Topic: INtelligent Information Retrieval and Web Search ) may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M.
Object-oriented formulations of software systems as executable specifications, object-oriented analysis, design of software architectures, translation of high-level specification systems. Three lecture horus a week for one semester. CS 371S and 378 (Topic: Object-Oriented Software Engineering) may not both be counted. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M.
Basic concepts of operating systems: concurrent process management, virtual memory, file systems, scheduling, and protection. Three lecture horus a week for one semester. CS 372 and 372H may not both be counted. Prerequisite: CS 337 or 337H, and 352 or 352H with a grade of at least C in each.
Basic concepts of operating systems: concurrent process management, virtual memory, file systems, scheduling, and protection. Three lecture horus a week for one semester. CS 372 and 372H may not both be counted. Prerequisite: CS 337 or 337H, and 352 or 352H with a grade of at least C in each; and consent of the honors director.
Introduction to current knowledge, techniques, and theories in large software system design and development. Three lecture horus a week for one semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M.
Formal description of languages, lexical analysis, syntax analysis, syntax-directed translation, run-time system management, code generation, code optimization, compiler-building tools. Three lecture horus a week for one semester. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M. CS 341 or 341H and 345 or 345H are recommended.
Models of parallel computation, fundamental concepts for representation of parallel computation structures, study of representative parallel programming systems, programming of parallel algorithms and computations. Three lecture horus a week for one semester. Prerequisite: CS 345 or 345H with a grade of at least C.
One or three lecture hours a week for one semester. May be repeated for credit when the topics vary. Only one of the following may be counted unless the topics vary: CS 178, 378, 178H, 378H. Prerequisite: Upper-division standing. Additional prerequisites vary with the topic and are given in the Course Schedule.
One or three lecture hours a week for one semester. May be repeated for credit when the topics vary. Only one of the following may be counted unless the topics vary: CS 178, 378, 178H, 378H. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D; and consent of the honors director.
Directed reading, research, and/or projects in areas of computer sciences, under supervision of a faculty member, leading to an honors thesis. The thesis must be approved by a committee of three readers. The equivalent of three lecture hours a week for one semester, by arrangement with a faculty member. Prerequisite: The following courses, with a grade of at least C in each: CS 310 or 310H, 336 or 336H, and M 408D or 408M; nine additional semester hours of upper-division coursework in computer sciences, with a grade of at least C in each course; and consent of the student's research supervisor and the departmental honors advisor.
