|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 113 Corequisites: None Type: LEC/REC Continuation of CSE 113 for nonmajors. Currently required for some School of Management majors and appropriate for others seeking additional programming skills. Emphasizes the use of modern object-oriented programming methodologies, such as class inheritance, polymorphism, and exceptions. Neither CSE 113 nor CSE 114 can count towards a CSE degree. Admitted computer science and computer engineering majors should not take this course.
-
4.00 Credits
Credits: 4 Prerequisites: No previous programming experience required Corequisites: MTH 141 or equivalent Type: LEC/REC Provides the fundamentals of the field to computer science and computer engineering majors, introducing students to algorithm design and implementation in a modern, high-level programming language. Emphasizes problem solving by abstraction. Topics include object-oriented design using a formal modeling language; fundamental object-oriented principles such as classes, objects, interfaces, inheritance and polymorphism; simple event-driven programming; data types; variables; expressions; basic imperative programming techniques, including assignment, input/output, subprograms, parameters, sequencing, selection and iteration; the use of aggregate data structures, such as arrays or more general collections; simple design patterns.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 115 or permission of instructor Corequisites: None Type: LEC/REC Continuation of CSE 115. Heavily emphasizes abstract data types (ADTs) and object-oriented methodology, and expects students not only to understand ADTs but also to design and implement robust ADTs using a modern object-oriented programming language. Further emphasizes object-oriented techniques, which support sound software engineering, such as encapsulation, polymorphism and inheritance as well as the use of more complex design patterns. Essential topics integrated in this framework include the use of recursion; linked data structures, including lists, stacks, queues, binary trees, and other advanced data structures; and algorithms for searching and sorting; exceptions and exception handling, event-driven programming. Introduces the analysis of algorithm complexity (0-notation).
-
4.00 Credits
Credits: 4 Prerequisites: CSE 113 or CSE 115 or knowledge of introductory computer science/computer programming Corequisites: None Type: LEC/REC Foundational material for further studies in computer science. Topics include logic, proofs, sets, functions, relations, recursion, recurrence relations, mathematical induction, graphs, trees, and some basic counting theory. CSE 191 is required for computer science and computer engineering majors.
-
3.00 Credits
Credits: 3 Prerequisites: four years of high school mathematics, knowledge of some programming language Corequisites: None Type: SEM Specifically for students enrolled in the UB Honors Program. Enrollment is limited. Topics reflect the interest and research of the faculty member teaching the course. Offered irregularly.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 116 Corequisites: None Type: LEC/REC A course in digital principles which includes an introduction to machine dependent programming. Topics covered include: fundamentals of digital logic, computer arithmetic & Boolean algebra, minimization techniques, basic components of digital circuits such as logic gates and flip-flops, information representation, design of combinational and sequential circuits, memory devices and programmable logic devices, CPU organization, arithmetic logic unit and control unit design, assembly language programming.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 116, CSE 191 Corequisites: None Type: LEC/REC Provides a rigorous analysis of the design, implementation, and properties of advanced data structures. Topics include order notation and time-space analysis and tradeoffs in a list, tree and graph algorithms, and hashing. 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 different from the language of CSE 115 and CSE 116; also covers instruction in this language.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 250 Corequisites: None Type: LEC/REC Examines the various components of programming languages so students will understand the choices that have been made by programming language designers, and how those choices affect how procedures may be expressed and how data are conceptualized. Topics generally include the nature of variables, types, expressions, control structures, subprograms, concurrency, and exceptions; syntax and semantics. Discusses different programming paradigms, such as imperative, functional, logic, procedural and object-oriented.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 341 or permission of instructor Corequisites: None Type: LEC/REC Addresses some of the fundamental challenges in the design, implementation, and validation of these real-time and embedded systems. Topics include resource management, concurrency, secure coding practices, memory management, timeline design and analysis using metrics and schedulability tests, hardware interfacing, device driver programming, memory maps and boot kernels, firmware and ROM-resident system code, communications and networking, and debugging live systems. These concepts will be reinforced through C programming assignments using the RTLinux operating system.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 50, MTH 14with a grade of C or higher Corequisites: None Type: LEC/REC Introduces methods for algorithm design, paradigms such as divide and conquer, greedy, and dynamic programming, and techniques for algorithm analysis, such as asymptotic notations and estimates, as well as time/space tradeoffs. Topics include sorting, searching, scheduling, string matching, graph algorithms, computational geometry, and more.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|