Course Flowsheets

These interactive guides provide a semester-by-semester outline of the courses within a curriculum in a "flowsheet" format. The flowsheets enable students and advisors to visualize the pre-, co-, and post-requisites associated with a course. This tool provides a means for students to understand how courses within a curriculum are linked and provides guidance regarding course scheduling.

The effective academic year (AY) refers to the academic year a student is admitted to the major. Academic years listed with a red font represent years in which a curriculum revision was implemented. Please see the Undergraduate Catalog for detailed information regarding effective academic years.

Students can obtain the requirement term (map to effective academic year) associated with their major through the SEAS Portal.

If you have any issues using the flowsheets tool or need assistance, please contact the SEAS Office of Academic Affairs to meet with an academic advisor.

Plan:

Effective Academic Year:

Flowsheet for First Year
Flowsheet for First Year
Flowsheet for Transfer Students
Seamless Transfer

Freshmen Flowsheet for Computer Science BS
(Effective AY 2012-13 to AY 2015-16)

First Year		Second Year		Third Year		Fourth Year
Fall	Spring	Fall	Spring	Fall	Spring	Fall	Spring
MTH 141 MTH 141LR College Calculus 1 Lecture Beginning of a three-semester sequence in calculus for students of mathematics, natural sciences, and engineering. Covers differentiation and integration with applications. This course is the same as MTH 136 + 137 and course repeat rules will apply. Students should consult with their major department regarding any restrictions on their degree requirements. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer, Winter Other Requisites: Pre-Req:70+ all parts of MRA, or C or better in ULC148, MTH108, 114, 115, 121, 131, D or better in MTH141, 3 on AP Calc or 4-5 on AP Pre-Calc or concurrent reg in MTH109 with C or better in MTH113 or MRA scores 70+ Math Fund AND Alg and 50-69 in Trig Calculus 1 CSE 115 CSE 115LLR Computer Science I Lecture Provides the fundamentals of computer science with an emphasis on applying programming skills to solve problems and increase human efficiency. Topics include variables, data types, expressions, control flow, functions, input/output, data storage, networking, security, selection, sorting, iteration and the use of aggregate data structures such as lists and more general collections. No previous programming experience required. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Intro to Computer Science I UBE 101 UBE 101SEM University Experience Seminar Weekly seminar that assists first-year students in making the transition to the university. Through a small, interactive classroom environment intended to engage students in learning, we provide resources, foster important relationships, and help students understand their responsibilities and privileges within the university community. A faculty or staff member and an undergraduate peer mentor collaboratively teach the course. UB 101 is for first semester students only. Students who are not in their first semester will be deregistered from the course. The repeat policy does not apply to this course. Credit: 1 Grading: Pass/Not Pass (PNP) Typically Offered: Fall, Spring Other Requisites: Pre-requisite: Incoming freshmen only. University Experience See your advisor for detailed information. Gen Ed See your advisor for detailed information. Gen Ed	MTH 142 MTH 142LR College Calculus 2 Lecture Differentiation and integration of transcendental functions; infinite sequences; series and power series; integration methods; additional topics in analytic geometry.. This course is the same as MTH 138 and MTH 139 and course repeat rules will apply. Students should consult with their major department regarding any restrictions on their degree requirements. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer, Winter Other Requisites: Pre-Requisite: MTH 141 or MTH 136 with MTH 137 as a co-requisite; Anti-Requisite MTH 138/139. Calculus 2 CSE 116 CSE 116LLB Computer Science II Lecture Students will continue to develop the skills introduced in CSE115 while exploring the details of program execution and the structure of large programs. Emphasizes design decisions that affect the efficiency, expandability, and maintainability of code while analyzing the differences amongst a variety of approaches. Design decisions analyzed include choice of data structures and object-oriented techniques such as encapsulation, polymorphism, and inheritance. Additional topics include the use of recursion, multithreading, parallelism, hardware, graph and tree traversals, asymptotic analysis, divide and conquer, databases, testing, and multi-language integration. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: CSE 115 or EAS 230 or EAS 240 or EAS 999TRCP. Intro to Computer Science II CSE 191 CSE 191LR Intro Discrete Structures Lecture Foundational material for further studies in computer science. Topics include logic, proofs, sets, functions, relations, recursion, recurrence relations, mathematical induction, graphs, trees, basic counting theory, regular languages, and context free grammars. This course is the same as MTH 191 and course repeat rules will apply. Students should consult with their major department regarding any restrictions on their degree requirements. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: CSE 115 or EAS 230 or EAS 240 or EAS 999TRCP, and Pre-calculus (MTH 115 or ULC 148 or MTH 113 or MTH 114) or appropriate math placement test scores or Co-Requisite of Calculus 1 (MTH 121 or MTH 131 or MTH 141, or MTH 136 or MTH 108). Discrete Structures See your advisor for detailed information. Gen Ed	CSE 241 CSE 241LLB Digital Systems Lecture A course in digital principles which includes the following topics: fundamentals of digital logic, number systems, codes, computer arithmetic, Boolean algebra, minimization techniques, basic components of digital circuits such as logic gates and flip-flops, design of combinational and sequential circuits, memory devices, and programming logic. Recommended for sophomore-level students. Credit: 4 Grading: Graded (GRD) Typically Offered: Spring, Summer Other Requisites: Pre-Requisites: Engineering Majors, Computer Science Minors, or Computing and Applied Math Majors only Digital Systems CSE 250 CSE 250LR Data Structures Lecture Provides a rigorous analysis of the design, implementation, and properties of advanced data structures. Topics include time-space analysis and tradeoffs in arrays, vectors, lists, stacks, queues, and heaps; tree and graph algorithms and traversals, hashing, sorting, and data structures on secondary storage. Surveys library implementations of basic data structures in a high-level language. Advanced data structure implementations are studied in detail. Illustrates the importance of choosing appropriate data structures when solving a problem by programming projects in a high-level language. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: CSE 116 and (CSE 191 or MTH 311) and (MTH 141 or MTH 131 or MTH 121 or MTH 137). Engineering, Bioinformatics, Computational Physics, or Math Majors, Computer Science Minors, and Data Intesive Computing Certificate students only Data Structures Your program requirements are older than the curricula available online. See an advisor in 410 Bonner Hall for assistance. Science Sequence 1 See your advisor for detailed information. Gen Ed	CSE 305 CSE 305LR Programming Languages Lecture Examines concepts and constructs found in programming languages. Topics include binding time, strong typing, control and data abstraction, higher-order functions, and polymorphism. The major programming paradigms (procedural, object-oriented, functional, and logic) will be studied and compared. The course will also provide an introduction to syntax and semantics, compilation vs. interpretation, and storage management. Category: Software Systems. Credit: 4 Grading: Graded (GRD) Typically Offered: Spring, Summer Other Requisites: Pre-Requisite: CSE 250 and Computer Science, Computer Engineering, Computational Physics or Bioinformatics majors only. Into to Programming Languages MTH 411 or STA 301 or EAS 305 MTH 411LR Probability Theory Lecture A first course in probability. Introduces the basic concepts of probability theory and addresses many concrete problems. A list of basic concepts includes axioms of probability, conditional probability, independence, random variables (continuous and discrete), distribution functions, expectation, variance, joint distribution functions, limit theorems. This course is dual-listed with MTH 511. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: MTH 142 or MTH 154 or MTH 138 and MTH 139 STA 301LEC Intro to Probability Lec Lecture Credit: 3 Grading: Graded (GRD) Typically Offered: Fall Other Requisites: Co-Requisite: Students must enroll in STA 301LEC and STA 301REC in the same term. EAS 305LR Appl Prob & Stat Lecture This is an introductory course in probability and statistics for undergraduate students in engineering and applied sciences. It prepares the students to apply probability theory and statistical methods to solve engineering problems. Basic probability concepts including discrete, continuous, and multivariate probability distributions are covered. Also, the fundamentals of descriptive and inferential statistics are discussed. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-requisite: MTH 142 or MTH 154. Engineering or Computer Science Majors Only. Students are not eligible to enroll in EAS 305 if they have already completed or are enrolled in CE 305, CIE 308, or EE 305. Applied Probability Elective Your program requirements are older than the curricula available online. See an advisor in 410 Bonner Hall for assistance. Science Sequence 2 See your advisor for detailed information. Gen Ed	CSE 331 CSE 331LR Algo and Complexity Lecture Introduces paradigms for designing algorithms and fundamental limitations to what algorithms can do. Covers basic algorithm design paradigms of greedy algorithms, divide and conquer algorithms and dynamic programming, as well as a selection of advanced algorithmic topics, such as randomized algorithms, algorithms for distributed systems and basic algorithms for machine learning. Topics related to limitations of algorithms include NP-completeness and undecidability. Coverage includes analyzing algorithms via proofs and programming assignments to implement algorithms. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring Other Requisites: Pre-Requisite: MTH 142 or MTH139 or MTH 122, and CSE 250 and (CSE 191 or MTH 311). Computer Science, Computer Engineering, or Bioinformatics majors only. Algorithm Analysis Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. Mathematics Elective See your advisor for detailed information. Gen Ed Please see the Undergraduate Catalog for information on required free electives. Free Elective Please see the Undergraduate Catalog for information on required free electives. Free Elective	CSE 341 CSE 341LR Computer Organization Lecture Basic hardware and software issues of computer organization. Topics include computer abstractions and technology, performance evaluation, instruction set architecture, arithmetic logic unit design, advanced computer arithmetic, datapath and control unit design, pipelining, memory hierarchy, input-output. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: EE 178 or CSE 241 or CSE 220 Computer Science, Computer Engineering, Electrical Engineering, or Bioinformatics majors only Computer Organization CSE 396 CSE 396LR Intro Theory of Computatn Lecture Covers machine models and formal specifications of the classes of computational problems they can solve. The central concepts are the Turing machine and the classes of decidable and computably enumerable languages. The Halting Problem and other natural problems are shown to be undecidable by Turing machines, implying that they are undecidable by high-level programming languages or any other known computational model. Finite automata, which are Turing machines without external memory, are shown to correspond to the class of regular languages. The course also covers regular expressions, time and space complexity of Turing machines, reducibility between problems, and NP-completeness. Category: Theory. Credit: 4 Grading: Graded (GRD) Typically Offered: Spring Other Requisites: Pre-Requisite: CSE 191 or MTH311 and CSE 250, and MTH142 or MTH 139. Computer Science, Computer Engineering, or Bioinformatics majors only. Students must complete a mandatory advisement session with their faculty advisor. Theory of Computation See your advisor for detailed information. Gen Ed Please see the Undergraduate Catalog for information on required free electives. Free Elective	CSE 442 CSE 442LR Software Eng Concepts Lecture Examines in detail the software development process. Topics include software life-cycle models; architectural and design approaches; various techniques for systematic software testing; coding and documentation strategies; project management; customer relations; the social, ethical, and legal aspects of computing; and the impact of economic, environmental, safety, manufacturability, and sustainability factors on design. Students in this course participate in a real-world project from conception to implementation. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring Other Requisites: Pre-Requisite: CSE 250; Approved Computer Science, Computer Engineering, Computational Physics, Bioinformatics/CS Majors only. Students must 60 or more credit hours completed. Software Engineering Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. Software Systems Elective See your advisor for detailed information. Gen Ed See your advisor for detailed information. Gen Ed Please see the Undergraduate Catalog for information on required free electives. Free Elective	CSE 421 CSE 421LEC Operating Systems Lecture Covers the principles and techniques in the design of operating systems. Describes concepts of operating systems in terms of functions, structure, and implementation, particularly emphasizing multiprogramming. Topics include process coordination, deadlocks, memory management, device management, file systems, scheduling policies for CPU, and network and distributed operating systems. Illustrates concepts with examples from existing operating systems. Category: Software Systems. Credit: 3 Grading: Graded (GRD) Typically Offered: Fall, Spring Other Requisites: Pre-Requisite: CSE 250 and CSE 220 Computer Science, Computer Engineering, or Bioinformatics majors only. Operating Systems Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. Artificial Intelligence Elective Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. CSE 400 Level Elective Please see the Undergraduate Catalog for information on required free electives. Free Elective
15 Hours	15 Hours	15 Hours	14 Hours	17 Hours	14 Hours	17 Hours	15 Hours

