🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 109 (from laksa193)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa109.int.ahrefs:8124/' \
  -H 'Content-Type: text/plain' \
  -H 'X-ClickHouse-Database: crawler3' \
  -H 'Authorization: Basic YXBpOg==' \
  -d 'SELECT getAhrefsURLFromUnparsed(src_unparsed) AS found_url, ifNull(toUnixTimestamp(download_stamp), 0) AS crawl_time, ifNull(toUnixTimestamp(props_url_first_seen), 0) AS first_indexed_time, download_http_code AS http_code, src_unparsed AS src_unparsed, src_root_hash AS src_root_hash, history_drop_reason AS history_drop_reason, meta_title AS meta_title, meta_descriptions AS meta_descriptions, attrs_boilerpipe_text AS attrs_boilerpipe_text, attrs_markdown AS attrs_markdown, attrs_readable_markdown AS attrs_readable_markdown, meta_canonical AS meta_canonical FROM crawler3.page_info_local FINAL PREWHERE (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://catalog.illinois.edu/courses-of-instruction/cs/\')), getAhrefsUnparsedNoserviceFromURL(\'https://catalog.illinois.edu/courses-of-instruction/cs/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/catalog.illinois.edu\/courses-of-instruction\/cs\/","crawl_time":1774707623,"first_indexed_time":1617794945,"http_code":200,"src_unparsed":"edu,illinois!catalog,\/courses-of-instruction\/cs\/ s443","src_root_hash":"5087864546879250709","history_drop_reason":null,"meta_title":"CS - Computer Science | 2026-2027 Course Catalog | University of Illinois Urbana-Champaign","meta_descriptions":[],"attrs_boilerpipe_text":"Courses\nCS 100   Computer Science Orientation   credit: 1 Hour.\nIntroduction 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.\nCS 101   Intro Computing: Engrg & Sci   credit: 3 Hours.\nFundamental 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\nMATH 220\nor\nMATH 221\nor\nMATH 231\nor\nMATH 241\n.\nThis course satisfies the General Education Criteria for:\nQuantitative Reasoning II\nCS 105   Intro Computing: Non-Tech   credit: 3 Hours.\nComputing 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:\nMATH 112\n.\nThis course satisfies the General Education Criteria for:\nQuantitative Reasoning I\nCS 124   Introduction to Computer Science I   credit: 3 Hours.\nBasic 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\nCS 124\nand\nCS 125\n. Prerequisite: Three years of high school mathematics or\nMATH 112\n.\nThis course satisfies the General Education Criteria for:\nQuantitative Reasoning I\nCS 173   Discrete Structures   credit: 3 Hours.\n[IAI Code: CS915] 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 toward graduation for: Credit is not given for both\nCS 173\nand\nMATH 213\n. Prerequisite: One of\nCS 124\n,\nCS 125\n,\nECE 220\n; one of\nMATH 220\n,\nMATH 221\n.\nCS 196   First-Year Student Honors   credit: 1 Hour.\nOffered 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).\nCS 211   Ethical and Professional Conduct   credit: 3 Hours.\nNavigating 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\nCS 211\nand\nCS 210\nor\nECE 316\n. Prerequisite:\nCS 225\n.\nThis course satisfies the General Education Criteria for:\nAdvanced Composition\nCS 222   Software Design Lab   credit: 1 Hour.\nDesign 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:\nCS 128\n; credit or concurrent registration in\nCS 225\n. Restricted to majors in Computer Science undergraduate curricula only.\nCS 233   Computer Architecture   credit: 4 Hours.\nFundamentals 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:\nCS 125\nor\nCS 128\n;\nCS 173\nor\nMATH 213\n; credit or concurrent enrollment in\nCS 225\n.\nCS 277   Algorithms and Data Structures for Data Science   credit: 4 Hours.\nIntroduction 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\nCS 277\nif credit for\nCS 225\nis earned. Prerequisite:\nSTAT 207\n; one of\nMATH 220\n,\nMATH 221\n,\nMATH 234\n.\nCS 277\ncannot be taken concurrently with\nCS 225\n.\nCS 296   Honors Course   credit: 1 Hour.\nGroup 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).\nCS 340   Introduction to Computer Systems   credit: 3 Hours.\nBasics 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\nCS 340\nand CS 240. Prerequisite:\nCS 128\nand\nCS 225\n.\nCS 341   System Programming   credit: 4 Hours.\nBasics 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\nCS 341\nand either CS 241 or\nECE 391\n. Prerequisite:\nCS 225\nand\nCS 233\n.\nCS 357   Numerical Methods I   credit: 3 Hours.\nFundamentals 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. (Counts for advanced hours in LAS). Same as\nMATH 357\n. Credit is not given toward graduation for: Credit is not given towards graduation for\nCS 357\nif credit for\nCS 450\nhas been earned. Prerequisite: One of\nCS 101\n,\nCS 105\n,\nCS 124\n,\nCS 125\nor\nECE 220\n;\nMATH 241\n; one of\nMATH 225\n,\nMATH 227\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\nor\nBIOE 210\n.\nCS 361   Probability & Statistics for Computer Science   credit: 3 Hours.\nIntroduction 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. Credit is not given toward graduation for: Credit is not given for both\nCS 361\nand\nECE 313\n. Prerequisite:\nMATH 220\nor\nMATH 221\n. Credit or concurrent registration in one of\nMATH 225\n,\nMATH 227\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\nor\nBIOE 210\n.\nCS 374   Introduction to Algorithms & Models of Computation   credit: 4 Hours.\nAnalysis 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\nECE 374\n. Prerequisite: One of\nCS 173\n,\nMATH 213\n;\nCS 225\n.\nCS 398   Special Topics   credit: 1 to 4 Hours.\nSubject 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.\nCS 400   Accelerated Fundamentals of Computing I   credit: 3 Hours.\nThe 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.\nCS 401   Accelerated Fundamentals of Algorithms I   credit: 3 Hours.\nThe 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.\nCS 402   Accelerated Fundamentals of Computing II   credit: 3 Hours.\nProvides 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:\nCS 400\nor 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.\nCS 403   Accelerated Fundamentals of Algorithms II   credit: 3 Hours.\nThe 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:\nCS 401\nor 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.\nCS 409   The Art of Web Programming   credit: 3 or 4 Hours.\nClient- 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:\nCS 225\n.\nCS 410   Text Information Systems   credit: 3 or 4 Hours.\nTheory, 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:\nCS 225\n.\nCS 411   Database Systems   credit: 3 or 4 Hours.\nExamination 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:\nCS 225\n.\nCS 412   Introduction to Data Mining   credit: 3 or 4 Hours.\nConcepts, 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:\nCS 225\n.\nCS 414   Multimedia Systems   credit: 3 or 4 Hours.\nOrganization 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,\nCS 340\n,\nCS 341\nor\nECE 391\n.\nCS 415   Game Development   credit: 3 or 4 Hours.\nA 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:\nCS 225\n.\nCS 416   Data Visualization   credit: 3 or 4 Hours.\nElements 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:\nCS 225\n.\nCS 419   Production Computer Graphics   credit: 3 or 4 Hours.\nAdvanced 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:\nCS 418\nor\nCSE 427\n.\nCS 420   Parallel Progrmg: Sci & Engrg   credit: 3 or 4 Hours.\nFundamental 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\nCSE 402\nand\nECE 492\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite:\nCS 225\n.\nCS 421   Programming Languages & Compilers   credit: 3 or 4 Hours.\nStructure 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\nCS 233\n, CS 240,\nCS 340\nor\nECE 391\n;\nCS 374\nor\nECE 374\n; one of\nMATH 225\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\n, or\nBIOE 210\n.\nCS 424   Real-Time Systems   credit: 3 or 4 Hours.\nSupervisory 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,\nCS 341\nor\nECE 391\n.\nCS 426   Compiler Construction   credit: 3 or 4 Hours.\nCompiler 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\nCS 421\n.\nCS 428   Software Engineering II   credit: 3 or 4 Hours.\nContinuation of\nCS 427\n. 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\nCSE 429\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite:\nCS 427\nor\nCSE 426\n.\nCS 431   Embedded Systems   credit: 3 or 4 Hours.\nStudents 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,\nCS 341\nor\nECE 391\n.\nCS 433   Computer System Organization   credit: 3 or 4 Hours.\nComputer 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\nCSE 422\n. 3 undergraduate hours. 4 graduate hours. Prerequisite:\nCS 233\n.\nCS 435   Cloud Networking   credit: 3 or 4 Hours.\nProvides 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\nCS 435\nand\nCS 438\n\/\nECE 438\n. Prerequisite: One of CS 240, CS 241,\nCS 340\n,\nCS 341\nor\nECE 391\n.\nCS 436   Computer Networking Laboratory   credit: 3 or 4 Hours.\nDesign, 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\nECE 435\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 240, CS 241,\nCS 340\n,\nCS 341\nor\nECE 391\n.\nCS 437   Topics in Internet of Things   credit: 3 or 4 Hours.\nTopics 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\nCS 341\n. Additional prerequisites may be specified each term. See section information.\nCS 438   Communication Networks   credit: 3 or 4 Hours.\nLayered 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\nECE 438\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241,\nCS 341\nor\nECE 391\n; strongly recommend one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n.\nCS 440   Artificial Intelligence   credit: 3 or 4 Hours.\nMajor 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\nECE 448\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite:\nCS 225\n; one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\n,\nSTAT 400\nor\nBIOE 310\n.\nCS 441   Applied Machine Learning   credit: 3 or 4 Hours.\nTechniques 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: One of\nCS 225\nor\nCS 277\n, and one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nBIOE 310\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n.\nCS 442   Trustworthy Machine Learning   credit: 3 or 4 Hours.\nPrepares 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:\nCS 225\n; one of\nCS 440\n,\nECE 448\n,\nCS 441\n,\nCS 446\nor\nECE 449\n; one of\nMATH 225\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\nor\nBIOE 210\n.\nCS 443   Reinforcement Learning   credit: 3 or 4 Hours.\nFundamental 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:\nCS 225\n;\nMATH 241\n; one of\nMATH 225\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\nor\nBIOE 210\n; one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n.\nCS 444   Deep Learning for Computer Vision   credit: 3 or 4 Hours.\nProvides 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. Same as\nECE 494\n. 3 undergraduate hours. 4 graduate hours. Prerequisite:\nMATH 241\n; one of\nMATH 225\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\n, or\nBIOE 210\n;\nCS 225\n; one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n. No previous exposure to machine learning is required.\nCS 446   Machine Learning   credit: 3 or 4 Hours.\nPrinciples 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\nECE 449\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite:\nCS 225\n; One of\nMATH 225\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\nor\nBIOE 210\n; one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\n,\nSTAT 400\nor\nBIOE 310\n.\nCS 447   Natural Language Processing   credit: 3 or 4 Hours.\nPart-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\nCS 173\nor\nMATH 213\n;\nCS 225\n;\nCS 374\nor\nECE 374\n; one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\n,\nSTAT 400\nor\nBIOE 310\n; one of\nMATH 225\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\nor\nBIOE 210\n.\nCS 448   Audio Computing Laboratory   credit: 3 or 4 Hours.\nComputational 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,\nCS 340\n,\nCS 341\n, or\nECE 391\n; one of\nMATH 225\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\n, or\nBIOE 210\n.\nCS 450   Numerical Analysis   credit: 3 or 4 Hours.\nLinear 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\nCSE 401\n,\nECE 491\n, and\nMATH 450\n. 3 undergraduate hours. 3 or 4 graduate hours. Credit is not given toward graduation for both\nCS 450\nand CS 457. Prerequisite: One of\nCS 101\n,\nCS 124\nor\nCS 125\n; one of\nCS 357\n,\nMATH 257\n,\nMATH 357\n,\nMATH 415\n, or\nMATH 416\n;\nMATH 285\n.\nCS 452   Topics in Robotics   credit: 3 or 4 Hours.\nTopics in robotics presented from a computational perspective, including artificial intelligence, algorithms, computational modeling, and\/or software engineering. Generating intelligent behavior for a physical robot poses unique computational challenges in decision making, perception, representations of three-dimensional worlds and movement, and system integration. This course introduces general computational principles used in robotics as well as performing in-depth study of selected subtopics. 3 undergraduate hours. 3 or 4 graduate hours. May be repeated in the same term up to 6 undergraduate or 8 graduate hours, or in separate terms up to 12 undergraduate or 16 graduate hours, if topics vary. Prerequisite: (\nCS 128\nor\nECE 220\n) and\nCS 225\nand (CS 241 or\nCS 341\nor\nECE 391\n).\nCS 460   Security Laboratory   credit: 3 or 4 Hours.\nOperating 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\nCS 461\nvia hands-on project. Same as\nECE 419\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite:\nCS 461\nor\nECE 422\nor a combination of\nCS 463\nand one of\nCS 340\n,\nCS 341\nor\nECE 391\n.\nCS 461   Computer Security I   credit: 4 Hours.\nFundamental 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\nECE 422\n. 4 undergraduate hours. 4 graduate hours. Prerequisite: One of CS 241,\nCS 341\nor\nECE 391\n, or a combination of\nCS 233\nand\nCS 340\n.\nCS 462   Issues of Law and Policy in Computer Science   credit: 3 or 4 Hours.\nExploration of the intersection of public policy and computing technology: overview of the US legal system and government, how computing technology is regulated in areas such as privacy, crime, intellectual property, commerce, and national security. Students will complete technical projects related to legal issues, such as scrutinizing DRM, evaluating digital forensics reports, and critiquing software patents. Students will also scrutinize excerpts from legal opinions. 3 undergraduate hours. 4 graduate hours. Credit is not given toward graduation for: Credit is not given for both\nCS 462\nand\nCS 498\n, Law &Policy Issues in CS. Prerequisite:\nCS 340\nor\nCS 341\nor\nECE 391\n.\nCS 463   Computer Security II   credit: 3 or 4 Hours.\nProgram 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\nECE 424\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite:\nCS 225\nand one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n.\nCS 441\ncompletion is recommended.\nCS 464   Topics in Societal and Ethical Impacts of Computer Technology   credit: 3 Hours.\nTopics 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:\nCS 225\n. One of\nCS 210\nor\nCS 211\nor\nECE 316\nor\nPHIL 316\n. One of\nCS 361\nor\nSTAT 400\nor\nSTAT 200\n. Restricted to students with senior standing.\nCS 465   User Interface Design   credit: 4 Hours.\nA 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:\nCS 225\n.\nCS 466   Introduction to Bioinformatics   credit: 3 or 4 Hours.\nAlgorithmic 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:\nCS 225\n.\nCS 467   Social Visualization   credit: 3 or 4 Hours.\nVisualizing 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:\nCS 225\n.\nCS 469   Computational Advertising Infrastructure   credit: 3 or 4 Hours.\nThorough 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\nADV 462\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite:\nCS 173\n;\nCS 225\n; one of\nMATH 225\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\nor\nBIOE 210\n; one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n.\nCS 470   Social and Information Networks   credit: 3 or 4 Hours.\nSocial 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:\nCS 225\n;\nCS 173\n; one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n; one of\nMATH 225\n,\nMATH 257\n,\nMATH 415\n,\nMATH 416\n,\nASRM 406\n, or\nBIOE 210\n.\nCS 473   Algorithms   credit: 4 Hours.\nDesign 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\nCSE 414\nand\nMATH 473\n. 4 undergraduate hours. 4 graduate hours. Prerequisite:\nCS 374\nor\nECE 374\n, and one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n.\nCS 474   Logic in Computer Science   credit: 3 or 4 Hours.\nAn 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:\nCS 173\n;\nCS 225\n; one of\nCS 374\nor\nECE 374\n.\nCS 475   Formal Models of Computation   credit: 3 or 4 Hours.\nFinite 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\nMATH 475\n. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite:\nCS 374\nor\nECE 374\n.\nCS 476   Program Verification   credit: 3 or 4 Hours.\nFormal 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:\nCS 225\n; one of\nCS 374\n,\nECE 374\nor\nMATH 414\n.\nCS 478   Quantum Algorithms and Complexity   credit: 3 or 4 Hours.\nA comprehensive introduction to the theoretical foundations of quantum computing, preparing students for advanced study in quantum information sciences: Building blocks of quantum information such as qubits and entanglement; basic quantum operations such as quantum gates and measurements, and key quantum protocols and algorithms like teleportation and Shor's factoring algorithm. Advanced topics include modern quantum algorithms, quantum learning, quantum complexity theory, cryptography, and error correction. Emphasis on theoretical aspects of design and analysis of quantum algorithms and their computational limits. Prior quantum physics knowledge is helpful but not required. 3 undergraduate hours. 4 graduate hours. Prerequisite:\nCS 225\n; one of\nMATH 257\n,\nMATH 415\nor\nMATH 416\n; one of\nCS 361\n,\nSTAT 361\n,\nECE 313\n,\nMATH 362\n,\nMATH 461\n,\nMATH 463\n,\nSTAT 400\n,\nPHYS 214\nor\nPHYS 486\n. Credit or concurrent enrollment in CS\/\nECE 374\nis encouraged.\nCS 484   Parallel Programming   credit: 3 or 4 Hours.\nTechniques 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\nCS 341\n.\nCS 491   Seminar   credit: 0 to 4 Hours.\nSeminar 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.\nCS 492   Senior Project I   credit: 3 Hours.\nFirst 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.\nCS 492\nmust be taken as a sequence with either\nCS 493\nor\nCS 494\n. 3 undergraduate hours. No graduate credit. Credit is not given for both\nCS 492\nand a project course in another engineering department for the same project. Prerequisite: For Computer Science majors with senior standing.\nCS 493   Senior Project II, ACP   credit: 3 Hours.\nContinuation of\nCS 492\n. Identical to\nCS 494\nexcept for an additional writing component. See\nCS 494\n. 3 undergraduate hours. No graduate credit. Credit is not given for both\nCS 493\nand a project course in another engineering department for the same project. Prerequisite:\nCS 492\n.\nThis course satisfies the General Education Criteria for:\nAdvanced Composition\nCS 497   CS Team Project   credit: 1 to 3 Hours.\nStudent 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.\nCS 498   Special Topics   credit: 1 to 4 Hours.\nSubject 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.\nCS 499   Senior Thesis   credit: 3 Hours.\nResearch 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.\nThis course satisfies the General Education Criteria for:\nAdvanced Composition\nCS 500   Current Topics in Computing Education Research   credit: 4 Hours.\nCurrent 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. 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.\nCS 507   Topics in Cryptography   credit: 4 Hours.\nModern 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. 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.\nCS 510   Advanced Information Retrieval   credit: 4 Hours.\nAdvanced 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. Prerequisite: One of\nCS 410\n,\nCS 412\n,\nCS 446\n,\nECE 449\nor\nLING 406\n.\nCS 511   Advanced Data Management   credit: 4 Hours.\nAdvanced 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:\nCS 411\n.\nCS 512   Data Mining Principles   credit: 4 Hours.\nAn 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:\nCS 412\n.\nCS 514   Advanced Topics in Network Science   credit: 4 Hours.\nWe 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. 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:\nCS 412\n; one of\nCS 446\nor\nECE 449\n. Additional prerequisites or corequisites may be specified each term. See section information.\nCS 519   Scientific Visualization   credit: 4 Hours.\nVisualization 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\nCSE 527\n. Prerequisite:\nCS 418\nor\nCSE 427\n.\nCS 521   Advanced Topics in Programming Systems   credit: 4 Hours.\nAdvanced 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. 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:\nCS 374\nor\nECE 374\n;\nCS 421\n. Additional prerequisites or corequisites may be specified each term. See section information.\nCS 523   Advanced Operating Systems   credit: 4 Hours.\nAdvanced 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. Prerequisite: One of\nCS 423\nor\nCSE 423\n; one of\nCS 425\nor\nECE 428\n; and one of\nCS 433\nor\nCSE 422\n.\nCS 524   Concurrent Progrmg Languages   credit: 4 Hours.\nTheory 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. Prerequisite:\nCS 422\n; one of\nCS 475\n,\nMATH 475\nor\nCS 476\n.\nCS 525   Advanced Distributed Systems   credit: 4 Hours.\nPeer-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. Prerequisite: One of\nCS 423\n,\nCSE 423\n,\nCS 425\n,\nECE 428\n,\nCS 438\nor\nECE 438\n.\nCS 534   Advanced Topics in Computer Architecture   credit: 4 Hours.\nCurrent 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. 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:\nCS 433\nor\nCSE 422\n. Additional prerequisites or co-requisites may be specified each term. See Class Schedule information.\nCS 537   Advanced Topics in Internet of Things (IoT)   credit: 4 Hours.\nAdvanced 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. 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\nCS 425\nor\nECE 428\n; one of\nCS 438\nor\nECE 438\n. Additional prerequisites may be specified each term. See section information.\nCS 540   Deep Learning Theory   credit: 4 Hours.\nA 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. Prerequisite: Basic linear algebra, probability, proof-writing, and statistics required. Real analysis recommended.\nCS 542   Statistical Reinforcement Learning   credit: 4 Hours.\nTheory 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. 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.\nCS 544   Optimiz in Computer Vision   credit: 4 Hours.\nApplications 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. Prerequisite: One of\nCS 450\n,\nCSE 401\n,\nECE 491\n, or\nMATH 450\n; one of\nCS 473\n,\nCSE 414\nor\nMATH 473\n.\nCS 545   Machine Learning for Signal Processing   credit: 4 Hours.\nFundamentals 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. Prerequisite:\nMATH 415\n; one of\nCS 361\n,\nSTAT 361\n,\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n.\nCS 546   Advanced Topics in Natural Language Processing   credit: 4 Hours.\nAdvanced 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. 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:\nCS 447\nand one of\nCS 446\nor\nECE 449\n, or equivalent background.\nCS 562   Advanced Topics in Security, Privacy, and Machine Learning   credit: 4 Hours.\nAdvanced 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. 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\nCS 446\nor\nECE 449\nand one of\nCS 463\nor\nECE 424\n, or equivalent courses, by consent of instructor. Additional prerequisites or corequisites may be specified each term. See section information.\nCS 563   Advanced Computer Security   credit: 4 Hours.\nCurrent 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\nECE 524\n. Prerequisite: One of\nCS 461\n,\nCS 463\n,\nECE 422\nor\nECE 424\n.\nCS 565   Human-Computer Interaction   credit: 4 Hours.\nIn-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:\nCS 465\n.\nCS 567   Social Signals and Social Media   credit: 4 Hours.\nOnline 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. Prerequisite:\nCS 465\nor equivalent or permission of instructor. Prioritize PhD students, then others.\nCS 568   User-Centered Machine Learning   credit: 4 Hours.\nIntroduces 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. Prerequisite:\nCS 465\nor equivalent course work.\nCS 574   Randomized Algorithms   credit: 4 Hours.\nBasic 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. Prerequisite: One of\nCS 473\n,\nCSE 414\n, or\nMATH 473\n; one of\nMATH 461\n,\nMATH 463\nor\nSTAT 400\n.\nCS 576   Topics in Automated Deduction   credit: 2 to 4 Hours.\nAdvanced 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.\nCS 579   Computational Complexity   credit: 4 Hours.\nTuring 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\nECE 579\n. Prerequisite: One of\nCS 473\n,\nCSE 414\n,\nMATH 473\n,\nCS 475\nor\nMATH 475\n.\nCS 580   Topics in Algorithmic Game Theory   credit: 4 Hours.\nA 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. Prerequisite:\nCS 473\n.\nCS 581   Algorithmic Genomic Biology   credit: 4 Hours.\nGives 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. Prerequisite: One of\nCS 374\nor\nECE 374\nand one of\nCS 361\nor\nSTAT 361\n, or consent of instructor.\nCS 582   Machine Learning for Bioinformatics   credit: 4 Hours.\nThis 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. Prerequisite:\nCS 446\nor\nECE 449\n; Credit or concurrent enrollment in\nCS 466\n; or consent of instructor.\nCS 583   Approximation Algorithms   credit: 4 Hours.\nApproximation 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. Prerequisite: CS 573, CSE 515 or consent of instructor.\nCS 588   Autonomous Vehicle System Engineering   credit: 4 Hours.\nWill 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. Prerequisite:\nCS 374\n,\nECE 374\n,\nECE 484\n, or equivalent.\nCS 591   Advanced Seminar   credit: 0 to 4 Hours.\nSeminar 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.\nCS 598   Special Topics   credit: 2 to 4 Hours.\nSubject 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.","attrs_markdown":"- [Skip to Content](https:\/\/catalog.illinois.edu\/courses-of-instruction\/cs\/#contentarea)\n- [AZ Index](https:\/\/catalog.illinois.edu\/azindex\/)\n- [Catalog Home](https:\/\/catalog.illinois.edu\/)\n- [Undergraduate](https:\/\/catalog.illinois.edu\/undergraduate\/)\n- [Graduate](https:\/\/catalog.illinois.edu\/graduate\/)\n- [Professional](https:\/\/catalog.illinois.edu\/professional\/)\n- [Courses](https:\/\/catalog.illinois.edu\/courses-of-instruction\/)\n- [Colleges](https:\/\/catalog.illinois.edu\/schools\/)\n- [Archive](https:\/\/catalog.illinois.edu\/archivedacademiccatalogs\/)\n\n- [Admissions](https:\/\/illinois.edu\/admissions\/index.html)\n- [Registrar](https:\/\/registrar.illinois.edu\/)\n- [Calendar](https:\/\/senate.illinois.edu\/a_calendar.asp)\n# [2026-2027 Course Catalog](https:\/\/catalog.illinois.edu\/)\nMENU\n\n- [Undergraduate](https:\/\/catalog.illinois.edu\/undergraduate\/)\n- [Graduate](https:\/\/catalog.illinois.edu\/graduate\/)\n- [Professional](https:\/\/catalog.illinois.edu\/professional\/)\n- [Courses](https:\/\/catalog.illinois.edu\/courses-of-instruction\/)\n- [Colleges](https:\/\/catalog.illinois.edu\/schools\/)\n- [Program Index](https:\/\/catalog.illinois.edu\/degree-programs\/)\n- [Archive](https:\/\/catalog.illinois.edu\/archivedacademiccatalogs\/)\n\n![University of Illinois](https:\/\/catalog.illinois.edu\/images\/banner.png)\n\n2026-2027 Academic Catalog\n\n- [Home](https:\/\/catalog.illinois.edu\/)›\n- [Courses of Instruction](https:\/\/catalog.illinois.edu\/courses-of-instruction\/)›\n- CS - Computer Science\n\n2026-2027 Edition\n\n- [CS - Computer Science](https:\/\/catalog.illinois.edu\/courses-of-instruction\/cs\/)\n\nPrint Options (Opens Modal)\n\n# CS - Computer Science\n\n[CS Class Schedule](https:\/\/courses.illinois.edu\/schedule\/DEFAULT\/DEFAULT\/CS)\n\n### Courses\n**[CS 100 Computer Science Orientation credit: 1 Hour.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/100)**\n\nIntroduction 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.\n\n**[CS 101 Intro Computing: Engrg & Sci credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/101)**\n\nFundamental 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](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20220 \"MATH 220\") or [MATH 221](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20221 \"MATH 221\") or [MATH 231](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20231 \"MATH 231\") or [MATH 241](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20241 \"MATH 241\").   \nThis course satisfies the General Education Criteria for:  \nQuantitative Reasoning II\n\n**[CS 102 Little Bits to Big Ideas credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/102)**\n\nSame as [INFO 102](https:\/\/catalog.illinois.edu\/search\/?P=INFO%20102 \"INFO 102\"). See [INFO 102](https:\/\/catalog.illinois.edu\/search\/?P=INFO%20102 \"INFO 102\").\n\n**[CS 105 Intro Computing: Non-Tech credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/105)**\n\nComputing 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](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20112 \"MATH 112\").   \nThis course satisfies the General Education Criteria for:  \nQuantitative Reasoning I\n\n**[CS 107 Data Science Discovery credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/107)**\n\nSame as [IS 107](https:\/\/catalog.illinois.edu\/search\/?P=IS%20107 \"IS 107\") and [STAT 107](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20107 \"STAT 107\"). See [STAT 107](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20107 \"STAT 107\").  \nThis course satisfies the General Education Criteria for:  \nQuantitative Reasoning I\n\n**[CS 124 Introduction to Computer Science I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/124)**\n\nBasic 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\") and [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\"). Prerequisite: Three years of high school mathematics or [MATH 112](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20112 \"MATH 112\").  \nThis course satisfies the General Education Criteria for:  \nQuantitative Reasoning I\n\n**[CS 125 Introduction to Computer Science credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/125)**\n\nBasic 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\") and [CS 124](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\"). Prerequisite: Three years of high school mathematics or [MATH 112](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20112 \"MATH 112\").\n\n**[CS 126 Software Design Studio credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/126)**\n\nFundamental 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20242 \"CS 242\") and [CS 126](https:\/\/catalog.illinois.edu\/search\/?P=CS%20126 \"CS 126\"). Prerequisite: [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\"). For majors only.\n\n**[CS 128 Introduction to Computer Science II credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/128)**\n\nContinuation of [CS 124](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\"). More advanced concepts in computing and techniques and approaches for solving computational problems. Prerequisite: [CS 124](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\") or [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\").  \nThis course satisfies the General Education Criteria for:  \nQuantitative Reasoning II\n\n**[CS 173 Discrete Structures credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/173)**\n\n\\[IAI Code: CS915\\] 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 toward graduation for: Credit is not given for both [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\") and [MATH 213](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20213 \"MATH 213\"). Prerequisite: One of [CS 124](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\"), [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\"), [ECE 220](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20220 \"ECE 220\"); one of [MATH 220](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20220 \"MATH 220\"), [MATH 221](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20221 \"MATH 221\").\n\n**[CS 196 First-Year Student Honors credit: 1 Hour.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/196)**\n\nOffered 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).\n\n**[CS 199 Undergraduate Open Seminar in Computer Science credit: 0 to 5 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/199)**\n\nTopics vary. Approved for Letter and S\/U grading. May be repeated.\n\n**[CS 210 Ethical & Professional Issues credit: 2 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/210)**\n\nEthics for the computing profession. Ethical decision-making; licensing; intellectual property, freedom of information, and privacy. Credit is not given for both [CS 210](https:\/\/catalog.illinois.edu\/search\/?P=CS%20210 \"CS 210\") and either [CS 211](https:\/\/catalog.illinois.edu\/search\/?P=CS%20211 \"CS 211\") or [ECE 316](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20316 \"ECE 316\"). Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"). Junior standing required.\n\n**[CS 211 Ethical and Professional Conduct credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/211)**\n\nNavigating 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20211 \"CS 211\") and [CS 210](https:\/\/catalog.illinois.edu\/search\/?P=CS%20210 \"CS 210\") or [ECE 316](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20316 \"ECE 316\"). Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").  \nThis course satisfies the General Education Criteria for:  \nAdvanced Composition\n\n**[CS 222 Software Design Lab credit: 1 Hour.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/222)**\n\nDesign 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\"); credit or concurrent registration in [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"). Restricted to majors in Computer Science undergraduate curricula only.\n\n**[CS 225 Data Structures credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/225)**\n\nData 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 toward graduation for: [CS 277](https:\/\/catalog.illinois.edu\/search\/?P=CS%20277 \"CS 277\") if credit for [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") has been earned. Prerequisite: [CS 126](https:\/\/catalog.illinois.edu\/search\/?P=CS%20126 \"CS 126\") or [CS 128](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\") or [ECE 220](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20220 \"ECE 220\"); One of [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\"), [CS 413](https:\/\/catalog.illinois.edu\/search\/?P=CS%20413 \"CS 413\"), [MATH 213](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20213 \"MATH 213\"), [MATH 314](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20314 \"MATH 314\"), [MATH 347](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20347 \"MATH 347\"), [MATH 412](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20412 \"MATH 412\"), or [MATH 413](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20413 \"MATH 413\").   \nThis course satisfies the General Education Criteria for:  \nQuantitative Reasoning II\n\n**[CS 233 Computer Architecture credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/233)**\n\nFundamentals 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\") or [CS 128](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\"); [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\") or [MATH 213](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20213 \"MATH 213\"); credit or concurrent enrollment in [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 242 Programming Studio credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/242)**\n\nIntensive programming lab intended to strengthen skills in programming. Prerequisite: CS 241.\n\n**[CS 265 Innovation Illinois: From Accessible Design to Supercomputing Cultures credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/265)**\n\nSame as [IS 265](https:\/\/catalog.illinois.edu\/search\/?P=IS%20265 \"IS 265\") and [MACS 265](https:\/\/catalog.illinois.edu\/search\/?P=MACS%20265 \"MACS 265\"). See [MACS 265](https:\/\/catalog.illinois.edu\/search\/?P=MACS%20265 \"MACS 265\").\n\n**[CS 266 Community Innovation credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/266)**\n\nSame as [IS 266](https:\/\/catalog.illinois.edu\/search\/?P=IS%20266 \"IS 266\") and [MACS 266](https:\/\/catalog.illinois.edu\/search\/?P=MACS%20266 \"MACS 266\"). See [IS 266](https:\/\/catalog.illinois.edu\/search\/?P=IS%20266 \"IS 266\").  \nThis course satisfies the General Education Criteria for:  \nSocial & Beh Sci - Soc Sci  \nCultural Studies - Western\n\n**[CS 277 Algorithms and Data Structures for Data Science credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/277)**\n\nIntroduction 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20277 \"CS 277\") if credit for [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") is earned. Prerequisite: [STAT 207](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20207 \"STAT 207\"); one of [MATH 220](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20220 \"MATH 220\"), [MATH 221](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20221 \"MATH 221\"), [MATH 234](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20234 \"MATH 234\"). [CS 277](https:\/\/catalog.illinois.edu\/search\/?P=CS%20277 \"CS 277\") cannot be taken concurrently with [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 296 Honors Course credit: 1 Hour.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/296)**\n\nGroup 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).\n\n**[CS 307 Modeling and Learning in Data Science credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/307)**\n\nIntroduction 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](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20207 \"STAT 207\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 227](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20227 \"MATH 227\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\").\n\n**[CS 340 Introduction to Computer Systems credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/340)**\n\nBasics 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\") and CS 240. Prerequisite: [CS 128](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\") and [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 341 System Programming credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/341)**\n\nBasics 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") and either CS 241 or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"). Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") and [CS 233](https:\/\/catalog.illinois.edu\/search\/?P=CS%20233 \"CS 233\").\n\n**[CS 357 Numerical Methods I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/357)**\n\nFundamentals 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. (Counts for advanced hours in LAS). Same as [MATH 357](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20357 \"MATH 357\"). Credit is not given toward graduation for: Credit is not given towards graduation for [CS 357](https:\/\/catalog.illinois.edu\/search\/?P=CS%20357 \"CS 357\") if credit for [CS 450](https:\/\/catalog.illinois.edu\/search\/?P=CS%20450 \"CS 450\") has been earned. Prerequisite: One of [CS 101](https:\/\/catalog.illinois.edu\/search\/?P=CS%20101 \"CS 101\"), [CS 105](https:\/\/catalog.illinois.edu\/search\/?P=CS%20105 \"CS 105\"), [CS 124](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\"), [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\") or [ECE 220](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20220 \"ECE 220\"); [MATH 241](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20241 \"MATH 241\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 227](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20227 \"MATH 227\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 361 Probability & Statistics for Computer Science credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/361)**\n\nIntroduction 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. Credit is not given toward graduation for: Credit is not given for both [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\") and [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"). Prerequisite: [MATH 220](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20220 \"MATH 220\") or [MATH 221](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20221 \"MATH 221\"). Credit or concurrent registration in one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 227](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20227 \"MATH 227\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 374 Introduction to Algorithms & Models of Computation credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/374)**\n\nAnalysis 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"). Prerequisite: One of [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\"), [MATH 213](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20213 \"MATH 213\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 397 Individual Study credit: 1 to 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/397)**\n\nMay be repeated. Prerequisite: Consent of instructor.\n\n**[CS 398 Special Topics credit: 1 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/398)**\n\nSubject 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.\n\n**[CS 400 Accelerated Fundamentals of Computing I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/400)**\n\nThe 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.\n\n**[CS 401 Accelerated Fundamentals of Algorithms I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/401)**\n\nThe 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.\n\n**[CS 402 Accelerated Fundamentals of Computing II credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/402)**\n\nProvides 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20400 \"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.\n\n**[CS 403 Accelerated Fundamentals of Algorithms II credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/403)**\n\nThe 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20401 \"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.\n\n**[CS 407 Cryptography credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/407)**\n\nSame as [ECE 407](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20407 \"ECE 407\"). See [ECE 407](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20407 \"ECE 407\").\n\n**[CS 409 The Art of Web Programming credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/409)**\n\nClient- 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 410 Text Information Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/410)**\n\nTheory, 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 411 Database Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/411)**\n\nExamination 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 412 Introduction to Data Mining credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/412)**\n\nConcepts, 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 413 Intro to Combinatorics credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/413)**\n\nSame as [MATH 413](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20413 \"MATH 413\"). See [MATH 413](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20413 \"MATH 413\").\n\n**[CS 414 Multimedia Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/414)**\n\nOrganization 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 415 Game Development credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/415)**\n\nA 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 416 Data Visualization credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/416)**\n\nElements 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 417 Introduction to Extended Reality credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/417)**\n\nProvides a deep understanding of the fundamentals of virtual reality (VR) and augmented reality (AR) systems through practical experience implementing these extended reality (XR) systems. Topics covered include visual and audio display technology, tracking, human perception and psychophysics, building user interfaces for XR applications, and analyzing XR experiences. 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 128](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\"); one of [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 227](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20227 \"MATH 227\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 418 Interactive Computer Graphics credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/418)**\n\nBasic mathematical tools and computational techniques for modeling, rendering, and animating 3-D scenes. Same as [CSE 427](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20427 \"CSE 427\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); One of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\"), or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\"); [MATH 241](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20241 \"MATH 241\").\n\n**[CS 419 Production Computer Graphics credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/419)**\n\nAdvanced 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20418 \"CS 418\") or [CSE 427](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20427 \"CSE 427\").\n\n**[CS 420 Parallel Progrmg: Sci & Engrg credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/420)**\n\nFundamental 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20402 \"CSE 402\") and [ECE 492](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20492 \"ECE 492\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 421 Programming Languages & Compilers credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/421)**\n\nStructure 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20233 \"CS 233\"), CS 240, [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"); [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\"), or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 422 Programming Language Design credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/422)**\n\nExploration 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20421 \"CS 421\").\n\n**[CS 423 Operating Systems Design credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/423)**\n\nOrganization 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20423 \"CSE 423\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\"), or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 424 Real-Time Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/424)**\n\nSupervisory 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 425 Distributed Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/425)**\n\nProtocols, specification techniques, global states and their determination, reliable broadcast, transactions and commitment, security, and real-time systems. Same as [ECE 428](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20428 \"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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 426 Compiler Construction credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/426)**\n\nCompiler 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20421 \"CS 421\").\n\n**[CS 427 Software Engineering I credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/427)**\n\nSoftware 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20426 \"CSE 426\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of [CS 222](https:\/\/catalog.illinois.edu\/search\/?P=CS%20222 \"CS 222\"), CS 240, CS 241, [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 428 Software Engineering II credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/428)**\n\nContinuation of [CS 427](https:\/\/catalog.illinois.edu\/search\/?P=CS%20427 \"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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20429 \"CSE 429\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 427](https:\/\/catalog.illinois.edu\/search\/?P=CS%20427 \"CS 427\") or [CSE 426](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20426 \"CSE 426\").\n\n**[CS 429 Software Engineering II, ACP credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/429)**\n\nContinuation of [CS 427](https:\/\/catalog.illinois.edu\/search\/?P=CS%20427 \"CS 427\"). Identical to [CS 428](https:\/\/catalog.illinois.edu\/search\/?P=CS%20428 \"CS 428\") except for the additional writing component. See [CS 428](https:\/\/catalog.illinois.edu\/search\/?P=CS%20428 \"CS 428\"). 3 undergraduate hours. 3 graduate hours. Prerequisite: [CS 427](https:\/\/catalog.illinois.edu\/search\/?P=CS%20427 \"CS 427\") or [CSE 426](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20426 \"CSE 426\").\n\n**[CS 431 Embedded Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/431)**\n\nStudents 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 433 Computer System Organization credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/433)**\n\nComputer 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20422 \"CSE 422\"). 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 233](https:\/\/catalog.illinois.edu\/search\/?P=CS%20233 \"CS 233\").\n\n**[CS 434 Real World Algorithms for IoT and Data Science credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/434)**\n\nSame as [ECE 434](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20434 \"ECE 434\"). See [ECE 434](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20434 \"ECE 434\").\n\n**[CS 435 Cloud Networking credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/435)**\n\nProvides 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20435 \"CS 435\") and [CS 438](https:\/\/catalog.illinois.edu\/search\/?P=CS%20438 \"CS 438\")\/[ECE 438](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20438 \"ECE 438\"). Prerequisite: One of CS 240, CS 241, [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 436 Computer Networking Laboratory credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/436)**\n\nDesign, 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20435 \"ECE 435\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 240, CS 241, [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 437 Topics in Internet of Things credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/437)**\n\nTopics 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\"). Additional prerequisites may be specified each term. See section information.\n\n**[CS 438 Communication Networks credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/438)**\n\nLayered 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20438 \"ECE 438\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"); strongly recommend one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 439 Wireless Networks credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/439)**\n\nSame as [ECE 439](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20439 \"ECE 439\"). See [ECE 439](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20439 \"ECE 439\").\n\n**[CS 440 Artificial Intelligence credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/440)**\n\nMajor 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20448 \"ECE 448\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\"), [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\") or [BIOE 310](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20310 \"BIOE 310\").\n\n**[CS 441 Applied Machine Learning credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/441)**\n\nTechniques 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: One of [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") or [CS 277](https:\/\/catalog.illinois.edu\/search\/?P=CS%20277 \"CS 277\"), and one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [BIOE 310](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20310 \"BIOE 310\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 442 Trustworthy Machine Learning credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/442)**\n\nPrepares 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 440](https:\/\/catalog.illinois.edu\/search\/?P=CS%20440 \"CS 440\"), [ECE 448](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20448 \"ECE 448\"), [CS 441](https:\/\/catalog.illinois.edu\/search\/?P=CS%20441 \"CS 441\"), [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 443 Reinforcement Learning credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/443)**\n\nFundamental 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); [MATH 241](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20241 \"MATH 241\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 444 Deep Learning for Computer Vision credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/444)**\n\nProvides 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. Same as [ECE 494](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20494 \"ECE 494\"). 3 undergraduate hours. 4 graduate hours. Prerequisite: [MATH 241](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20241 \"MATH 241\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\"), or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\"). No previous exposure to machine learning is required.\n\n**[CS 445 Computational Photography credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/445)**\n\nComputer 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"), [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), and [MATH 231](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20231 \"MATH 231\").\n\n**[CS 446 Machine Learning credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/446)**\n\nPrinciples 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); One of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\"), [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\") or [BIOE 310](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20310 \"BIOE 310\").\n\n**[CS 447 Natural Language Processing credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/447)**\n\nPart-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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\") or [MATH 213](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20213 \"MATH 213\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\"), [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\") or [BIOE 310](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20310 \"BIOE 310\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 448 Audio Computing Laboratory credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/448)**\n\nComputational 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\"), or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\"), or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 450 Numerical Analysis credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/450)**\n\nLinear 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20401 \"CSE 401\"), [ECE 491](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20491 \"ECE 491\"), and [MATH 450](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20450 \"MATH 450\"). 3 undergraduate hours. 3 or 4 graduate hours. Credit is not given toward graduation for both [CS 450](https:\/\/catalog.illinois.edu\/search\/?P=CS%20450 \"CS 450\") and CS 457. Prerequisite: One of [CS 101](https:\/\/catalog.illinois.edu\/search\/?P=CS%20101 \"CS 101\"), [CS 124](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\") or [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\"); one of [CS 357](https:\/\/catalog.illinois.edu\/search\/?P=CS%20357 \"CS 357\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 357](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20357 \"MATH 357\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), or [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"); [MATH 285](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20285 \"MATH 285\").\n\n**[CS 452 Topics in Robotics credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/452)**\n\nTopics in robotics presented from a computational perspective, including artificial intelligence, algorithms, computational modeling, and\/or software engineering. Generating intelligent behavior for a physical robot poses unique computational challenges in decision making, perception, representations of three-dimensional worlds and movement, and system integration. This course introduces general computational principles used in robotics as well as performing in-depth study of selected subtopics. 3 undergraduate hours. 3 or 4 graduate hours. May be repeated in the same term up to 6 undergraduate or 8 graduate hours, or in separate terms up to 12 undergraduate or 16 graduate hours, if topics vary. Prerequisite: ([CS 128](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\") or [ECE 220](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20220 \"ECE 220\")) and [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") and (CS 241 or [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\")).\n\n**[CS 460 Security Laboratory credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/460)**\n\nOperating 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20461 \"CS 461\") via hands-on project. Same as [ECE 419](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20419 \"ECE 419\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 461](https:\/\/catalog.illinois.edu\/search\/?P=CS%20461 \"CS 461\") or [ECE 422](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20422 \"ECE 422\") or a combination of [CS 463](https:\/\/catalog.illinois.edu\/search\/?P=CS%20463 \"CS 463\") and one of [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 461 Computer Security I credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/461)**\n\nFundamental 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20422 \"ECE 422\"). 4 undergraduate hours. 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"), or a combination of [CS 233](https:\/\/catalog.illinois.edu\/search\/?P=CS%20233 \"CS 233\") and [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\").\n\n**[CS 462 Issues of Law and Policy in Computer Science credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/462)**\n\nExploration of the intersection of public policy and computing technology: overview of the US legal system and government, how computing technology is regulated in areas such as privacy, crime, intellectual property, commerce, and national security. Students will complete technical projects related to legal issues, such as scrutinizing DRM, evaluating digital forensics reports, and critiquing software patents. Students will also scrutinize excerpts from legal opinions. 3 undergraduate hours. 4 graduate hours. Credit is not given toward graduation for: Credit is not given for both [CS 462](https:\/\/catalog.illinois.edu\/search\/?P=CS%20462 \"CS 462\") and [CS 498](https:\/\/catalog.illinois.edu\/search\/?P=CS%20498 \"CS 498\"), Law \\&Policy Issues in CS. Prerequisite: [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\") or [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 463 Computer Security II credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/463)**\n\nProgram 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20424 \"ECE 424\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") and one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\"). [CS 441](https:\/\/catalog.illinois.edu\/search\/?P=CS%20441 \"CS 441\") completion is recommended.\n\n**[CS 464 Topics in Societal and Ethical Impacts of Computer Technology credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/464)**\n\nTopics 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"). One of [CS 210](https:\/\/catalog.illinois.edu\/search\/?P=CS%20210 \"CS 210\") or [CS 211](https:\/\/catalog.illinois.edu\/search\/?P=CS%20211 \"CS 211\") or [ECE 316](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20316 \"ECE 316\") or [PHIL 316](https:\/\/catalog.illinois.edu\/search\/?P=PHIL%20316 \"PHIL 316\"). One of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\") or [STAT 200](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20200 \"STAT 200\"). Restricted to students with senior standing.\n\n**[CS 465 User Interface Design credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/465)**\n\nA 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 466 Introduction to Bioinformatics credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/466)**\n\nAlgorithmic 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 467 Social Visualization credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/467)**\n\nVisualizing 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 468 Tech and Advertising Campaigns credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/468)**\n\nSame as [ADV 492](https:\/\/catalog.illinois.edu\/search\/?P=ADV%20492 \"ADV 492\"). See [ADV 492](https:\/\/catalog.illinois.edu\/search\/?P=ADV%20492 \"ADV 492\").\n\n**[CS 469 Computational Advertising Infrastructure credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/469)**\n\nThorough 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](https:\/\/catalog.illinois.edu\/search\/?P=ADV%20462 \"ADV 462\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 470 Social and Information Networks credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/470)**\n\nSocial 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\"), or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 473 Algorithms credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/473)**\n\nDesign 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20414 \"CSE 414\") and [MATH 473](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20473 \"MATH 473\"). 4 undergraduate hours. 4 graduate hours. Prerequisite: [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"), and one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 474 Logic in Computer Science credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/474)**\n\nAn 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\").\n\n**[CS 475 Formal Models of Computation credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/475)**\n\nFinite 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](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20475 \"MATH 475\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\").\n\n**[CS 476 Program Verification credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/476)**\n\nFormal 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\"), [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\") or [MATH 414](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20414 \"MATH 414\").\n\n**[CS 477 Formal Software Development Methods credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/477)**\n\nMathematical models, languages, and methods for software specification, development, and verification. Same as [ECE 478](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20478 \"ECE 478\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\"), [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\") or [MATH 414](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20414 \"MATH 414\").\n\n**[CS 478 Quantum Algorithms and Complexity credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/478)**\n\nA comprehensive introduction to the theoretical foundations of quantum computing, preparing students for advanced study in quantum information sciences: Building blocks of quantum information such as qubits and entanglement; basic quantum operations such as quantum gates and measurements, and key quantum protocols and algorithms like teleportation and Shor's factoring algorithm. Advanced topics include modern quantum algorithms, quantum learning, quantum complexity theory, cryptography, and error correction. Emphasis on theoretical aspects of design and analysis of quantum algorithms and their computational limits. Prior quantum physics knowledge is helpful but not required. 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\") or [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\"), [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\"), [PHYS 214](https:\/\/catalog.illinois.edu\/search\/?P=PHYS%20214 \"PHYS 214\") or [PHYS 486](https:\/\/catalog.illinois.edu\/search\/?P=PHYS%20486 \"PHYS 486\"). Credit or concurrent enrollment in CS\/[ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\") is encouraged.\n\n**[CS 481 Advanced Topics in Stochastic Processes & Applications credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/481)**\n\nSame as [IE 410](https:\/\/catalog.illinois.edu\/search\/?P=IE%20410 \"IE 410\"). See [IE 410](https:\/\/catalog.illinois.edu\/search\/?P=IE%20410 \"IE 410\").\n\n**[CS 482 Simulation credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/482)**\n\nSame as [IE 413](https:\/\/catalog.illinois.edu\/search\/?P=IE%20413 \"IE 413\"). See [IE 413](https:\/\/catalog.illinois.edu\/search\/?P=IE%20413 \"IE 413\").\n\n**[CS 483 Applied Parallel Programming credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/483)**\n\nSame as [CSE 408](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20408 \"CSE 408\") and [ECE 408](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20408 \"ECE 408\"). See [ECE 408](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20408 \"ECE 408\").\n\n**[CS 484 Parallel Programming credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/484)**\n\nTechniques 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\").\n\n**[CS 491 Seminar credit: 0 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/491)**\n\nSeminar 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.\n\n**[CS 492 Senior Project I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/492)**\n\nFirst 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\") must be taken as a sequence with either [CS 493](https:\/\/catalog.illinois.edu\/search\/?P=CS%20493 \"CS 493\") or [CS 494](https:\/\/catalog.illinois.edu\/search\/?P=CS%20494 \"CS 494\"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 492](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\") and a project course in another engineering department for the same project. Prerequisite: For Computer Science majors with senior standing.\n\n**[CS 493 Senior Project II, ACP credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/493)**\n\nContinuation of [CS 492](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\"). Identical to [CS 494](https:\/\/catalog.illinois.edu\/search\/?P=CS%20494 \"CS 494\") except for an additional writing component. See [CS 494](https:\/\/catalog.illinois.edu\/search\/?P=CS%20494 \"CS 494\"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 493](https:\/\/catalog.illinois.edu\/search\/?P=CS%20493 \"CS 493\") and a project course in another engineering department for the same project. Prerequisite: [CS 492](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\").  \nThis course satisfies the General Education Criteria for:  \nAdvanced Composition\n\n**[CS 494 Senior Project II credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/494)**\n\nContinuation of [CS 492](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 494](https:\/\/catalog.illinois.edu\/search\/?P=CS%20494 \"CS 494\") and a project course in another engineering department for the same project. Prerequisite: [CS 492](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\").\n\n**[CS 497 CS Team Project credit: 1 to 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/497)**\n\nStudent 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.\n\n**[CS 498 Special Topics credit: 1 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/498)**\n\nSubject 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.\n\n**[CS 499 Senior Thesis credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/499)**\n\nResearch 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.  \nThis course satisfies the General Education Criteria for:  \nAdvanced Composition\n\n**[CS 500 Current Topics in Computing Education Research credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/500)**\n\nCurrent 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. 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.\n\n**[CS 507 Topics in Cryptography credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/507)**\n\nModern 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. 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.\n\n**[CS 508 Manycore Parallel Algorithms credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/508)**\n\nSame as [ECE 508](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20508 \"ECE 508\"). See [ECE 508](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20508 \"ECE 508\").\n\n**[CS 510 Advanced Information Retrieval credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/510)**\n\nAdvanced 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. Prerequisite: One of [CS 410](https:\/\/catalog.illinois.edu\/search\/?P=CS%20410 \"CS 410\"), [CS 412](https:\/\/catalog.illinois.edu\/search\/?P=CS%20412 \"CS 412\"), [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\"), [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\") or [LING 406](https:\/\/catalog.illinois.edu\/search\/?P=LING%20406 \"LING 406\").\n\n**[CS 511 Advanced Data Management credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/511)**\n\nAdvanced 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20411 \"CS 411\").\n\n**[CS 512 Data Mining Principles credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/512)**\n\nAn 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20412 \"CS 412\").\n\n**[CS 513 Theory & Practice of Data Cleaning credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/513)**\n\nSame as [IS 537](https:\/\/catalog.illinois.edu\/search\/?P=IS%20537 \"IS 537\"). See [IS 537](https:\/\/catalog.illinois.edu\/search\/?P=IS%20537 \"IS 537\").\n\n**[CS 514 Advanced Topics in Network Science credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/514)**\n\nWe 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20412 \"CS 412\"); one of [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"). Additional prerequisites or corequisites may be specified each term. See section information.\n\n**[CS 519 Scientific Visualization credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/519)**\n\nVisualization 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20527 \"CSE 527\"). Prerequisite: [CS 418](https:\/\/catalog.illinois.edu\/search\/?P=CS%20418 \"CS 418\") or [CSE 427](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20427 \"CSE 427\").\n\n**[CS 521 Advanced Topics in Programming Systems credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/521)**\n\nAdvanced 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"); [CS 421](https:\/\/catalog.illinois.edu\/search\/?P=CS%20421 \"CS 421\"). Additional prerequisites or corequisites may be specified each term. See section information.\n\n**[CS 522 Programming Language Semantics credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/522)**\n\nTheory of programming languages including functional programming, meta-circular interpreters, typed, untyped and polymorphic lambda-calculi, and denotational semantics. Prerequisite: [CS 422](https:\/\/catalog.illinois.edu\/search\/?P=CS%20422 \"CS 422\") and [CS 426](https:\/\/catalog.illinois.edu\/search\/?P=CS%20426 \"CS 426\").\n\n**[CS 523 Advanced Operating Systems credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/523)**\n\nAdvanced 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. Prerequisite: One of [CS 423](https:\/\/catalog.illinois.edu\/search\/?P=CS%20423 \"CS 423\") or [CSE 423](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20423 \"CSE 423\"); one of [CS 425](https:\/\/catalog.illinois.edu\/search\/?P=CS%20425 \"CS 425\") or [ECE 428](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20428 \"ECE 428\"); and one of [CS 433](https:\/\/catalog.illinois.edu\/search\/?P=CS%20433 \"CS 433\") or [CSE 422](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20422 \"CSE 422\").\n\n**[CS 524 Concurrent Progrmg Languages credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/524)**\n\nTheory 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. Prerequisite: [CS 422](https:\/\/catalog.illinois.edu\/search\/?P=CS%20422 \"CS 422\"); one of [CS 475](https:\/\/catalog.illinois.edu\/search\/?P=CS%20475 \"CS 475\"), [MATH 475](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20475 \"MATH 475\") or [CS 476](https:\/\/catalog.illinois.edu\/search\/?P=CS%20476 \"CS 476\").\n\n**[CS 525 Advanced Distributed Systems credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/525)**\n\nPeer-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. Prerequisite: One of [CS 423](https:\/\/catalog.illinois.edu\/search\/?P=CS%20423 \"CS 423\"), [CSE 423](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20423 \"CSE 423\"), [CS 425](https:\/\/catalog.illinois.edu\/search\/?P=CS%20425 \"CS 425\"), [ECE 428](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20428 \"ECE 428\"), [CS 438](https:\/\/catalog.illinois.edu\/search\/?P=CS%20438 \"CS 438\") or [ECE 438](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20438 \"ECE 438\").\n\n**[CS 526 Advanced Compiler Construction credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/526)**\n\nIncremental and interactive compiling, error correction, code optimization, models of code generators. Prerequisite: [CS 426](https:\/\/catalog.illinois.edu\/search\/?P=CS%20426 \"CS 426\").\n\n**[CS 527 Topics in Software Engineering credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/527)**\n\nFault-tolerant software, software architecture, software patterns, multi-media software, and knowledge-based approaches to software engineering. Case studies. Prerequisite: [CS 428](https:\/\/catalog.illinois.edu\/search\/?P=CS%20428 \"CS 428\"), [CSE 429](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20429 \"CSE 429\") or [CS 429](https:\/\/catalog.illinois.edu\/search\/?P=CS%20429 \"CS 429\").\n\n**[CS 533 Parallel Computer Architecture credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/533)**\n\nTheoretical 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20522 \"CSE 522\"). Prerequisite: [CS 433](https:\/\/catalog.illinois.edu\/search\/?P=CS%20433 \"CS 433\") or [CSE 422](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20422 \"CSE 422\").\n\n**[CS 534 Advanced Topics in Computer Architecture credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/534)**\n\nCurrent 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20433 \"CS 433\") or [CSE 422](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20422 \"CSE 422\"). Additional prerequisites or co-requisites may be specified each term. See Class Schedule information.\n\n**[CS 536 Fault-Tolerant Dig Syst Design credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/536)**\n\nSame as [ECE 542](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20542 \"ECE 542\"). See [ECE 542](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20542 \"ECE 542\").\n\n**[CS 537 Advanced Topics in Internet of Things (IoT) credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/537)**\n\nAdvanced 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20425 \"CS 425\") or [ECE 428](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20428 \"ECE 428\"); one of [CS 438](https:\/\/catalog.illinois.edu\/search\/?P=CS%20438 \"CS 438\") or [ECE 438](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20438 \"ECE 438\"). Additional prerequisites may be specified each term. See section information.\n\n**[CS 538 Advanced Computer Networks credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/538)**\n\nAdvanced concepts in computer networks, including congestion control, quality of service, naming, routing, wireless networks, Internet architecture, measurement, network security, and selected recent research directions. Prerequisite: [CS 438](https:\/\/catalog.illinois.edu\/search\/?P=CS%20438 \"CS 438\") or [ECE 438](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20438 \"ECE 438\").\n\n**[CS 539 Distributed Algorithms credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/539)**\n\nSame as [ECE 526](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20526 \"ECE 526\"). See [ECE 526](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20526 \"ECE 526\").\n\n**[CS 540 Deep Learning Theory credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/540)**\n\nA 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. Prerequisite: Basic linear algebra, probability, proof-writing, and statistics required. Real analysis recommended.\n\n**[CS 541 Computer Systems Analysis credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/541)**\n\nSame as [ECE 541](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20541 \"ECE 541\"). See [ECE 541](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20541 \"ECE 541\").\n\n**[CS 542 Statistical Reinforcement Learning credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/542)**\n\nTheory 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. 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.\n\n**[CS 543 Computer Vision credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/543)**\n\nSame as [ECE 549](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20549 \"ECE 549\"). See [ECE 549](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20549 \"ECE 549\").\n\n**[CS 544 Optimiz in Computer Vision credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/544)**\n\nApplications 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. Prerequisite: One of [CS 450](https:\/\/catalog.illinois.edu\/search\/?P=CS%20450 \"CS 450\"), [CSE 401](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20401 \"CSE 401\"), [ECE 491](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20491 \"ECE 491\"), or [MATH 450](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20450 \"MATH 450\"); one of [CS 473](https:\/\/catalog.illinois.edu\/search\/?P=CS%20473 \"CS 473\"), [CSE 414](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20414 \"CSE 414\") or [MATH 473](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20473 \"MATH 473\").\n\n**[CS 545 Machine Learning for Signal Processing credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/545)**\n\nFundamentals 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. Prerequisite: [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 546 Advanced Topics in Natural Language Processing credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/546)**\n\nAdvanced 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20447 \"CS 447\") and one of [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"), or equivalent background.\n\n**[CS 547 Deep Learning credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/547)**\n\nSame as [IE 534](https:\/\/catalog.illinois.edu\/search\/?P=IE%20534 \"IE 534\"). See [IE 534](https:\/\/catalog.illinois.edu\/search\/?P=IE%20534 \"IE 534\").\n\n**[CS 549 Seminar in Cognitive Science credit: 2 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/549)**\n\nSame as [PSYC 514](https:\/\/catalog.illinois.edu\/search\/?P=PSYC%20514 \"PSYC 514\"), [ANTH 514](https:\/\/catalog.illinois.edu\/search\/?P=ANTH%20514 \"ANTH 514\"), [EPSY 551](https:\/\/catalog.illinois.edu\/search\/?P=EPSY%20551 \"EPSY 551\"), [LING 570](https:\/\/catalog.illinois.edu\/search\/?P=LING%20570 \"LING 570\"), and [PHIL 514](https:\/\/catalog.illinois.edu\/search\/?P=PHIL%20514 \"PHIL 514\"). See [PSYC 514](https:\/\/catalog.illinois.edu\/search\/?P=PSYC%20514 \"PSYC 514\").\n\n**[CS 554 Parallel Numerical Algorithms credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/554)**\n\nNumerical 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20512 \"CSE 512\"). Prerequisite: One of [CS 450](https:\/\/catalog.illinois.edu\/search\/?P=CS%20450 \"CS 450\"), [CSE 401](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20401 \"CSE 401\"), [ECE 491](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20491 \"ECE 491\"), [MATH 450](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20450 \"MATH 450\"), CS 457, [CS 555](https:\/\/catalog.illinois.edu\/search\/?P=CS%20555 \"CS 555\"), [CSE 510](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20510 \"CSE 510\") or [MATH 552](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20552 \"MATH 552\").\n\n**[CS 555 Numerical Methods for PDEs credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/555)**\n\nNumerical 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20510 \"CSE 510\") and [MATH 552](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20552 \"MATH 552\"). Prerequisite: [CS 450](https:\/\/catalog.illinois.edu\/search\/?P=CS%20450 \"CS 450\"), [CSE 401](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20401 \"CSE 401\"), [ECE 491](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20491 \"ECE 491\"), [MATH 450](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20450 \"MATH 450\") or CS 457.\n\n**[CS 556 Iterative & Multigrid Methods credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/556)**\n\nComprehensive 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20511 \"CSE 511\").\n\n**[CS 558 Topics in Numerical Analysis credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/558)**\n\nAdvanced topics in numerical analysis selected from areas of current research. Same as [CSE 513](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20513 \"CSE 513\"). May be repeated. Prerequisite: As specified for each topic offering, see Schedule or departmental course description.\n\n**[CS 562 Advanced Topics in Security, Privacy, and Machine Learning credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/562)**\n\nAdvanced 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\") and one of [CS 463](https:\/\/catalog.illinois.edu\/search\/?P=CS%20463 \"CS 463\") or [ECE 424](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20424 \"ECE 424\"), or equivalent courses, by consent of instructor. Additional prerequisites or corequisites may be specified each term. See section information.\n\n**[CS 563 Advanced Computer Security credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/563)**\n\nCurrent 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20524 \"ECE 524\"). Prerequisite: One of [CS 461](https:\/\/catalog.illinois.edu\/search\/?P=CS%20461 \"CS 461\"), [CS 463](https:\/\/catalog.illinois.edu\/search\/?P=CS%20463 \"CS 463\"), [ECE 422](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20422 \"ECE 422\") or [ECE 424](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20424 \"ECE 424\").\n\n**[CS 565 Human-Computer Interaction credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/565)**\n\nIn-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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20465 \"CS 465\").\n\n**[CS 567 Social Signals and Social Media credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/567)**\n\nOnline 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. Prerequisite: [CS 465](https:\/\/catalog.illinois.edu\/search\/?P=CS%20465 \"CS 465\") or equivalent or permission of instructor. Prioritize PhD students, then others.\n\n**[CS 568 User-Centered Machine Learning credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/568)**\n\nIntroduces 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. Prerequisite: [CS 465](https:\/\/catalog.illinois.edu\/search\/?P=CS%20465 \"CS 465\") or equivalent course work.\n\n**[CS 571 Combinatorial Mathematics credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/571)**\n\nSame as [MATH 580](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20580 \"MATH 580\"). See [MATH 580](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20580 \"MATH 580\").\n\n**[CS 572 Extremal Graph Theory credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/572)**\n\nSame as [MATH 581](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20581 \"MATH 581\"). See [MATH 581](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20581 \"MATH 581\").\n\n**[CS 574 Randomized Algorithms credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/574)**\n\nBasic 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. Prerequisite: One of [CS 473](https:\/\/catalog.illinois.edu\/search\/?P=CS%20473 \"CS 473\"), [CSE 414](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20414 \"CSE 414\"), or [MATH 473](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20473 \"MATH 473\"); one of [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 575 Methods of Combinatorics credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/575)**\n\nSame as [MATH 584](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20584 \"MATH 584\"). See [MATH 584](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20584 \"MATH 584\").\n\n**[CS 576 Topics in Automated Deduction credit: 2 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/576)**\n\nAdvanced 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.\n\n**[CS 579 Computational Complexity credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/579)**\n\nTuring 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20579 \"ECE 579\"). Prerequisite: One of [CS 473](https:\/\/catalog.illinois.edu\/search\/?P=CS%20473 \"CS 473\"), [CSE 414](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20414 \"CSE 414\"), [MATH 473](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20473 \"MATH 473\"), [CS 475](https:\/\/catalog.illinois.edu\/search\/?P=CS%20475 \"CS 475\") or [MATH 475](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20475 \"MATH 475\").\n\n**[CS 580 Topics in Algorithmic Game Theory credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/580)**\n\nA 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. Prerequisite: [CS 473](https:\/\/catalog.illinois.edu\/search\/?P=CS%20473 \"CS 473\").\n\n**[CS 581 Algorithmic Genomic Biology credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/581)**\n\nGives 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. Prerequisite: One of [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\") and one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\") or [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), or consent of instructor.\n\n**[CS 582 Machine Learning for Bioinformatics credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/582)**\n\nThis 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. Prerequisite: [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"); Credit or concurrent enrollment in [CS 466](https:\/\/catalog.illinois.edu\/search\/?P=CS%20466 \"CS 466\"); or consent of instructor.\n\n**[CS 583 Approximation Algorithms credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/583)**\n\nApproximation 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. Prerequisite: CS 573, CSE 515 or consent of instructor.\n\n**[CS 584 Embedded System Verification credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/584)**\n\nSame as [ECE 584](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20584 \"ECE 584\"). See [ECE 584](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20584 \"ECE 584\").\n\n**[CS 585 Hardware Verification credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/585)**\n\nSame as [ECE 519](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20519 \"ECE 519\"). See [ECE 519](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20519 \"ECE 519\").\n\n**[CS 586 Combinatorial Optimization credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/586)**\n\nSame as [IE 519](https:\/\/catalog.illinois.edu\/search\/?P=IE%20519 \"IE 519\"). See [IE 519](https:\/\/catalog.illinois.edu\/search\/?P=IE%20519 \"IE 519\").\n\n**[CS 588 Autonomous Vehicle System Engineering credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/588)**\n\nWill 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. Prerequisite: [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\"), [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"), [ECE 484](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20484 \"ECE 484\"), or equivalent.\n\n**[CS 591 Advanced Seminar credit: 0 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/591)**\n\nSeminar 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.\n\n**[CS 597 Individual Study credit: 2 to 16 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/597)**\n\nIndividual study or reading in a subject not covered in normal course offerings. May be repeated. Prerequisite: Consent of instructor.\n\n**[CS 598 Special Topics credit: 2 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/598)**\n\nSubject 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.\n\n**[CS 599 Thesis Research credit: 0 to 16 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/599)**\n\nApproved for S\/U grading only. May be repeated in the same term or in separate terms.\n\n[2026-2027 Course Catalog](https:\/\/catalog.illinois.edu\/courses-of-instruction\/cs\/)\n\n## Course Catalog Resources\n- [Academic Calendar](https:\/\/senate.illinois.edu\/a_calendar.asp)\n- [Class Schedule](https:\/\/courses.illinois.edu\/)\n- [Student Affairs](http:\/\/studentaffairs.illinois.edu\/)\n- [Registration, Tuition, and Cost Information](https:\/\/registrar.illinois.edu\/)\n##\n### Around Campus\n- [Campus Map](https:\/\/map.illinois.edu\/view?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University Admissions](https:\/\/illinois.edu\/admissions\/index.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Careers at Illinois](https:\/\/jobs.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University News](https:\/\/news.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Giving at Illinois](https:\/\/giving.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University Alumni](https:\/\/illinois.edu\/alumni\/index.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Athletics](https:\/\/illinois.edu\/athletics\/index.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University Library](https:\/\/www.library.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n\n### Universitywide Resources\n- [Emergency Services](https:\/\/illinois.edu\/resources\/emergency.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University Calendars](https:\/\/illinois.edu\/resources\/calendars.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University Directory](https:\/\/directory.illinois.edu\/search?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Student Assistance Center](https:\/\/odos.illinois.edu\/community-of-care\/student-assistance-%0A%09%09%09%09%09%09center\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Health and Wellness](https:\/\/wellness.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Parents and Families](https:\/\/newstudent.illinois.edu\/parents\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University COVID-19 Information](https:\/\/covid19.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n\n### About Illinois\n- [VC of Diversity, Equity and Inclusion](https:\/\/diversity.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Land Acknowledgement](https:\/\/chancellor.illinois.edu\/land-acknowledgement-statement\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University Research and Innovation](https:\/\/research.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Technology Services](https:\/\/techservices.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Illinois International](https:\/\/illinois.edu\/international\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University Strategic Plan](https:\/\/strategicplan.illinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [University of Illinois System](https:\/\/www.uillinois.edu\/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n\n- [Privacy](https:\/\/www.vpaa.uillinois.edu\/resources\/web_privacy?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Copyright](https:\/\/illinois.edu\/resources\/website\/copyright.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n- [Accessibility](https:\/\/illinois.edu\/resources\/website\/accessibility.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer)\n\n[Back to top](https:\/\/catalog.illinois.edu\/courses-of-instruction\/cs\/#header)\n\nClose this window\n\n## Print Options\n\n- [Send Page to Printer](https:\/\/catalog.illinois.edu\/courses-of-instruction\/cs\/)\n  Print this page.\n- [Download Page (PDF)](https:\/\/catalog.illinois.edu\/courses-of-instruction\/cs\/cs.pdf)\n  The PDF will include all information unique to this page.\n- [2026-2027 Catalog (PDF)](https:\/\/catalog.illinois.edu\/pdf\/University%20of%20Illinois%20Urbana-Champaign%202026-2027.pdf)\n  A copy of the full 2026-2027 catalog.","attrs_readable_markdown":"### Courses\n**[CS 100 Computer Science Orientation credit: 1 Hour.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/100)**\n\nIntroduction 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.\n\n**[CS 101 Intro Computing: Engrg & Sci credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/101)**\n\nFundamental 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](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20220 \"MATH 220\") or [MATH 221](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20221 \"MATH 221\") or [MATH 231](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20231 \"MATH 231\") or [MATH 241](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20241 \"MATH 241\").   \nThis course satisfies the General Education Criteria for:  \nQuantitative Reasoning II\n\n**[CS 105 Intro Computing: Non-Tech credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/105)**\n\nComputing 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](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20112 \"MATH 112\").   \nThis course satisfies the General Education Criteria for:  \nQuantitative Reasoning I\n\n**[CS 124 Introduction to Computer Science I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/124)**\n\nBasic 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\") and [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\"). Prerequisite: Three years of high school mathematics or [MATH 112](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20112 \"MATH 112\").  \nThis course satisfies the General Education Criteria for:  \nQuantitative Reasoning I\n\n**[CS 173 Discrete Structures credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/173)**\n\n\\[IAI Code: CS915\\] 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 toward graduation for: Credit is not given for both [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\") and [MATH 213](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20213 \"MATH 213\"). Prerequisite: One of [CS 124](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\"), [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\"), [ECE 220](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20220 \"ECE 220\"); one of [MATH 220](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20220 \"MATH 220\"), [MATH 221](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20221 \"MATH 221\").\n\n**[CS 196 First-Year Student Honors credit: 1 Hour.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/196)**\n\nOffered 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).\n\n**[CS 211 Ethical and Professional Conduct credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/211)**\n\nNavigating 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20211 \"CS 211\") and [CS 210](https:\/\/catalog.illinois.edu\/search\/?P=CS%20210 \"CS 210\") or [ECE 316](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20316 \"ECE 316\"). Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").  \nThis course satisfies the General Education Criteria for:  \nAdvanced Composition\n\n**[CS 222 Software Design Lab credit: 1 Hour.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/222)**\n\nDesign 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\"); credit or concurrent registration in [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"). Restricted to majors in Computer Science undergraduate curricula only.\n\n**[CS 233 Computer Architecture credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/233)**\n\nFundamentals 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\") or [CS 128](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\"); [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\") or [MATH 213](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20213 \"MATH 213\"); credit or concurrent enrollment in [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 277 Algorithms and Data Structures for Data Science credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/277)**\n\nIntroduction 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20277 \"CS 277\") if credit for [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") is earned. Prerequisite: [STAT 207](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20207 \"STAT 207\"); one of [MATH 220](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20220 \"MATH 220\"), [MATH 221](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20221 \"MATH 221\"), [MATH 234](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20234 \"MATH 234\"). [CS 277](https:\/\/catalog.illinois.edu\/search\/?P=CS%20277 \"CS 277\") cannot be taken concurrently with [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 296 Honors Course credit: 1 Hour.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/296)**\n\nGroup 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).\n\n**[CS 340 Introduction to Computer Systems credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/340)**\n\nBasics 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\") and CS 240. Prerequisite: [CS 128](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\") and [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 341 System Programming credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/341)**\n\nBasics 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") and either CS 241 or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"). Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") and [CS 233](https:\/\/catalog.illinois.edu\/search\/?P=CS%20233 \"CS 233\").\n\n**[CS 357 Numerical Methods I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/357)**\n\nFundamentals 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. (Counts for advanced hours in LAS). Same as [MATH 357](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20357 \"MATH 357\"). Credit is not given toward graduation for: Credit is not given towards graduation for [CS 357](https:\/\/catalog.illinois.edu\/search\/?P=CS%20357 \"CS 357\") if credit for [CS 450](https:\/\/catalog.illinois.edu\/search\/?P=CS%20450 \"CS 450\") has been earned. Prerequisite: One of [CS 101](https:\/\/catalog.illinois.edu\/search\/?P=CS%20101 \"CS 101\"), [CS 105](https:\/\/catalog.illinois.edu\/search\/?P=CS%20105 \"CS 105\"), [CS 124](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\"), [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\") or [ECE 220](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20220 \"ECE 220\"); [MATH 241](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20241 \"MATH 241\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 227](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20227 \"MATH 227\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 361 Probability & Statistics for Computer Science credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/361)**\n\nIntroduction 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. Credit is not given toward graduation for: Credit is not given for both [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\") and [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"). Prerequisite: [MATH 220](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20220 \"MATH 220\") or [MATH 221](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20221 \"MATH 221\"). Credit or concurrent registration in one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 227](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20227 \"MATH 227\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 374 Introduction to Algorithms & Models of Computation credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/374)**\n\nAnalysis 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"). Prerequisite: One of [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\"), [MATH 213](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20213 \"MATH 213\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 398 Special Topics credit: 1 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/398)**\n\nSubject 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.\n\n**[CS 400 Accelerated Fundamentals of Computing I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/400)**\n\nThe 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.\n\n**[CS 401 Accelerated Fundamentals of Algorithms I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/401)**\n\nThe 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.\n\n**[CS 402 Accelerated Fundamentals of Computing II credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/402)**\n\nProvides 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20400 \"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.\n\n**[CS 403 Accelerated Fundamentals of Algorithms II credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/403)**\n\nThe 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20401 \"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.\n\n**[CS 409 The Art of Web Programming credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/409)**\n\nClient- 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 410 Text Information Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/410)**\n\nTheory, 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 411 Database Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/411)**\n\nExamination 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 412 Introduction to Data Mining credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/412)**\n\nConcepts, 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 414 Multimedia Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/414)**\n\nOrganization 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 415 Game Development credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/415)**\n\nA 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 416 Data Visualization credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/416)**\n\nElements 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 419 Production Computer Graphics credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/419)**\n\nAdvanced 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20418 \"CS 418\") or [CSE 427](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20427 \"CSE 427\").\n\n**[CS 420 Parallel Progrmg: Sci & Engrg credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/420)**\n\nFundamental 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20402 \"CSE 402\") and [ECE 492](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20492 \"ECE 492\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 421 Programming Languages & Compilers credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/421)**\n\nStructure 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20233 \"CS 233\"), CS 240, [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"); [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\"), or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 424 Real-Time Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/424)**\n\nSupervisory 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 426 Compiler Construction credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/426)**\n\nCompiler 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20421 \"CS 421\").\n\n**[CS 428 Software Engineering II credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/428)**\n\nContinuation of [CS 427](https:\/\/catalog.illinois.edu\/search\/?P=CS%20427 \"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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20429 \"CSE 429\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 427](https:\/\/catalog.illinois.edu\/search\/?P=CS%20427 \"CS 427\") or [CSE 426](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20426 \"CSE 426\").\n\n**[CS 431 Embedded Systems credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/431)**\n\nStudents 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 433 Computer System Organization credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/433)**\n\nComputer 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20422 \"CSE 422\"). 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 233](https:\/\/catalog.illinois.edu\/search\/?P=CS%20233 \"CS 233\").\n\n**[CS 435 Cloud Networking credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/435)**\n\nProvides 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20435 \"CS 435\") and [CS 438](https:\/\/catalog.illinois.edu\/search\/?P=CS%20438 \"CS 438\")\/[ECE 438](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20438 \"ECE 438\"). Prerequisite: One of CS 240, CS 241, [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 436 Computer Networking Laboratory credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/436)**\n\nDesign, 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20435 \"ECE 435\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 240, CS 241, [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 437 Topics in Internet of Things credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/437)**\n\nTopics 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\"). Additional prerequisites may be specified each term. See section information.\n\n**[CS 438 Communication Networks credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/438)**\n\nLayered 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20438 \"ECE 438\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"); strongly recommend one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 440 Artificial Intelligence credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/440)**\n\nMajor 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20448 \"ECE 448\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\"), [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\") or [BIOE 310](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20310 \"BIOE 310\").\n\n**[CS 441 Applied Machine Learning credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/441)**\n\nTechniques 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: One of [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") or [CS 277](https:\/\/catalog.illinois.edu\/search\/?P=CS%20277 \"CS 277\"), and one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [BIOE 310](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20310 \"BIOE 310\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 442 Trustworthy Machine Learning credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/442)**\n\nPrepares 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 440](https:\/\/catalog.illinois.edu\/search\/?P=CS%20440 \"CS 440\"), [ECE 448](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20448 \"ECE 448\"), [CS 441](https:\/\/catalog.illinois.edu\/search\/?P=CS%20441 \"CS 441\"), [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 443 Reinforcement Learning credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/443)**\n\nFundamental 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); [MATH 241](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20241 \"MATH 241\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 444 Deep Learning for Computer Vision credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/444)**\n\nProvides 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. Same as [ECE 494](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20494 \"ECE 494\"). 3 undergraduate hours. 4 graduate hours. Prerequisite: [MATH 241](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20241 \"MATH 241\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\"), or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\"). No previous exposure to machine learning is required.\n\n**[CS 446 Machine Learning credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/446)**\n\nPrinciples 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); One of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\"), [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\") or [BIOE 310](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20310 \"BIOE 310\").\n\n**[CS 447 Natural Language Processing credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/447)**\n\nPart-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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\") or [MATH 213](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20213 \"MATH 213\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\"), [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\") or [BIOE 310](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20310 \"BIOE 310\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 448 Audio Computing Laboratory credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/448)**\n\nComputational 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\"), or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\"), or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 450 Numerical Analysis credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/450)**\n\nLinear 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20401 \"CSE 401\"), [ECE 491](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20491 \"ECE 491\"), and [MATH 450](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20450 \"MATH 450\"). 3 undergraduate hours. 3 or 4 graduate hours. Credit is not given toward graduation for both [CS 450](https:\/\/catalog.illinois.edu\/search\/?P=CS%20450 \"CS 450\") and CS 457. Prerequisite: One of [CS 101](https:\/\/catalog.illinois.edu\/search\/?P=CS%20101 \"CS 101\"), [CS 124](https:\/\/catalog.illinois.edu\/search\/?P=CS%20124 \"CS 124\") or [CS 125](https:\/\/catalog.illinois.edu\/search\/?P=CS%20125 \"CS 125\"); one of [CS 357](https:\/\/catalog.illinois.edu\/search\/?P=CS%20357 \"CS 357\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 357](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20357 \"MATH 357\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), or [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"); [MATH 285](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20285 \"MATH 285\").\n\n**[CS 452 Topics in Robotics credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/452)**\n\nTopics in robotics presented from a computational perspective, including artificial intelligence, algorithms, computational modeling, and\/or software engineering. Generating intelligent behavior for a physical robot poses unique computational challenges in decision making, perception, representations of three-dimensional worlds and movement, and system integration. This course introduces general computational principles used in robotics as well as performing in-depth study of selected subtopics. 3 undergraduate hours. 3 or 4 graduate hours. May be repeated in the same term up to 6 undergraduate or 8 graduate hours, or in separate terms up to 12 undergraduate or 16 graduate hours, if topics vary. Prerequisite: ([CS 128](https:\/\/catalog.illinois.edu\/search\/?P=CS%20128 \"CS 128\") or [ECE 220](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20220 \"ECE 220\")) and [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") and (CS 241 or [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\")).\n\n**[CS 460 Security Laboratory credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/460)**\n\nOperating 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20461 \"CS 461\") via hands-on project. Same as [ECE 419](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20419 \"ECE 419\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 461](https:\/\/catalog.illinois.edu\/search\/?P=CS%20461 \"CS 461\") or [ECE 422](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20422 \"ECE 422\") or a combination of [CS 463](https:\/\/catalog.illinois.edu\/search\/?P=CS%20463 \"CS 463\") and one of [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\"), [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 461 Computer Security I credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/461)**\n\nFundamental 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20422 \"ECE 422\"). 4 undergraduate hours. 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\"), or a combination of [CS 233](https:\/\/catalog.illinois.edu\/search\/?P=CS%20233 \"CS 233\") and [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\").\n\n**[CS 462 Issues of Law and Policy in Computer Science credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/462)**\n\nExploration of the intersection of public policy and computing technology: overview of the US legal system and government, how computing technology is regulated in areas such as privacy, crime, intellectual property, commerce, and national security. Students will complete technical projects related to legal issues, such as scrutinizing DRM, evaluating digital forensics reports, and critiquing software patents. Students will also scrutinize excerpts from legal opinions. 3 undergraduate hours. 4 graduate hours. Credit is not given toward graduation for: Credit is not given for both [CS 462](https:\/\/catalog.illinois.edu\/search\/?P=CS%20462 \"CS 462\") and [CS 498](https:\/\/catalog.illinois.edu\/search\/?P=CS%20498 \"CS 498\"), Law \\&Policy Issues in CS. Prerequisite: [CS 340](https:\/\/catalog.illinois.edu\/search\/?P=CS%20340 \"CS 340\") or [CS 341](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\") or [ECE 391](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20391 \"ECE 391\").\n\n**[CS 463 Computer Security II credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/463)**\n\nProgram 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20424 \"ECE 424\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\") and one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\"). [CS 441](https:\/\/catalog.illinois.edu\/search\/?P=CS%20441 \"CS 441\") completion is recommended.\n\n**[CS 464 Topics in Societal and Ethical Impacts of Computer Technology credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/464)**\n\nTopics 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"). One of [CS 210](https:\/\/catalog.illinois.edu\/search\/?P=CS%20210 \"CS 210\") or [CS 211](https:\/\/catalog.illinois.edu\/search\/?P=CS%20211 \"CS 211\") or [ECE 316](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20316 \"ECE 316\") or [PHIL 316](https:\/\/catalog.illinois.edu\/search\/?P=PHIL%20316 \"PHIL 316\"). One of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\") or [STAT 200](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20200 \"STAT 200\"). Restricted to students with senior standing.\n\n**[CS 465 User Interface Design credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/465)**\n\nA 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 466 Introduction to Bioinformatics credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/466)**\n\nAlgorithmic 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 467 Social Visualization credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/467)**\n\nVisualizing 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\").\n\n**[CS 469 Computational Advertising Infrastructure credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/469)**\n\nThorough 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](https:\/\/catalog.illinois.edu\/search\/?P=ADV%20462 \"ADV 462\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\") or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 470 Social and Information Networks credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/470)**\n\nSocial 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); [CS 173](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\"); one of [MATH 225](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20225 \"MATH 225\"), [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"), [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"), [ASRM 406](https:\/\/catalog.illinois.edu\/search\/?P=ASRM%20406 \"ASRM 406\"), or [BIOE 210](https:\/\/catalog.illinois.edu\/search\/?P=BIOE%20210 \"BIOE 210\").\n\n**[CS 473 Algorithms credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/473)**\n\nDesign 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20414 \"CSE 414\") and [MATH 473](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20473 \"MATH 473\"). 4 undergraduate hours. 4 graduate hours. Prerequisite: [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"), and one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 474 Logic in Computer Science credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/474)**\n\nAn 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20173 \"CS 173\"); [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\").\n\n**[CS 475 Formal Models of Computation credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/475)**\n\nFinite 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](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20475 \"MATH 475\"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\").\n\n**[CS 476 Program Verification credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/476)**\n\nFormal 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\"), [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\") or [MATH 414](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20414 \"MATH 414\").\n\n**[CS 478 Quantum Algorithms and Complexity credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/478)**\n\nA comprehensive introduction to the theoretical foundations of quantum computing, preparing students for advanced study in quantum information sciences: Building blocks of quantum information such as qubits and entanglement; basic quantum operations such as quantum gates and measurements, and key quantum protocols and algorithms like teleportation and Shor's factoring algorithm. Advanced topics include modern quantum algorithms, quantum learning, quantum complexity theory, cryptography, and error correction. Emphasis on theoretical aspects of design and analysis of quantum algorithms and their computational limits. Prior quantum physics knowledge is helpful but not required. 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 225](https:\/\/catalog.illinois.edu\/search\/?P=CS%20225 \"CS 225\"); one of [MATH 257](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20257 \"MATH 257\"), [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\") or [MATH 416](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20416 \"MATH 416\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [ECE 313](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20313 \"ECE 313\"), [MATH 362](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20362 \"MATH 362\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\"), [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\"), [PHYS 214](https:\/\/catalog.illinois.edu\/search\/?P=PHYS%20214 \"PHYS 214\") or [PHYS 486](https:\/\/catalog.illinois.edu\/search\/?P=PHYS%20486 \"PHYS 486\"). Credit or concurrent enrollment in CS\/[ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\") is encouraged.\n\n**[CS 484 Parallel Programming credit: 3 or 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/484)**\n\nTechniques 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20341 \"CS 341\").\n\n**[CS 491 Seminar credit: 0 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/491)**\n\nSeminar 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.\n\n**[CS 492 Senior Project I credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/492)**\n\nFirst 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\") must be taken as a sequence with either [CS 493](https:\/\/catalog.illinois.edu\/search\/?P=CS%20493 \"CS 493\") or [CS 494](https:\/\/catalog.illinois.edu\/search\/?P=CS%20494 \"CS 494\"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 492](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\") and a project course in another engineering department for the same project. Prerequisite: For Computer Science majors with senior standing.\n\n**[CS 493 Senior Project II, ACP credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/493)**\n\nContinuation of [CS 492](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\"). Identical to [CS 494](https:\/\/catalog.illinois.edu\/search\/?P=CS%20494 \"CS 494\") except for an additional writing component. See [CS 494](https:\/\/catalog.illinois.edu\/search\/?P=CS%20494 \"CS 494\"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 493](https:\/\/catalog.illinois.edu\/search\/?P=CS%20493 \"CS 493\") and a project course in another engineering department for the same project. Prerequisite: [CS 492](https:\/\/catalog.illinois.edu\/search\/?P=CS%20492 \"CS 492\").  \nThis course satisfies the General Education Criteria for:  \nAdvanced Composition\n\n**[CS 497 CS Team Project credit: 1 to 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/497)**\n\nStudent 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.\n\n**[CS 498 Special Topics credit: 1 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/498)**\n\nSubject 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.\n\n**[CS 499 Senior Thesis credit: 3 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/499)**\n\nResearch 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.  \nThis course satisfies the General Education Criteria for:  \nAdvanced Composition\n\n**[CS 500 Current Topics in Computing Education Research credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/500)**\n\nCurrent 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. 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.\n\n**[CS 507 Topics in Cryptography credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/507)**\n\nModern 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. 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.\n\n**[CS 510 Advanced Information Retrieval credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/510)**\n\nAdvanced 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. Prerequisite: One of [CS 410](https:\/\/catalog.illinois.edu\/search\/?P=CS%20410 \"CS 410\"), [CS 412](https:\/\/catalog.illinois.edu\/search\/?P=CS%20412 \"CS 412\"), [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\"), [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\") or [LING 406](https:\/\/catalog.illinois.edu\/search\/?P=LING%20406 \"LING 406\").\n\n**[CS 511 Advanced Data Management credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/511)**\n\nAdvanced 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20411 \"CS 411\").\n\n**[CS 512 Data Mining Principles credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/512)**\n\nAn 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20412 \"CS 412\").\n\n**[CS 514 Advanced Topics in Network Science credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/514)**\n\nWe 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20412 \"CS 412\"); one of [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"). Additional prerequisites or corequisites may be specified each term. See section information.\n\n**[CS 519 Scientific Visualization credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/519)**\n\nVisualization 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](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20527 \"CSE 527\"). Prerequisite: [CS 418](https:\/\/catalog.illinois.edu\/search\/?P=CS%20418 \"CS 418\") or [CSE 427](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20427 \"CSE 427\").\n\n**[CS 521 Advanced Topics in Programming Systems credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/521)**\n\nAdvanced 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"); [CS 421](https:\/\/catalog.illinois.edu\/search\/?P=CS%20421 \"CS 421\"). Additional prerequisites or corequisites may be specified each term. See section information.\n\n**[CS 523 Advanced Operating Systems credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/523)**\n\nAdvanced 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. Prerequisite: One of [CS 423](https:\/\/catalog.illinois.edu\/search\/?P=CS%20423 \"CS 423\") or [CSE 423](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20423 \"CSE 423\"); one of [CS 425](https:\/\/catalog.illinois.edu\/search\/?P=CS%20425 \"CS 425\") or [ECE 428](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20428 \"ECE 428\"); and one of [CS 433](https:\/\/catalog.illinois.edu\/search\/?P=CS%20433 \"CS 433\") or [CSE 422](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20422 \"CSE 422\").\n\n**[CS 524 Concurrent Progrmg Languages credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/524)**\n\nTheory 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. Prerequisite: [CS 422](https:\/\/catalog.illinois.edu\/search\/?P=CS%20422 \"CS 422\"); one of [CS 475](https:\/\/catalog.illinois.edu\/search\/?P=CS%20475 \"CS 475\"), [MATH 475](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20475 \"MATH 475\") or [CS 476](https:\/\/catalog.illinois.edu\/search\/?P=CS%20476 \"CS 476\").\n\n**[CS 525 Advanced Distributed Systems credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/525)**\n\nPeer-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. Prerequisite: One of [CS 423](https:\/\/catalog.illinois.edu\/search\/?P=CS%20423 \"CS 423\"), [CSE 423](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20423 \"CSE 423\"), [CS 425](https:\/\/catalog.illinois.edu\/search\/?P=CS%20425 \"CS 425\"), [ECE 428](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20428 \"ECE 428\"), [CS 438](https:\/\/catalog.illinois.edu\/search\/?P=CS%20438 \"CS 438\") or [ECE 438](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20438 \"ECE 438\").\n\n**[CS 534 Advanced Topics in Computer Architecture credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/534)**\n\nCurrent 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20433 \"CS 433\") or [CSE 422](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20422 \"CSE 422\"). Additional prerequisites or co-requisites may be specified each term. See Class Schedule information.\n\n**[CS 537 Advanced Topics in Internet of Things (IoT) credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/537)**\n\nAdvanced 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20425 \"CS 425\") or [ECE 428](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20428 \"ECE 428\"); one of [CS 438](https:\/\/catalog.illinois.edu\/search\/?P=CS%20438 \"CS 438\") or [ECE 438](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20438 \"ECE 438\"). Additional prerequisites may be specified each term. See section information.\n\n**[CS 540 Deep Learning Theory credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/540)**\n\nA 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. Prerequisite: Basic linear algebra, probability, proof-writing, and statistics required. Real analysis recommended.\n\n**[CS 542 Statistical Reinforcement Learning credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/542)**\n\nTheory 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. 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.\n\n**[CS 544 Optimiz in Computer Vision credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/544)**\n\nApplications 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. Prerequisite: One of [CS 450](https:\/\/catalog.illinois.edu\/search\/?P=CS%20450 \"CS 450\"), [CSE 401](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20401 \"CSE 401\"), [ECE 491](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20491 \"ECE 491\"), or [MATH 450](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20450 \"MATH 450\"); one of [CS 473](https:\/\/catalog.illinois.edu\/search\/?P=CS%20473 \"CS 473\"), [CSE 414](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20414 \"CSE 414\") or [MATH 473](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20473 \"MATH 473\").\n\n**[CS 545 Machine Learning for Signal Processing credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/545)**\n\nFundamentals 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. Prerequisite: [MATH 415](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20415 \"MATH 415\"); one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\"), [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 546 Advanced Topics in Natural Language Processing credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/546)**\n\nAdvanced 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20447 \"CS 447\") and one of [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"), or equivalent background.\n\n**[CS 562 Advanced Topics in Security, Privacy, and Machine Learning credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/562)**\n\nAdvanced 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. 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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\") and one of [CS 463](https:\/\/catalog.illinois.edu\/search\/?P=CS%20463 \"CS 463\") or [ECE 424](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20424 \"ECE 424\"), or equivalent courses, by consent of instructor. Additional prerequisites or corequisites may be specified each term. See section information.\n\n**[CS 563 Advanced Computer Security credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/563)**\n\nCurrent 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20524 \"ECE 524\"). Prerequisite: One of [CS 461](https:\/\/catalog.illinois.edu\/search\/?P=CS%20461 \"CS 461\"), [CS 463](https:\/\/catalog.illinois.edu\/search\/?P=CS%20463 \"CS 463\"), [ECE 422](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20422 \"ECE 422\") or [ECE 424](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20424 \"ECE 424\").\n\n**[CS 565 Human-Computer Interaction credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/565)**\n\nIn-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](https:\/\/catalog.illinois.edu\/search\/?P=CS%20465 \"CS 465\").\n\n**[CS 567 Social Signals and Social Media credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/567)**\n\nOnline 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. Prerequisite: [CS 465](https:\/\/catalog.illinois.edu\/search\/?P=CS%20465 \"CS 465\") or equivalent or permission of instructor. Prioritize PhD students, then others.\n\n**[CS 568 User-Centered Machine Learning credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/568)**\n\nIntroduces 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. Prerequisite: [CS 465](https:\/\/catalog.illinois.edu\/search\/?P=CS%20465 \"CS 465\") or equivalent course work.\n\n**[CS 574 Randomized Algorithms credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/574)**\n\nBasic 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. Prerequisite: One of [CS 473](https:\/\/catalog.illinois.edu\/search\/?P=CS%20473 \"CS 473\"), [CSE 414](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20414 \"CSE 414\"), or [MATH 473](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20473 \"MATH 473\"); one of [MATH 461](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20461 \"MATH 461\"), [MATH 463](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20463 \"MATH 463\") or [STAT 400](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20400 \"STAT 400\").\n\n**[CS 576 Topics in Automated Deduction credit: 2 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/576)**\n\nAdvanced 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.\n\n**[CS 579 Computational Complexity credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/579)**\n\nTuring 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](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20579 \"ECE 579\"). Prerequisite: One of [CS 473](https:\/\/catalog.illinois.edu\/search\/?P=CS%20473 \"CS 473\"), [CSE 414](https:\/\/catalog.illinois.edu\/search\/?P=CSE%20414 \"CSE 414\"), [MATH 473](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20473 \"MATH 473\"), [CS 475](https:\/\/catalog.illinois.edu\/search\/?P=CS%20475 \"CS 475\") or [MATH 475](https:\/\/catalog.illinois.edu\/search\/?P=MATH%20475 \"MATH 475\").\n\n**[CS 580 Topics in Algorithmic Game Theory credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/580)**\n\nA 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. Prerequisite: [CS 473](https:\/\/catalog.illinois.edu\/search\/?P=CS%20473 \"CS 473\").\n\n**[CS 581 Algorithmic Genomic Biology credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/581)**\n\nGives 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. Prerequisite: One of [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\") or [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\") and one of [CS 361](https:\/\/catalog.illinois.edu\/search\/?P=CS%20361 \"CS 361\") or [STAT 361](https:\/\/catalog.illinois.edu\/search\/?P=STAT%20361 \"STAT 361\"), or consent of instructor.\n\n**[CS 582 Machine Learning for Bioinformatics credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/582)**\n\nThis 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. Prerequisite: [CS 446](https:\/\/catalog.illinois.edu\/search\/?P=CS%20446 \"CS 446\") or [ECE 449](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20449 \"ECE 449\"); Credit or concurrent enrollment in [CS 466](https:\/\/catalog.illinois.edu\/search\/?P=CS%20466 \"CS 466\"); or consent of instructor.\n\n**[CS 583 Approximation Algorithms credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/583)**\n\nApproximation 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. Prerequisite: CS 573, CSE 515 or consent of instructor.\n\n**[CS 588 Autonomous Vehicle System Engineering credit: 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/588)**\n\nWill 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. Prerequisite: [CS 374](https:\/\/catalog.illinois.edu\/search\/?P=CS%20374 \"CS 374\"), [ECE 374](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20374 \"ECE 374\"), [ECE 484](https:\/\/catalog.illinois.edu\/search\/?P=ECE%20484 \"ECE 484\"), or equivalent.\n\n**[CS 591 Advanced Seminar credit: 0 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/591)**\n\nSeminar 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.\n\n**[CS 598 Special Topics credit: 2 to 4 Hours.](https:\/\/courses.illinois.edu\/schedule\/terms\/CS\/598)**\n\nSubject 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.","meta_canonical":null}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📄

INDEXABLE

✅

CRAWLED

12 days ago

🤖

ROBOTS ALLOWED

Page Info Filters

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	PASS	`download_stamp > now() - 6 MONTH`	0.4 months ago
History drop	PASS	`isNull(history_drop_reason)`	No drop reason
Spam/ban	PASS	`fh_dont_index != 1 AND ml_spam_score = 0`	ml_spam_score=0
Canonical	PASS	`meta_canonical IS NULL OR = '' OR = src_unparsed`	Not set

Page Details

Property	Value
URL	https://catalog.illinois.edu/courses-of-instruction/cs/
Last Crawled	2026-03-28 14:20:23 (12 days ago)
First Indexed	2021-04-07 11:29:05 (5 years ago)
HTTP Status Code	200
Meta Title	CS - Computer Science \| 2026-2027 Course Catalog \| University of Illinois Urbana-Champaign
Meta Description	null
Meta Canonical	null
Boilerpipe Text	Courses CS 100 Computer Science Orientation credit: 1 Hour. 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. CS 101 Intro Computing: Engrg & Sci credit: 3 Hours. 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 . This course satisfies the General Education Criteria for: Quantitative Reasoning II CS 105 Intro Computing: Non-Tech credit: 3 Hours. 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 . This course satisfies the General Education Criteria for: Quantitative Reasoning I CS 124 Introduction to Computer Science I credit: 3 Hours. 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 . This course satisfies the General Education Criteria for: Quantitative Reasoning I CS 173 Discrete Structures credit: 3 Hours. [IAI Code: CS915] 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 toward graduation for: 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 . CS 196 First-Year Student Honors credit: 1 Hour. 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). CS 211 Ethical and Professional Conduct credit: 3 Hours. 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 . This course satisfies the General Education Criteria for: Advanced Composition CS 222 Software Design Lab credit: 1 Hour. 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. CS 233 Computer Architecture credit: 4 Hours. 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 . CS 277 Algorithms and Data Structures for Data Science credit: 4 Hours. 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 . CS 296 Honors Course credit: 1 Hour. 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). CS 340 Introduction to Computer Systems credit: 3 Hours. 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 128 and CS 225 . CS 341 System Programming credit: 4 Hours. 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 . CS 357 Numerical Methods I credit: 3 Hours. 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. (Counts for advanced hours in LAS). Same as MATH 357 . Credit is not given toward graduation for: Credit is not given towards graduation for CS 357 if credit for CS 450 has been earned. Prerequisite: One of CS 101 , CS 105 , CS 124 , CS 125 or ECE 220 ; MATH 241 ; one of MATH 225 , MATH 227 , MATH 257 , MATH 415 , MATH 416 , ASRM 406 or BIOE 210 . CS 361 Probability & Statistics for Computer Science credit: 3 Hours. 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. Credit is not given toward graduation for: 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 227 , MATH 257 , MATH 415 , MATH 416 , ASRM 406 or BIOE 210 . CS 374 Introduction to Algorithms & Models of Computation credit: 4 Hours. 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 . CS 398 Special Topics credit: 1 to 4 Hours. 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. CS 400 Accelerated Fundamentals of Computing I credit: 3 Hours. 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. CS 401 Accelerated Fundamentals of Algorithms I credit: 3 Hours. 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. CS 402 Accelerated Fundamentals of Computing II credit: 3 Hours. 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. CS 403 Accelerated Fundamentals of Algorithms II credit: 3 Hours. 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. CS 409 The Art of Web Programming credit: 3 or 4 Hours. 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 . CS 410 Text Information Systems credit: 3 or 4 Hours. 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 . CS 411 Database Systems credit: 3 or 4 Hours. 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 . CS 412 Introduction to Data Mining credit: 3 or 4 Hours. 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 . CS 414 Multimedia Systems credit: 3 or 4 Hours. 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 . CS 415 Game Development credit: 3 or 4 Hours. 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 . CS 416 Data Visualization credit: 3 or 4 Hours. 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 . CS 419 Production Computer Graphics credit: 3 or 4 Hours. 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 . CS 420 Parallel Progrmg: Sci & Engrg credit: 3 or 4 Hours. 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 . CS 421 Programming Languages & Compilers credit: 3 or 4 Hours. 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 . CS 424 Real-Time Systems credit: 3 or 4 Hours. 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 . CS 426 Compiler Construction credit: 3 or 4 Hours. 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 . CS 428 Software Engineering II credit: 3 or 4 Hours. 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 . CS 431 Embedded Systems credit: 3 or 4 Hours. 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 . CS 433 Computer System Organization credit: 3 or 4 Hours. 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 . CS 435 Cloud Networking credit: 3 or 4 Hours. 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 . CS 436 Computer Networking Laboratory credit: 3 or 4 Hours. 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 . CS 437 Topics in Internet of Things credit: 3 or 4 Hours. 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. CS 438 Communication Networks credit: 3 or 4 Hours. 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 . CS 440 Artificial Intelligence credit: 3 or 4 Hours. 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 . CS 441 Applied Machine Learning credit: 3 or 4 Hours. 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: One of CS 225 or CS 277 , and one of CS 361 , STAT 361 , ECE 313 , BIOE 310 , MATH 362 , MATH 461 , MATH 463 or STAT 400 . CS 442 Trustworthy Machine Learning credit: 3 or 4 Hours. 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 . CS 443 Reinforcement Learning credit: 3 or 4 Hours. 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 . CS 444 Deep Learning for Computer Vision credit: 3 or 4 Hours. 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. Same as ECE 494 . 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 ; one of CS 361 , STAT 361 , ECE 313 , MATH 362 , MATH 461 , MATH 463 or STAT 400 . No previous exposure to machine learning is required. CS 446 Machine Learning credit: 3 or 4 Hours. 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 . CS 447 Natural Language Processing credit: 3 or 4 Hours. 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 . CS 448 Audio Computing Laboratory credit: 3 or 4 Hours. 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 . CS 450 Numerical Analysis credit: 3 or 4 Hours. 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 . CS 452 Topics in Robotics credit: 3 or 4 Hours. Topics in robotics presented from a computational perspective, including artificial intelligence, algorithms, computational modeling, and/or software engineering. Generating intelligent behavior for a physical robot poses unique computational challenges in decision making, perception, representations of three-dimensional worlds and movement, and system integration. This course introduces general computational principles used in robotics as well as performing in-depth study of selected subtopics. 3 undergraduate hours. 3 or 4 graduate hours. May be repeated in the same term up to 6 undergraduate or 8 graduate hours, or in separate terms up to 12 undergraduate or 16 graduate hours, if topics vary. Prerequisite: ( CS 128 or ECE 220 ) and CS 225 and (CS 241 or CS 341 or ECE 391 ). CS 460 Security Laboratory credit: 3 or 4 Hours. 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 or a combination of CS 463 and one of CS 340 , CS 341 or ECE 391 . CS 461 Computer Security I credit: 4 Hours. 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 . CS 462 Issues of Law and Policy in Computer Science credit: 3 or 4 Hours. Exploration of the intersection of public policy and computing technology: overview of the US legal system and government, how computing technology is regulated in areas such as privacy, crime, intellectual property, commerce, and national security. Students will complete technical projects related to legal issues, such as scrutinizing DRM, evaluating digital forensics reports, and critiquing software patents. Students will also scrutinize excerpts from legal opinions. 3 undergraduate hours. 4 graduate hours. Credit is not given toward graduation for: Credit is not given for both CS 462 and CS 498 , Law &Policy Issues in CS. Prerequisite: CS 340 or CS 341 or ECE 391 . CS 463 Computer Security II credit: 3 or 4 Hours. 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 225 and one of CS 361 , STAT 361 , ECE 313 , MATH 362 , MATH 461 , MATH 463 or STAT 400 . CS 441 completion is recommended. CS 464 Topics in Societal and Ethical Impacts of Computer Technology credit: 3 Hours. 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. CS 465 User Interface Design credit: 4 Hours. 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 . CS 466 Introduction to Bioinformatics credit: 3 or 4 Hours. 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 . CS 467 Social Visualization credit: 3 or 4 Hours. 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 . CS 469 Computational Advertising Infrastructure credit: 3 or 4 Hours. 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 . CS 470 Social and Information Networks credit: 3 or 4 Hours. 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 . CS 473 Algorithms credit: 4 Hours. 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 . CS 474 Logic in Computer Science credit: 3 or 4 Hours. 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 . CS 475 Formal Models of Computation credit: 3 or 4 Hours. 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 . CS 476 Program Verification credit: 3 or 4 Hours. 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 . CS 478 Quantum Algorithms and Complexity credit: 3 or 4 Hours. A comprehensive introduction to the theoretical foundations of quantum computing, preparing students for advanced study in quantum information sciences: Building blocks of quantum information such as qubits and entanglement; basic quantum operations such as quantum gates and measurements, and key quantum protocols and algorithms like teleportation and Shor's factoring algorithm. Advanced topics include modern quantum algorithms, quantum learning, quantum complexity theory, cryptography, and error correction. Emphasis on theoretical aspects of design and analysis of quantum algorithms and their computational limits. Prior quantum physics knowledge is helpful but not required. 3 undergraduate hours. 4 graduate hours. Prerequisite: CS 225 ; one of MATH 257 , MATH 415 or MATH 416 ; one of CS 361 , STAT 361 , ECE 313 , MATH 362 , MATH 461 , MATH 463 , STAT 400 , PHYS 214 or PHYS 486 . Credit or concurrent enrollment in CS/ ECE 374 is encouraged. CS 484 Parallel Programming credit: 3 or 4 Hours. 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 . CS 491 Seminar credit: 0 to 4 Hours. 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. CS 492 Senior Project I credit: 3 Hours. 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. CS 493 Senior Project II, ACP credit: 3 Hours. 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 . This course satisfies the General Education Criteria for: Advanced Composition CS 497 CS Team Project credit: 1 to 3 Hours. 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. CS 498 Special Topics credit: 1 to 4 Hours. 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. CS 499 Senior Thesis credit: 3 Hours. 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. This course satisfies the General Education Criteria for: Advanced Composition CS 500 Current Topics in Computing Education Research credit: 4 Hours. 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. 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. CS 507 Topics in Cryptography credit: 4 Hours. 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. 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. CS 510 Advanced Information Retrieval credit: 4 Hours. 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. Prerequisite: One of CS 410 , CS 412 , CS 446 , ECE 449 or LING 406 . CS 511 Advanced Data Management credit: 4 Hours. 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 . CS 512 Data Mining Principles credit: 4 Hours. 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 . CS 514 Advanced Topics in Network Science credit: 4 Hours. 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. 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. CS 519 Scientific Visualization credit: 4 Hours. 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 . Prerequisite: CS 418 or CSE 427 . CS 521 Advanced Topics in Programming Systems credit: 4 Hours. 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. 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. CS 523 Advanced Operating Systems credit: 4 Hours. 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. Prerequisite: One of CS 423 or CSE 423 ; one of CS 425 or ECE 428 ; and one of CS 433 or CSE 422 . CS 524 Concurrent Progrmg Languages credit: 4 Hours. 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. Prerequisite: CS 422 ; one of CS 475 , MATH 475 or CS 476 . CS 525 Advanced Distributed Systems credit: 4 Hours. 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. Prerequisite: One of CS 423 , CSE 423 , CS 425 , ECE 428 , CS 438 or ECE 438 . CS 534 Advanced Topics in Computer Architecture credit: 4 Hours. 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. 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. CS 537 Advanced Topics in Internet of Things (IoT) credit: 4 Hours. 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. 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. CS 540 Deep Learning Theory credit: 4 Hours. 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. Prerequisite: Basic linear algebra, probability, proof-writing, and statistics required. Real analysis recommended. CS 542 Statistical Reinforcement Learning credit: 4 Hours. 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. 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. CS 544 Optimiz in Computer Vision credit: 4 Hours. 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. Prerequisite: One of CS 450 , CSE 401 , ECE 491 , or MATH 450 ; one of CS 473 , CSE 414 or MATH 473 . CS 545 Machine Learning for Signal Processing credit: 4 Hours. 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. Prerequisite: MATH 415 ; one of CS 361 , STAT 361 , MATH 461 , MATH 463 or STAT 400 . CS 546 Advanced Topics in Natural Language Processing credit: 4 Hours. 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. 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. CS 562 Advanced Topics in Security, Privacy, and Machine Learning credit: 4 Hours. 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. 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. CS 563 Advanced Computer Security credit: 4 Hours. 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 . Prerequisite: One of CS 461 , CS 463 , ECE 422 or ECE 424 . CS 565 Human-Computer Interaction credit: 4 Hours. 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 . CS 567 Social Signals and Social Media credit: 4 Hours. 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. Prerequisite: CS 465 or equivalent or permission of instructor. Prioritize PhD students, then others. CS 568 User-Centered Machine Learning credit: 4 Hours. 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. Prerequisite: CS 465 or equivalent course work. CS 574 Randomized Algorithms credit: 4 Hours. 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. Prerequisite: One of CS 473 , CSE 414 , or MATH 473 ; one of MATH 461 , MATH 463 or STAT 400 . CS 576 Topics in Automated Deduction credit: 2 to 4 Hours. 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. CS 579 Computational Complexity credit: 4 Hours. 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 . Prerequisite: One of CS 473 , CSE 414 , MATH 473 , CS 475 or MATH 475 . CS 580 Topics in Algorithmic Game Theory credit: 4 Hours. 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. Prerequisite: CS 473 . CS 581 Algorithmic Genomic Biology credit: 4 Hours. 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. Prerequisite: One of CS 374 or ECE 374 and one of CS 361 or STAT 361 , or consent of instructor. CS 582 Machine Learning for Bioinformatics credit: 4 Hours. 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. Prerequisite: CS 446 or ECE 449 ; Credit or concurrent enrollment in CS 466 ; or consent of instructor. CS 583 Approximation Algorithms credit: 4 Hours. 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. Prerequisite: CS 573, CSE 515 or consent of instructor. CS 588 Autonomous Vehicle System Engineering credit: 4 Hours. 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. Prerequisite: CS 374 , ECE 374 , ECE 484 , or equivalent. CS 591 Advanced Seminar credit: 0 to 4 Hours. 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. CS 598 Special Topics credit: 2 to 4 Hours. 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.
Markdown	- [Skip to Content](https://catalog.illinois.edu/courses-of-instruction/cs/#contentarea) - [AZ Index](https://catalog.illinois.edu/azindex/) - [Catalog Home](https://catalog.illinois.edu/) - [Undergraduate](https://catalog.illinois.edu/undergraduate/) - [Graduate](https://catalog.illinois.edu/graduate/) - [Professional](https://catalog.illinois.edu/professional/) - [Courses](https://catalog.illinois.edu/courses-of-instruction/) - [Colleges](https://catalog.illinois.edu/schools/) - [Archive](https://catalog.illinois.edu/archivedacademiccatalogs/) - [Admissions](https://illinois.edu/admissions/index.html) - [Registrar](https://registrar.illinois.edu/) - [Calendar](https://senate.illinois.edu/a_calendar.asp) # [2026-2027 Course Catalog](https://catalog.illinois.edu/) MENU - [Undergraduate](https://catalog.illinois.edu/undergraduate/) - [Graduate](https://catalog.illinois.edu/graduate/) - [Professional](https://catalog.illinois.edu/professional/) - [Courses](https://catalog.illinois.edu/courses-of-instruction/) - [Colleges](https://catalog.illinois.edu/schools/) - [Program Index](https://catalog.illinois.edu/degree-programs/) - [Archive](https://catalog.illinois.edu/archivedacademiccatalogs/) ![University of Illinois](https://catalog.illinois.edu/images/banner.png) 2026-2027 Academic Catalog - [Home](https://catalog.illinois.edu/)› - [Courses of Instruction](https://catalog.illinois.edu/courses-of-instruction/)› - CS - Computer Science 2026-2027 Edition - [CS - Computer Science](https://catalog.illinois.edu/courses-of-instruction/cs/) Print Options (Opens Modal) # CS - Computer Science [CS Class Schedule](https://courses.illinois.edu/schedule/DEFAULT/DEFAULT/CS) ### Courses [CS 100 Computer Science Orientation credit: 1 Hour.](https://courses.illinois.edu/schedule/terms/CS/100) 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. [CS 101 Intro Computing: Engrg & Sci credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/101) 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](https://catalog.illinois.edu/search/?P=MATH%20220 "MATH 220") or [MATH 221](https://catalog.illinois.edu/search/?P=MATH%20221 "MATH 221") or [MATH 231](https://catalog.illinois.edu/search/?P=MATH%20231 "MATH 231") or [MATH 241](https://catalog.illinois.edu/search/?P=MATH%20241 "MATH 241"). This course satisfies the General Education Criteria for: Quantitative Reasoning II [CS 102 Little Bits to Big Ideas credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/102) Same as [INFO 102](https://catalog.illinois.edu/search/?P=INFO%20102 "INFO 102"). See [INFO 102](https://catalog.illinois.edu/search/?P=INFO%20102 "INFO 102"). [CS 105 Intro Computing: Non-Tech credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/105) 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](https://catalog.illinois.edu/search/?P=MATH%20112 "MATH 112"). This course satisfies the General Education Criteria for: Quantitative Reasoning I [CS 107 Data Science Discovery credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/107) Same as [IS 107](https://catalog.illinois.edu/search/?P=IS%20107 "IS 107") and [STAT 107](https://catalog.illinois.edu/search/?P=STAT%20107 "STAT 107"). See [STAT 107](https://catalog.illinois.edu/search/?P=STAT%20107 "STAT 107"). This course satisfies the General Education Criteria for: Quantitative Reasoning I [CS 124 Introduction to Computer Science I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/124) 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](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124") and [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125"). Prerequisite: Three years of high school mathematics or [MATH 112](https://catalog.illinois.edu/search/?P=MATH%20112 "MATH 112"). This course satisfies the General Education Criteria for: Quantitative Reasoning I [CS 125 Introduction to Computer Science credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/125) 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](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125") and [CS 124](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124"). Prerequisite: Three years of high school mathematics or [MATH 112](https://catalog.illinois.edu/search/?P=MATH%20112 "MATH 112"). [CS 126 Software Design Studio credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/126) 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](https://catalog.illinois.edu/search/?P=CS%20242 "CS 242") and [CS 126](https://catalog.illinois.edu/search/?P=CS%20126 "CS 126"). Prerequisite: [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125"). For majors only. [CS 128 Introduction to Computer Science II credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/128) Continuation of [CS 124](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124"). More advanced concepts in computing and techniques and approaches for solving computational problems. Prerequisite: [CS 124](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124") or [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125"). This course satisfies the General Education Criteria for: Quantitative Reasoning II [CS 173 Discrete Structures credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/173) \[IAI Code: CS915\] 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 toward graduation for: Credit is not given for both [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173") and [MATH 213](https://catalog.illinois.edu/search/?P=MATH%20213 "MATH 213"). Prerequisite: One of [CS 124](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124"), [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125"), [ECE 220](https://catalog.illinois.edu/search/?P=ECE%20220 "ECE 220"); one of [MATH 220](https://catalog.illinois.edu/search/?P=MATH%20220 "MATH 220"), [MATH 221](https://catalog.illinois.edu/search/?P=MATH%20221 "MATH 221"). [CS 196 First-Year Student Honors credit: 1 Hour.](https://courses.illinois.edu/schedule/terms/CS/196) 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). [CS 199 Undergraduate Open Seminar in Computer Science credit: 0 to 5 Hours.](https://courses.illinois.edu/schedule/terms/CS/199) Topics vary. Approved for Letter and S/U grading. May be repeated. [CS 210 Ethical & Professional Issues credit: 2 Hours.](https://courses.illinois.edu/schedule/terms/CS/210) Ethics for the computing profession. Ethical decision-making; licensing; intellectual property, freedom of information, and privacy. Credit is not given for both [CS 210](https://catalog.illinois.edu/search/?P=CS%20210 "CS 210") and either [CS 211](https://catalog.illinois.edu/search/?P=CS%20211 "CS 211") or [ECE 316](https://catalog.illinois.edu/search/?P=ECE%20316 "ECE 316"). Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). Junior standing required. [CS 211 Ethical and Professional Conduct credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/211) 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](https://catalog.illinois.edu/search/?P=CS%20211 "CS 211") and [CS 210](https://catalog.illinois.edu/search/?P=CS%20210 "CS 210") or [ECE 316](https://catalog.illinois.edu/search/?P=ECE%20316 "ECE 316"). Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). This course satisfies the General Education Criteria for: Advanced Composition [CS 222 Software Design Lab credit: 1 Hour.](https://courses.illinois.edu/schedule/terms/CS/222) 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](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128"); credit or concurrent registration in [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). Restricted to majors in Computer Science undergraduate curricula only. [CS 225 Data Structures credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/225) 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 toward graduation for: [CS 277](https://catalog.illinois.edu/search/?P=CS%20277 "CS 277") if credit for [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") has been earned. Prerequisite: [CS 126](https://catalog.illinois.edu/search/?P=CS%20126 "CS 126") or [CS 128](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128") or [ECE 220](https://catalog.illinois.edu/search/?P=ECE%20220 "ECE 220"); One of [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173"), [CS 413](https://catalog.illinois.edu/search/?P=CS%20413 "CS 413"), [MATH 213](https://catalog.illinois.edu/search/?P=MATH%20213 "MATH 213"), [MATH 314](https://catalog.illinois.edu/search/?P=MATH%20314 "MATH 314"), [MATH 347](https://catalog.illinois.edu/search/?P=MATH%20347 "MATH 347"), [MATH 412](https://catalog.illinois.edu/search/?P=MATH%20412 "MATH 412"), or [MATH 413](https://catalog.illinois.edu/search/?P=MATH%20413 "MATH 413"). This course satisfies the General Education Criteria for: Quantitative Reasoning II [CS 233 Computer Architecture credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/233) 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](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125") or [CS 128](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128"); [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173") or [MATH 213](https://catalog.illinois.edu/search/?P=MATH%20213 "MATH 213"); credit or concurrent enrollment in [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 242 Programming Studio credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/242) Intensive programming lab intended to strengthen skills in programming. Prerequisite: CS 241. [CS 265 Innovation Illinois: From Accessible Design to Supercomputing Cultures credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/265) Same as [IS 265](https://catalog.illinois.edu/search/?P=IS%20265 "IS 265") and [MACS 265](https://catalog.illinois.edu/search/?P=MACS%20265 "MACS 265"). See [MACS 265](https://catalog.illinois.edu/search/?P=MACS%20265 "MACS 265"). [CS 266 Community Innovation credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/266) Same as [IS 266](https://catalog.illinois.edu/search/?P=IS%20266 "IS 266") and [MACS 266](https://catalog.illinois.edu/search/?P=MACS%20266 "MACS 266"). See [IS 266](https://catalog.illinois.edu/search/?P=IS%20266 "IS 266"). This course satisfies the General Education Criteria for: Social & Beh Sci - Soc Sci Cultural Studies - Western [CS 277 Algorithms and Data Structures for Data Science credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/277) 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](https://catalog.illinois.edu/search/?P=CS%20277 "CS 277") if credit for [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") is earned. Prerequisite: [STAT 207](https://catalog.illinois.edu/search/?P=STAT%20207 "STAT 207"); one of [MATH 220](https://catalog.illinois.edu/search/?P=MATH%20220 "MATH 220"), [MATH 221](https://catalog.illinois.edu/search/?P=MATH%20221 "MATH 221"), [MATH 234](https://catalog.illinois.edu/search/?P=MATH%20234 "MATH 234"). [CS 277](https://catalog.illinois.edu/search/?P=CS%20277 "CS 277") cannot be taken concurrently with [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 296 Honors Course credit: 1 Hour.](https://courses.illinois.edu/schedule/terms/CS/296) 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). [CS 307 Modeling and Learning in Data Science credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/307) 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](https://catalog.illinois.edu/search/?P=STAT%20207 "STAT 207"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 227](https://catalog.illinois.edu/search/?P=MATH%20227 "MATH 227"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"). [CS 340 Introduction to Computer Systems credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/340) 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](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340") and CS 240. Prerequisite: [CS 128](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128") and [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 341 System Programming credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/341) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") and either CS 241 or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") and [CS 233](https://catalog.illinois.edu/search/?P=CS%20233 "CS 233"). [CS 357 Numerical Methods I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/357) 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. (Counts for advanced hours in LAS). Same as [MATH 357](https://catalog.illinois.edu/search/?P=MATH%20357 "MATH 357"). Credit is not given toward graduation for: Credit is not given towards graduation for [CS 357](https://catalog.illinois.edu/search/?P=CS%20357 "CS 357") if credit for [CS 450](https://catalog.illinois.edu/search/?P=CS%20450 "CS 450") has been earned. Prerequisite: One of [CS 101](https://catalog.illinois.edu/search/?P=CS%20101 "CS 101"), [CS 105](https://catalog.illinois.edu/search/?P=CS%20105 "CS 105"), [CS 124](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124"), [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125") or [ECE 220](https://catalog.illinois.edu/search/?P=ECE%20220 "ECE 220"); [MATH 241](https://catalog.illinois.edu/search/?P=MATH%20241 "MATH 241"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 227](https://catalog.illinois.edu/search/?P=MATH%20227 "MATH 227"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 361 Probability & Statistics for Computer Science credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/361) 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. Credit is not given toward graduation for: Credit is not given for both [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361") and [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"). Prerequisite: [MATH 220](https://catalog.illinois.edu/search/?P=MATH%20220 "MATH 220") or [MATH 221](https://catalog.illinois.edu/search/?P=MATH%20221 "MATH 221"). Credit or concurrent registration in one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 227](https://catalog.illinois.edu/search/?P=MATH%20227 "MATH 227"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 374 Introduction to Algorithms & Models of Computation credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/374) 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](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"). Prerequisite: One of [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173"), [MATH 213](https://catalog.illinois.edu/search/?P=MATH%20213 "MATH 213"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 397 Individual Study credit: 1 to 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/397) May be repeated. Prerequisite: Consent of instructor. [CS 398 Special Topics credit: 1 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/398) 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. [CS 400 Accelerated Fundamentals of Computing I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/400) 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. [CS 401 Accelerated Fundamentals of Algorithms I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/401) 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. [CS 402 Accelerated Fundamentals of Computing II credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/402) 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](https://catalog.illinois.edu/search/?P=CS%20400 "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. [CS 403 Accelerated Fundamentals of Algorithms II credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/403) 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](https://catalog.illinois.edu/search/?P=CS%20401 "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. [CS 407 Cryptography credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/407) Same as [ECE 407](https://catalog.illinois.edu/search/?P=ECE%20407 "ECE 407"). See [ECE 407](https://catalog.illinois.edu/search/?P=ECE%20407 "ECE 407"). [CS 409 The Art of Web Programming credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/409) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 410 Text Information Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/410) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 411 Database Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/411) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 412 Introduction to Data Mining credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/412) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 413 Intro to Combinatorics credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/413) Same as [MATH 413](https://catalog.illinois.edu/search/?P=MATH%20413 "MATH 413"). See [MATH 413](https://catalog.illinois.edu/search/?P=MATH%20413 "MATH 413"). [CS 414 Multimedia Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/414) 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](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 415 Game Development credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/415) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 416 Data Visualization credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/416) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 417 Introduction to Extended Reality credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/417) Provides a deep understanding of the fundamentals of virtual reality (VR) and augmented reality (AR) systems through practical experience implementing these extended reality (XR) systems. Topics covered include visual and audio display technology, tracking, human perception and psychophysics, building user interfaces for XR applications, and analyzing XR experiences. 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 128](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128"); one of [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 227](https://catalog.illinois.edu/search/?P=MATH%20227 "MATH 227"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 418 Interactive Computer Graphics credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/418) Basic mathematical tools and computational techniques for modeling, rendering, and animating 3-D scenes. Same as [CSE 427](https://catalog.illinois.edu/search/?P=CSE%20427 "CSE 427"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); One of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"), or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"); [MATH 241](https://catalog.illinois.edu/search/?P=MATH%20241 "MATH 241"). [CS 419 Production Computer Graphics credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/419) 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](https://catalog.illinois.edu/search/?P=CS%20418 "CS 418") or [CSE 427](https://catalog.illinois.edu/search/?P=CSE%20427 "CSE 427"). [CS 420 Parallel Progrmg: Sci & Engrg credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/420) 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](https://catalog.illinois.edu/search/?P=CSE%20402 "CSE 402") and [ECE 492](https://catalog.illinois.edu/search/?P=ECE%20492 "ECE 492"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 421 Programming Languages & Compilers credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/421) 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](https://catalog.illinois.edu/search/?P=CS%20233 "CS 233"), CS 240, [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"); [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"), or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 422 Programming Language Design credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/422) 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](https://catalog.illinois.edu/search/?P=CS%20421 "CS 421"). [CS 423 Operating Systems Design credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/423) 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](https://catalog.illinois.edu/search/?P=CSE%20423 "CSE 423"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341"), or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 424 Real-Time Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/424) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 425 Distributed Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/425) Protocols, specification techniques, global states and their determination, reliable broadcast, transactions and commitment, security, and real-time systems. Same as [ECE 428](https://catalog.illinois.edu/search/?P=ECE%20428 "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](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 426 Compiler Construction credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/426) 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](https://catalog.illinois.edu/search/?P=CS%20421 "CS 421"). [CS 427 Software Engineering I credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/427) 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](https://catalog.illinois.edu/search/?P=CSE%20426 "CSE 426"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of [CS 222](https://catalog.illinois.edu/search/?P=CS%20222 "CS 222"), CS 240, CS 241, [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 428 Software Engineering II credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/428) Continuation of [CS 427](https://catalog.illinois.edu/search/?P=CS%20427 "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](https://catalog.illinois.edu/search/?P=CSE%20429 "CSE 429"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 427](https://catalog.illinois.edu/search/?P=CS%20427 "CS 427") or [CSE 426](https://catalog.illinois.edu/search/?P=CSE%20426 "CSE 426"). [CS 429 Software Engineering II, ACP credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/429) Continuation of [CS 427](https://catalog.illinois.edu/search/?P=CS%20427 "CS 427"). Identical to [CS 428](https://catalog.illinois.edu/search/?P=CS%20428 "CS 428") except for the additional writing component. See [CS 428](https://catalog.illinois.edu/search/?P=CS%20428 "CS 428"). 3 undergraduate hours. 3 graduate hours. Prerequisite: [CS 427](https://catalog.illinois.edu/search/?P=CS%20427 "CS 427") or [CSE 426](https://catalog.illinois.edu/search/?P=CSE%20426 "CSE 426"). [CS 431 Embedded Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/431) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 433 Computer System Organization credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/433) 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](https://catalog.illinois.edu/search/?P=CSE%20422 "CSE 422"). 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 233](https://catalog.illinois.edu/search/?P=CS%20233 "CS 233"). [CS 434 Real World Algorithms for IoT and Data Science credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/434) Same as [ECE 434](https://catalog.illinois.edu/search/?P=ECE%20434 "ECE 434"). See [ECE 434](https://catalog.illinois.edu/search/?P=ECE%20434 "ECE 434"). [CS 435 Cloud Networking credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/435) 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](https://catalog.illinois.edu/search/?P=CS%20435 "CS 435") and [CS 438](https://catalog.illinois.edu/search/?P=CS%20438 "CS 438")/[ECE 438](https://catalog.illinois.edu/search/?P=ECE%20438 "ECE 438"). Prerequisite: One of CS 240, CS 241, [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 436 Computer Networking Laboratory credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/436) 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](https://catalog.illinois.edu/search/?P=ECE%20435 "ECE 435"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 240, CS 241, [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 437 Topics in Internet of Things credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/437) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341"). Additional prerequisites may be specified each term. See section information. [CS 438 Communication Networks credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/438) 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](https://catalog.illinois.edu/search/?P=ECE%20438 "ECE 438"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"); strongly recommend one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 439 Wireless Networks credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/439) Same as [ECE 439](https://catalog.illinois.edu/search/?P=ECE%20439 "ECE 439"). See [ECE 439](https://catalog.illinois.edu/search/?P=ECE%20439 "ECE 439"). [CS 440 Artificial Intelligence credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/440) 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](https://catalog.illinois.edu/search/?P=ECE%20448 "ECE 448"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463"), [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400") or [BIOE 310](https://catalog.illinois.edu/search/?P=BIOE%20310 "BIOE 310"). [CS 441 Applied Machine Learning credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/441) 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: One of [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") or [CS 277](https://catalog.illinois.edu/search/?P=CS%20277 "CS 277"), and one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [BIOE 310](https://catalog.illinois.edu/search/?P=BIOE%20310 "BIOE 310"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 442 Trustworthy Machine Learning credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/442) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 440](https://catalog.illinois.edu/search/?P=CS%20440 "CS 440"), [ECE 448](https://catalog.illinois.edu/search/?P=ECE%20448 "ECE 448"), [CS 441](https://catalog.illinois.edu/search/?P=CS%20441 "CS 441"), [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 443 Reinforcement Learning credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/443) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); [MATH 241](https://catalog.illinois.edu/search/?P=MATH%20241 "MATH 241"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 444 Deep Learning for Computer Vision credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/444) 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. Same as [ECE 494](https://catalog.illinois.edu/search/?P=ECE%20494 "ECE 494"). 3 undergraduate hours. 4 graduate hours. Prerequisite: [MATH 241](https://catalog.illinois.edu/search/?P=MATH%20241 "MATH 241"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"), or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). No previous exposure to machine learning is required. [CS 445 Computational Photography credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/445) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"), [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), and [MATH 231](https://catalog.illinois.edu/search/?P=MATH%20231 "MATH 231"). [CS 446 Machine Learning credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/446) 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](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); One of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463"), [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400") or [BIOE 310](https://catalog.illinois.edu/search/?P=BIOE%20310 "BIOE 310"). [CS 447 Natural Language Processing credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/447) 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](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173") or [MATH 213](https://catalog.illinois.edu/search/?P=MATH%20213 "MATH 213"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463"), [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400") or [BIOE 310](https://catalog.illinois.edu/search/?P=BIOE%20310 "BIOE 310"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 448 Audio Computing Laboratory credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/448) 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](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341"), or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"), or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 450 Numerical Analysis credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/450) 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](https://catalog.illinois.edu/search/?P=CSE%20401 "CSE 401"), [ECE 491](https://catalog.illinois.edu/search/?P=ECE%20491 "ECE 491"), and [MATH 450](https://catalog.illinois.edu/search/?P=MATH%20450 "MATH 450"). 3 undergraduate hours. 3 or 4 graduate hours. Credit is not given toward graduation for both [CS 450](https://catalog.illinois.edu/search/?P=CS%20450 "CS 450") and CS 457. Prerequisite: One of [CS 101](https://catalog.illinois.edu/search/?P=CS%20101 "CS 101"), [CS 124](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124") or [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125"); one of [CS 357](https://catalog.illinois.edu/search/?P=CS%20357 "CS 357"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 357](https://catalog.illinois.edu/search/?P=MATH%20357 "MATH 357"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), or [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"); [MATH 285](https://catalog.illinois.edu/search/?P=MATH%20285 "MATH 285"). [CS 452 Topics in Robotics credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/452) Topics in robotics presented from a computational perspective, including artificial intelligence, algorithms, computational modeling, and/or software engineering. Generating intelligent behavior for a physical robot poses unique computational challenges in decision making, perception, representations of three-dimensional worlds and movement, and system integration. This course introduces general computational principles used in robotics as well as performing in-depth study of selected subtopics. 3 undergraduate hours. 3 or 4 graduate hours. May be repeated in the same term up to 6 undergraduate or 8 graduate hours, or in separate terms up to 12 undergraduate or 16 graduate hours, if topics vary. Prerequisite: ([CS 128](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128") or [ECE 220](https://catalog.illinois.edu/search/?P=ECE%20220 "ECE 220")) and [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") and (CS 241 or [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391")). [CS 460 Security Laboratory credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/460) 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](https://catalog.illinois.edu/search/?P=CS%20461 "CS 461") via hands-on project. Same as [ECE 419](https://catalog.illinois.edu/search/?P=ECE%20419 "ECE 419"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 461](https://catalog.illinois.edu/search/?P=CS%20461 "CS 461") or [ECE 422](https://catalog.illinois.edu/search/?P=ECE%20422 "ECE 422") or a combination of [CS 463](https://catalog.illinois.edu/search/?P=CS%20463 "CS 463") and one of [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 461 Computer Security I credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/461) 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](https://catalog.illinois.edu/search/?P=ECE%20422 "ECE 422"). 4 undergraduate hours. 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"), or a combination of [CS 233](https://catalog.illinois.edu/search/?P=CS%20233 "CS 233") and [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"). [CS 462 Issues of Law and Policy in Computer Science credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/462) Exploration of the intersection of public policy and computing technology: overview of the US legal system and government, how computing technology is regulated in areas such as privacy, crime, intellectual property, commerce, and national security. Students will complete technical projects related to legal issues, such as scrutinizing DRM, evaluating digital forensics reports, and critiquing software patents. Students will also scrutinize excerpts from legal opinions. 3 undergraduate hours. 4 graduate hours. Credit is not given toward graduation for: Credit is not given for both [CS 462](https://catalog.illinois.edu/search/?P=CS%20462 "CS 462") and [CS 498](https://catalog.illinois.edu/search/?P=CS%20498 "CS 498"), Law \&Policy Issues in CS. Prerequisite: [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340") or [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 463 Computer Security II credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/463) 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](https://catalog.illinois.edu/search/?P=ECE%20424 "ECE 424"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") and one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 441](https://catalog.illinois.edu/search/?P=CS%20441 "CS 441") completion is recommended. [CS 464 Topics in Societal and Ethical Impacts of Computer Technology credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/464) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). One of [CS 210](https://catalog.illinois.edu/search/?P=CS%20210 "CS 210") or [CS 211](https://catalog.illinois.edu/search/?P=CS%20211 "CS 211") or [ECE 316](https://catalog.illinois.edu/search/?P=ECE%20316 "ECE 316") or [PHIL 316](https://catalog.illinois.edu/search/?P=PHIL%20316 "PHIL 316"). One of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400") or [STAT 200](https://catalog.illinois.edu/search/?P=STAT%20200 "STAT 200"). Restricted to students with senior standing. [CS 465 User Interface Design credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/465) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 466 Introduction to Bioinformatics credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/466) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 467 Social Visualization credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/467) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 468 Tech and Advertising Campaigns credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/468) Same as [ADV 492](https://catalog.illinois.edu/search/?P=ADV%20492 "ADV 492"). See [ADV 492](https://catalog.illinois.edu/search/?P=ADV%20492 "ADV 492"). [CS 469 Computational Advertising Infrastructure credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/469) 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](https://catalog.illinois.edu/search/?P=ADV%20462 "ADV 462"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 470 Social and Information Networks credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/470) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"), or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 473 Algorithms credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/473) 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](https://catalog.illinois.edu/search/?P=CSE%20414 "CSE 414") and [MATH 473](https://catalog.illinois.edu/search/?P=MATH%20473 "MATH 473"). 4 undergraduate hours. 4 graduate hours. Prerequisite: [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"), and one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 474 Logic in Computer Science credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/474) 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](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"). [CS 475 Formal Models of Computation credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/475) 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](https://catalog.illinois.edu/search/?P=MATH%20475 "MATH 475"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"). [CS 476 Program Verification credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/476) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374"), [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374") or [MATH 414](https://catalog.illinois.edu/search/?P=MATH%20414 "MATH 414"). [CS 477 Formal Software Development Methods credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/477) Mathematical models, languages, and methods for software specification, development, and verification. Same as [ECE 478](https://catalog.illinois.edu/search/?P=ECE%20478 "ECE 478"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374"), [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374") or [MATH 414](https://catalog.illinois.edu/search/?P=MATH%20414 "MATH 414"). [CS 478 Quantum Algorithms and Complexity credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/478) A comprehensive introduction to the theoretical foundations of quantum computing, preparing students for advanced study in quantum information sciences: Building blocks of quantum information such as qubits and entanglement; basic quantum operations such as quantum gates and measurements, and key quantum protocols and algorithms like teleportation and Shor's factoring algorithm. Advanced topics include modern quantum algorithms, quantum learning, quantum complexity theory, cryptography, and error correction. Emphasis on theoretical aspects of design and analysis of quantum algorithms and their computational limits. Prior quantum physics knowledge is helpful but not required. 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415") or [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463"), [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"), [PHYS 214](https://catalog.illinois.edu/search/?P=PHYS%20214 "PHYS 214") or [PHYS 486](https://catalog.illinois.edu/search/?P=PHYS%20486 "PHYS 486"). Credit or concurrent enrollment in CS/[ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374") is encouraged. [CS 481 Advanced Topics in Stochastic Processes & Applications credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/481) Same as [IE 410](https://catalog.illinois.edu/search/?P=IE%20410 "IE 410"). See [IE 410](https://catalog.illinois.edu/search/?P=IE%20410 "IE 410"). [CS 482 Simulation credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/482) Same as [IE 413](https://catalog.illinois.edu/search/?P=IE%20413 "IE 413"). See [IE 413](https://catalog.illinois.edu/search/?P=IE%20413 "IE 413"). [CS 483 Applied Parallel Programming credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/483) Same as [CSE 408](https://catalog.illinois.edu/search/?P=CSE%20408 "CSE 408") and [ECE 408](https://catalog.illinois.edu/search/?P=ECE%20408 "ECE 408"). See [ECE 408](https://catalog.illinois.edu/search/?P=ECE%20408 "ECE 408"). [CS 484 Parallel Programming credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/484) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341"). [CS 491 Seminar credit: 0 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/491) 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. [CS 492 Senior Project I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/492) 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](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492") must be taken as a sequence with either [CS 493](https://catalog.illinois.edu/search/?P=CS%20493 "CS 493") or [CS 494](https://catalog.illinois.edu/search/?P=CS%20494 "CS 494"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 492](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492") and a project course in another engineering department for the same project. Prerequisite: For Computer Science majors with senior standing. [CS 493 Senior Project II, ACP credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/493) Continuation of [CS 492](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492"). Identical to [CS 494](https://catalog.illinois.edu/search/?P=CS%20494 "CS 494") except for an additional writing component. See [CS 494](https://catalog.illinois.edu/search/?P=CS%20494 "CS 494"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 493](https://catalog.illinois.edu/search/?P=CS%20493 "CS 493") and a project course in another engineering department for the same project. Prerequisite: [CS 492](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492"). This course satisfies the General Education Criteria for: Advanced Composition [CS 494 Senior Project II credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/494) Continuation of [CS 492](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 494](https://catalog.illinois.edu/search/?P=CS%20494 "CS 494") and a project course in another engineering department for the same project. Prerequisite: [CS 492](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492"). [CS 497 CS Team Project credit: 1 to 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/497) 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. [CS 498 Special Topics credit: 1 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/498) 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. [CS 499 Senior Thesis credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/499) 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. This course satisfies the General Education Criteria for: Advanced Composition [CS 500 Current Topics in Computing Education Research credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/500) 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. 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. [CS 507 Topics in Cryptography credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/507) 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. 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. [CS 508 Manycore Parallel Algorithms credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/508) Same as [ECE 508](https://catalog.illinois.edu/search/?P=ECE%20508 "ECE 508"). See [ECE 508](https://catalog.illinois.edu/search/?P=ECE%20508 "ECE 508"). [CS 510 Advanced Information Retrieval credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/510) 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. Prerequisite: One of [CS 410](https://catalog.illinois.edu/search/?P=CS%20410 "CS 410"), [CS 412](https://catalog.illinois.edu/search/?P=CS%20412 "CS 412"), [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446"), [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449") or [LING 406](https://catalog.illinois.edu/search/?P=LING%20406 "LING 406"). [CS 511 Advanced Data Management credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/511) 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](https://catalog.illinois.edu/search/?P=CS%20411 "CS 411"). [CS 512 Data Mining Principles credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/512) 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](https://catalog.illinois.edu/search/?P=CS%20412 "CS 412"). [CS 513 Theory & Practice of Data Cleaning credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/513) Same as [IS 537](https://catalog.illinois.edu/search/?P=IS%20537 "IS 537"). See [IS 537](https://catalog.illinois.edu/search/?P=IS%20537 "IS 537"). [CS 514 Advanced Topics in Network Science credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/514) 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. 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](https://catalog.illinois.edu/search/?P=CS%20412 "CS 412"); one of [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"). Additional prerequisites or corequisites may be specified each term. See section information. [CS 519 Scientific Visualization credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/519) 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](https://catalog.illinois.edu/search/?P=CSE%20527 "CSE 527"). Prerequisite: [CS 418](https://catalog.illinois.edu/search/?P=CS%20418 "CS 418") or [CSE 427](https://catalog.illinois.edu/search/?P=CSE%20427 "CSE 427"). [CS 521 Advanced Topics in Programming Systems credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/521) 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. 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](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"); [CS 421](https://catalog.illinois.edu/search/?P=CS%20421 "CS 421"). Additional prerequisites or corequisites may be specified each term. See section information. [CS 522 Programming Language Semantics credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/522) Theory of programming languages including functional programming, meta-circular interpreters, typed, untyped and polymorphic lambda-calculi, and denotational semantics. Prerequisite: [CS 422](https://catalog.illinois.edu/search/?P=CS%20422 "CS 422") and [CS 426](https://catalog.illinois.edu/search/?P=CS%20426 "CS 426"). [CS 523 Advanced Operating Systems credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/523) 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. Prerequisite: One of [CS 423](https://catalog.illinois.edu/search/?P=CS%20423 "CS 423") or [CSE 423](https://catalog.illinois.edu/search/?P=CSE%20423 "CSE 423"); one of [CS 425](https://catalog.illinois.edu/search/?P=CS%20425 "CS 425") or [ECE 428](https://catalog.illinois.edu/search/?P=ECE%20428 "ECE 428"); and one of [CS 433](https://catalog.illinois.edu/search/?P=CS%20433 "CS 433") or [CSE 422](https://catalog.illinois.edu/search/?P=CSE%20422 "CSE 422"). [CS 524 Concurrent Progrmg Languages credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/524) 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. Prerequisite: [CS 422](https://catalog.illinois.edu/search/?P=CS%20422 "CS 422"); one of [CS 475](https://catalog.illinois.edu/search/?P=CS%20475 "CS 475"), [MATH 475](https://catalog.illinois.edu/search/?P=MATH%20475 "MATH 475") or [CS 476](https://catalog.illinois.edu/search/?P=CS%20476 "CS 476"). [CS 525 Advanced Distributed Systems credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/525) 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. Prerequisite: One of [CS 423](https://catalog.illinois.edu/search/?P=CS%20423 "CS 423"), [CSE 423](https://catalog.illinois.edu/search/?P=CSE%20423 "CSE 423"), [CS 425](https://catalog.illinois.edu/search/?P=CS%20425 "CS 425"), [ECE 428](https://catalog.illinois.edu/search/?P=ECE%20428 "ECE 428"), [CS 438](https://catalog.illinois.edu/search/?P=CS%20438 "CS 438") or [ECE 438](https://catalog.illinois.edu/search/?P=ECE%20438 "ECE 438"). [CS 526 Advanced Compiler Construction credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/526) Incremental and interactive compiling, error correction, code optimization, models of code generators. Prerequisite: [CS 426](https://catalog.illinois.edu/search/?P=CS%20426 "CS 426"). [CS 527 Topics in Software Engineering credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/527) Fault-tolerant software, software architecture, software patterns, multi-media software, and knowledge-based approaches to software engineering. Case studies. Prerequisite: [CS 428](https://catalog.illinois.edu/search/?P=CS%20428 "CS 428"), [CSE 429](https://catalog.illinois.edu/search/?P=CSE%20429 "CSE 429") or [CS 429](https://catalog.illinois.edu/search/?P=CS%20429 "CS 429"). [CS 533 Parallel Computer Architecture credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/533) 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](https://catalog.illinois.edu/search/?P=CSE%20522 "CSE 522"). Prerequisite: [CS 433](https://catalog.illinois.edu/search/?P=CS%20433 "CS 433") or [CSE 422](https://catalog.illinois.edu/search/?P=CSE%20422 "CSE 422"). [CS 534 Advanced Topics in Computer Architecture credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/534) 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. 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](https://catalog.illinois.edu/search/?P=CS%20433 "CS 433") or [CSE 422](https://catalog.illinois.edu/search/?P=CSE%20422 "CSE 422"). Additional prerequisites or co-requisites may be specified each term. See Class Schedule information. [CS 536 Fault-Tolerant Dig Syst Design credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/536) Same as [ECE 542](https://catalog.illinois.edu/search/?P=ECE%20542 "ECE 542"). See [ECE 542](https://catalog.illinois.edu/search/?P=ECE%20542 "ECE 542"). [CS 537 Advanced Topics in Internet of Things (IoT) credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/537) 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. 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](https://catalog.illinois.edu/search/?P=CS%20425 "CS 425") or [ECE 428](https://catalog.illinois.edu/search/?P=ECE%20428 "ECE 428"); one of [CS 438](https://catalog.illinois.edu/search/?P=CS%20438 "CS 438") or [ECE 438](https://catalog.illinois.edu/search/?P=ECE%20438 "ECE 438"). Additional prerequisites may be specified each term. See section information. [CS 538 Advanced Computer Networks credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/538) 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. Prerequisite: [CS 438](https://catalog.illinois.edu/search/?P=CS%20438 "CS 438") or [ECE 438](https://catalog.illinois.edu/search/?P=ECE%20438 "ECE 438"). [CS 539 Distributed Algorithms credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/539) Same as [ECE 526](https://catalog.illinois.edu/search/?P=ECE%20526 "ECE 526"). See [ECE 526](https://catalog.illinois.edu/search/?P=ECE%20526 "ECE 526"). [CS 540 Deep Learning Theory credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/540) 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. Prerequisite: Basic linear algebra, probability, proof-writing, and statistics required. Real analysis recommended. [CS 541 Computer Systems Analysis credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/541) Same as [ECE 541](https://catalog.illinois.edu/search/?P=ECE%20541 "ECE 541"). See [ECE 541](https://catalog.illinois.edu/search/?P=ECE%20541 "ECE 541"). [CS 542 Statistical Reinforcement Learning credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/542) 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. 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. [CS 543 Computer Vision credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/543) Same as [ECE 549](https://catalog.illinois.edu/search/?P=ECE%20549 "ECE 549"). See [ECE 549](https://catalog.illinois.edu/search/?P=ECE%20549 "ECE 549"). [CS 544 Optimiz in Computer Vision credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/544) 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. Prerequisite: One of [CS 450](https://catalog.illinois.edu/search/?P=CS%20450 "CS 450"), [CSE 401](https://catalog.illinois.edu/search/?P=CSE%20401 "CSE 401"), [ECE 491](https://catalog.illinois.edu/search/?P=ECE%20491 "ECE 491"), or [MATH 450](https://catalog.illinois.edu/search/?P=MATH%20450 "MATH 450"); one of [CS 473](https://catalog.illinois.edu/search/?P=CS%20473 "CS 473"), [CSE 414](https://catalog.illinois.edu/search/?P=CSE%20414 "CSE 414") or [MATH 473](https://catalog.illinois.edu/search/?P=MATH%20473 "MATH 473"). [CS 545 Machine Learning for Signal Processing credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/545) 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. Prerequisite: [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 546 Advanced Topics in Natural Language Processing credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/546) 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. 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](https://catalog.illinois.edu/search/?P=CS%20447 "CS 447") and one of [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"), or equivalent background. [CS 547 Deep Learning credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/547) Same as [IE 534](https://catalog.illinois.edu/search/?P=IE%20534 "IE 534"). See [IE 534](https://catalog.illinois.edu/search/?P=IE%20534 "IE 534"). [CS 549 Seminar in Cognitive Science credit: 2 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/549) Same as [PSYC 514](https://catalog.illinois.edu/search/?P=PSYC%20514 "PSYC 514"), [ANTH 514](https://catalog.illinois.edu/search/?P=ANTH%20514 "ANTH 514"), [EPSY 551](https://catalog.illinois.edu/search/?P=EPSY%20551 "EPSY 551"), [LING 570](https://catalog.illinois.edu/search/?P=LING%20570 "LING 570"), and [PHIL 514](https://catalog.illinois.edu/search/?P=PHIL%20514 "PHIL 514"). See [PSYC 514](https://catalog.illinois.edu/search/?P=PSYC%20514 "PSYC 514"). [CS 554 Parallel Numerical Algorithms credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/554) 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](https://catalog.illinois.edu/search/?P=CSE%20512 "CSE 512"). Prerequisite: One of [CS 450](https://catalog.illinois.edu/search/?P=CS%20450 "CS 450"), [CSE 401](https://catalog.illinois.edu/search/?P=CSE%20401 "CSE 401"), [ECE 491](https://catalog.illinois.edu/search/?P=ECE%20491 "ECE 491"), [MATH 450](https://catalog.illinois.edu/search/?P=MATH%20450 "MATH 450"), CS 457, [CS 555](https://catalog.illinois.edu/search/?P=CS%20555 "CS 555"), [CSE 510](https://catalog.illinois.edu/search/?P=CSE%20510 "CSE 510") or [MATH 552](https://catalog.illinois.edu/search/?P=MATH%20552 "MATH 552"). [CS 555 Numerical Methods for PDEs credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/555) 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](https://catalog.illinois.edu/search/?P=CSE%20510 "CSE 510") and [MATH 552](https://catalog.illinois.edu/search/?P=MATH%20552 "MATH 552"). Prerequisite: [CS 450](https://catalog.illinois.edu/search/?P=CS%20450 "CS 450"), [CSE 401](https://catalog.illinois.edu/search/?P=CSE%20401 "CSE 401"), [ECE 491](https://catalog.illinois.edu/search/?P=ECE%20491 "ECE 491"), [MATH 450](https://catalog.illinois.edu/search/?P=MATH%20450 "MATH 450") or CS 457. [CS 556 Iterative & Multigrid Methods credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/556) 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](https://catalog.illinois.edu/search/?P=CSE%20511 "CSE 511"). [CS 558 Topics in Numerical Analysis credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/558) Advanced topics in numerical analysis selected from areas of current research. Same as [CSE 513](https://catalog.illinois.edu/search/?P=CSE%20513 "CSE 513"). May be repeated. Prerequisite: As specified for each topic offering, see Schedule or departmental course description. [CS 562 Advanced Topics in Security, Privacy, and Machine Learning credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/562) 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. 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](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449") and one of [CS 463](https://catalog.illinois.edu/search/?P=CS%20463 "CS 463") or [ECE 424](https://catalog.illinois.edu/search/?P=ECE%20424 "ECE 424"), or equivalent courses, by consent of instructor. Additional prerequisites or corequisites may be specified each term. See section information. [CS 563 Advanced Computer Security credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/563) 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](https://catalog.illinois.edu/search/?P=ECE%20524 "ECE 524"). Prerequisite: One of [CS 461](https://catalog.illinois.edu/search/?P=CS%20461 "CS 461"), [CS 463](https://catalog.illinois.edu/search/?P=CS%20463 "CS 463"), [ECE 422](https://catalog.illinois.edu/search/?P=ECE%20422 "ECE 422") or [ECE 424](https://catalog.illinois.edu/search/?P=ECE%20424 "ECE 424"). [CS 565 Human-Computer Interaction credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/565) 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](https://catalog.illinois.edu/search/?P=CS%20465 "CS 465"). [CS 567 Social Signals and Social Media credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/567) 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. Prerequisite: [CS 465](https://catalog.illinois.edu/search/?P=CS%20465 "CS 465") or equivalent or permission of instructor. Prioritize PhD students, then others. [CS 568 User-Centered Machine Learning credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/568) 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. Prerequisite: [CS 465](https://catalog.illinois.edu/search/?P=CS%20465 "CS 465") or equivalent course work. [CS 571 Combinatorial Mathematics credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/571) Same as [MATH 580](https://catalog.illinois.edu/search/?P=MATH%20580 "MATH 580"). See [MATH 580](https://catalog.illinois.edu/search/?P=MATH%20580 "MATH 580"). [CS 572 Extremal Graph Theory credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/572) Same as [MATH 581](https://catalog.illinois.edu/search/?P=MATH%20581 "MATH 581"). See [MATH 581](https://catalog.illinois.edu/search/?P=MATH%20581 "MATH 581"). [CS 574 Randomized Algorithms credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/574) 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. Prerequisite: One of [CS 473](https://catalog.illinois.edu/search/?P=CS%20473 "CS 473"), [CSE 414](https://catalog.illinois.edu/search/?P=CSE%20414 "CSE 414"), or [MATH 473](https://catalog.illinois.edu/search/?P=MATH%20473 "MATH 473"); one of [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 575 Methods of Combinatorics credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/575) Same as [MATH 584](https://catalog.illinois.edu/search/?P=MATH%20584 "MATH 584"). See [MATH 584](https://catalog.illinois.edu/search/?P=MATH%20584 "MATH 584"). [CS 576 Topics in Automated Deduction credit: 2 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/576) 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. [CS 579 Computational Complexity credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/579) 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](https://catalog.illinois.edu/search/?P=ECE%20579 "ECE 579"). Prerequisite: One of [CS 473](https://catalog.illinois.edu/search/?P=CS%20473 "CS 473"), [CSE 414](https://catalog.illinois.edu/search/?P=CSE%20414 "CSE 414"), [MATH 473](https://catalog.illinois.edu/search/?P=MATH%20473 "MATH 473"), [CS 475](https://catalog.illinois.edu/search/?P=CS%20475 "CS 475") or [MATH 475](https://catalog.illinois.edu/search/?P=MATH%20475 "MATH 475"). [CS 580 Topics in Algorithmic Game Theory credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/580) 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. Prerequisite: [CS 473](https://catalog.illinois.edu/search/?P=CS%20473 "CS 473"). [CS 581 Algorithmic Genomic Biology credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/581) 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. Prerequisite: One of [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374") and one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361") or [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), or consent of instructor. [CS 582 Machine Learning for Bioinformatics credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/582) 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. Prerequisite: [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"); Credit or concurrent enrollment in [CS 466](https://catalog.illinois.edu/search/?P=CS%20466 "CS 466"); or consent of instructor. [CS 583 Approximation Algorithms credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/583) 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. Prerequisite: CS 573, CSE 515 or consent of instructor. [CS 584 Embedded System Verification credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/584) Same as [ECE 584](https://catalog.illinois.edu/search/?P=ECE%20584 "ECE 584"). See [ECE 584](https://catalog.illinois.edu/search/?P=ECE%20584 "ECE 584"). [CS 585 Hardware Verification credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/585) Same as [ECE 519](https://catalog.illinois.edu/search/?P=ECE%20519 "ECE 519"). See [ECE 519](https://catalog.illinois.edu/search/?P=ECE%20519 "ECE 519"). [CS 586 Combinatorial Optimization credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/586) Same as [IE 519](https://catalog.illinois.edu/search/?P=IE%20519 "IE 519"). See [IE 519](https://catalog.illinois.edu/search/?P=IE%20519 "IE 519"). [CS 588 Autonomous Vehicle System Engineering credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/588) 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. Prerequisite: [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374"), [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"), [ECE 484](https://catalog.illinois.edu/search/?P=ECE%20484 "ECE 484"), or equivalent. [CS 591 Advanced Seminar credit: 0 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/591) 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. [CS 597 Individual Study credit: 2 to 16 Hours.](https://courses.illinois.edu/schedule/terms/CS/597) Individual study or reading in a subject not covered in normal course offerings. May be repeated. Prerequisite: Consent of instructor. [CS 598 Special Topics credit: 2 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/598) 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. [CS 599 Thesis Research credit: 0 to 16 Hours.](https://courses.illinois.edu/schedule/terms/CS/599) Approved for S/U grading only. May be repeated in the same term or in separate terms. [2026-2027 Course Catalog](https://catalog.illinois.edu/courses-of-instruction/cs/) ## Course Catalog Resources - [Academic Calendar](https://senate.illinois.edu/a_calendar.asp) - [Class Schedule](https://courses.illinois.edu/) - [Student Affairs](http://studentaffairs.illinois.edu/) - [Registration, Tuition, and Cost Information](https://registrar.illinois.edu/) ## ### Around Campus - [Campus Map](https://map.illinois.edu/view?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University Admissions](https://illinois.edu/admissions/index.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Careers at Illinois](https://jobs.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University News](https://news.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Giving at Illinois](https://giving.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University Alumni](https://illinois.edu/alumni/index.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Athletics](https://illinois.edu/athletics/index.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University Library](https://www.library.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) ### Universitywide Resources - [Emergency Services](https://illinois.edu/resources/emergency.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University Calendars](https://illinois.edu/resources/calendars.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University Directory](https://directory.illinois.edu/search?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Student Assistance Center](https://odos.illinois.edu/community-of-care/student-assistance-%0A%09%09%09%09%09%09center/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Health and Wellness](https://wellness.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Parents and Families](https://newstudent.illinois.edu/parents/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University COVID-19 Information](https://covid19.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) ### About Illinois - [VC of Diversity, Equity and Inclusion](https://diversity.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Land Acknowledgement](https://chancellor.illinois.edu/land-acknowledgement-statement/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University Research and Innovation](https://research.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Technology Services](https://techservices.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Illinois International](https://illinois.edu/international/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University Strategic Plan](https://strategicplan.illinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [University of Illinois System](https://www.uillinois.edu/?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Privacy](https://www.vpaa.uillinois.edu/resources/web_privacy?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Copyright](https://illinois.edu/resources/website/copyright.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) - [Accessibility](https://illinois.edu/resources/website/accessibility.html?utm_source=Illinois_App&utm_medium=web&utm_campaign=Footer) [Back to top](https://catalog.illinois.edu/courses-of-instruction/cs/#header) Close this window ## Print Options - [Send Page to Printer](https://catalog.illinois.edu/courses-of-instruction/cs/) Print this page. - [Download Page (PDF)](https://catalog.illinois.edu/courses-of-instruction/cs/cs.pdf) The PDF will include all information unique to this page. - [2026-2027 Catalog (PDF)](https://catalog.illinois.edu/pdf/University%20of%20Illinois%20Urbana-Champaign%202026-2027.pdf) A copy of the full 2026-2027 catalog.
Readable Markdown	### Courses [CS 100 Computer Science Orientation credit: 1 Hour.](https://courses.illinois.edu/schedule/terms/CS/100) 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. [CS 101 Intro Computing: Engrg & Sci credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/101) 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](https://catalog.illinois.edu/search/?P=MATH%20220 "MATH 220") or [MATH 221](https://catalog.illinois.edu/search/?P=MATH%20221 "MATH 221") or [MATH 231](https://catalog.illinois.edu/search/?P=MATH%20231 "MATH 231") or [MATH 241](https://catalog.illinois.edu/search/?P=MATH%20241 "MATH 241"). This course satisfies the General Education Criteria for: Quantitative Reasoning II [CS 105 Intro Computing: Non-Tech credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/105) 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](https://catalog.illinois.edu/search/?P=MATH%20112 "MATH 112"). This course satisfies the General Education Criteria for: Quantitative Reasoning I [CS 124 Introduction to Computer Science I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/124) 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](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124") and [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125"). Prerequisite: Three years of high school mathematics or [MATH 112](https://catalog.illinois.edu/search/?P=MATH%20112 "MATH 112"). This course satisfies the General Education Criteria for: Quantitative Reasoning I [CS 173 Discrete Structures credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/173) \[IAI Code: CS915\] 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 toward graduation for: Credit is not given for both [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173") and [MATH 213](https://catalog.illinois.edu/search/?P=MATH%20213 "MATH 213"). Prerequisite: One of [CS 124](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124"), [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125"), [ECE 220](https://catalog.illinois.edu/search/?P=ECE%20220 "ECE 220"); one of [MATH 220](https://catalog.illinois.edu/search/?P=MATH%20220 "MATH 220"), [MATH 221](https://catalog.illinois.edu/search/?P=MATH%20221 "MATH 221"). [CS 196 First-Year Student Honors credit: 1 Hour.](https://courses.illinois.edu/schedule/terms/CS/196) 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). [CS 211 Ethical and Professional Conduct credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/211) 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](https://catalog.illinois.edu/search/?P=CS%20211 "CS 211") and [CS 210](https://catalog.illinois.edu/search/?P=CS%20210 "CS 210") or [ECE 316](https://catalog.illinois.edu/search/?P=ECE%20316 "ECE 316"). Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). This course satisfies the General Education Criteria for: Advanced Composition [CS 222 Software Design Lab credit: 1 Hour.](https://courses.illinois.edu/schedule/terms/CS/222) 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](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128"); credit or concurrent registration in [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). Restricted to majors in Computer Science undergraduate curricula only. [CS 233 Computer Architecture credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/233) 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](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125") or [CS 128](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128"); [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173") or [MATH 213](https://catalog.illinois.edu/search/?P=MATH%20213 "MATH 213"); credit or concurrent enrollment in [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 277 Algorithms and Data Structures for Data Science credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/277) 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](https://catalog.illinois.edu/search/?P=CS%20277 "CS 277") if credit for [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") is earned. Prerequisite: [STAT 207](https://catalog.illinois.edu/search/?P=STAT%20207 "STAT 207"); one of [MATH 220](https://catalog.illinois.edu/search/?P=MATH%20220 "MATH 220"), [MATH 221](https://catalog.illinois.edu/search/?P=MATH%20221 "MATH 221"), [MATH 234](https://catalog.illinois.edu/search/?P=MATH%20234 "MATH 234"). [CS 277](https://catalog.illinois.edu/search/?P=CS%20277 "CS 277") cannot be taken concurrently with [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 296 Honors Course credit: 1 Hour.](https://courses.illinois.edu/schedule/terms/CS/296) 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). [CS 340 Introduction to Computer Systems credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/340) 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](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340") and CS 240. Prerequisite: [CS 128](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128") and [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 341 System Programming credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/341) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") and either CS 241 or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") and [CS 233](https://catalog.illinois.edu/search/?P=CS%20233 "CS 233"). [CS 357 Numerical Methods I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/357) 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. (Counts for advanced hours in LAS). Same as [MATH 357](https://catalog.illinois.edu/search/?P=MATH%20357 "MATH 357"). Credit is not given toward graduation for: Credit is not given towards graduation for [CS 357](https://catalog.illinois.edu/search/?P=CS%20357 "CS 357") if credit for [CS 450](https://catalog.illinois.edu/search/?P=CS%20450 "CS 450") has been earned. Prerequisite: One of [CS 101](https://catalog.illinois.edu/search/?P=CS%20101 "CS 101"), [CS 105](https://catalog.illinois.edu/search/?P=CS%20105 "CS 105"), [CS 124](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124"), [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125") or [ECE 220](https://catalog.illinois.edu/search/?P=ECE%20220 "ECE 220"); [MATH 241](https://catalog.illinois.edu/search/?P=MATH%20241 "MATH 241"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 227](https://catalog.illinois.edu/search/?P=MATH%20227 "MATH 227"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 361 Probability & Statistics for Computer Science credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/361) 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. Credit is not given toward graduation for: Credit is not given for both [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361") and [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"). Prerequisite: [MATH 220](https://catalog.illinois.edu/search/?P=MATH%20220 "MATH 220") or [MATH 221](https://catalog.illinois.edu/search/?P=MATH%20221 "MATH 221"). Credit or concurrent registration in one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 227](https://catalog.illinois.edu/search/?P=MATH%20227 "MATH 227"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 374 Introduction to Algorithms & Models of Computation credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/374) 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](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"). Prerequisite: One of [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173"), [MATH 213](https://catalog.illinois.edu/search/?P=MATH%20213 "MATH 213"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 398 Special Topics credit: 1 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/398) 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. [CS 400 Accelerated Fundamentals of Computing I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/400) 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. [CS 401 Accelerated Fundamentals of Algorithms I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/401) 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. [CS 402 Accelerated Fundamentals of Computing II credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/402) 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](https://catalog.illinois.edu/search/?P=CS%20400 "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. [CS 403 Accelerated Fundamentals of Algorithms II credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/403) 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](https://catalog.illinois.edu/search/?P=CS%20401 "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. [CS 409 The Art of Web Programming credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/409) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 410 Text Information Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/410) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 411 Database Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/411) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 412 Introduction to Data Mining credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/412) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 414 Multimedia Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/414) 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](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 415 Game Development credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/415) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 416 Data Visualization credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/416) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 419 Production Computer Graphics credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/419) 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](https://catalog.illinois.edu/search/?P=CS%20418 "CS 418") or [CSE 427](https://catalog.illinois.edu/search/?P=CSE%20427 "CSE 427"). [CS 420 Parallel Progrmg: Sci & Engrg credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/420) 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](https://catalog.illinois.edu/search/?P=CSE%20402 "CSE 402") and [ECE 492](https://catalog.illinois.edu/search/?P=ECE%20492 "ECE 492"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 421 Programming Languages & Compilers credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/421) 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](https://catalog.illinois.edu/search/?P=CS%20233 "CS 233"), CS 240, [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"); [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"), or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 424 Real-Time Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/424) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 426 Compiler Construction credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/426) 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](https://catalog.illinois.edu/search/?P=CS%20421 "CS 421"). [CS 428 Software Engineering II credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/428) Continuation of [CS 427](https://catalog.illinois.edu/search/?P=CS%20427 "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](https://catalog.illinois.edu/search/?P=CSE%20429 "CSE 429"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 427](https://catalog.illinois.edu/search/?P=CS%20427 "CS 427") or [CSE 426](https://catalog.illinois.edu/search/?P=CSE%20426 "CSE 426"). [CS 431 Embedded Systems credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/431) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 433 Computer System Organization credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/433) 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](https://catalog.illinois.edu/search/?P=CSE%20422 "CSE 422"). 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 233](https://catalog.illinois.edu/search/?P=CS%20233 "CS 233"). [CS 435 Cloud Networking credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/435) 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](https://catalog.illinois.edu/search/?P=CS%20435 "CS 435") and [CS 438](https://catalog.illinois.edu/search/?P=CS%20438 "CS 438")/[ECE 438](https://catalog.illinois.edu/search/?P=ECE%20438 "ECE 438"). Prerequisite: One of CS 240, CS 241, [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 436 Computer Networking Laboratory credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/436) 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](https://catalog.illinois.edu/search/?P=ECE%20435 "ECE 435"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 240, CS 241, [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 437 Topics in Internet of Things credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/437) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341"). Additional prerequisites may be specified each term. See section information. [CS 438 Communication Networks credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/438) 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](https://catalog.illinois.edu/search/?P=ECE%20438 "ECE 438"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"); strongly recommend one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 440 Artificial Intelligence credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/440) 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](https://catalog.illinois.edu/search/?P=ECE%20448 "ECE 448"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463"), [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400") or [BIOE 310](https://catalog.illinois.edu/search/?P=BIOE%20310 "BIOE 310"). [CS 441 Applied Machine Learning credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/441) 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: One of [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") or [CS 277](https://catalog.illinois.edu/search/?P=CS%20277 "CS 277"), and one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [BIOE 310](https://catalog.illinois.edu/search/?P=BIOE%20310 "BIOE 310"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 442 Trustworthy Machine Learning credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/442) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 440](https://catalog.illinois.edu/search/?P=CS%20440 "CS 440"), [ECE 448](https://catalog.illinois.edu/search/?P=ECE%20448 "ECE 448"), [CS 441](https://catalog.illinois.edu/search/?P=CS%20441 "CS 441"), [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 443 Reinforcement Learning credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/443) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); [MATH 241](https://catalog.illinois.edu/search/?P=MATH%20241 "MATH 241"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 444 Deep Learning for Computer Vision credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/444) 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. Same as [ECE 494](https://catalog.illinois.edu/search/?P=ECE%20494 "ECE 494"). 3 undergraduate hours. 4 graduate hours. Prerequisite: [MATH 241](https://catalog.illinois.edu/search/?P=MATH%20241 "MATH 241"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"), or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). No previous exposure to machine learning is required. [CS 446 Machine Learning credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/446) 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](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); One of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463"), [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400") or [BIOE 310](https://catalog.illinois.edu/search/?P=BIOE%20310 "BIOE 310"). [CS 447 Natural Language Processing credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/447) 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](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173") or [MATH 213](https://catalog.illinois.edu/search/?P=MATH%20213 "MATH 213"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463"), [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400") or [BIOE 310](https://catalog.illinois.edu/search/?P=BIOE%20310 "BIOE 310"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 448 Audio Computing Laboratory credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/448) 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](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341"), or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"), or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 450 Numerical Analysis credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/450) 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](https://catalog.illinois.edu/search/?P=CSE%20401 "CSE 401"), [ECE 491](https://catalog.illinois.edu/search/?P=ECE%20491 "ECE 491"), and [MATH 450](https://catalog.illinois.edu/search/?P=MATH%20450 "MATH 450"). 3 undergraduate hours. 3 or 4 graduate hours. Credit is not given toward graduation for both [CS 450](https://catalog.illinois.edu/search/?P=CS%20450 "CS 450") and CS 457. Prerequisite: One of [CS 101](https://catalog.illinois.edu/search/?P=CS%20101 "CS 101"), [CS 124](https://catalog.illinois.edu/search/?P=CS%20124 "CS 124") or [CS 125](https://catalog.illinois.edu/search/?P=CS%20125 "CS 125"); one of [CS 357](https://catalog.illinois.edu/search/?P=CS%20357 "CS 357"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 357](https://catalog.illinois.edu/search/?P=MATH%20357 "MATH 357"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), or [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"); [MATH 285](https://catalog.illinois.edu/search/?P=MATH%20285 "MATH 285"). [CS 452 Topics in Robotics credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/452) Topics in robotics presented from a computational perspective, including artificial intelligence, algorithms, computational modeling, and/or software engineering. Generating intelligent behavior for a physical robot poses unique computational challenges in decision making, perception, representations of three-dimensional worlds and movement, and system integration. This course introduces general computational principles used in robotics as well as performing in-depth study of selected subtopics. 3 undergraduate hours. 3 or 4 graduate hours. May be repeated in the same term up to 6 undergraduate or 8 graduate hours, or in separate terms up to 12 undergraduate or 16 graduate hours, if topics vary. Prerequisite: ([CS 128](https://catalog.illinois.edu/search/?P=CS%20128 "CS 128") or [ECE 220](https://catalog.illinois.edu/search/?P=ECE%20220 "ECE 220")) and [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") and (CS 241 or [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391")). [CS 460 Security Laboratory credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/460) 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](https://catalog.illinois.edu/search/?P=CS%20461 "CS 461") via hands-on project. Same as [ECE 419](https://catalog.illinois.edu/search/?P=ECE%20419 "ECE 419"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 461](https://catalog.illinois.edu/search/?P=CS%20461 "CS 461") or [ECE 422](https://catalog.illinois.edu/search/?P=ECE%20422 "ECE 422") or a combination of [CS 463](https://catalog.illinois.edu/search/?P=CS%20463 "CS 463") and one of [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"), [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 461 Computer Security I credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/461) 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](https://catalog.illinois.edu/search/?P=ECE%20422 "ECE 422"). 4 undergraduate hours. 4 graduate hours. Prerequisite: One of CS 241, [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"), or a combination of [CS 233](https://catalog.illinois.edu/search/?P=CS%20233 "CS 233") and [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340"). [CS 462 Issues of Law and Policy in Computer Science credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/462) Exploration of the intersection of public policy and computing technology: overview of the US legal system and government, how computing technology is regulated in areas such as privacy, crime, intellectual property, commerce, and national security. Students will complete technical projects related to legal issues, such as scrutinizing DRM, evaluating digital forensics reports, and critiquing software patents. Students will also scrutinize excerpts from legal opinions. 3 undergraduate hours. 4 graduate hours. Credit is not given toward graduation for: Credit is not given for both [CS 462](https://catalog.illinois.edu/search/?P=CS%20462 "CS 462") and [CS 498](https://catalog.illinois.edu/search/?P=CS%20498 "CS 498"), Law \&Policy Issues in CS. Prerequisite: [CS 340](https://catalog.illinois.edu/search/?P=CS%20340 "CS 340") or [CS 341](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341") or [ECE 391](https://catalog.illinois.edu/search/?P=ECE%20391 "ECE 391"). [CS 463 Computer Security II credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/463) 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](https://catalog.illinois.edu/search/?P=ECE%20424 "ECE 424"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225") and one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 441](https://catalog.illinois.edu/search/?P=CS%20441 "CS 441") completion is recommended. [CS 464 Topics in Societal and Ethical Impacts of Computer Technology credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/464) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). One of [CS 210](https://catalog.illinois.edu/search/?P=CS%20210 "CS 210") or [CS 211](https://catalog.illinois.edu/search/?P=CS%20211 "CS 211") or [ECE 316](https://catalog.illinois.edu/search/?P=ECE%20316 "ECE 316") or [PHIL 316](https://catalog.illinois.edu/search/?P=PHIL%20316 "PHIL 316"). One of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400") or [STAT 200](https://catalog.illinois.edu/search/?P=STAT%20200 "STAT 200"). Restricted to students with senior standing. [CS 465 User Interface Design credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/465) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 466 Introduction to Bioinformatics credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/466) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 467 Social Visualization credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/467) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"). [CS 469 Computational Advertising Infrastructure credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/469) 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](https://catalog.illinois.edu/search/?P=ADV%20462 "ADV 462"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406") or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 470 Social and Information Networks credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/470) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); [CS 173](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"); one of [MATH 225](https://catalog.illinois.edu/search/?P=MATH%20225 "MATH 225"), [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"), [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"), [ASRM 406](https://catalog.illinois.edu/search/?P=ASRM%20406 "ASRM 406"), or [BIOE 210](https://catalog.illinois.edu/search/?P=BIOE%20210 "BIOE 210"). [CS 473 Algorithms credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/473) 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](https://catalog.illinois.edu/search/?P=CSE%20414 "CSE 414") and [MATH 473](https://catalog.illinois.edu/search/?P=MATH%20473 "MATH 473"). 4 undergraduate hours. 4 graduate hours. Prerequisite: [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"), and one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 474 Logic in Computer Science credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/474) 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](https://catalog.illinois.edu/search/?P=CS%20173 "CS 173"); [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"). [CS 475 Formal Models of Computation credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/475) 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](https://catalog.illinois.edu/search/?P=MATH%20475 "MATH 475"). 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"). [CS 476 Program Verification credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/476) 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](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374"), [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374") or [MATH 414](https://catalog.illinois.edu/search/?P=MATH%20414 "MATH 414"). [CS 478 Quantum Algorithms and Complexity credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/478) A comprehensive introduction to the theoretical foundations of quantum computing, preparing students for advanced study in quantum information sciences: Building blocks of quantum information such as qubits and entanglement; basic quantum operations such as quantum gates and measurements, and key quantum protocols and algorithms like teleportation and Shor's factoring algorithm. Advanced topics include modern quantum algorithms, quantum learning, quantum complexity theory, cryptography, and error correction. Emphasis on theoretical aspects of design and analysis of quantum algorithms and their computational limits. Prior quantum physics knowledge is helpful but not required. 3 undergraduate hours. 4 graduate hours. Prerequisite: [CS 225](https://catalog.illinois.edu/search/?P=CS%20225 "CS 225"); one of [MATH 257](https://catalog.illinois.edu/search/?P=MATH%20257 "MATH 257"), [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415") or [MATH 416](https://catalog.illinois.edu/search/?P=MATH%20416 "MATH 416"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [ECE 313](https://catalog.illinois.edu/search/?P=ECE%20313 "ECE 313"), [MATH 362](https://catalog.illinois.edu/search/?P=MATH%20362 "MATH 362"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463"), [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"), [PHYS 214](https://catalog.illinois.edu/search/?P=PHYS%20214 "PHYS 214") or [PHYS 486](https://catalog.illinois.edu/search/?P=PHYS%20486 "PHYS 486"). Credit or concurrent enrollment in CS/[ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374") is encouraged. [CS 484 Parallel Programming credit: 3 or 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/484) 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](https://catalog.illinois.edu/search/?P=CS%20341 "CS 341"). [CS 491 Seminar credit: 0 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/491) 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. [CS 492 Senior Project I credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/492) 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](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492") must be taken as a sequence with either [CS 493](https://catalog.illinois.edu/search/?P=CS%20493 "CS 493") or [CS 494](https://catalog.illinois.edu/search/?P=CS%20494 "CS 494"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 492](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492") and a project course in another engineering department for the same project. Prerequisite: For Computer Science majors with senior standing. [CS 493 Senior Project II, ACP credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/493) Continuation of [CS 492](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492"). Identical to [CS 494](https://catalog.illinois.edu/search/?P=CS%20494 "CS 494") except for an additional writing component. See [CS 494](https://catalog.illinois.edu/search/?P=CS%20494 "CS 494"). 3 undergraduate hours. No graduate credit. Credit is not given for both [CS 493](https://catalog.illinois.edu/search/?P=CS%20493 "CS 493") and a project course in another engineering department for the same project. Prerequisite: [CS 492](https://catalog.illinois.edu/search/?P=CS%20492 "CS 492"). This course satisfies the General Education Criteria for: Advanced Composition [CS 497 CS Team Project credit: 1 to 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/497) 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. [CS 498 Special Topics credit: 1 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/498) 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. [CS 499 Senior Thesis credit: 3 Hours.](https://courses.illinois.edu/schedule/terms/CS/499) 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. This course satisfies the General Education Criteria for: Advanced Composition [CS 500 Current Topics in Computing Education Research credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/500) 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. 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. [CS 507 Topics in Cryptography credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/507) 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. 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. [CS 510 Advanced Information Retrieval credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/510) 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. Prerequisite: One of [CS 410](https://catalog.illinois.edu/search/?P=CS%20410 "CS 410"), [CS 412](https://catalog.illinois.edu/search/?P=CS%20412 "CS 412"), [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446"), [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449") or [LING 406](https://catalog.illinois.edu/search/?P=LING%20406 "LING 406"). [CS 511 Advanced Data Management credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/511) 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](https://catalog.illinois.edu/search/?P=CS%20411 "CS 411"). [CS 512 Data Mining Principles credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/512) 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](https://catalog.illinois.edu/search/?P=CS%20412 "CS 412"). [CS 514 Advanced Topics in Network Science credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/514) 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. 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](https://catalog.illinois.edu/search/?P=CS%20412 "CS 412"); one of [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"). Additional prerequisites or corequisites may be specified each term. See section information. [CS 519 Scientific Visualization credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/519) 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](https://catalog.illinois.edu/search/?P=CSE%20527 "CSE 527"). Prerequisite: [CS 418](https://catalog.illinois.edu/search/?P=CS%20418 "CS 418") or [CSE 427](https://catalog.illinois.edu/search/?P=CSE%20427 "CSE 427"). [CS 521 Advanced Topics in Programming Systems credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/521) 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. 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](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"); [CS 421](https://catalog.illinois.edu/search/?P=CS%20421 "CS 421"). Additional prerequisites or corequisites may be specified each term. See section information. [CS 523 Advanced Operating Systems credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/523) 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. Prerequisite: One of [CS 423](https://catalog.illinois.edu/search/?P=CS%20423 "CS 423") or [CSE 423](https://catalog.illinois.edu/search/?P=CSE%20423 "CSE 423"); one of [CS 425](https://catalog.illinois.edu/search/?P=CS%20425 "CS 425") or [ECE 428](https://catalog.illinois.edu/search/?P=ECE%20428 "ECE 428"); and one of [CS 433](https://catalog.illinois.edu/search/?P=CS%20433 "CS 433") or [CSE 422](https://catalog.illinois.edu/search/?P=CSE%20422 "CSE 422"). [CS 524 Concurrent Progrmg Languages credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/524) 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. Prerequisite: [CS 422](https://catalog.illinois.edu/search/?P=CS%20422 "CS 422"); one of [CS 475](https://catalog.illinois.edu/search/?P=CS%20475 "CS 475"), [MATH 475](https://catalog.illinois.edu/search/?P=MATH%20475 "MATH 475") or [CS 476](https://catalog.illinois.edu/search/?P=CS%20476 "CS 476"). [CS 525 Advanced Distributed Systems credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/525) 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. Prerequisite: One of [CS 423](https://catalog.illinois.edu/search/?P=CS%20423 "CS 423"), [CSE 423](https://catalog.illinois.edu/search/?P=CSE%20423 "CSE 423"), [CS 425](https://catalog.illinois.edu/search/?P=CS%20425 "CS 425"), [ECE 428](https://catalog.illinois.edu/search/?P=ECE%20428 "ECE 428"), [CS 438](https://catalog.illinois.edu/search/?P=CS%20438 "CS 438") or [ECE 438](https://catalog.illinois.edu/search/?P=ECE%20438 "ECE 438"). [CS 534 Advanced Topics in Computer Architecture credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/534) 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. 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](https://catalog.illinois.edu/search/?P=CS%20433 "CS 433") or [CSE 422](https://catalog.illinois.edu/search/?P=CSE%20422 "CSE 422"). Additional prerequisites or co-requisites may be specified each term. See Class Schedule information. [CS 537 Advanced Topics in Internet of Things (IoT) credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/537) 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. 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](https://catalog.illinois.edu/search/?P=CS%20425 "CS 425") or [ECE 428](https://catalog.illinois.edu/search/?P=ECE%20428 "ECE 428"); one of [CS 438](https://catalog.illinois.edu/search/?P=CS%20438 "CS 438") or [ECE 438](https://catalog.illinois.edu/search/?P=ECE%20438 "ECE 438"). Additional prerequisites may be specified each term. See section information. [CS 540 Deep Learning Theory credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/540) 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. Prerequisite: Basic linear algebra, probability, proof-writing, and statistics required. Real analysis recommended. [CS 542 Statistical Reinforcement Learning credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/542) 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. 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. [CS 544 Optimiz in Computer Vision credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/544) 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. Prerequisite: One of [CS 450](https://catalog.illinois.edu/search/?P=CS%20450 "CS 450"), [CSE 401](https://catalog.illinois.edu/search/?P=CSE%20401 "CSE 401"), [ECE 491](https://catalog.illinois.edu/search/?P=ECE%20491 "ECE 491"), or [MATH 450](https://catalog.illinois.edu/search/?P=MATH%20450 "MATH 450"); one of [CS 473](https://catalog.illinois.edu/search/?P=CS%20473 "CS 473"), [CSE 414](https://catalog.illinois.edu/search/?P=CSE%20414 "CSE 414") or [MATH 473](https://catalog.illinois.edu/search/?P=MATH%20473 "MATH 473"). [CS 545 Machine Learning for Signal Processing credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/545) 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. Prerequisite: [MATH 415](https://catalog.illinois.edu/search/?P=MATH%20415 "MATH 415"); one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361"), [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 546 Advanced Topics in Natural Language Processing credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/546) 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. 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](https://catalog.illinois.edu/search/?P=CS%20447 "CS 447") and one of [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"), or equivalent background. [CS 562 Advanced Topics in Security, Privacy, and Machine Learning credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/562) 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. 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](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449") and one of [CS 463](https://catalog.illinois.edu/search/?P=CS%20463 "CS 463") or [ECE 424](https://catalog.illinois.edu/search/?P=ECE%20424 "ECE 424"), or equivalent courses, by consent of instructor. Additional prerequisites or corequisites may be specified each term. See section information. [CS 563 Advanced Computer Security credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/563) 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](https://catalog.illinois.edu/search/?P=ECE%20524 "ECE 524"). Prerequisite: One of [CS 461](https://catalog.illinois.edu/search/?P=CS%20461 "CS 461"), [CS 463](https://catalog.illinois.edu/search/?P=CS%20463 "CS 463"), [ECE 422](https://catalog.illinois.edu/search/?P=ECE%20422 "ECE 422") or [ECE 424](https://catalog.illinois.edu/search/?P=ECE%20424 "ECE 424"). [CS 565 Human-Computer Interaction credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/565) 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](https://catalog.illinois.edu/search/?P=CS%20465 "CS 465"). [CS 567 Social Signals and Social Media credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/567) 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. Prerequisite: [CS 465](https://catalog.illinois.edu/search/?P=CS%20465 "CS 465") or equivalent or permission of instructor. Prioritize PhD students, then others. [CS 568 User-Centered Machine Learning credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/568) 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. Prerequisite: [CS 465](https://catalog.illinois.edu/search/?P=CS%20465 "CS 465") or equivalent course work. [CS 574 Randomized Algorithms credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/574) 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. Prerequisite: One of [CS 473](https://catalog.illinois.edu/search/?P=CS%20473 "CS 473"), [CSE 414](https://catalog.illinois.edu/search/?P=CSE%20414 "CSE 414"), or [MATH 473](https://catalog.illinois.edu/search/?P=MATH%20473 "MATH 473"); one of [MATH 461](https://catalog.illinois.edu/search/?P=MATH%20461 "MATH 461"), [MATH 463](https://catalog.illinois.edu/search/?P=MATH%20463 "MATH 463") or [STAT 400](https://catalog.illinois.edu/search/?P=STAT%20400 "STAT 400"). [CS 576 Topics in Automated Deduction credit: 2 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/576) 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. [CS 579 Computational Complexity credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/579) 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](https://catalog.illinois.edu/search/?P=ECE%20579 "ECE 579"). Prerequisite: One of [CS 473](https://catalog.illinois.edu/search/?P=CS%20473 "CS 473"), [CSE 414](https://catalog.illinois.edu/search/?P=CSE%20414 "CSE 414"), [MATH 473](https://catalog.illinois.edu/search/?P=MATH%20473 "MATH 473"), [CS 475](https://catalog.illinois.edu/search/?P=CS%20475 "CS 475") or [MATH 475](https://catalog.illinois.edu/search/?P=MATH%20475 "MATH 475"). [CS 580 Topics in Algorithmic Game Theory credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/580) 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. Prerequisite: [CS 473](https://catalog.illinois.edu/search/?P=CS%20473 "CS 473"). [CS 581 Algorithmic Genomic Biology credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/581) 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. Prerequisite: One of [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374") or [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374") and one of [CS 361](https://catalog.illinois.edu/search/?P=CS%20361 "CS 361") or [STAT 361](https://catalog.illinois.edu/search/?P=STAT%20361 "STAT 361"), or consent of instructor. [CS 582 Machine Learning for Bioinformatics credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/582) 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. Prerequisite: [CS 446](https://catalog.illinois.edu/search/?P=CS%20446 "CS 446") or [ECE 449](https://catalog.illinois.edu/search/?P=ECE%20449 "ECE 449"); Credit or concurrent enrollment in [CS 466](https://catalog.illinois.edu/search/?P=CS%20466 "CS 466"); or consent of instructor. [CS 583 Approximation Algorithms credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/583) 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. Prerequisite: CS 573, CSE 515 or consent of instructor. [CS 588 Autonomous Vehicle System Engineering credit: 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/588) 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. Prerequisite: [CS 374](https://catalog.illinois.edu/search/?P=CS%20374 "CS 374"), [ECE 374](https://catalog.illinois.edu/search/?P=ECE%20374 "ECE 374"), [ECE 484](https://catalog.illinois.edu/search/?P=ECE%20484 "ECE 484"), or equivalent. [CS 591 Advanced Seminar credit: 0 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/591) 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. [CS 598 Special Topics credit: 2 to 4 Hours.](https://courses.illinois.edu/schedule/terms/CS/598) 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.
Shard	109 (laksa)
Root Hash	5087864546879250709
Unparsed URL	edu,illinois!catalog,/courses-of-instruction/cs/ s443