This is an archived copy of the 2012-14 catalog. To access the most recent version of the catalog, please visit http://catalog.utexas.edu/.

Department of Computer Science

An undergraduate may not enroll in any computer science course more than once without written consent of an undergraduate adviser in computer science. No student may enroll in any computer science course more than twice. No student may take more than three upper-division computer science courses in a semester without written consent of an undergraduate adviser in computer science.

The information in parentheses after a course number is the Texas Common Course Numbering (TCCN) designation. Only TCCN designations that are exact semester-hour equivalents of University courses are listed here. Additional TCCN information is given in Appendix A.

Computer Science: C S

Lower-Division Courses

C S 301K. Foundations of Logical Thought.

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.

C S 302. Computer Fluency.

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 or two lecture hours and one discussion hour a week for one semester. Credit for Computer Science 302 may not be earned after a student has received credit for Computer Science 303E, 305J, 307, 312, 312H, 314, or 314H. May not be counted toward a degree in computer science.

C S 303E. Elements of Computers and Programming.

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 or two lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: Computer Science 303E, 305J, 312, 312H. Credit for Computer Science 303E may not be earned after a student has received credit for Computer Science 307, 314, or 314H.

C S 105. Computer Programming.

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: Computer Sciences 307, 313E, 314, 314H, or Electrical Engineering 422C (or 322C), with a grade of at least C-.

C S 305J. Introduction to Computing.

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. Only one of the following may be counted: Computer Science 303E, 305J, 312, 312H. Credit for Computer Science 305J may not be earned after a student has received credit for Computer Science 307, 314, or 314H. Prerequisite: Some knowledge of and experience in computer programming; and credit with a grade of at least C- or registration for Mathematics 305G, or equivalent score on the SAT Mathematics Level 1 or Level 2 test.

C S 307. Foundations of Computer Science.

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. Only one of the following may be counted: Computer Science 307, 314, 314H. Prerequisite: Credit or registration for Mathematics 408C, 408K, or 408N, or a score of at least 520 on the SAT Mathematics Level 1 or Level 2 test; and one of the following: one year of programming in high school, Computer Science 303E or 305J with a grade of at least C-, consent of instructor.

C S 108. Software Systems.

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: Computer Science 307, 313E, 314, 314H, or Electrical Engineering 422C (or 322C), with a grade of at least C-.

C S 109, 209, 309. Topics in Computer Science.

For each semester hour of credit earned, one lecture hour a week for one semester. Some sections are offered on the pass/fail basis only. May be repeated for credit when the topics vary. Prerequisite: Varies with the topic.

C S 310. Computer Organization and Programming.

Basic computer organization; machine representation of instructions and data; hardware/software interface. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: Computer Science 310, 310H, 429, 429H. Prerequisite: Computer Science 307 with a grade of at least C-.

C S 310H. Computer Organization and Programming: Honors.

C S 312. Introduction to Programming.

First part of a two-part sequence in Java programming. Fundamental concepts of structured programming; procedures and data structures with a focus on problem solving strategies and implementation; introduction to concepts of informal specification, informal reasoning about program behavior, debugging, and ad hoc testing. Three lecture hours and one discussion hour a week for one semester. Only one of the following courses may be counted: Computer Science 303E, 305J, 312, 312H. Credit for Computer Science 312 may not be earned after a student has received credit for Computer Science 314 or 314H. Prerequisite: Credit with a grade of at least C- or registration for Mathematics 305G, or a score of 70 on the ALEKS placement examination.

C S 312H. Introduction to Programming: Honors.

Restricted to computer science majors. First part of a two-part sequence in Java programming. Fundamental concepts of structured programming; procedures and data structures with a focus on problem solving strategies and implementation; introduction to concepts of informal specification, informal reasoning about program behavior, debugging, and ad hoc testing. Three lecture hours and one discussion hour a week for one semester. Only one of the following courses may be counted: Computer Science 303E, 305J, 312, 312H. Credit for Computer Science 312H may not be earned after a student has received credit for Computer Science 314 or 314H. Prerequisite: Credit with a grade of at least C- or registration for Mathematics 305G, or a score of 70 on the ALEKS placement examination; and consent of the honors director.

C S 313E. Elements of Software Design.

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 science. Prerequisite: Computer Science 303E, 305J, 312, or 312H with a grade of at least C-.