General Notes:

STA 301 and MTH 411 are equivalent courses. Students can not earn credit for both STA 301 and MTH 411.

Effective Fall 2019, CSE 400 level classes except CSE 442 and CSE 493 will be 3 credits.

Course Specific Notes:

CSE 241 will no longer be offered in Fall after the Fall 2018 semester.

Place the mouse over a course to highlight the
course prerequisite sequence
course prerequisites
course corequisite sequence
course corequisites
course post-corequisites
postrequisite course sequence

Please refer to the undergraduate catalog for course options and further details about options and possible requisites for elective courses.

Click any course to view a course description and course schedules in the Undergraduate Catalog

These online flowsheets have been prepared to assist you in determining the standard course flow for each major. While efforts have been made to ensure their accuracy, final responsibility for meeting graduation requirements resides with you. Using this tool does not take the place of meeting with your academic advisor.

Transfer Flowsheet for Computer Science BS
(Effective AY 2012-13 to AY 2015-16)

First Year		Second Year		Third Year		Fourth Year
Fall	Spring	Fall	Spring	Fall	Spring	Fall	Spring
MTH 141 MTH 141LR College Calculus 1 Lecture Beginning of a three-semester sequence in calculus for students of mathematics, natural sciences, and engineering. Covers differentiation and integration with applications. This course is the same as MTH 136 + 137 and course repeat rules will apply. Students should consult with their major department regarding any restrictions on their degree requirements. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer, Winter Other Requisites: Pre-Req:70+ all parts of MRA, or C or better in ULC148, MTH108, 114, 115, 121, 131, D or better in MTH141, 3 on AP Calc or 4-5 on AP Pre-Calc or concurrent reg in MTH109 with C or better in MTH113 or MRA scores 70+ Math Fund AND Alg and 50-69 in Trig Calculus 1 CSE 115 CSE 115LLR Computer Science I Lecture Provides the fundamentals of computer science with an emphasis on applying programming skills to solve problems and increase human efficiency. Topics include variables, data types, expressions, control flow, functions, input/output, data storage, networking, security, selection, sorting, iteration and the use of aggregate data structures such as lists and more general collections. No previous programming experience required. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Intro to Computer Science I See your advisor for detailed information. Gen Ed See your advisor for detailed information. Gen Ed	MTH 142 MTH 142LR College Calculus 2 Lecture Differentiation and integration of transcendental functions; infinite sequences; series and power series; integration methods; additional topics in analytic geometry.. This course is the same as MTH 138 and MTH 139 and course repeat rules will apply. Students should consult with their major department regarding any restrictions on their degree requirements. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer, Winter Other Requisites: Pre-Requisite: MTH 141 or MTH 136 with MTH 137 as a co-requisite; Anti-Requisite MTH 138/139. Calculus 2 CSE 116 CSE 116LLB Computer Science II Lecture Students will continue to develop the skills introduced in CSE115 while exploring the details of program execution and the structure of large programs. Emphasizes design decisions that affect the efficiency, expandability, and maintainability of code while analyzing the differences amongst a variety of approaches. Design decisions analyzed include choice of data structures and object-oriented techniques such as encapsulation, polymorphism, and inheritance. Additional topics include the use of recursion, multithreading, parallelism, hardware, graph and tree traversals, asymptotic analysis, divide and conquer, databases, testing, and multi-language integration. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: CSE 115 or EAS 230 or EAS 240 or EAS 999TRCP. Intro to Computer Science II CSE 191 CSE 191LR Intro Discrete Structures Lecture Foundational material for further studies in computer science. Topics include logic, proofs, sets, functions, relations, recursion, recurrence relations, mathematical induction, graphs, trees, basic counting theory, regular languages, and context free grammars. This course is the same as MTH 191 and course repeat rules will apply. Students should consult with their major department regarding any restrictions on their degree requirements. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: CSE 115 or EAS 230 or EAS 240 or EAS 999TRCP, and Pre-calculus (MTH 115 or ULC 148 or MTH 113 or MTH 114) or appropriate math placement test scores or Co-Requisite of Calculus 1 (MTH 121 or MTH 131 or MTH 141, or MTH 136 or MTH 108). Discrete Structures See your advisor for detailed information. Gen Ed	CSE 250 CSE 250LR Data Structures Lecture Provides a rigorous analysis of the design, implementation, and properties of advanced data structures. Topics include time-space analysis and tradeoffs in arrays, vectors, lists, stacks, queues, and heaps; tree and graph algorithms and traversals, hashing, sorting, and data structures on secondary storage. Surveys library implementations of basic data structures in a high-level language. Advanced data structure implementations are studied in detail. Illustrates the importance of choosing appropriate data structures when solving a problem by programming projects in a high-level language. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: CSE 116 and (CSE 191 or MTH 311) and (MTH 141 or MTH 131 or MTH 121 or MTH 137). Engineering, Bioinformatics, Computational Physics, or Math Majors, Computer Science Minors, and Data Intesive Computing Certificate students only Data Structures Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. Mathematics Elective Your program requirements are older than the curricula available online. See an advisor in 410 Bonner Hall for assistance. Science Sequence 1 See your advisor for detailed information. Gen Ed	CSE 341 CSE 341LR Computer Organization Lecture Basic hardware and software issues of computer organization. Topics include computer abstractions and technology, performance evaluation, instruction set architecture, arithmetic logic unit design, advanced computer arithmetic, datapath and control unit design, pipelining, memory hierarchy, input-output. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: EE 178 or CSE 241 or CSE 220 Computer Science, Computer Engineering, Electrical Engineering, or Bioinformatics majors only Computer Organization Your program requirements are older than the curricula available online. See an advisor in 410 Bonner Hall for assistance. Science Sequence 2 See your advisor for detailed information. Gen Ed	CSE 241 CSE 241LLB Digital Systems Lecture A course in digital principles which includes the following topics: fundamentals of digital logic, number systems, codes, computer arithmetic, Boolean algebra, minimization techniques, basic components of digital circuits such as logic gates and flip-flops, design of combinational and sequential circuits, memory devices, and programming logic. Recommended for sophomore-level students. Credit: 4 Grading: Graded (GRD) Typically Offered: Spring, Summer Other Requisites: Pre-Requisites: Engineering Majors, Computer Science Minors, or Computing and Applied Math Majors only Digital Systems CSE 331 CSE 331LR Algo and Complexity Lecture Introduces paradigms for designing algorithms and fundamental limitations to what algorithms can do. Covers basic algorithm design paradigms of greedy algorithms, divide and conquer algorithms and dynamic programming, as well as a selection of advanced algorithmic topics, such as randomized algorithms, algorithms for distributed systems and basic algorithms for machine learning. Topics related to limitations of algorithms include NP-completeness and undecidability. Coverage includes analyzing algorithms via proofs and programming assignments to implement algorithms. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring Other Requisites: Pre-Requisite: MTH 142 or MTH139 or MTH 122, and CSE 250 and (CSE 191 or MTH 311). Computer Science, Computer Engineering, or Bioinformatics majors only. Algorithm Analysis MTH 411 or STA 301 or EAS 305 MTH 411LR Probability Theory Lecture A first course in probability. Introduces the basic concepts of probability theory and addresses many concrete problems. A list of basic concepts includes axioms of probability, conditional probability, independence, random variables (continuous and discrete), distribution functions, expectation, variance, joint distribution functions, limit theorems. This course is dual-listed with MTH 511. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: MTH 142 or MTH 154 or MTH 138 and MTH 139 STA 301LEC Intro to Probability Lec Lecture Credit: 3 Grading: Graded (GRD) Typically Offered: Fall Other Requisites: Co-Requisite: Students must enroll in STA 301LEC and STA 301REC in the same term. EAS 305LR Appl Prob & Stat Lecture This is an introductory course in probability and statistics for undergraduate students in engineering and applied sciences. It prepares the students to apply probability theory and statistical methods to solve engineering problems. Basic probability concepts including discrete, continuous, and multivariate probability distributions are covered. Also, the fundamentals of descriptive and inferential statistics are discussed. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-requisite: MTH 142 or MTH 154. Engineering or Computer Science Majors Only. Students are not eligible to enroll in EAS 305 if they have already completed or are enrolled in CE 305, CIE 308, or EE 305. Applied Probability Elective See your advisor for detailed information. Gen Ed Please see the Undergraduate Catalog for information on required free electives. Free Elective	CSE 305 CSE 305LR Programming Languages Lecture Examines concepts and constructs found in programming languages. Topics include binding time, strong typing, control and data abstraction, higher-order functions, and polymorphism. The major programming paradigms (procedural, object-oriented, functional, and logic) will be studied and compared. The course will also provide an introduction to syntax and semantics, compilation vs. interpretation, and storage management. Category: Software Systems. Credit: 4 Grading: Graded (GRD) Typically Offered: Spring, Summer Other Requisites: Pre-Requisite: CSE 250 and Computer Science, Computer Engineering, Computational Physics or Bioinformatics majors only. Into to Programming Languages CSE 396 CSE 396LR Intro Theory of Computatn Lecture Covers machine models and formal specifications of the classes of computational problems they can solve. The central concepts are the Turing machine and the classes of decidable and computably enumerable languages. The Halting Problem and other natural problems are shown to be undecidable by Turing machines, implying that they are undecidable by high-level programming languages or any other known computational model. Finite automata, which are Turing machines without external memory, are shown to correspond to the class of regular languages. The course also covers regular expressions, time and space complexity of Turing machines, reducibility between problems, and NP-completeness. Category: Theory. Credit: 4 Grading: Graded (GRD) Typically Offered: Spring Other Requisites: Pre-Requisite: CSE 191 or MTH311 and CSE 250, and MTH142 or MTH 139. Computer Science, Computer Engineering, or Bioinformatics majors only. Students must complete a mandatory advisement session with their faculty advisor. Theory of Computation See your advisor for detailed information. Gen Ed Please see the Undergraduate Catalog for information on required free electives. Free Elective Please see the Undergraduate Catalog for information on required free electives. Free Elective	CSE 442 CSE 442LR Software Eng Concepts Lecture Examines in detail the software development process. Topics include software life-cycle models; architectural and design approaches; various techniques for systematic software testing; coding and documentation strategies; project management; customer relations; the social, ethical, and legal aspects of computing; and the impact of economic, environmental, safety, manufacturability, and sustainability factors on design. Students in this course participate in a real-world project from conception to implementation. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring Other Requisites: Pre-Requisite: CSE 250; Approved Computer Science, Computer Engineering, Computational Physics, Bioinformatics/CS Majors only. Students must 60 or more credit hours completed. Software Engineering Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. Software Systems Elective See your advisor for detailed information. Gen Ed See your advisor for detailed information. Gen Ed Please see the Undergraduate Catalog for information on required free electives. Free Elective	CSE 421 CSE 421LEC Operating Systems Lecture Covers the principles and techniques in the design of operating systems. Describes concepts of operating systems in terms of functions, structure, and implementation, particularly emphasizing multiprogramming. Topics include process coordination, deadlocks, memory management, device management, file systems, scheduling policies for CPU, and network and distributed operating systems. Illustrates concepts with examples from existing operating systems. Category: Software Systems. Credit: 3 Grading: Graded (GRD) Typically Offered: Fall, Spring Other Requisites: Pre-Requisite: CSE 250 and CSE 220 Computer Science, Computer Engineering, or Bioinformatics majors only. Operating Systems Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. Artificial Intelligence Elective Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. CSE 400 Level Elective Please see the Undergraduate Catalog for information on required free electives. Free Elective
14 Hours	15 Hours	15 Hours	11 Hours	17 Hours	17 Hours	17 Hours	15 Hours

