A checklist is the list of requirements to complete this program and receive the award, as the college publishes it in its catalog. It is the same for everyone. It does not say what you have completed; that comes from applying your own record.
Program
- Award
- B.S.
- Credential class
- ceterms:BachelorDegree
- CIP
- 11.0701
- Total credits (published)
- 36
- Credits (computed from items)
- 949
- Catalog edition
- 2026-2027
- Checklist type
- degree-program
Identifiers
- IPEDS UNITID
- 211440
- CourseShelf checklist
- CK_211440_749e5f27
- CollegeTransfer.Net
- Institution Transfer Profile
- Source
- CourseShelf publish 59
Requirements to complete
Every course or condition the catalog lists, in the catalog's order.
Computer Science
39 items
- 07-128First Year SeminarNot resolved to a course3
- 15-122Principles of Imperative Computation(students without credit or a waiver for 15-112, Fundamentals of Programming and Computer Science, must take 15-112 before 15-122)Not resolved to a course12
- 15-150Principles of Functional ProgrammingNot resolved to a course12
- 15-210Parallel and Sequential Data Structures and AlgorithmsNot resolved to a course12
- 15-213Introduction to Computer SystemsNot resolved to a course12
- 15-251Great Ideas in Theoretical Computer ScienceNot resolved to a course12
- 15-451Algorithm Design and AnalysisNot resolved to a course12
- 07-280Artificial Intelligence and Machine Learning INot resolved to a course12
- 10-301Introduction to Machine LearningNot resolved to a course12
- 11-411Natural Language ProcessingNot resolved to a course12
- 11-485Introduction to Deep LearningNot resolved to a course12
- 15-382Collective Intelligence(Note: 15-382 is ONLY offered at Carnegie Mellon in Qatar.)Not resolved to a course9
- 15-386Neural ComputationNot resolved to a course9
- 16-280Intelligent Robot SystemsNot resolved to a course12
- 16-384Robot Kinematics and DynamicsNot resolved to a course12
- 16-385Computer VisionNot resolved to a course12
- 02-251Great Ideas in Computational Biologyor 02-180 & 02-181Not resolved to a course12
- 05-391Designing Human Centered Softwareor 05-180 & 05-431Not resolved to a course12
- 11-324Human Language for Artificial IntelligenceNot resolved to a course12
- 15-322Introduction to Computer MusicNot resolved to a course9
- 15-330Introduction to Computer SecurityNot resolved to a course12
- 15-362Computer GraphicsNot resolved to a course12
- 15-455Undergraduate Complexity TheoryNot resolved to a course9
- 17-313Foundations of Software EngineeringNot resolved to a course12
- 15-311Logic and Mechanized ReasoningNot resolved to a course9
- 15-312Foundations of Programming LanguagesNot resolved to a course12
- 15-316Software Foundations of Security and PrivacyNot resolved to a course9
- 15-317Constructive LogicNot resolved to a course9
- 15-414Bug Catching: Automated Program VerificationNot resolved to a course9
- 17-355Program AnalysisNot resolved to a course12
- 17-363Programming Language PragmaticsNot resolved to a course12
- 80-413Category TheoryNot resolved to a course9
- 15-410Operating System Design and ImplementationNot resolved to a course15
- 15-411Compiler DesignNot resolved to a course15
- 15-418Parallel Computer Architecture and ProgrammingNot resolved to a course12
- 15-440Distributed SystemsNot resolved to a course12
- 15-441Networking and the InternetNot resolved to a course12
- 15-445Database SystemsNot resolved to a course12
- These electives can be from any SCS department (Computer Science [15-], Computational Biology [02-], Human-Computer Interaction [05-], SCS Interdisciplinary [07-], Machine Learning [10-], Language Technologies [11-], Robotics [16-], or Software & Societal Systems [17-]). They must be 200-level or above and at least 9 units each, with the following exceptions:Not resolved to a course18
ADDITIONS: 1) students who take two of the major-intro mini-courses (02-180, 05-180, 07-180, or 16-180) during their first year may combine these two mini-courses together to count as one SCS elective; 2) 15-195 and 15-295 can be combined to count as one SCS elective.
electives · 0 items
DELETIONS: 1) the following courses do NOT count as SCS electives: 02-201, 02-223, 02-250, 02-261, 05-200, 07-300, 07-402, 10-202, 11-423, 15-351, 16-211, 16-223, 16-224, 16-375, 16-376, 16-377, 16-397, 16-480, 16-730, 17-200, 17-333, 17-416, 17-562; 2) some IDeATe courses and some SCS undergraduate and graduate courses might not be allowed based on course content. Always consult with a CS undergraduate advisor before registration to determine eligibility for this requirement.
electives · 0 items
Mathematics
0 items
All of the following Mathematics courses:
5 items
- 15-151Mathematical Foundations for Computer Science(if not offered, substitute 21-127 or 21-128)Not resolved to a course12
- 21-120Differential and Integral CalculusNot resolved to a course10
- 21-122Integration and ApproximationNot resolved to a course10
- 21-241Matrices and Linear TransformationsNot resolved to a courseor: 21-242 Matrix Theory11
- 21-259Calculus in Three DimensionsNot resolved to a courseor: 21-266 Vector Calculus using Matrix Algebraor: 21-268 Multidimensional Calculusor: 21-269 Vector Analysis10
Plus one of the following Probability choices:
5 items
- 15-259Probability and ComputingNot resolved to a course12
- 21-325ProbabilityNot resolved to a course9
- 21-425Probability and MartingalesNot resolved to a course9
- 36-218Probability Theory for Computer ScientistsNot resolved to a course9
- 36-225& 36-226Introduction to Probability Theoryand Introduction to Statistical Inference(must take both courses in this sequence to satisfy requirement)Not resolved to a course18
Technical Communication
3 items
- 07-300Research and Innovation in Computer ScienceNot resolved to a course9
- 17-200Ethics and Policy Issues in ComputingNot resolved to a course9
- 76-270Writing for the ProfessionsNot resolved to a course9
Computing @ Carnegie Mellon (1 course)
1 item
- 99-101Core@CMUNot resolved to a course3
Sample Course Sequence
40 items
- 07-128First Year SeminarNot resolved to a course3
- 07-131Great Practical Ideas for Computer Scientists(optional, not required for CS major)Not resolved to a course2
- 15-122Principles of Imperative ComputationNot resolved to a course12
- 15-151Mathematical Foundations for Computer Science(if not offered, substitute 21-127)Not resolved to a course12
- 21-122Integration and ApproximationNot resolved to a course10
- 76-101Interpretation and ArgumentNot resolved to a course9
- 99-101Core@CMUNot resolved to a course3
- 15-150Principles of Functional ProgrammingNot resolved to a course12
- 15-213Introduction to Computer SystemsNot resolved to a course12
- 21-259Calculus in Three DimensionsNot resolved to a course10
- xx-180Not resolved to a course5
- xx-xxxNot resolved to a course9
- 15-210Parallel and Sequential Data Structures and AlgorithmsNot resolved to a course12
- 21-241Matrices and Linear TransformationsNot resolved to a course11
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- 15-251Great Ideas in Theoretical Computer ScienceNot resolved to a course12
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- 15-451Algorithm Design and AnalysisNot resolved to a course12
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- 15-xxxNot resolved to a course12
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
- xx-xxxNot resolved to a course9
Source. Carnegie Mellon University, catalog 2026-2027 — https://coursecatalog.web.cmu.edu/schools-colleges/schoolofcomputerscience/undergraduatecomputerscience/computer-science-bs/. Captured page pages/0063.html.gz. Assembled from the institution's published catalog as captured; every record names its captured page and source URL. Assembled, not asserted.