C S 313H. Logic, Sets, and Functions: Honors.

Propositional and predicate logic; proof techniques, including induction, sets, relations, and functions. Introduction to the 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: Computer Science 313H, 313K, Philosophy 313, 313K, 313Q. Prerequisite: Consent of the honors director.

C S 313K. Logic, Sets, and Functions.

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: Computer Science 313H, 313K, Philosophy 313, 313K, 313Q. Prerequisite: Credit or registration for Mathematics 408C, 408K, or 408N.

C S 314. Data Structures.

Second part of a two-part sequence in Java programming. Introduction to specifications, simple unity testing, and debugging; building and using canonical data structures; algorithm analysis and reasoning techniques such as assertions and invariants. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: Computer Science 307, 314, 314H. Only one of the following may be counted: Computer Science 314, 314H, 315, 315H. Prerequisite: Computer Science 312 or 312H with a grade of at least C-.

C S 314H. Data Structures: Honors.

C S 315. Algorithms and Data Structures.

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; and multithreaded programs. Three lecture hours and one laboratory hour a week for one semester. Only one of the following may be counted: Computer Science 314, 314H, 315, 315H. Prerequisite: Computer Science 307 with a grade of at least C-, and credit or registration for Computer Science 313K.

C S 315H. Algorithms and Data Structures: Honors.

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; and multithreaded programs. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: Computer Science 314, 314H, 315, 315H. Prerequisite: Consent of the honors director.

C S 119S, 219S, 319S, 419S, 519S, 619S, 719S, 819S, 919S. Topics in Computer Science.

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 Science. 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.

Upper-Division Courses

C S 120N, 220N, 320N. Topics in Computer Science for Nonmajors.

For each semester hour of credit earned, one lecture hour a week for one semester. May not be counted toward a degree in computer science. May be repeated for credit when the topics vary. Prerequisite: Varies with the topic and is given in the Course Schedule.

C S 321H. Functional and Symbolic Programming: Honors.

Introduction to functional and symbolic programming and to the use of these concepts throughout computer science. Three lecture hours a week for one semester. Prerequisite: Credit with a grade of at least C- or registration for Computer Science 337 or 337H, and consent of the honors director.

C S 323E. Elements of Scientific Computing.

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 hours a week for one semester. May not be counted toward a degree in computer science. Computer Science 323E and 323H may not both be counted. Prerequisite: Computer Science 303E or the equivalent; Mathematics 408C, 408K, or 408N; Mathematics 408D, 408M, or 427L; and credit with a grade of at least C- or registration for Mathematics 341 or 340L.

C S 323H. Elements of Scientific Computing: Honors.

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 hours a week for one semester. May not be counted toward a degree in computer science. Computer Science 323E and 323H may not both be counted. Prerequisite: Computer Science 303E, 305J, or 307; Mathematics 408D, 408M, or 427L; credit with a grade of at least C- or registration for Mathematics 341 or 340L; and consent of the honors director.

C S 324E. Elements of Graphics and Visualization.

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 science. Prerequisite: Computer Science 307, 313E, 314, 314H, or Electrical Engineering 422C (or 322C) with a grade of at least C-.

C S 326E. Elements of Networking.

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 science. Prerequisite: Computer Science 307, 313E, 314, 314H, or Electrical Engineering 422C (or 322C) with a grade of at least C-.

C S 327E. Elements of Databases.

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. Three lecture hours a week for one semester. May not be counted toward a degree in computer science. Prerequisite: Computer Science 307, 313E, 314, 314H, or Electrical Engineering 422C (or 322C) with a grade of at least C-.

C S 429. Computer Organization and Architecture.

Restricted to computer science majors. An introduction to low-level computer design ranging from the basics of digital design to the hardware/software interface for application programs. Includes basic systems principles of pipelining and caching, and requires writing and understanding programs at multiple levels. Four lecture hours and two laboratory hours a week for one semester. Only one of the following may be counted: Computer Science 310, 310H, 429, 429H. Prerequisite: Computer Science 314 or 314H with a grade of at least C-.

C S 329E. Topics in Elements of Computing.

Three lecture hours a week for one semester. May not be counted toward a degree in computer science. May be repeated for credit when the topics vary. Prerequisite: Computer Science 303E or the equivalent with a grade of at least C-.