General Notes:

Transfer students are encouraged to complete a minimum of 60 credit hours during the first two years of study. We recommend that they complete a Digital Systems course (equivalent to UB's CSE 241) and a calculus-based probability and statistics course (equivalent to UB's MTH 411, EAS 305, or STA 301) in the first two years of study.

STA 301 and MTH 411 are equivalent courses. Students can not earn credit for both STA 301 and MTH 411.

Effective Fall 2019, CSE 400 level classes except CSE 442 and CSE 493 will be 3 credits.

Course Specific Notes:

CSE 241 will no longer be offered in Fall after the Fall 2018 semester.

Place the mouse over a course to highlight the
course prerequisite sequence
course prerequisites
course corequisite sequence
course corequisites
course post-corequisites
postrequisite course sequence

Please refer to the undergraduate catalog for course options and further details about options and possible requisites for elective courses.

Click any course to view a course description and course schedules in the Undergraduate Catalog

Seamless Transfer Flowsheet for Computer Science BS
(Effective AY 2012-13 to AY 2015-16)

Third Year		Fourth Year
Fall	Spring	Fall	Spring
Please see the Undergraduate Catalog for information on required free electives. Free Elective See your advisor for detailed information. Gen Ed CSE 241 CSE 241LLB Digital Systems Lecture A course in digital principles which includes the following topics: fundamentals of digital logic, number systems, codes, computer arithmetic, Boolean algebra, minimization techniques, basic components of digital circuits such as logic gates and flip-flops, design of combinational and sequential circuits, memory devices, and programming logic. Recommended for sophomore-level students. Credit: 4 Grading: Graded (GRD) Typically Offered: Spring, Summer Other Requisites: Pre-Requisites: Engineering Majors, Computer Science Minors, or Computing and Applied Math Majors only Digital Systems CSE 331 CSE 331LR Algo and Complexity Lecture Introduces paradigms for designing algorithms and fundamental limitations to what algorithms can do. Covers basic algorithm design paradigms of greedy algorithms, divide and conquer algorithms and dynamic programming, as well as a selection of advanced algorithmic topics, such as randomized algorithms, algorithms for distributed systems and basic algorithms for machine learning. Topics related to limitations of algorithms include NP-completeness and undecidability. Coverage includes analyzing algorithms via proofs and programming assignments to implement algorithms. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring Other Requisites: Pre-Requisite: MTH 142 or MTH139 or MTH 122, and CSE 250 and (CSE 191 or MTH 311). Computer Science, Computer Engineering, or Bioinformatics majors only. Algorithm Analysis MTH 411 or STA 301 or EAS 305 MTH 411LR Probability Theory Lecture A first course in probability. Introduces the basic concepts of probability theory and addresses many concrete problems. A list of basic concepts includes axioms of probability, conditional probability, independence, random variables (continuous and discrete), distribution functions, expectation, variance, joint distribution functions, limit theorems. This course is dual-listed with MTH 511. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: MTH 142 or MTH 154 or MTH 138 and MTH 139 STA 301LEC Intro to Probability Lec Lecture Credit: 3 Grading: Graded (GRD) Typically Offered: Fall Other Requisites: Co-Requisite: Students must enroll in STA 301LEC and STA 301REC in the same term. EAS 305LR Appl Prob & Stat Lecture This is an introductory course in probability and statistics for undergraduate students in engineering and applied sciences. It prepares the students to apply probability theory and statistical methods to solve engineering problems. Basic probability concepts including discrete, continuous, and multivariate probability distributions are covered. Also, the fundamentals of descriptive and inferential statistics are discussed. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-requisite: MTH 142 or MTH 154. Engineering or Computer Science Majors Only. Students are not eligible to enroll in EAS 305 if they have already completed or are enrolled in CE 305, CIE 308, or EE 305. Applied Probability Elective	Please see the Undergraduate Catalog for information on required free electives. Free Elective Please see the Undergraduate Catalog for information on required free electives. Free Elective See your advisor for detailed information. Gen Ed CSE 396 CSE 396LR Intro Theory of Computatn Lecture Covers machine models and formal specifications of the classes of computational problems they can solve. The central concepts are the Turing machine and the classes of decidable and computably enumerable languages. The Halting Problem and other natural problems are shown to be undecidable by Turing machines, implying that they are undecidable by high-level programming languages or any other known computational model. Finite automata, which are Turing machines without external memory, are shown to correspond to the class of regular languages. The course also covers regular expressions, time and space complexity of Turing machines, reducibility between problems, and NP-completeness. Category: Theory. Credit: 4 Grading: Graded (GRD) Typically Offered: Spring Other Requisites: Pre-Requisite: CSE 191 or MTH311 and CSE 250, and MTH142 or MTH 139. Computer Science, Computer Engineering, or Bioinformatics majors only. Students must complete a mandatory advisement session with their faculty advisor. Theory of Computation CSE 305 CSE 305LR Programming Languages Lecture Examines concepts and constructs found in programming languages. Topics include binding time, strong typing, control and data abstraction, higher-order functions, and polymorphism. The major programming paradigms (procedural, object-oriented, functional, and logic) will be studied and compared. The course will also provide an introduction to syntax and semantics, compilation vs. interpretation, and storage management. Category: Software Systems. Credit: 4 Grading: Graded (GRD) Typically Offered: Spring, Summer Other Requisites: Pre-Requisite: CSE 250 and Computer Science, Computer Engineering, Computational Physics or Bioinformatics majors only. Into to Programming Languages	Please see the Undergraduate Catalog for information on required free electives. Free Elective See your advisor for detailed information. Gen Ed See your advisor for detailed information. Gen Ed Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. Software Systems Elective CSE 442 CSE 442LR Software Eng Concepts Lecture Examines in detail the software development process. Topics include software life-cycle models; architectural and design approaches; various techniques for systematic software testing; coding and documentation strategies; project management; customer relations; the social, ethical, and legal aspects of computing; and the impact of economic, environmental, safety, manufacturability, and sustainability factors on design. Students in this course participate in a real-world project from conception to implementation. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring Other Requisites: Pre-Requisite: CSE 250; Approved Computer Science, Computer Engineering, Computational Physics, Bioinformatics/CS Majors only. Students must 60 or more credit hours completed. Software Engineering	Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. CSE 400 Level Elective Please see the Undergraduate Catalog for information on required free electives. Free Elective Your program requirements are older than the available online. See an advisor in 410 Bonner Hall for assistance. Artificial Intelligence Elective CSE 421 CSE 421LEC Operating Systems Lecture Covers the principles and techniques in the design of operating systems. Describes concepts of operating systems in terms of functions, structure, and implementation, particularly emphasizing multiprogramming. Topics include process coordination, deadlocks, memory management, device management, file systems, scheduling policies for CPU, and network and distributed operating systems. Illustrates concepts with examples from existing operating systems. Category: Software Systems. Credit: 3 Grading: Graded (GRD) Typically Offered: Fall, Spring Other Requisites: Pre-Requisite: CSE 250 and CSE 220 Computer Science, Computer Engineering, or Bioinformatics majors only. Operating Systems
17 Hours	17 Hours	17 Hours	15 Hours

