UIUC - bsiever/WUSTL-CSE-Curriculum GitHub Wiki
Overview of CS Major
- 11 significant courses plus a 1 credit intro to CS for Freshman
Core CS courses / description:
Brief summary of- CS100: 1 CR (1-0) Intro to CS as a field and career (Recommended but not required)
- Overview of programs in the Department, College and University that they can use for extra help
- Opportunities to enrich the CS degree and make progress towards a career
- Introduction to the areas in CS covered in our department, the courses and research associated with those areas
- Introduction to the overlap of CS and the research done in our partner departments in the CS+X program
- WUSTL Comparable:?
- CS125: 4 CR (3-2) Introduction to Computer Science
- Basic concepts in computing and fundamental techniques for solving computational problems
- Uses Java and Android Developer Studio
- Course link: https://cs125.cs.illinois.edu/
- WUSTL Comparable: CSE131
- CS126: 3 CR (0-3) Software Design Studio
- Fundamental principles and techniques of software development (Patterns, MVC)
- Design, documentation, testing, and debugging software, with a significant emphasis on code review.
- Continues to use Java and Android Dev Studio
- Course link: [https://courses.engr.illinois.edu/cs126/sp2019/] (https://courses.engr.illinois.edu/cs126/sp2019/)
- WUSTL Comparable: CSE132?
- CS173: 3 CR (3-0) Discrete Structures
- Discrete mathematical structures frequently encountered in the study of Computer Science. Sets, propositions, Boolean algebra, induction, recursion, relations, functions, and graphs.
- Course link: https://courses.engr.illinois.edu/cs173/sp2019/
- WUSTL Comparable: CSE240
- CS210: 2 CR (1-1) Ethical and Professional Issues in CS
- Ethics for the computing profession. Ethical decision-making; licensing; intellectual property, freedom of information, and privacy.
- Course link: [https://cs.illinois.edu/courses/profile/CS210] (https://cs.illinois.edu/courses/profile/CS210)
- WUSTL Comparable: Parts of CSE131 and CSE217?
- CS225: 4 CR (3-2) Data Structure and Software Principles
- Data abstractions: elementary data structures (lists, stacks, queues, and trees) and their implementation using an object-oriented programming language
- Programming in C++, build software to do things like manipulate images or traverse a maze
- Course link: [https://courses.engr.illinois.edu/cs225/sp2019/]] (https://courses.engr.illinois.edu/cs225/sp2019/)
- WUSTL Comparable: CSE332?
- CS233: 4 CR (3-1) Computer Architecture
- Logic design using Verilog, implement a MIPS processor
- Course link:[https://wiki.illinois.edu/wiki/display/cs233sp19] (https://wiki.illinois.edu/wiki/display/cs233sp19)
- WUSTL Comparable: CSE260?
- CS241: 4 CR (3-1) System Programming
- Write, compile, debug, and execute C programs in a UNIX-like operating system.
- Define semaphores, mutexes, and other synchronization primitives.
- Course link:[http://cs241.cs.illinois.edu/] (http://cs241.cs.illinois.edu/)
- WUSTL Comparable:CSE422? or CSE361?
- CS357: 3 CR (3-0) Numerical Methods I
- Fundamentals of numerical methods for students in science and engineering
- Numerical experiments, randomness, Monte Carlo simulations, Taylor series
- Course link:[https://relate.cs.illinois.edu/course/cs357-s19/] (https://relate.cs.illinois.edu/course/cs357-s19/)
- WUSTL Comparable:?
- CS361: 3 CR (3-0) Probability and Statistics for Computer Science
- Course link:[https://courses.engr.illinois.edu/cs361/sp2019/] (https://courses.engr.illinois.edu/cs361/sp2019/)
- WUSTL Comparable: ESE 326
- CS374: 4 (3-1) CR Algorithms and Models of Computation
- Languages, regular expressions, NFAs, DFAs, NP Completeness
- Course link:[https://courses.engr.illinois.edu/cs374/sp2019/] (https://courses.engr.illinois.edu/cs374/sp2019/)
- WUSTL Comparable: CSE347?
- CS421: 3 (3-0) CR Programming Languages and Compilers
- Parts of an interpreter and Functional Programming
- Course link:[https://pages.github-dev.cs.illinois.edu/cs421-haskell/web/] (https://pages.github-dev.cs.illinois.edu/cs421-haskell/web/)
- WUSTL Comparable: CSE425?
Notes of interest
- Courses units are described in 2 parts: (X-Y) X is class hours, Y is lab hours.
- Terms are 16 weeks
Notes of program requirements beyond core courses (breadth/depth requirements)
-
At least six additional courses must be selected to complete the technical electives requirement
-
Three of the CS electives must be chosen from a single focus area
- Focus Areas: Software Foundations, Algorithms and Models of Computation, Intelligence and Big Data, Human and Social Impact, Media, High-Performance Computing, Distributed Systems and Security, Machines
-
One of the six electives must satisfy the team project requirement.
-
6 units in advanced electives (2 400 level courses)
-
Misc. other courses
- Several math courses (Calc I - III, Applied Linear Algebra).
- Several general science/lab courses
- General breadth