C S 429H. Computer Organization and Architecture: Honors.

C S 129S, 229S, 329S, 429S, 529S, 629S, 729S, 829S, 929S. Topics in Computer Science.

C S 329W. Cooperative Computer Science.

This course covers the work period of computer science 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: Computer Science 336 or 336H with a grade of at least C-, and consent of the undergraduate adviser.

C S 234. Technical Writing.

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. Computer Science 234 and 178 (Topic: Technical Writing) may not both be counted. May not be counted toward the number of hours in computer science required for the Bachelor of Science in Computer Science degree. Prerequisite: Computer Science 310, 310H, 429, or 429H with a grade of at least C-.

C S 336. Analysis of Programs.

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. Computer Science 336 and 336H may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 313H or 313K; 314, 314H, 315, or 315H; and Mathematics 408C, 408L, or 408S.

C S 336H. Analysis of Programs: Honors.

A survey of mathematical techniques useful in the analysis and verification of programs. Three lecture hours a week for one semester. Computer Science 336 and 336H may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 313H or 313K; 314, 314H, 315, or 315H; Mathematics 408C, 408L, or 408S; and consent of the honors director.

C S 337. Theory in Programming Practice.

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. Computer Science 337 and 337H may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 314, 314H, 315, or 315H; 336 or 336H; and Mathematics 408C, 408L, or 408S.

C S 337H. Theory in Programming Practice: Honors.

C S 439. Principles of Computer Systems.

Restricted to computer science majors. An introduction to low-level software abstractions with an emphasis on the connection of these abstractions to underlying computer hardware. Key abstractions include threads, dynamic memory allocation, protection, and IO. Requires writing of synchronized multithreaded programs. Four lecture hours and two laboratory hours a week for one semester. Only one of the following may be counted: Computer Science 439, 439H, 352, 352H. Only one of the following may be counted: Computer Science 439, 439H, 372, 372H. Prerequisite: Computer Science 429 or 429H with a grade of at least C-.

C S 439H. Principles of Computer Systems: Honors.

Restricted to computer science majors. An introduction to low-level software abstractions with an emphasis on the connection of these abstractions to underlying computer hardware. Key abstractions include threads, dynamic memory allocation, protection, and IO. Requires writing of synchronized multi-threaded programs. Four lecture hours and two laboratory hours a week for one semester. Only one of the following may be counted: Computer Science 439, 439H, 352, 352H. Only one of the following may be counted: Computer Science 439, 439H, 372, 372H. Prerequisite: Computer Science 429 or 429H with a grade of at least C-, and consent of the honors director.

C S 341. Automata Theory.

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: Computer Science 341, 341H, Linguistics 340. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429 or 429H; 336 or 336H; 337 or 337H; and Mathematics 408D, 408M, or 427L.

C S 341H. Automata Theory: Honors.

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: Computer Science 341, 341H, Linguistics 340. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; 337 or 337H; Mathematics 408D, 408M, or 427L; and consent of the honors director.

C S 342. Neural Networks.

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 coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 343. Artificial Intelligence.

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 coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 344M. Autonomous Multiagent Systems.

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. Computer Science 344M and 378 (Topic: Autonomous Multiagent Systems) may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 344R. Robotics.

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. Computer Science 344R and 378 (Topic: Robotics) may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 345. Programming Languages.

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. Computer Science 345 and 345H may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 345H. Programming Languages: Honors.

C S 346. Cryptography.

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. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; 337 or 337H; and Mathematics 408D, 408M, or 427L.

C S 347. Data Management.

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 coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 349. Contemporary Issues in Computer Science.

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, and philosophical issues. Three lecture hours a week for one semester. Computer Science 349 and 378 (Topic: Contemporary Issues in Computer Science) may not both be counted. Prerequisite: Computer Science 336 or 336H with a grade of at least C-.

C S 351. LISP and Symbolic Computation.

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 coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 352. Computer Systems Architecture.

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. Only one of the following may be counted: Computer Science 439, 439H, 352, 352H. Prerequisite: The following coursework with the grade of at least C- in each course: Computer Science 310 or 310H; 336 or 336H; Electrical Engineering 316; and Mathematics 408D, 408M, or 427L.