Computer Science Core Requirements
CSE 115LLR Computer Science I Lecture Provides the fundamentals of computer science with an emphasis on applying programming skills to solve problems and increase human efficiency. Topics include variables, data types, expressions, control flow, functions, input/output, data storage, networking, security, selection, sorting, iteration and the use of aggregate data structures such as lists and more general collections. No previous programming experience required. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: CSE 115 Intro to Computer Science I MTH 141LR College Calculus 1 Lecture Beginning of a three-semester sequence in calculus for students of mathematics, natural sciences, and engineering. Covers differentiation and integration with applications. This course is the same as MTH 136 + 137 and course repeat rules will apply. Students should consult with their major department regarding any restrictions on their degree requirements. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer, Winter Other Requisites: Pre-Req:70+ all parts of MRA, or C or better in ULC148, MTH108, 114, 115, 121, 131, D or better in MTH141, 3 on AP Calc or 4-5 on AP Pre-Calc or concurrent reg in MTH109 with C or better in MTH113 or MRA scores 70+ Math Fund AND Alg and 50-69 in Trig MTH 141 Calculus 1	CSE 116LLB Computer Science II Lecture Students will continue to develop the skills introduced in CSE115 while exploring the details of program execution and the structure of large programs. Emphasizes design decisions that affect the efficiency, expandability, and maintainability of code while analyzing the differences amongst a variety of approaches. Design decisions analyzed include choice of data structures and object-oriented techniques such as encapsulation, polymorphism, and inheritance. Additional topics include the use of recursion, multithreading, parallelism, hardware, graph and tree traversals, asymptotic analysis, divide and conquer, databases, testing, and multi-language integration. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: CSE 115 or EAS 230 or EAS 240 or EAS 999TRCP. CSE 116 Intro to Computer Science II CSE 191LR Intro Discrete Structures Lecture Foundational material for further studies in computer science. Topics include logic, proofs, sets, functions, relations, recursion, recurrence relations, mathematical induction, graphs, trees, basic counting theory, regular languages, and context free grammars. This course is the same as MTH 191 and course repeat rules will apply. Students should consult with their major department regarding any restrictions on their degree requirements. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: CSE 115 or EAS 230 or EAS 240 or EAS 999TRCP, and Pre-calculus (MTH 115 or ULC 148 or MTH 113 or MTH 114) or appropriate math placement test scores or Co-Requisite of Calculus 1 (MTH 121 or MTH 131 or MTH 141, or MTH 136 or MTH 108). CSE 191 Discrete Structures	CSE 250LR Data Structures Lecture Provides a rigorous analysis of the design, implementation, and properties of advanced data structures. Topics include time-space analysis and tradeoffs in arrays, vectors, lists, stacks, queues, and heaps; tree and graph algorithms and traversals, hashing, sorting, and data structures on secondary storage. Surveys library implementations of basic data structures in a high-level language. Advanced data structure implementations are studied in detail. Illustrates the importance of choosing appropriate data structures when solving a problem by programming projects in a high-level language. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: CSE 116 and (CSE 191 or MTH 311) and (MTH 141 or MTH 131 or MTH 121 or MTH 137). Engineering, Bioinformatics, Computational Physics, or Math Majors, Computer Science Minors, and Data Intesive Computing Certificate students only CSE 250 Data Structures	CSE 341LR Computer Organization Lecture Basic hardware and software issues of computer organization. Topics include computer abstractions and technology, performance evaluation, instruction set architecture, arithmetic logic unit design, advanced computer arithmetic, datapath and control unit design, pipelining, memory hierarchy, input-output. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer Other Requisites: Pre-Requisite: EE 178 or CSE 241 or CSE 220 Computer Science, Computer Engineering, Electrical Engineering, or Bioinformatics majors only CSE 341 Computer Organization

