path: root/data/courses_test.json

[
  {
    "index": "CS 100",
    "name": "Computer Science Orientation",
    "description": "Introduction to Computer Science as a field and career for incoming first year and external transfer students in the computer science majors. Overview of the field and specific examples of problem areas and methods of solution.",
    "prerequisites": null
  },
  {
    "index": "CS 101",
    "name": "Intro Computing: Engrg & Sci",
    "description": "Fundamental principles, concepts, and methods of computing, with emphasis on applications in the physical sciences and engineering. Basic problem solving and programming techniques; fundamental algorithms and data structures; use of computers in solving engineering and scientific problems. Intended for engineering and science majors. Prerequisite: One of MATH 220 or MATH 221 or MATH 231 or MATH 241.",
    "prerequisites": "One of MATH 220 or MATH 221 or MATH 231 or MATH 241."
  },
  {
    "index": "CS 102",
    "name": "Little Bits to Big Ideas",
    "description": "Same as INFO 102. See INFO 102.",
    "prerequisites": null
  },
  {
    "index": "CS 105",
    "name": "Intro Computing: Non-Tech",
    "description": "Computing as an essential tool of academic and professional activities. Functions and interrelationships of computer system components: hardware, systems and applications software, and networks. Widely used application packages such as spreadsheets and databases. Concepts and practice of programming for the solution of simple problems in different application areas. Intended for non-science and non-engineering majors. Prerequisite: MATH 112.",
    "prerequisites": "MATH 112."
  },
  {
    "index": "CS 107",
    "name": "Data Science Discovery",
    "description": "Same as IS 107 and STAT 107. See STAT 107.",
    "prerequisites": null
  },
  {
    "index": "CS 124",
    "name": "Introduction to Computer Science I",
    "description": "Basic concepts in computing and fundamental techniques for solving computational problems. Intended as a first course for computer science majors and others with a deep interest in computing. Credit is not given for both CS 124 and CS 125. Prerequisite: Three years of high school mathematics or MATH 112.",
    "prerequisites": "Three years of high school mathematics or MATH 112."
  },
  {
    "index": "CS 125",
    "name": "Introduction to Computer Science",
    "description": "Basic concepts in computing and fundamental techniques for solving computational problems. Intended as a first course for computer science majors and others with a deep interest in computing. Credit is not given for both CS 125 and CS 124. Prerequisite: Three years of high school mathematics or MATH 112.",
    "prerequisites": "Three years of high school mathematics or MATH 112."
  },
  {
    "index": "CS 126",
    "name": "Software Design Studio",
    "description": "Fundamental principles and techniques of software development. Design, documentation, testing, and debugging software, with a significant emphasis on code review. Credit is not given for both CS 242 and CS 126. Prerequisite: CS 125. For majors only.",
    "prerequisites": "CS 125. For majors only."
  },
  {
    "index": "CS 128",
    "name": "Introduction to Computer Science II",
    "description": "Continuation of CS 124. More advanced concepts in computing and techniques and approaches for solving computational problems. Prerequisite: CS 124 or CS 125.",
    "prerequisites": "CS 124 or CS 125."
  },
  {
    "index": "CS 173",
    "name": "Discrete Structures",
    "description": "Discrete mathematical structures frequently encountered in the study of Computer Science. Sets, propositions, Boolean algebra, induction, recursion, relations, functions, and graphs. Credit is not given for both CS 173 and MATH 213. Prerequisite: One of CS 124, CS 125, ECE 220; one of MATH 220, MATH 221.",
    "prerequisites": "One of CS 124, CS 125, ECE 220; one of MATH 220, MATH 221."
  },
  {
    "index": "CS 196",
    "name": "First-Year Student Honors",
    "description": "Offered for honors credit in conjunction with other 100-level computer science courses taken concurrently. A special examination may be required for admission to this course. May be repeated if topics vary, for a maximum of 2 hours in the same semester and a maximum of 3 hours total. Prerequisite: Concurrent registration in another 100-level computer science course (see Schedule).",
    "prerequisites": "Concurrent registration in another 100-level computer science course (see Schedule)."
  },
  {
    "index": "CS 199",
    "name": "Undergraduate Open Seminar in Computer Science",
    "description": "Topics vary. Approved for Letter and S/U grading. May be repeated.",
    "prerequisites": null
  },
  {
    "index": "CS 210",
    "name": "Ethical & Professional Issues",
    "description": "Ethics for the computing profession. Ethical decision-making; licensing; intellectual property, freedom of information, and privacy. Credit is not given for both CS 210 and either CS 211 or ECE 316. Prerequisite: CS 225. Junior standing required.",
    "prerequisites": "CS 225. Junior standing required."
  },
  {
    "index": "CS 211",
    "name": "Ethical and Professional Conduct",
    "description": "Navigating the complex ethical and professional landscape of the computing professional: privacy, intellectual property, cybersecurity, and freedom of speech. Hands-on exercises, assignments, and discussions in which students analyze current events from perspectives in both philosophical and professional ethics. Writing professionally and technically in several writing assignments requiring peer review, workshops, and multiple rounds of editing and revising. Credit is not given for both CS 211 and CS 210 or ECE 316. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 222",
    "name": "Software Design Lab",
    "description": "Design and implementation of novel software solutions. Problem identification and definition; idea generation and evaluation; and software implementation, testing, and deployment. Emphasizes software development best practices—including framework selection, code review, documentation, appropriate library usage, project management, continuous integration and testing, and teamwork. Prerequisite: CS 128; credit or concurrent registration in CS 225. Restricted to majors in Computer Science undergraduate curricula only.",
    "prerequisites": "CS 128; credit or concurrent registration in CS 225. Restricted to majors in Computer Science undergraduate curricula only."
  },
  {
    "index": "CS 225",
    "name": "Data Structures",
    "description": "Data abstractions: elementary data structures (lists, stacks, queues, and trees) and their implementation using an object-oriented programming language. Solutions to a variety of computational problems such as search on graphs and trees. Elementary analysis of algorithms. Credit is not given for CS 277 if credit for CS 225 has been earned. Prerequisite: CS 126 or CS 128 or ECE 220; One of CS 173, CS 413, MATH 213, MATH 347, MATH 412, or MATH 413.",
    "prerequisites": "CS 126 or CS 128 or ECE 220; One of CS 173, CS 413, MATH 213, MATH 347, MATH 412, or MATH 413."
  },
  {
    "index": "CS 233",
    "name": "Computer Architecture",
    "description": "Fundamentals of computer architecture: digital logic design, working up from the logic gate level to understand the function of a simple computer; machine-level programming to understand implementation of high-level languages; performance models of modern computer architectures to enable performance optimization of software; hardware primitives for parallelism and security. Prerequisite: CS 125 or CS 128; CS 173 or MATH 213; credit or concurrent enrollment in CS 225.",
    "prerequisites": "CS 125 or CS 128; CS 173 or MATH 213; credit or concurrent enrollment in CS 225."
  },
  {
    "index": "CS 242",
    "name": "Programming Studio",
    "description": "Intensive programming lab intended to strengthen skills in programming. Prerequisite: CS 241.",
    "prerequisites": "CS 241."
  },
  {
    "index": "CS 265",
    "name": "Innovation Illinois: From Accessible Design to Supercomputing Cultures",
    "description": "Same as IS 265 and MACS 265. See MACS 265.",
    "prerequisites": null
  },
  {
    "index": "CS 266",
    "name": "Community Innovation",
    "description": "Same as IS 266 and MACS 266. See IS 266.",
    "prerequisites": null
  },
  {
    "index": "CS 277",
    "name": "Algorithms and Data Structures for Data Science",
    "description": "Introduction to elementary concepts in algorithms and classical data structures with a focus on their applications in Data Science. Topics include algorithm analysis (ex: Big-O notation), elementary data structures (ex: lists, stacks, queues, trees, and graphs), basics of discrete algorithm design principles (ex: greedy, divide and conquer, dynamic programming), and discussion of discrete and continuous optimization. Credit is not given for CS 277 if credit for CS 225 is earned. Prerequisite: STAT 207; one of MATH 220, MATH 221, MATH 234. CS 277 cannot be taken concurrently with CS 225.",
    "prerequisites": "STAT 207; one of MATH 220, MATH 221, MATH 234. CS 277 cannot be taken concurrently with CS 225."
  },
  {
    "index": "CS 296",
    "name": "Honors Course",
    "description": "Group projects for honors credit in computer science. Sections of this course are offered in conjunction with other 200-level computer science courses taken concurrently. A special examination may be required for admission to this course. May be repeated. Prerequisite: Concurrent registration in another 200-level computer science course (see Schedule).",
    "prerequisites": "Concurrent registration in another 200-level computer science course (see Schedule)."
  },
  {
    "index": "CS 307",
    "name": "Modeling and Learning in Data Science",
    "description": "Introduction to the use of classical approaches in data modeling and machine learning in the context of solving data-centric problems. A broad coverage of fundamental models is presented, including linear models, unsupervised learning, supervised learning, and deep learning. A significant emphasis is placed on the application of the models in Python and the interpretability of the results. Prerequisite: STAT 207; one of MATH 225, MATH 227, MATH 257, MATH 415, MATH 416, ASRM 406.",
    "prerequisites": "STAT 207; one of MATH 225, MATH 227, MATH 257, MATH 415, MATH 416, ASRM 406."
  },
  {
    "index": "CS 340",
    "name": "Introduction to Computer Systems",
    "description": "Basics of computer systems. Number representations, assembly/machine language, abstract models of processors (fetch/execute, memory hierarchy), processes/process control, simple memory management, file I/O and directories, network programming, usage of cloud services. Credit is not given for both CS 340 and CS 240. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 341",
    "name": "System Programming",
    "description": "Basics of system programming, including POSIX processes, process control, inter-process communication, synchronization, signals, simple memory management, file I/O and directories, shell programming, socket network programming, RPC programming in distributed systems, basic security mechanisms, and standard tools for systems programming such as debugging tools. Credit is not given for both CS 341 and either CS 241 or ECE 391. Prerequisite: CS 225 and CS 233.",
    "prerequisites": "CS 225 and CS 233."
  },
  {
    "index": "CS 357",
    "name": "Numerical Methods I",
    "description": "Fundamentals of numerical methods for students in science and engineering; floating-point computation, systems of linear equations, approximation of functions and integrals, the single nonlinear equation, and the numerical solution of ordinary differential equations; various applications in science and engineering; programming exercises and use of high quality mathematical library routines. Same as MATH 357. Credit is not given towards graduation for CS 357 if credit for CS 450 has been earned. (Counts for advanced hours in LAS). Prerequisite: One of CS 101, CS 105, CS 124, CS 125 or ECE 220; MATH 241; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210.",
    "prerequisites": "One of CS 101, CS 105, CS 124, CS 125 or ECE 220; MATH 241; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210."
  },
  {
    "index": "CS 361",
    "name": "Probability & Statistics for Computer Science",
    "description": "Introduction to probability theory and statistics with applications to computer science. Topics include: visualizing datasets, summarizing data, basic descriptive statistics, conditional probability, independence, Bayes theorem, random variables, joint and conditional distributions, expectation, variance and covariance, central limit theorem. Markov inequality, Chebyshev inequality, law of large numbers, Markov chains, simulation, the PageRank algorithm, populations and sampling, sample mean, standard error, maximum likelihood estimation, Bayes estimation, hypothesis testing, confidence intervals, linear regression, principal component analysis, classification, and decision trees. Same as STAT 361. Credit is not given for both CS 361 and ECE 313. Prerequisite: MATH 220 or MATH 221; credit or concurrent registration in one of MATH 225, MATH 257, MATH 415, MATH 416 or ASRM 406. For majors only.",
    "prerequisites": "MATH 220 or MATH 221; credit or concurrent registration in one of MATH 225, MATH 257, MATH 415, MATH 416 or ASRM 406. For majors only."
  },
  {
    "index": "CS 374",
    "name": "Introduction to Algorithms & Models of Computation",
    "description": "Analysis of algorithms, major paradigms of algorithm design including recursive algorithms, divide-and-conquer algorithms, dynamic programming, greedy algorithms, and graph algorithms. Formal models of computation including finite automata and Turing machines. Limitations of computation arising from fundamental notions of algorithm and from complexity-theoretic constraints. Reductions, undecidability and NP-completeness. Same as ECE 374. Prerequisite: One of CS 173, MATH 213; CS 225.",
    "prerequisites": "One of CS 173, MATH 213; CS 225."
  },
  {
    "index": "CS 397",
    "name": "Individual Study",
    "description": "May be repeated. Prerequisite: Consent of instructor.",
    "prerequisites": "Consent of instructor."
  },
  {
    "index": "CS 398",
    "name": "Special Topics",
    "description": "Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. May be repeated in the same or separate terms if topics vary.",
    "prerequisites": null
  },
  {
    "index": "CS 400",
    "name": "Accelerated Fundamentals of Computing I",
    "description": "The first class in a sequence of two classes that introduces students to the basic concepts in computing with an emphasis on the fundamental techniques for solving computational problems. Topics include: core programming concepts (variables, data types, conditional expressions, loops, functions), basic data structures, searching and sorting algorithms, and data exploration and visualization. No prior programming experience is required. No undergraduate credit. 3 graduate hours. Prerequisite: Current enrollment in the Illinois Computing Accelerator for Non-specialists (iCAN) program or consent of instructor. Restricted to post-baccalaureate students with a non-computing background.",
    "prerequisites": "Current enrollment in the Illinois Computing Accelerator for Non-specialists (iCAN) program or consent of instructor. Restricted to post-baccalaureate students with a non-computing background."
  },
  {
    "index": "CS 401",
    "name": "Accelerated Fundamentals of Algorithms I",
    "description": "The first class in a sequence of two classes that introduces students to the theoretical foundations of computer science. Topics include counting, sets, functions, decision trees, recursion, binary numbers, basic graph theory, depth first search and breadth first search, algorithms for computing shortest paths, data structures like stacks and queues, big O notation and asymptotic analysis, complexity classes like P and NP, and reductions. No undergraduate credit. 3 graduate hours. Prerequisite: Current enrollment in the Illinois Computing Accelerator for Non-specialists (iCAN) program or consent of instructor. Restricted to post- baccalaureate students with a non-computing background.",
    "prerequisites": "Current enrollment in the Illinois Computing Accelerator for Non-specialists (iCAN) program or consent of instructor. Restricted to post- baccalaureate students with a non-computing background."
  },
  {
    "index": "CS 402",
    "name": "Accelerated Fundamentals of Computing II",
    "description": "Provides an accelerated introduction to class-based program design and the design of abstractions that support the design of reusable software and libraries. It reviews typical object-oriented concepts such as information hiding, encapsulation, polymorphism, inheritance, composition, and common design patterns. The course will also covers exception handling, database programming, and concurrent programming. No undergraduate credit. 3 graduate hours. Prerequisite: CS 400 or consent of instructor. Current enrollment in the Illinois Computing Accelerator for Non-specialists (iCAN) program or consent of instructor. Restricted to post-baccalaureate students with a non-computing background.",
    "prerequisites": "CS 400 or consent of instructor. Current enrollment in the Illinois Computing Accelerator for Non-specialists (iCAN) program or consent of instructor. Restricted to post-baccalaureate students with a non-computing background."
  },
  {
    "index": "CS 403",
    "name": "Accelerated Fundamentals of Algorithms II",
    "description": "The second class in a sequence of two classes that introduces students to the theoretical foundations of computer science. Topics include major paradigms of algorithm design divide and conquer, greedy, recursive, and dynamic programming; solving recurrences and analysis of divide and conquer algorithms; graph algorithms; formal models of computations like finite state automata and Turing machines; reductions. No undergraduate credit. 3 graduate hours. Prerequisite: CS 401 or consent of instructor. Current enrollment in the Illinois Computing Accelerator for Non-specialists (iCAN) program or consent of instructor. Restricted to post-baccalaureate students with a non-computing background.",
    "prerequisites": "CS 401 or consent of instructor. Current enrollment in the Illinois Computing Accelerator for Non-specialists (iCAN) program or consent of instructor. Restricted to post-baccalaureate students with a non-computing background."
  },
  {
    "index": "CS 407",
    "name": "Cryptography",
    "description": "Same as ECE 407. See ECE 407.",
    "prerequisites": null
  },
  {
    "index": "CS 409",
    "name": "The Art of Web Programming",
    "description": "Client- and server-side technologies that enable modern Web applications. Topics include the building blocks of the Web (browsers, HTML, CSS, JavaScript) and data exchange (HTTP, AJAX, JSON, REST). Assignments expose students to full-stack web development, and JavaScript frameworks that scaffold MVC architectures and event-driven, asynchronous programming. The course culminates in a final project, where students work in teams to design and develop an original, database-backed web application. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 410",
    "name": "Text Information Systems",
    "description": "Theory, design, and implementation of text-based information systems. Text analysis, retrieval models (e.g., Boolean, vector space, probabilistic), text categorization, text filtering, clustering, retrieval system design and implementation, and applications to web information management. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 411",
    "name": "Database Systems",
    "description": "Examination of the logical organization of databases: the entity-relationship model; the hierarchical, network, and relational data models and their languages. Functional dependencies and normal forms. Design, implementation, and optimization of query languages; security and integrity; concurrency control, and distributed database systems. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 412",
    "name": "Introduction to Data Mining",
    "description": "Concepts, techniques, and systems of data warehousing and data mining. Design and implementation of data warehouse and on-line analytical processing (OLAP) systems; data mining concepts, methods, systems, implementations, and applications. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 413",
    "name": "Intro to Combinatorics",
    "description": "Same as MATH 413. See MATH 413.",
    "prerequisites": null
  },
  {
    "index": "CS 414",
    "name": "Multimedia Systems",
    "description": "Organization and structure of modern multimedia systems; audio and video encoding; quality of service concepts; scheduling algorithms for multimedia within OS and networks multimedia protocols over high-speed networks; synchronization schemes, user-interface design; multimedia teleservices. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 240, CS 241, CS 340, CS 341 or ECE 391.",
    "prerequisites": "One of CS 240, CS 241, CS 340, CS 341 or ECE 391."
  },
  {
    "index": "CS 415",
    "name": "Game Development",
    "description": "A team and project-based course on the technical aspects of video game development and game engine internals: geometric modeling, game physics and AI, shader programming, real-time physically based rendering, and software engineering practices within the game industry. The central focus of the course is the development of a game by teams of 3 to 5 students. The course strongly emphasizes code development using a modern game engine. Students will gain skills necessary to develop games and to develop game engines. 3 undergraduate hours. 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 416",
    "name": "Data Visualization",
    "description": "Elements of databases, computer graphics and perceptual psychology combined to utilize the human visual system to improve user understanding of large datasets. Topics include appropriate and effective selection and construction of charts, organization of dashboards, and design for user engagement and interaction. 3 undergraduate hours. 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 417",
    "name": "Virtual Reality",
    "description": "Provides both a deep understanding of the fundamentals of virtual reality (VR) and practical experience implementing VR systems. Topics covered include visual and audio display technology, tracking, human perception and psychophysics, building user interfaces for VR, and analyzing VR experiences. 3 undergraduate hours. 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 418",
    "name": "Interactive Computer Graphics",
    "description": "Basic mathematical tools and computational techniques for modeling, rendering, and animating 3-D scenes. Same as CSE 427. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225; One of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210; MATH 241.",
    "prerequisites": "CS 225; One of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210; MATH 241."
  },
  {
    "index": "CS 419",
    "name": "Production Computer Graphics",
    "description": "Advanced methods for representing, displaying, and rendering two-, three-, and four-dimensional scenes. General algebraic curves and surfaces, splines, Gaussian and bump-function representation, fractals, particle systems, constructive solid geometry methods, lighting models, radiosity, advanced ray-tracing methods, surface texturing animation techniques, data visualization methods. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 418 or CSE 427.",
    "prerequisites": "CS 418 or CSE 427."
  },
  {
    "index": "CS 420",
    "name": "Parallel Progrmg: Sci & Engrg",
    "description": "Fundamental issues in design and development of parallel programs for various types of parallel computers. Various programming models according to both machine type and application area. Cost models, debugging, and performance evaluation of parallel programs with actual application examples. Same as CSE 402 and ECE 492. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 421",
    "name": "Programming Languages & Compilers",
    "description": "Structure of programming languages and their implementation. Basic language design principles; abstract data types; functional languages; type systems; object-oriented languages. Basics of lexing, parsing, syntax-directed translation, semantic analysis, and code generation. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 233, CS 240, CS 340 or ECE 391; CS 374 or ECE 374; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210.",
    "prerequisites": "One of CS 233, CS 240, CS 340 or ECE 391; CS 374 or ECE 374; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210."
  },
  {
    "index": "CS 422",
    "name": "Programming Language Design",
    "description": "Exploration of major language design paradigms using imperative and functional programming as unifying themes. Tools include both practical language processor construction and theoretical models. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 421.",
    "prerequisites": "CS 421."
  },
  {
    "index": "CS 423",
    "name": "Operating Systems Design",
    "description": "Organization and structure of modern operating systems and concurrent programming concepts. Deadlock, virtual memory, processor scheduling, and disk systems. Performance, security, and protection. Same as CSE 423. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, CS 341, or ECE 391.",
    "prerequisites": "One of CS 241, CS 341, or ECE 391."
  },
  {
    "index": "CS 424",
    "name": "Real-Time Systems",
    "description": "Supervisory control aspects of Cyber Physical Systems (CPS): fundamentals of reliability analysis, real-time scheduling, simple feedback control, software fault tolerance architecture, wireless networking and energy saving, principles of safety critical system engineering. Student groups design and demonstrate supervisory control architecture for a robot. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, CS 341 or ECE 391.",
    "prerequisites": "One of CS 241, CS 341 or ECE 391."
  },
  {
    "index": "CS 425",
    "name": "Distributed Systems",
    "description": "Protocols, specification techniques, global states and their determination, reliable broadcast, transactions and commitment, security, and real-time systems. Same as ECE 428. 3 or 4 undergraduate hours. 3 or 4 graduate hours. Prerequisite: Credit or concurrent enrollment in one of CS 240, CS 241, CS 340, CS 341 or ECE 391.",
    "prerequisites": "Credit or concurrent enrollment in one of CS 240, CS 241, CS 340, CS 341 or ECE 391."
  },
  {
    "index": "CS 426",
    "name": "Compiler Construction",
    "description": "Compiler structure, syntax analysis, syntax-directed translation, automatically constructed recognizers, semantic analysis, code generation, intermediate language, optimization techniques. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: Credit or concurrent enrollment in CS 421.",
    "prerequisites": "Credit or concurrent enrollment in CS 421."
  },
  {
    "index": "CS 427",
    "name": "Software Engineering I",
    "description": "Software process, analysis and design. Software development paradigms, system engineering, function-based analysis and design, and object-oriented analysis and design. Course will use team-projects for hands-on exercises. Same as CSE 426. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 222, CS 240, CS 241, CS 340, CS 341 or ECE 391.",
    "prerequisites": "One of CS 222, CS 240, CS 241, CS 340, CS 341 or ECE 391."
  },
  {
    "index": "CS 428",
    "name": "Software Engineering II",
    "description": "Continuation of CS 427. Software development, management, and maintenance. Project and configuration management, collaborative development models, software quality assurance, interoperability domain engineering and software reuse, and software re-engineering. Same as CSE 429. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 427 or CSE 426.",
    "prerequisites": "CS 427 or CSE 426."
  },
  {
    "index": "CS 429",
    "name": "Software Engineering II, ACP",
    "description": "Continuation of CS 427. Identical to CS 428 except for the additional writing component. See CS 428. 3 undergraduate hours. 3 graduate hours. Prerequisite: CS 427 or CSE 426.",
    "prerequisites": "CS 427 or CSE 426."
  },
  {
    "index": "CS 431",
    "name": "Embedded Systems",
    "description": "Students will learn embedded system architecture, Real-Time Operating Systems, and real-time software design and development techniques, including 1) real-time software designs, practical signal processing, and control techniques in embedded applications, including the safe use of machine learning, and 2) the schedulability analysis to ensure deadlines of tasks are met. In the lab, students will practice what they learn in the class so that their software can drive a two-wheeled robot car along a course and avoid obstacles autonomously. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, CS 341 or ECE 391.",
    "prerequisites": "One of CS 241, CS 341 or ECE 391."
  },
  {
    "index": "CS 433",
    "name": "Computer System Organization",
    "description": "Computer hardware design and analysis and interface with software. Advanced processor design, including superscalar, out-of-order issue, branch prediction, and speculation. Memory hierarchy design, including advanced cache optimizations, main memory, and virtual memory. Principles of multiprocessor design, including shared-memory, cache coherence, synchronization, and consistency. Other advanced topics depending on time; e.g., GPUs and accelerators, warehouse computers and data centers, security. Same as CSE 422. 3 undergraduate hours. 4 graduate hours. Prerequisite: CS 233.",
    "prerequisites": "CS 233."
  },
  {
    "index": "CS 434",
    "name": "Real World Algorithms for IoT and Data Science",
    "description": "Same as ECE 434. See ECE 434.",
    "prerequisites": null
  },
  {
    "index": "CS 435",
    "name": "Cloud Networking",
    "description": "Provides a foundational view of computer networks with a focus on enabling modern large-scale cloud computing. The first part of this course studies the principles upon which the Internet and other networks are built, and how those principles translate into deployed protocols. The second part covers how those principles are applied in network infrastructure for modern clouds, enabling deployment of virtual networks on shared infrastructure, efficient transfer of big data and low latency communication, and federation of applications across countries and continents. 3 undergraduate hours. 4 graduate hours. Credit is not given for both CS 435 and CS 438/ECE 438. Prerequisite: One of CS 240, CS 241, CS 340, CS 341 or ECE 391.",
    "prerequisites": "One of CS 240, CS 241, CS 340, CS 341 or ECE 391."
  },
  {
    "index": "CS 436",
    "name": "Computer Networking Laboratory",
    "description": "Design, application, analysis, and deployment of communication protocols and system software behind modern cloud/compute/network infrastructures. Students learn the internals of modern system infrastructures, including operating system networking kernels, cloud application service code, and firewall and router configuration. Students will gain experience with widely-used and production-grade code and systems, such as Cisco IOS, the Linux networking stack, and Amazon Web Services. This class links theory with practice to prepare students to confidently carry out tasks they will commonly encounter in industry, such as building an enterprise network, deploying a large-scale cloud service, or implementing a new network protocol. Same as ECE 435. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 240, CS 241, CS 340, CS 341 or ECE 391.",
    "prerequisites": "One of CS 240, CS 241, CS 340, CS 341 or ECE 391."
  },
  {
    "index": "CS 437",
    "name": "Topics in Internet of Things",
    "description": "Topics of networked embedded computing technology, known as the Internet of Things, in application, distributed, human-centric, or social contexts. The tight coupling between people, networking protocols, computing elements, and physical things in IoT systems presents unique challenges for data collection, processing in constrained computation and communication environments. Introduces general principles of IoT systems and protocol, offers broad foundations for IoT services, and allows specialization to pursue an in-depth understanding of selected IoT aspects or subtopics. 3 undergraduate hours. 4 graduate hours. May be repeated if topics vary. Credit towards a degree from multiple offerings of this course is not given if those offerings have significant overlap, as determined by the CS department. Prerequisite: CS 241 or CS 341. Additional prerequisites may be specified each term. See section information.",
    "prerequisites": "CS 241 or CS 341. Additional prerequisites may be specified each term. See section information."
  },
  {
    "index": "CS 438",
    "name": "Communication Networks",
    "description": "Layered architectures and the OSI Reference Model; design issues and protocols in the transport, network, and data link layers; architectures and control algorithms of local-area, point-to-point, and satellite networks; standards in networks access protocols; models of network interconnection; overview of networking and communication software. Same as ECE 438. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, CS 341 or ECE 391; strongly recommend one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400.",
    "prerequisites": "One of CS 241, CS 341 or ECE 391; strongly recommend one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400."
  },
  {
    "index": "CS 439",
    "name": "Wireless Networks",
    "description": "Same as ECE 439. See ECE 439.",
    "prerequisites": null
  },
  {
    "index": "CS 440",
    "name": "Artificial Intelligence",
    "description": "Major topics in and directions of research in artificial intelligence: basic problem solving techniques, knowledge representation and computer inference, machine learning, natural language understanding, computer vision, robotics, and societal impacts. Same as ECE 448. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463, STAT 400 or BIOE 310.",
    "prerequisites": "CS 225; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463, STAT 400 or BIOE 310."
  },
  {
    "index": "CS 441",
    "name": "Applied Machine Learning",
    "description": "Techniques of machine learning to various signal problems: regression, including linear regression, multiple regression, regression forest and nearest neighbors regression; classification with various methods, including logistic regression, support vector machines, nearest neighbors, simple boosting and decision forests; clustering with various methods, including basic agglomerative clustering and k-means; resampling methods, including cross-validation and the bootstrap; model selection methods, including AIC, stepwise selection and the lasso; hidden Markov models; model estimation in the presence of missing variables; and neural networks, including deep networks. The course will focus on tool-oriented and problem-oriented exposition. Application areas include computer vision, natural language, interpreting accelerometer data, and understanding audio data. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225 and CS 361.",
    "prerequisites": "CS 225 and CS 361."
  },
  {
    "index": "CS 442",
    "name": "Trustworthy Machine Learning",
    "description": "Prepares students to understand the security and privacy problems in machine learning and educates students to propose different attack strategies to identify the vulnerabilities of a range of learning algorithms and understand different defense approaches towards trustworthy machine learning systems. Students will explore topics including basic machine learning foundations (e.g., linear regression and PCA), adversarial attacks against different learning algorithms, differential privacy, data valuation, and different categories of defenses. The lessons are reinforced via a series of topic-driven lectures, coding assignments, related paper readings, exams and in-class discussions. Students will learn to analyze current interactions between attackers and defenders on machine learning and therefore develop an understanding of the principles on trustworthy machine learning which is an emerging and important topic. Students will be required to finish three related homework projects, including 1) developing a machine learning classifier, 2) designing adversarial attacks against the built classifier, and 3) developing defenses to improve the robustness of the trained classifier against designed attacks. Students registered for 4 credit hours will also finish a final project based on the class topics, demonstrating their ability to propose related new algorithms based on the class subjects. 3 undergraduate hours. 4 graduate hours. Prerequisite: CS 225; one of CS 440, ECE 448, CS 441, CS 446 or ECE 449; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210.",
    "prerequisites": "CS 225; one of CS 440, ECE 448, CS 441, CS 446 or ECE 449; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210."
  },
  {
    "index": "CS 443",
    "name": "Reinforcement Learning",
    "description": "Fundamental concepts and basic algorithms in Reinforcement Learning (RL) - a machine learning paradigm for sequential decision-making. The goal of this course is to enable students to (1) understand the mathematical framework of RL, (2) tell what problems can be solved with RL, and how to cast these problems into the RL formulation, (3) understand why and how RL algorithms are designed to work, and (4) know how to experimentally and mathematically evaluate the effectiveness of an RL algorithm. There will be both programming and written assignments. 3 undergraduate hours. 4 graduate hours. Prerequisite: CS 225; MATH 241; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400.",
    "prerequisites": "CS 225; MATH 241; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400."
  },
  {
    "index": "CS 444",
    "name": "Deep Learning for Computer Vision",
    "description": "Provides an elementary hands-on introduction to neural networks and deep learning with an emphasis on computer vision applications. Topics include: linear classifiers; multi-layer neural networks; back-propagation and stochastic gradient descent; convolutional neural networks and their applications to object detection and dense image labeling; recurrent neural networks and state-of-the-art sequence models like transformers; generative adversarial networks and variational autoencoders for image generation; and deep reinforcement learning. Coursework will consist of programming assignments in a common deep learning framework. Those registered for 4 credit hours will have to complete a project. 3 undergraduate hours. 4 graduate hours. Prerequisite: MATH 241; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210; CS 225 or equivalent; one of CS 361, ECE 313, MATH 461 or STAT 400. No previous exposure to machine learning is required.",
    "prerequisites": "MATH 241; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210; CS 225 or equivalent; one of CS 361, ECE 313, MATH 461 or STAT 400. No previous exposure to machine learning is required."
  },
  {
    "index": "CS 445",
    "name": "Computational Photography",
    "description": "Computer vision techniques to enhance, manipulate, and create media from photo collections, such as panoramic stitching, face morphing, texture synthesis, blending, and 3D reconstruction. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225, MATH 225, and MATH 231.",
    "prerequisites": "CS 225, MATH 225, and MATH 231."
  },
  {
    "index": "CS 446",
    "name": "Machine Learning",
    "description": "Principles and applications of machine learning. Main paradigms and techniques, including discriminative and generative methods, reinforcement learning: linear regression, logistic regression, support vector machines, deep nets, structured methods, dimensionality reduction, k-means, Gaussian mixtures, expectation maximization, Markov decision processes, and Q-learning. Application areas such as natural language and text understanding, speech recognition, computer vision, data mining, and adaptive computer systems, among others. Same as ECE 449. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225; One of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463, STAT 400 or BIOE 310.",
    "prerequisites": "CS 225; One of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463, STAT 400 or BIOE 310."
  },
  {
    "index": "CS 447",
    "name": "Natural Language Processing",
    "description": "Part-of-speech tagging, parsing, semantic analysis and machine translation. Relevant linguistics concepts from morphology (word formation) and lexical semantics (the meaning of words) to syntax (sentence structure) and compositional semantics (the meaning of sentences). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 173 or MATH 213; CS 225; CS 374 or ECE 374; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463, STAT 400 or BIOE 310; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210.",
    "prerequisites": "One of CS 173 or MATH 213; CS 225; CS 374 or ECE 374; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463, STAT 400 or BIOE 310; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210."
  },
  {
    "index": "CS 448",
    "name": "Audio Computing Laboratory",
    "description": "Computational foundations of modern audio applications: theory of audio processing for implementation of applications such as room and 3D/virtual audio rendering, pitch manipulations and autotuning, denoising for communications and forensics, audio classification, music information retrieval based on audio, rudimentary speech recognition, speech and audio coding, applications of machine learning to audio scene recognition, audio restoration, missing data recovery, and many more. This will be a lab-like course in which students collectively implement a variety of core audio operations that are commonplace today. Students will be required to bring to class their laptops and headphones to participate in lab exercises. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 240, CS 241, CS 340, CS 341, or ECE 391; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210.",
    "prerequisites": "One of CS 240, CS 241, CS 340, CS 341, or ECE 391; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210."
  },
  {
    "index": "CS 450",
    "name": "Numerical Analysis",
    "description": "Linear system solvers, optimization techniques, interpolation and approximation of functions, solving systems of nonlinear equations, eigenvalue problems, least squares, and quadrature; numerical handling of ordinary and partial differential equations. Same as CSE 401, ECE 491, and MATH 450. 3 undergraduate hours. 3 or 4 graduate hours. Credit is not given toward graduation for both CS 450 and CS 457. Prerequisite: One of CS 101, CS 124 or CS 125; one of CS 357, MATH 257, MATH 357, MATH 415, or MATH 416; MATH 285.",
    "prerequisites": "One of CS 101, CS 124 or CS 125; one of CS 357, MATH 257, MATH 357, MATH 415, or MATH 416; MATH 285."
  },
  {
    "index": "CS 460",
    "name": "Security Laboratory",
    "description": "Operating systems security: access control, least privilege mechanism and malware techniques. Network security: firewalls, sniffing, tunnels, intrusion detection, AAA and worm structure. System security: forensics security architectures, and attack/defend exercises. Complements CS 461 via hands-on project. Same as ECE 419. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 461 or ECE 422.",
    "prerequisites": "CS 461 or ECE 422."
  },
  {
    "index": "CS 461",
    "name": "Computer Security I",
    "description": "Fundamental principles of computer and communications security and information assurance: ethics, privacy, notions of threat, vulnerabilities, and risk in systems, information warfare, malicious software, data secrecy and integrity issues, network security, trusted computing, mandatory and discretionary access controls, certification and accreditation of systems against security standards. Security mechanisms: authentication, auditing, intrusion detection, access control, cryptography, security protocols, key distribution. Same as ECE 422. 4 undergraduate hours. 4 graduate hours. Prerequisite: One of CS 241, CS 341 or ECE 391, or a combination of CS 233 and CS 340.",
    "prerequisites": "One of CS 241, CS 341 or ECE 391, or a combination of CS 233 and CS 340."
  },
  {
    "index": "CS 463",
    "name": "Computer Security II",
    "description": "Program security, trusted base, privacy, anonymity, non-interference, information flow, confinement, advanced auditing, forensics, intrusion detection, key management and distribution, policy composition and analysis, formal approaches to specification and verification of secure systems and protocols, and topics in applied cryptography. Same as ECE 424. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 461. Recommended: CS 475.",
    "prerequisites": "CS 461. Recommended: CS 475."
  },
  {
    "index": "CS 464",
    "name": "Topics in Societal and Ethical Impacts of Computer Technology",
    "description": "Topics selected from key current areas of impact of computer technology on aspects of society and ethics such as: freedom versus the rule of law in cyberspace; social discourse; privacy; livelihoods and automation; fairness; security; political change; business models; technology divide. 3 undergraduate hours. No graduate credit. May be repeated if topics vary. Credit is not given towards a degree from multiple offerings of this course, if those offerings have significant overlap, as determined by the CS department. Prerequisite: CS 225. One of CS 210 or CS 211 or ECE 316 or PHIL 316. One of CS 361 or STAT 400 or STAT 200. Restricted to students with senior standing.",
    "prerequisites": "CS 225. One of CS 210 or CS 211 or ECE 316 or PHIL 316. One of CS 361 or STAT 400 or STAT 200. Restricted to students with senior standing."
  },
  {
    "index": "CS 465",
    "name": "User Interface Design",
    "description": "A project-focused course covering fundamental principles of user interface design, implementation, and evaluation. Small teams work on a term-long project that involves: analysis of the problem domain, user skills, and tasks; iterative prototyping of interfaces to address user needs; conducting several forms of evaluation such as cognitive walkthroughs and usability tests; implementation of the final prototype. Non-technical majors may enroll as non-programmers who participate in all aspects of the projects with the possible exception of implementation. 4 undergraduate hours. 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 466",
    "name": "Introduction to Bioinformatics",
    "description": "Algorithmic approaches in bioinformatics: (i) biological problems that can be solved computationally (e.g., discovering genes, and interactions among different genes and proteins); (ii) algorithmic techniques with wide applicability in solving these problems (e.g., dynamic programming and probabilistic methods); (iii) practical issues in translating the basic algorithmic ideas into accurate and efficient tools that biologists may use. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 467",
    "name": "Social Visualization",
    "description": "Visualizing social interaction in networked spaces: investigation of patterns in networked communications systems such as messaging (email, instant messaging), social networking sites and collaborative sites; social network theory and visualizations; exploration of how to move beyond existing visualization techniques; visualizing the network identity over compilations of online data. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225.",
    "prerequisites": "CS 225."
  },
  {
    "index": "CS 468",
    "name": "Tech and Advertising Campaigns",
    "description": "Same as ADV 492. See ADV 492.",
    "prerequisites": null
  },
  {
    "index": "CS 469",
    "name": "Computational Advertising Infrastructure",
    "description": "Thorough coverage of technologies including web-search, auctions, behavioral targeting, mechanisms for viral marketing, that underpin the display of advertisements on a variety of locations (e.g., ads on search engines; display ads). Students shall also learn about emerging areas in computational advertising including location-based adverting and algorithmic synthesis of personalized advertisements. Discussion around privacy will be a significant focus of the class. Same as ADV 462. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 173; CS 225; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400.",
    "prerequisites": "CS 173; CS 225; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406 or BIOE 210; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400."
  },
  {
    "index": "CS 470",
    "name": "Social and Information Networks",
    "description": "Social networks, auctions, and stock-markets appear to be very different phenomena, but they share a common foundation—the science of networks. The learning goal: to provide a broad, accessible introduction to the foundations of network science. We shall draw on ideas from mathematical sociology, and from game theory to understand strategic interaction over networks. We shall develop algorithms to identify network properties, and models for explaining network dynamics, including viral behavior. 3 undergraduate hours. 4 graduate hours. Prerequisite: CS 225; CS 173; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210.",
    "prerequisites": "CS 225; CS 173; one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400; one of MATH 225, MATH 257, MATH 415, MATH 416, ASRM 406, or BIOE 210."
  },
  {
    "index": "CS 473",
    "name": "Algorithms",
    "description": "Design and analysis techniques, approximation algorithms, randomized algorithms and amortized analysis, and advanced topics such as network flow, linear programming, and dynamic data structures, among others. Same as CSE 414 and MATH 473. 4 undergraduate hours. 4 graduate hours. Prerequisite: CS 374 or ECE 374, and one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400.",
    "prerequisites": "CS 374 or ECE 374, and one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400."
  },
  {
    "index": "CS 474",
    "name": "Logic in Computer Science",
    "description": "An introduction to mathematical logic from the perspective of computer science, emphasizing both computable aspects of logic, especially automated reasoning, as well as applications of logic to computer science in artificial intelligence, databases, formal methods, and theoretical computer science. Prepares students to use logic as a formal tool to solve problems in computer science and AI. Topics include: syntax, semantics and proofs for propositional and first order logic, the decidable logics and efficient realizations in terms of SAT/SMT solvers, decision and semi-decision procedures for first order logic and several first order logic theories, finite model theory and descriptive complexity. Additional topics include: connections between logic and machine learning, higher order logics, applications of logic to program verification, applications of logic in knowledge representation, proof complexity, modal and temporal logic, Courcelle’s theorem and its applications in parameterized complexity, logic and its role in automatic program synthesis, connections between logic and database query languages. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 173; CS 225; one of CS 374 or ECE 374.",
    "prerequisites": "CS 173; CS 225; one of CS 374 or ECE 374."
  },
  {
    "index": "CS 475",
    "name": "Formal Models of Computation",
    "description": "Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; linear-bounded automata and context-sensitive languages; computability and the halting problem; undecidable problems; recursive functions; Chomsky hierarchy; computational complexity. Same as MATH 475. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 374 or ECE 374.",
    "prerequisites": "CS 374 or ECE 374."
  },
  {
    "index": "CS 476",
    "name": "Program Verification",
    "description": "Formal methods for demonstrating correctness and other properties of programs. Invariant assertions; Hoare axiomatics; well-founded orderings for proving termination; structural induction; computational induction; data structures; parallel programs; overview of predicate calculus. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225; one of CS 374, ECE 374 or MATH 414.",
    "prerequisites": "CS 225; one of CS 374, ECE 374 or MATH 414."
  },
  {
    "index": "CS 477",
    "name": "Formal Software Development Methods",
    "description": "Mathematical models, languages, and methods for software specification, development, and verification. Same as ECE 478. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225; one of CS 374, ECE 374 or MATH 414.",
    "prerequisites": "CS 225; one of CS 374, ECE 374 or MATH 414."
  },
  {
    "index": "CS 481",
    "name": "Advanced Topics in Stochastic Processes & Applications",
    "description": "Same as IE 410. See IE 410.",
    "prerequisites": null
  },
  {
    "index": "CS 482",
    "name": "Simulation",
    "description": "Same as IE 413. See IE 413.",
    "prerequisites": null
  },
  {
    "index": "CS 483",
    "name": "Applied Parallel Programming",
    "description": "Same as CSE 408 and ECE 408. See ECE 408.",
    "prerequisites": null
  },
  {
    "index": "CS 484",
    "name": "Parallel Programming",
    "description": "Techniques for the programming of all classes of parallel computers and devices including shared memory and distributed memory multiprocessors, SIMD processors and co-processors, and special purpose devices. Key concepts in parallel programming such as reactive and transformational programming, speculation, speedup, isoefficiency, and load balancing. Synchronization primitives, libraries and languages for parallel programming such as OpenMP and MPI, performance monitoring, program tuning, analysis and programming of numerical and symbolic parallel algorithms. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 241 or CS 341.",
    "prerequisites": "CS 241 or CS 341."
  },
  {
    "index": "CS 491",
    "name": "Seminar",
    "description": "Seminar on topics of current interest as announced in the Class Schedule. 0 to 4 undergraduate hours. 0 to 4 graduate hours. Approved for S/U grading only. May be repeated in the same or separate terms if topics vary to a maximum of 4 hours. Prerequisite: As specified for each topic offering, see Class Schedule or departmental course description.",
    "prerequisites": "As specified for each topic offering, see Class Schedule or departmental course description."
  },
  {
    "index": "CS 492",
    "name": "Senior Project I",
    "description": "First part of a project course in computer science. Students work in teams to solve typical commercial or industrial problems. Work involves planning, design, and implementation. Extensive oral and written work is required both on-campus and possibly off-campus at sponsors' locations. CS 492 must be taken as a sequence with either CS 493 or CS 494. 3 undergraduate hours. No graduate credit. Credit is not given for both CS 492 and a project course in another engineering department for the same project. Prerequisite: For Computer Science majors with senior standing.",
    "prerequisites": "For Computer Science majors with senior standing."
  },
  {
    "index": "CS 493",
    "name": "Senior Project II, ACP",
    "description": "Continuation of CS 492. Identical to CS 494 except for an additional writing component. See CS 494. 3 undergraduate hours. No graduate credit. Credit is not given for both CS 493 and a project course in another engineering department for the same project. Prerequisite: CS 492.",
    "prerequisites": "CS 492."
  },
  {
    "index": "CS 494",
    "name": "Senior Project II",
    "description": "Continuation of CS 492. 3 undergraduate hours. No graduate credit. Credit is not given for both CS 494 and a project course in another engineering department for the same project. Prerequisite: CS 492.",
    "prerequisites": "CS 492."
  },
  {
    "index": "CS 497",
    "name": "CS Team Project",
    "description": "Student teams work with CS faculty to complete a significant project requiring advanced knowledge of CS principles. Project topics vary. 1 to 3 undergraduate hours. No graduate credit. May be repeated in the same term up to 6 hours, if topics vary; may be repeated in separate terms. Prerequisite: For majors only; junior or senior standing required.",
    "prerequisites": "For majors only; junior or senior standing required."
  },
  {
    "index": "CS 498",
    "name": "Special Topics",
    "description": "Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. 1 to 4 undergraduate hours. 1 to 4 graduate hours. May be repeated in the same or separate terms if topics vary.",
    "prerequisites": null
  },
  {
    "index": "CS 499",
    "name": "Senior Thesis",
    "description": "Research and thesis development experience in computer science under guidance of a faculty member. Literature search, oral presentation, analysis and implementation, paper preparation, and completion of a written thesis. 3 undergraduate hours. No graduate credit. May be repeated to a maximum of 6 hours. Prerequisite: Consent of instructor.",
    "prerequisites": "Consent of instructor."
  },
  {
    "index": "CS 500",
    "name": "Current Topics in Computing Education Research",
    "description": "Current research topics and theories in Computers and Education with an emphasis on learning theories such as constructivism, behaviorism, cognitivism, knowledge-in-pieces, test-potentiated learning, and transfer of learning. These theories will be applied to understanding how students learn computing topics such as programming and theoretical computing. These topics will be applied through the design of ethically responsible educational research studies. The course will culminate in students writing a research proposal or conference-style research paper based upon pilot data. 4 graduate hours. No professional credit. May be repeated if topics vary. Credit towards a degree from multiple offerings of this course is not given if those offerings have significant overlap, as determined by the CS department.",
    "prerequisites": null
  },
  {
    "index": "CS 507",
    "name": "Topics in Cryptography",
    "description": "Modern cryptography helps realize a variety of tasks: from computations on and proofs about secret data, to verifiably offloading computation to untrusted clients, to making programs unintelligible while preserving functionality, to testing untrusted quantum devices. Covers a selection of such cutting-edge topics in cryptography. We will understand how any adversary that counters the security of modern protocols can be transformed into an adversary that contradicts basic mathematical assumptions. We will understand key ideas in recent cryptography research and identify new directions and problems for the future. 4 graduate hours. No professional credit. May be repeated, up to 8 hours in a single term, to a total of 16 graduate hours, if topics vary. Credit is not given towards a degree from multiple offerings of this course if those offerings have significant overlap, as determined by the CS department. Prerequisite: Offerings in separate semesters may specify additional prerequisites each term, depending on the specific topic offered. See section information for additional details.",
    "prerequisites": "Offerings in separate semesters may specify additional prerequisites each term, depending on the specific topic offered. See section information for additional details."
  },
  {
    "index": "CS 508",
    "name": "Manycore Parallel Algorithms",
    "description": "Same as ECE 508. See ECE 508.",
    "prerequisites": null
  },
  {
    "index": "CS 510",
    "name": "Advanced Information Retrieval",
    "description": "Advanced concepts, models, and algorithms in information retrieval and major recent developments in the field, including historical milestones in information retrieval research, evaluation methodology, vector space retrieval model, probabilistic retrieval models, learning to rank algorithms, probabilistic topic models, information retrieval systems, text analytics, and topics of research frontiers in information retrieval. 4 graduate hours. No professional credit. Prerequisite: One of CS 410, CS 412, CS 446, ECE 449 or LING 406.",
    "prerequisites": "One of CS 410, CS 412, CS 446, ECE 449 or LING 406."
  },
  {
    "index": "CS 511",
    "name": "Advanced Data Management",
    "description": "Advanced concepts in data management and information system design and implementation, and recent developments in the field. 1) Relational roots, objects and extensibility, query languages, data indexing, query processing, transaction processing, benchmarks, and 2) semi-structured data and unstructured data, information extraction, information integration, web search and mining, and other emerging directions in the field. Prerequisite: CS 411.",
    "prerequisites": "CS 411."
  },
  {
    "index": "CS 512",
    "name": "Data Mining Principles",
    "description": "An advanced course on principles and algorithms of data mining. Data cleaning and integration; descriptive and predictive mining; mining frequent, sequential, and structured patterns; clustering, outlier analysis and fraud detection; stream data, web, text, and biomedical data mining; security and privacy in data mining; research frontiers. Prerequisite: CS 412.",
    "prerequisites": "CS 412."
  },
  {
    "index": "CS 513",
    "name": "Theory & Practice of Data Cleaning",
    "description": "Same as IS 537. See IS 537.",
    "prerequisites": null
  },
  {
    "index": "CS 514",
    "name": "Advanced Topics in Network Science",
    "description": "We shall discuss classic and recent research in network analysis. Advanced topics include individual decision-making models, game theory, mechanism design, social choice, social signal design, diffusion of behavior on a network, choice architecture, network models, network mining algorithms and applications. 4 graduate hours. No professional credit. May be repeated if topics vary. Credit is not given towards a degree from multiple offerings of this course, if those offerings have significant overlap, as determined by the CS department. Prerequisite: CS 412; one of CS 446 or ECE 449. Additional prerequisites or corequisites may be specified each term. See section information.",
    "prerequisites": "CS 412; one of CS 446 or ECE 449. Additional prerequisites or corequisites may be specified each term. See section information."
  },
  {
    "index": "CS 519",
    "name": "Scientific Visualization",
    "description": "Visualization techniques useful in analysis of engineering and scientific data. Physical models; methods of computational science; two- and three-dimensional data types; visual representation schemes for scalar, vector, and tensor data; isosurface and volume visualization methods; visual monitoring; interactive steering. Same as CSE 527. 4 graduate hours. No professional credit. Prerequisite: CS 418 or CSE 427.",
    "prerequisites": "CS 418 or CSE 427."
  },
  {
    "index": "CS 521",
    "name": "Advanced Topics in Programming Systems",
    "description": "Advanced topics in building and verifying software systems, selected from areas of current research such as: model checking and automated verification, testing and automated test generation, program synthesis, runtime verification, machine learning and its applications in the design of verified systems, formal analysis of machine learning algorithms, principles of programming languages and type systems. 4 graduate hours. No professional credit. May be repeated if topics vary. Credit is not given towards a degree from multiple offerings of this course if those offerings have significant overlap, as determined by the CS department. Prerequisite: CS 374 or ECE 374; CS 421. Additional prerequisites or corequisites may be specified each term. See section information.",
    "prerequisites": "CS 374 or ECE 374; CS 421. Additional prerequisites or corequisites may be specified each term. See section information."
  },
  {
    "index": "CS 522",
    "name": "Programming Language Semantics",
    "description": "Theory of programming languages including functional programming, meta-circular interpreters, typed, untyped and polymorphic lambda-calculi, and denotational semantics. Prerequisite: CS 422 and CS 426.",
    "prerequisites": "CS 422 and CS 426."
  },
  {
    "index": "CS 523",
    "name": "Advanced Operating Systems",
    "description": "Advanced concepts in operating system design and coverage of recent research directions. Resource management for parallel and distributed systems. Interaction between operating system design and computer architectures. Process management, virtual memory, interprocess communication, context switching, parallel and distributed file system designs, persistent objects, process and data migration, load balancing, security, protection. Term projects. 4 graduate hours. No professional credit. Prerequisite: One of CS 423 or CSE 423; one of CS 425 or ECE 428; and one of CS 433 or CSE 422.",
    "prerequisites": "One of CS 423 or CSE 423; one of CS 425 or ECE 428; and one of CS 433 or CSE 422."
  },
  {
    "index": "CS 524",
    "name": "Concurrent Progrmg Languages",
    "description": "Theory of concurrency and concurrent programming languages. Formal models of concurrent computation such as process algebras, nets, and actors; high level concurrent programming languages and their operational semantics; methods for reasoning about correctness and complexity of concurrent programs. 4 graduate hours. No professional credit. Prerequisite: CS 422; one of CS 475, MATH 475 or CS 476.",
    "prerequisites": "CS 422; one of CS 475, MATH 475 or CS 476."
  },
  {
    "index": "CS 525",
    "name": "Advanced Distributed Systems",
    "description": "Peer-to-peer systems, sensor networks, and fundamental theoretical distributed computing. Review of classical work in each area, and application of design methodologies to explore overlaps across them. Emphasis on protocol design, systems issues, and theory. Reading selections are roughly two-third classical to one-third contemporary. Students write critiques, make presentations, and create a conference paper in a systematic manner. 4 graduate hours. No professional credit. Prerequisite: One of CS 423, CSE 423, CS 425, ECE 428, CS 438 or ECE 438.",
    "prerequisites": "One of CS 423, CSE 423, CS 425, ECE 428, CS 438 or ECE 438."
  },
  {
    "index": "CS 526",
    "name": "Advanced Compiler Construction",
    "description": "Incremental and interactive compiling, error correction, code optimization, models of code generators. Prerequisite: CS 426.",
    "prerequisites": "CS 426."
  },
  {
    "index": "CS 527",
    "name": "Topics in Software Engineering",
    "description": "Fault-tolerant software, software architecture, software patterns, multi-media software, and knowledge-based approaches to software engineering. Case studies. 4 graduate hours. No professional credit. Prerequisite: CS 428, CSE 429 or CS 429.",
    "prerequisites": "CS 428, CSE 429 or CS 429."
  },
  {
    "index": "CS 533",
    "name": "Parallel Computer Architecture",
    "description": "Theoretical aspects of parallel and pipeline computation; time and processor bounds on classes of computations; data alignment network speed and cost bounds; conflict-free access memories; overall computer system ideas. Same as CSE 522. 4 graduate hours. No professional credit. Prerequisite: CS 433 or CSE 422.",
    "prerequisites": "CS 433 or CSE 422."
  },
  {
    "index": "CS 534",
    "name": "Advanced Topics in Computer Architecture",
    "description": "Current topics in computer architecture, selected from areas of current research such as: energy efficiency, processing in memory, cloud computing, 3-D architectures, security and privacy, hardware and software resiliency, cross-stack design, heterogeneous platforms, approximate computing, mobile computing, machine learning accelerators, and novel computing technologies. 4 graduate hours. No professional credit. May be repeated, if topics vary. Credit is not given towards a degree from multiple offerings of this course, if those offerings have significant overlap, as determined by the CS department. Prerequisite: CS 433 or CSE 422. Additional prerequisites or co-requisites may be specified each term. See Class Schedule information.",
    "prerequisites": "CS 433 or CSE 422. Additional prerequisites or co-requisites may be specified each term. See Class Schedule information."
  },
  {
    "index": "CS 536",
    "name": "Fault-Tolerant Dig Syst Design",
    "description": "Same as ECE 542. See ECE 542.",
    "prerequisites": null
  },
  {
    "index": "CS 537",
    "name": "Advanced Topics in Internet of Things (IoT)",
    "description": "Advanced topics in Internet of Things (IoT) algorithms, protocols, architectures, systems, and infrastructures, selected from areas of current research such as: IoT sensors representations and compression, streaming and caching of IoT data, IoT analytics and feature learning, IoT-edge-cloud computing infrastructures, resource optimization for multi-modal IoT systems, applications and human perception of IoT. Students will read and discuss recent research papers and conduct a semester-long research project. 4 graduate hours. No professional credit. May be repeated, if topics vary. Credit towards a degree from multiple offerings of this course is not given if those offerings have significant overlap, as determined by the CS department. Prerequisite: One of CS 425 or ECE 428; one of CS 438 or ECE 438. Additional prerequisites may be specified each term. See section information.",
    "prerequisites": "One of CS 425 or ECE 428; one of CS 438 or ECE 438. Additional prerequisites may be specified each term. See section information."
  },
  {
    "index": "CS 538",
    "name": "Advanced Computer Networks",
    "description": "Advanced concepts in computer networks, including congestion control, quality of service, naming, routing, wireless networks, Internet architecture, measurement, network security, and selected recent research directions. 4 graduate hours. No professional credit. Prerequisite: CS 438 or ECE 438.",
    "prerequisites": "CS 438 or ECE 438."
  },
  {
    "index": "CS 539",
    "name": "Distributed Algorithms",
    "description": "Same as ECE 526. See ECE 526.",
    "prerequisites": null
  },
  {
    "index": "CS 540",
    "name": "Deep Learning Theory",
    "description": "A rigorous mathematical course covering foundational analyses of the approximation, optimization, and generalization properties of Deep Neural Networks. Topics include: constructive and non-constructive approximations with one hidden layer; benefits of depth; optimization in the NTK regime; maximum margin optimization outside the NTK regime; Rademacher complexity, VC dimensino, and covering number bounds for ReLU networks. Evaluation is primarily based on homeworks, with a smaller project component. The course goal is to prepare students perform their own research in the field. 4 graduate hours. No professional credit. Prerequisite: Basic linear algebra, probability, proof-writing, and statistics required. Real analysis recommended.",
    "prerequisites": "Basic linear algebra, probability, proof-writing, and statistics required. Real analysis recommended."
  },
  {
    "index": "CS 541",
    "name": "Computer Systems Analysis",
    "description": "Same as ECE 541. See ECE 541.",
    "prerequisites": null
  },
  {
    "index": "CS 542",
    "name": "Statistical Reinforcement Learning",
    "description": "Theory of reinforcement learning, with a focus on sample complexity analyses. Specific topics include MDP basics, finite-sample analyses of online (i.e., exploration) and offline (i.e., batch) RL with a tabular representation, finite-sample analyses of online and offline RL with function approximation, state abstraction theory, off-policy evaluation (importance sampling), and policy gradient. The course goal is to provide a comprehensive understanding of the statistical properties of RL under various settings (e.g., online vs offline), preparing the students for doing research in the area. 4 graduate hours. No professional credit. Prerequisite: Calculus, linear algebra, probability and statistics, and basic concepts of machine learning. Familiarity with (at least one of) the following topics is highly recommended: stochastic processes, numerical analysis, and theoretical computer science.",
    "prerequisites": "Calculus, linear algebra, probability and statistics, and basic concepts of machine learning. Familiarity with (at least one of) the following topics is highly recommended: stochastic processes, numerical analysis, and theoretical computer science."
  },
  {
    "index": "CS 543",
    "name": "Computer Vision",
    "description": "Same as ECE 549. See ECE 549.",
    "prerequisites": null
  },
  {
    "index": "CS 544",
    "name": "Optimiz in Computer Vision",
    "description": "Applications of continuous and discrete optimization to problems in computer vision and machine learning, with particular emphasis on large-scale algorithms and effective approximations: gradient-based learning; Newton's method and variants, applied to structure from motion problems; the augmented Lagrangian method and variants; interior-point methods; SMO and other specialized algorithms for support vector machines; flows and cuts as examples of primal-dual methods; dynamics programming, hidden Markov models, and parsing: 0-1 quadratic forms, max-cut, and Markov random-fields solutions. 4 graduate hours. No professional credit. Prerequisite: One of CS 450, CSE 401, ECE 491, or MATH 450; one of CS 473, CSE 414 or MATH 473.",
    "prerequisites": "One of CS 450, CSE 401, ECE 491, or MATH 450; one of CS 473, CSE 414 or MATH 473."
  },
  {
    "index": "CS 545",
    "name": "Machine Learning for Signal Processing",
    "description": "Fundamentals of machine learning and signal processing as they pertain to the development of machines that can understand complex real-world signals, such as speech, images, movies, music, biological and mechanical readings, etc. Hands-on examples of how to decompose, analyze, classify, detect and consolidate signals, and examine various commonplace operations such as finding faces from camera feeds, organizing personal music collections, designing speech dialog systems and understanding movie content. 4 graduate hours. No professional credit. Prerequisite: MATH 415; one of CS 361, STAT 361, MATH 461, MATH 463 or STAT 400.",
    "prerequisites": "MATH 415; one of CS 361, STAT 361, MATH 461, MATH 463 or STAT 400."
  },
  {
    "index": "CS 546",
    "name": "Advanced Topics in Natural Language Processing",
    "description": "Advanced topics in natural language processing, ranging from general techniques such as deep learning for NLP to specific topics such as information extraction, knowledge acquisition, dialogue systems, language grounding, and natural language generation. Review of classic as well as state-of-the-art techniques and remaining challenges, and exploration of recent proposals for meeting these challenges. Intended for graduate students doing research in natural language processing. 4 graduate hours. No professional credit. May be repeated in separate terms up to 16 hours, if topics vary. Credit towards a degree from multiple offerings of this course is not given if those offerings have significant overlap, as determined by the CS department. Prerequisite: CS 447 and one of CS 446 or ECE 449, or equivalent background.",
    "prerequisites": "CS 447 and one of CS 446 or ECE 449, or equivalent background."
  },
  {
    "index": "CS 547",
    "name": "Deep Learning",
    "description": "Same as IE 534. See IE 534.",
    "prerequisites": null
  },
  {
    "index": "CS 549",
    "name": "Seminar in Cognitive Science",
    "description": "Same as PSYC 514, ANTH 514, EPSY 551, LING 570, and PHIL 514. See PSYC 514.",
    "prerequisites": null
  },
  {
    "index": "CS 554",
    "name": "Parallel Numerical Algorithms",
    "description": "Numerical algorithms for parallel computers: parallel algorithms in numerical linear algebra (dense and sparse solvers for linear systems and the algebraic eigenvalue problem), numerical handling of ordinary and partial differential equations, and numerical optimization techniques. Same as CSE 512. 4 graduate hours. No professional credit. Prerequisite: One of CS 450, CSE 401, ECE 491, MATH 450, CS 457, CS 555, CSE 510 or MATH 552.",
    "prerequisites": "One of CS 450, CSE 401, ECE 491, MATH 450, CS 457, CS 555, CSE 510 or MATH 552."
  },
  {
    "index": "CS 555",
    "name": "Numerical Methods for PDEs",
    "description": "Numerical techniques for initial and boundary value problems in partial differential equations. Finite difference and finite element discretization techniques, direct and iterative solution methods for discrete problems, and programming techniques and usage of software packages. Same as CSE 510 and MATH 552. 4 graduate hours. No professional credit. Prerequisite: CS 450, CSE 401, ECE 491, MATH 450 or CS 457.",
    "prerequisites": "CS 450, CSE 401, ECE 491, MATH 450 or CS 457."
  },
  {
    "index": "CS 556",
    "name": "Iterative & Multigrid Methods",
    "description": "Comprehensive treatment of algebraic and multigrid iterative methods to solve systems of equations, primarily linear equations arising from discretization of partial differential equations. Same as CSE 511.",
    "prerequisites": null
  },
  {
    "index": "CS 558",
    "name": "Topics in Numerical Analysis",
    "description": "Advanced topics in numerical analysis selected from areas of current research. Same as CSE 513. May be repeated. Prerequisite: As specified for each topic offering, see Schedule or departmental course description.",
    "prerequisites": "As specified for each topic offering, see Schedule or departmental course description."
  },
  {
    "index": "CS 562",
    "name": "Advanced Topics in Security, Privacy, and Machine Learning",
    "description": "Advanced topics in security and privacy problems in machine learning systems, selected from areas of current research such as: adversarial machine learning, differential privacy, game theory enabled defenses, robust learning methods, machine learning based cybercrime analysis, network intrusion detection, and malware analysis, and machine learning interpretation techniques. 4 graduate hours. No professional credit. May be repeated if topics vary. Credit is not given towards a degree from multiple offerings of this course if those offerings have significant overlap, as determined by the CS department. Prerequisite: One of CS 446 or ECE 449 and one of CS 463 or ECE 424, or equivalent courses, by consent of instructor. Additional prerequisites or corequisites may be specified each term. See section information.",
    "prerequisites": "One of CS 446 or ECE 449 and one of CS 463 or ECE 424, or equivalent courses, by consent of instructor. Additional prerequisites or corequisites may be specified each term. See section information."
  },
  {
    "index": "CS 563",
    "name": "Advanced Computer Security",
    "description": "Current research trends in computer and network security. Privacy, tamper-resistance, unwanted traffic, monitoring and surveillance, and critical infrastructure protection. Subtopics will vary depending upon current research trends. Students work in teams in close coordination with the course instructor to develop one of the topics in depth by carrying out background research and an exploratory project. Same as ECE 524. 4 graduate hours. No professional credit. Prerequisite: One of CS 461, CS 463, ECE 422 or ECE 424.",
    "prerequisites": "One of CS 461, CS 463, ECE 422 or ECE 424."
  },
  {
    "index": "CS 565",
    "name": "Human-Computer Interaction",
    "description": "In-depth coverage of advanced topics in human-computer interaction (HCI). Applied models of human performance and attention, design tools for creative design tasks, interruptions and peripheral displays, gestures, and bimanual input, and usability evaluation techniques. Students complete a research-oriented term project of their choosing. Prerequisite: CS 465.",
    "prerequisites": "CS 465."
  },
  {
    "index": "CS 567",
    "name": "Social Signals and Social Media",
    "description": "Online social interactions occur in many arenas important to society and human well-being, but are mediated through algorithmic interventions that alter the users expectations in these social spaces. This class explores the presentation of self, the presentation of collectives, the presentation of news, and social dynamics in these online spaces--and how algorithmic intervention shapes them from the perspective of social signaling theory. Topics covered include: the evolution of algorithmic matchmaking (as in online resume/interviews and dating sites), why people share misinformation, the mitigation of trolling, ethics, and bias in social media systems. Upon completion of this course, students will have an up-to-date understanding of the design social media interfaces with incentive structures from social signaling theory. 4 graduate hours. No professional credit. Prerequisite: CS 465 or equivalent or permission of instructor. Prioritize PhD students, then others.",
    "prerequisites": "CS 465 or equivalent or permission of instructor. Prioritize PhD students, then others."
  },
  {
    "index": "CS 568",
    "name": "User-Centered Machine Learning",
    "description": "Introduces guidelines, processes, and systems for designing effective user experiences powered by machine learning models. Topics include design tradeoffs unique to data-driven products and services such as automation versus control, precision versus recall, and personalization versus privacy. Readings from human computer-interaction, product design, cognitive science, machine learning, computer vision, and natural language processing frame in-class design exercises. Students work in teams on a multi-week research project creating or auditing data-driven experiences. 4 graduate hours. No professional credit. Prerequisite: CS 465 or equivalent course work.",
    "prerequisites": "CS 465 or equivalent course work."
  },
  {
    "index": "CS 571",
    "name": "Combinatorial Mathematics",
    "description": "Same as MATH 580. See MATH 580.",
    "prerequisites": null
  },
  {
    "index": "CS 572",
    "name": "Extremal Graph Theory",
    "description": "Same as MATH 581. See MATH 581.",
    "prerequisites": null
  },
  {
    "index": "CS 574",
    "name": "Randomized Algorithms",
    "description": "Basic and advanced concepts in the design and analysis of randomized algorithms. Sampling; concentration inequalities such as Chernoff-Hoeffding bounds; probabilistic method; random walks, dimension reduction; entropy; martingales and Azuma's inequality; derandomization. Randomized algorithms for sorting and searching; graphs; geometric problems. Basics of pseudorandomness and randomized complexity classes. 4 graduate hours. No professional credit. Prerequisite: One of CS 473, CSE 414, or MATH 473; one of MATH 461, MATH 463 or STAT 400.",
    "prerequisites": "One of CS 473, CSE 414, or MATH 473; one of MATH 461, MATH 463 or STAT 400."
  },
  {
    "index": "CS 575",
    "name": "Methods of Combinatorics",
    "description": "Same as MATH 584. See MATH 584.",
    "prerequisites": null
  },
  {
    "index": "CS 576",
    "name": "Topics in Automated Deduction",
    "description": "Advanced topics in computer-aided methods for formal deduction, selected from areas of current research, such as: resolution theorem proving strategies, special relations, equational reasoning, unification theory, rewrite systems, mathematical induction, program derivation, hybrid inference systems, and programming with logic. May be repeated in separate terms. Prerequisite: As specified for each topic offering, see Schedule or departmental course description.",
    "prerequisites": "As specified for each topic offering, see Schedule or departmental course description."
  },
  {
    "index": "CS 579",
    "name": "Computational Complexity",
    "description": "Turing machines; determinism and non-determinism; time and space hierarchy theorems; speed-up and tape compression; Blum axioms; structure of complexity classes NP, P, NL, L, and PSPACE; complete problems; randomness and complexity classes RP, RL, and BPP; alternation, polynomial-time hierarchy; circuit complexity, parallel complexity, NC, and RNC; relativized computational complexity; time-space trade-offs. Same as ECE 579. 4 graduate hours. No professional credit. Prerequisite: One of CS 473, CSE 414, MATH 473, CS 475 or MATH 475.",
    "prerequisites": "One of CS 473, CSE 414, MATH 473, CS 475 or MATH 475."
  },
  {
    "index": "CS 580",
    "name": "Topics in Algorithmic Game Theory",
    "description": "A theoretical CS course covering advances in algorithmic game theory. This includes study of strategic, computational, learning, dynamic, and fairness aspects of games and markets (organizations that involves rational and strategic agents). In particular, topics will include computation and complexity of equilibria, mechanism design, fair-division, dynamics in games and markets, price-of-anarchy etc.. These topics arise from applications such as online marketplaces (like Lyft, Uber, eBay, sponsored search, TaskRabbit), social networks, recommendation systems, kidney exchange, spectrum auction, etc., and thereby will prepare students for related research and/or industry jobs. 4 graduate hours. No professional credit. Prerequisite: CS 473.",
    "prerequisites": "CS 473."
  },
  {
    "index": "CS 581",
    "name": "Algorithmic Genomic Biology",
    "description": "Gives each student enough background and training in the area of algorithmic genomic biology so that each will be able to do research in this area, and publish papers. The main focus of the course is phylogeny (evolutionary tree) estimation, multiple sequence alignment, and genome-scale phylogenetics, which are problems that present very interesting challenges from a computational and statistical standpoint. Time permitting, we will also discuss computational problems in microbiome analysis, protein function and structure prediction, genome assembly, and even historical linguistics. Students will learn the mathematical and computational foundations in these areas, read the current literature, and do a team research project. The course is designed for doctoral students in computer science, computer engineering, bioengineering, mathematics, and statistics, and does not depend on any prior background in biology. The technical material will depend on discrete algorithms, graph theory, simulations, and probabilistic analysis of algorithms. 4 graduate hours. No professional credit. Prerequisite: One of CS 374 or ECE 374 and one of CS 361 or STAT 361, or consent of instructor.",
    "prerequisites": "One of CS 374 or ECE 374 and one of CS 361 or STAT 361, or consent of instructor."
  },
  {
    "index": "CS 582",
    "name": "Machine Learning for Bioinformatics",
    "description": "This graduate course on bioinformatics introduces a selection of topics in computational biology and bioinformatics, with special emphasis on current problems in regulatory genomics and systems biology. Computational approaches discussed will focus on Machine Learning techniques such as Bayesian inference, graphical models, supervised learning and network analysis. Bioinformatics topics will be introduced through lectures by instructor and research paper presentations by students, and include regulatory sequence analysis, cistromics, epigenomics, regulatory network reconstruction, non-coding variant interpretation, and protein structure and function prediction. A research project involving real data analysis with techniques related to course content is mandatory and will help prepare students for bioinformatics research. 4 graduate hours. No professional credit. Prerequisite: CS 446 or ECE 449; Credit or concurrent enrollment in CS 466; or consent of instructor.",
    "prerequisites": "CS 446 or ECE 449; Credit or concurrent enrollment in CS 466; or consent of instructor."
  },
  {
    "index": "CS 583",
    "name": "Approximation Algorithms",
    "description": "Approximation algorithms for NP-hard problems. Basic and advanced techniques in approximation algorithm design: combinatorial algorithms; mathematical programming methods including linear and semi-definite programming, local search methods, and others. Algorithms for graphs and networks, constraint satisfaction, packing and scheduling. 4 graduate hours. No professional credit. Prerequisite: CS 573, CSE 515 or consent of instructor.",
    "prerequisites": "CS 573, CSE 515 or consent of instructor."
  },
  {
    "index": "CS 584",
    "name": "Embedded System Verification",
    "description": "Same as ECE 584. See ECE 584.",
    "prerequisites": null
  },
  {
    "index": "CS 585",
    "name": "Hardware Verification",
    "description": "Same as ECE 519. See ECE 519.",
    "prerequisites": null
  },
  {
    "index": "CS 586",
    "name": "Combinatorial Optimization",
    "description": "Same as IE 519. See IE 519.",
    "prerequisites": null
  },
  {
    "index": "CS 588",
    "name": "Autonomous Vehicle System Engineering",
    "description": "Will introduce students to the computational principles involved in autonomous vehicles, with practical labwork on an actual vehicle. Sensing topics will include vision, lidar and sonar sensing, including state-of-the-art methods for detection, classification, and segmentation. Bayesian filtering methods will be covered in the context of both SLAM and visual tracking. Planning and control topics will cover vehicle dynamics models, state-lattice planning, sampling-based kinodynamic planning, optimal control and trajectory optimization, and some reinforcement learning. Evaluation will involve ambitious challenge projects implemented on a physical vehicle. 4 graduate hours. No professional credit. Prerequisite: CS 374, ECE 374, ECE 484, or equivalent.",
    "prerequisites": "CS 374, ECE 374, ECE 484, or equivalent."
  },
  {
    "index": "CS 591",
    "name": "Advanced Seminar",
    "description": "Seminar on topics of current interest as announced in the Class Schedule. Approved for S/U grading only. May be repeated in the same or separate terms if topics vary. Prerequisite: As specified for each topic offering, see Class Schedule or departmental course description.",
    "prerequisites": "As specified for each topic offering, see Class Schedule or departmental course description."
  },
  {
    "index": "CS 597",
    "name": "Individual Study",
    "description": "Individual study or reading in a subject not covered in normal course offerings. May be repeated. Prerequisite: Consent of instructor.",
    "prerequisites": "Consent of instructor."
  },
  {
    "index": "CS 598",
    "name": "Special Topics",
    "description": "Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. May be repeated in the same or separate terms if topics vary.",
    "prerequisites": null
  },
  {
    "index": "CS 599",
    "name": "Thesis Research",
    "description": "Approved for S/U grading only. May be repeated.",
    "prerequisites": null
  }
]