C S 352H. Computer Systems Architecture: Honors.

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. Only one of the following may be counted: Computer Science 439, 439H, 352, 352H. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310 or 310H; 336 or 336H; Electrical Engineering 316; Mathematics 408D, 408M, or 427L; and consent of the honors director.

C S 353. Theory of Computation.

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 one semester. Prerequisite: Computer Science 341 or 341H with a grade of at least C-.

C S 354. Computer Graphics.

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 one semester. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; and 340L or 341.

C S 356. Computer Networks.

Introduction to computer networks, including common terminology, basic design issues, and types of networks and protocols. Three lecture hours a week for one semester. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; and credit with a grade of at least C- or registration for Computer Science 352 or 352H.

C S 357. Algorithms.

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 one semester. Computer Science 357 and 357H may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; 337 or 337H; and Mathematics 408D, 408M, or 427L.

C S 357H. Algorithms: Honors.

C S 361. Introduction to Computer Security.

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. Computer Science 361 and 378 (Topic: Introduction to Security) may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 367. Numerical Methods.

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: Computer Science 367, Mathematics 368K, Physics 329. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; and 340L or 341.

C S 369. Systems Modeling.

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 coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 362K.

C S 370. Undergraduate Reading and Research.

Supervised study of selected problems in computer science, 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 coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; and consent of the undergraduate adviser.

C S 371D. Distributed Computing.

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 hours a week for one semester. Prerequisite: Computer Science 372 or 372H with a grade of at least C-, or consent of instructor.

C S 371P. Object-Oriented Programming.

Programming using class derivation, inheritance, and dynamic polymorphism. Application of a simple object-oriented design methodology to several software development problems. Three lecture hours a week for one semester. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; 337 or 337H; and Mathematics 408D, 408M, or 427L.

C S 371R. Information Retrieval and Web Search.

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 hours a week for one semester. Computer Sciences 371R and 378 (Topic: Intelligent Information Retrieval and Web Search) may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 371S. Object-Oriented Software Engineering.

Object-oriented formulations of software systems as executable specifications, object-oriented analysis, design of software architectures, translation of high-level specification systems. Three lecture hours a week for one semester. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 372. Introduction to Operating Systems.

Basic concepts of operating systems: concurrent process management, virtual memory, file systems, scheduling, and protection. Three lecture hours a week for one semester. Only one of the following may be counted: Computer Science 439, 439H, 372, 372H. Prerequisite: Computer Science 337 or 337H, and 352 or 352H, with a grade of at least C- in each.

C S 372H. Introduction to Operating Systems: Honors.

C S 373. Software Engineering.

Introduction to current knowledge, techniques, and theories in large software system design and development. Three lecture hours a week for one semester. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.

C S 375. Compilers.

Formal description of languages, lexical analysis, syntax analysis, syntax-directed translation, run-time system management, code generation, code optimization, compiler-building tools. Three lecture hours a week for one semester. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L. Computer Science 341 or 341H, and 345 or 345H are recommended.

C S 376. Computer Vision.

Explores computer vision, a discipline that develops methods that enable machines to interpret or analyze images and videos. Includes the study of image formation, feature detection, segmentation, multiple-view geometry, recognition and learning, and motion and tracking. Three lecture hours a week for one semester. Computer Science 376 and 378 (Topic: Computer Vision) may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Mathematics 408D or 408M; 340L; and 362K or Statistics and Scientific Computation 321.

C S 377. Principles and Applications of Parallel Programming.

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 hours a week for one semester. Prerequisite: Computer Science 345 or 345H with a grade of at least C-.

C S 178, 378. Undergraduate Topics in Computer Science.

One or three lecture hours a week for one semester. Only one of the following may be counted unless the topics vary: Computer Science 178, 378, 178H, 378H. May be repeated for credit when the topics vary. Prerequisite: Upper-division standing. Additional prerequisites vary with the topic and are given in the Course Schedule.

C S 178H, 378H. Undergraduate Topics in Computer Science: Honors.

One or three lecture hours a week for one semester. Only one of the following may be counted unless the topics vary: Computer Science 178, 378, 178H, 378H. May be repeated for credit when the topics vary. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; and consent of the honors director.

C S 379H. Computer Science Honors Thesis.

Directed reading, research, and/or projects in areas of computer science, 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 coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; nine additional semester hours of upper-division coursework in computer science; and consent of the student's research supervisor and the departmental honors adviser.