Mathematics Requirements
MTH 142LR College Calculus 2 Lecture Differentiation and integration of transcendental functions; infinite sequences; series and power series; integration methods; additional topics in analytic geometry.. This course is the same as MTH 138 and MTH 139 and course repeat rules will apply. Students should consult with their major department regarding any restrictions on their degree requirements. Credit: 4 Grading: Graded (GRD) Typically Offered: Fall, Spring, Summer, Winter Other Requisites: Pre-Requisite: MTH 141 or MTH 136 with MTH 137 as a co-requisite; Anti-Requisite MTH 138/139. MTH 142 Calculus 2	Your program requirements are older than the curricula available online. See an advisor in 410 Bonner Hall for assistance. Mathematics Elective

Natural Science Requirements
Your program requirements are older than the curricula available online. See an advisor in 410 Bonner Hall for assistance. Science Sequence 1	Your program requirements are older than the curricula available online. See an advisor in 410 Bonner Hall for assistance. Science Sequence 2

General Education Requirements
See your advisor for detailed information. Gen Ed See your advisor for detailed information. Gen Ed	See your advisor for detailed information. Gen Ed	See your advisor for detailed information. Gen Ed	See your advisor for detailed information. Gen Ed

General Notes:

STA 301 and MTH 411 are equivalent courses. Students can not earn credit for both STA 301 and MTH 411.

Effective Fall 2019, CSE 400 level classes except CSE 442 and CSE 493 will be 3 credits.

Course Specific Notes:

CSE 241 will no longer be offered in Fall after the Fall 2018 semester.

Place the mouse over a course to highlight the
course prerequisite sequence
course prerequisites
course corequisite sequence
course corequisites
course post-corequisites
postrequisite course sequence

Please refer to the undergraduate catalog for course options and further details about options and possible requisites for elective courses.

Click any course to view a course description and course schedules in the Undergraduate Catalog

Back to Academic Advisement

Course Flowsheets

Academic Departments