UB - University at Buffalo, The State University of New York
Computer Science and Engineering
Prospective Students
Current Students
Alumni
About CSE
A Message From The Chair
Mission
Why Choose CSE?
News and Events
Calendar
Faculty Achievements
Give to CSE
Faculty Positions
Departmental Committees
Professional and Student Organizations
Professional and Student Organizations
Videos
School of Engineering and Applied Sciences
University at Buffalo
Buffalo Niagara Region
Contact Us
Undergraduate Academics
What is Computer Science?
What is Computer Engineering?
Computer Engineering Educational Objectives and Outcomes
Undergraduate Programs
Courses
Course Enrollments
Internships
Career Moves
Professional and Student Organizations
Advisement
Information Technology Services
System Stats
Policies
Help!
Graduate Academics
Graduate Programs
Graduate Handbooks
Graduate Courses
Course Enrollments
Special Joint Programs
Internships
Ph.D. Dissertation Abstracts
Downloads and Forms
Dr. Rapaport's Information for Grad Students
Information Technology Services
System Stats
Policies
Research
Research Areas
Research Spotlight
Speaker Series
Research Centers
Research Labs and Groups
Research Resources
Research Wikis
Faculty-Authored Software
Technical Reports
Information Technology Services
System Stats
Facilities
People
All Faculty and Staff
Tenured/Tenure-Track Faculty
Teaching Faculty
Affiliated Faculty
Emeritus Faculty
Information Technology Staff
Administrative Staff
Research Staff
Summer Instructors
Teaching Assistants
Student Assistants
Students
Industrial Advisory Board
In Memoriam
Office Assignments
How to Find People at UB
Admissions
Graduate Admissions
Undergraduate Admissions
Contact Us
Undergraduate Academics
What is Computer Science?
What is Computer Engineering?
Computer Engineering Educational Objectives and Outcomes
Undergraduate Programs
Courses
Undergraduate Catalog
This Semester's Undergrad Courses
Next Semester's Undergrad Courses
Course Web Pages
Course Enrollments
Course Enrollments
Internships
Career Moves
Professional and Student Organizations
Advisement
Information Technology Services
System Stats
Policies
Help!
Apply Now
Apply to our Graduate Programs online
Apply to our Undergraduate Programs online
CSE Home
>
Undergraduate Academics
>
Courses
>
This Semester's Undergrad Courses
CSE Undergraduate Course Offerings - Summer 2013
CSE 101 Computers: A General Introduction
Introduces computers and applications software. Areas of study include computers and their societal impact; history; hardware; problem solving; buying computers and software; and application packages, such as word processing, spreadsheets, and database systems. Admitted computer science and computer engineering majors should not enroll in this course.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
7/25
Instructor:
Mr. Kevin Cleary
Dates:
Jun 24, 2013 - Aug 2, 2013
Days/Time:
TR, 1000 - 1255
Room:
Capen 201
Credits:
4
Prerequisites:
Basic knowledge of arithmetic. No experience with computers needed.
Corequisites:
None
Type:
LEC
CSE 111 Great Ideas in Computer Science
Designed to satisfy the mathematics core requirements. Students study algorithmic problem-solving techniques and gain an appreciation for some of the most interesting and significant results of computer science, as well as its intellectual and social significance. The course has both a mathematical and a laboratory component. Topics may include algorithm design, introduction to programming, structured programming, software tools, software engineering, text manipulation, numerical computation, transistors, very large-scale integrated circuits, machine architecture, language translation, operating systems, and artificial intelligence. Admitted computer science and computer engineering majors should not enroll in this course sequence.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
11/24
Instructor:
Nathan Russell
Dates:
Jun 24, 2013 - Aug 2, 2013
Days/Time:
MW, 1000 - 1255
Room:
Norton 213
Credits:
4
Prerequisites:
None
Corequisites:
None
Type:
LEC
CSE 113 Introduction to Computer Programming I
Introduction to computers and computer programming intended for nonmajors. Currently required for some School of Management majors and appropriate for others seeking a practical introduction to computer programming. Topics include the use of data types and variables, programming control constructs supported by modern languages, input/output, basic concepts of object-oriented programming (such as classes, objects, encapsulation, information hiding, and code reuse), as well as graphical user interfaces. No previous computer experience assumed. Not suitable for intended computer science or computer engineering majors except those who have absolutely no experience using a computer. Admitted computer science and computer engineering students should not take this course.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
8/40
Instructor:
Aditya Wagh
Dates:
Jun 24, 2013 - Aug 2, 2013
Days/Time:
MW, 200P - 455P
Room:
Bell 340
Credits:
4
Prerequisites:
None
Corequisites:
None
Type:
LEC
CSE 115 Introduction to Computer Science for Majors I
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.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
28/35
Instructor:
James Scandale
Dates:
Jun 24, 2013 - Aug 2, 2013
Days/Time:
TR, 1000 - 1255
Room:
Bell 340
Credits:
4
Prerequisites:
No previous programming experience required
Corequisites:
MTH 141 or equivalent
Type:
LEC
CSE 116 Introduction to Computer Science for Majors II
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).
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
40/40
Instructor:
James Scandale
Dates:
Jun 24, 2013 - Aug 2, 2013
Days/Time:
MW, 1000 - 1255
Room:
Bell 340
Credits:
4
Prerequisites:
CSE 115 or permission of instructor
Corequisites:
None
Type:
LEC
CSE 191 Discrete Structures
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.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
17/35
Instructor:
Mahmoud Abo Khamis
Dates:
May 20, 2013 - Aug 9, 2013
Days/Time:
TR, 200P - 405P
Room:
Bell 337
Credits:
4
Prerequisites:
None
Corequisites:
None
Type:
LEC
CSE 241 Digital Systems
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.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
13/40
Instructor:
Dr. Ramalingam Sridhar
Dates:
May 20, 2013 - Jun 28, 2013
Days/Time:
MW, 200P - 455P
Room:
Norton 213
Credits:
4
Prerequisites:
CSE 191
Corequisites:
None
Type:
LEC
CSE 250 Data Structures
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. CSE 191 may also be used as a corequisite.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
24/25
Instructor:
Tamal Tanu Biswas
Dates:
May 20, 2013 - Aug 9, 2013
Days/Time:
TR, 1030 - 1235
Room:
Baldy 21
Credits:
4
Prerequisites:
CSE 116, CSE 191
Corequisites:
None
Type:
LEC
CSE 305 Introduction to Programming Languages
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.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
8/24
Instructor:
Zhi Yang
Dates:
May 20, 2013 - Aug 9, 2013
Days/Time:
TR, 1000 - 1205
Room:
R25 Needs Assignment
Credits:
4
Prerequisites:
CSE 250
Corequisites:
None
Type:
LEC
CSE 331 Introduction to Algorithm Analysis and Design
Introduces methods for algorithm design, paradigms such as divide and conquer, greedy, and dynamic programming, and techniques for algorithm analysis, such as asymptotic notations, estimates and recursions. Topics include sorting, searching, scheduling, string matching, graph algorithms, computational geometry, and more.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
9/40
Instructor:
Jesse Hartloff
Dates:
May 20, 2013 - Aug 9, 2013
Days/Time:
TR, 200P - 405P
Room:
Norton 214
Credits:
4
Prerequisites:
CSE 191, CSE 250, MTH 142
Corequisites:
None
Type:
LEC
CSE 341 Computer Organization
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.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
7/40
Instructor:
Dr. Ramalingam Sridhar
Dates:
May 20, 2013 - Jun 28, 2013
Days/Time:
MW, 1000 - 1255
Room:
Knox 14
Credits:
4
Prerequisites:
CSE 241 or EE 378
Corequisites:
None
Type:
LEC
CSE 379 Introduction to Microprocessors and Microcomputers
Microprocessor architecture, machine language programming, microprocessor assemblers, assembly language programming, software development, memory and I/O interface, interrupts, microprocessor system design and microprocessor applications.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
8/20
Instructor:
Dr. Kris Schindler
Dates:
May 20, 2013 - Jun 28, 2013
Days/Time:
MW, 200P - 455P
Room:
Capen 260
Credits:
3
Prerequisites:
CSE 241 or EE 378
Corequisites:
CSE 380
Type:
LEC
CSE 380 Introduction to Microprocessors and Microcomputers Lab
A microprocessor system and its application in embedded devices. This course is the laboratory component to CSE 379. Topics include: microprocessor architecture; memory organization; assembly language programming; microprocessor assemblers; software development; use of microprocessor boards; memory and I/O interfaces; programming peripherals; interrupt system programming; microprocessor system design and applications.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
8/25
Instructor:
Dr. Kris Schindler
Dates:
May 20, 2013 - Jun 28, 2013
Days/Time:
MW, 500P - 555P
Room:
Bell 138
Credits:
3
Prerequisites:
CSE 241 or EE 378
Corequisites:
CSE 379
Type:
LEC
CSE 396 Introduction to the Theory of Computation
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.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
14/25
Instructor:
Andrew Hughes
Dates:
May 20, 2013 - Aug 9, 2013
Days/Time:
MW, 200P - 405P
Room:
Bell 138
Credits:
4
Prerequisites:
CSE 191, CSE 250
Corequisites:
None
Type:
LEC
CSE 422 Operating Systems Internals
Uses an operating system (such as UNIX) as an example to teach the internal workings of operating systems. The material presented is more practical than the other operating systems related classes. The laboratory component of this course provides programming projects involving modifications to an operating system kernel (such as UNIX) on computers dedicated to use for this course. Topics covered include building the operating system kernel, the system call interface, process management, kernel services provided for processes, the I/O system, the internal workings of the file system, device drivers, and the kernel support of Interprocess Communications.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
0/20
Instructor:
Mr. Kenneth Smith
Dates:
May 20, 2013 - Aug 9, 2013
Days/Time:
MW, 1000 - 1205
Room:
Clemen 04
Credits:
4
Prerequisites:
CSE 421 or permission of instructor
Corequisites:
None
Type:
LEC
CSE 462 Database Concepts
Discusses basic concepts of modern database management systems. Topics include: data models, query languages, database design, integrity constraints, indexing, query evaluation, and transaction management. Students implement small projects using modern DBMS.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
4/40
Instructor:
Shounak Gore
Dates:
Jun 24, 2013 - Aug 2, 2013
Days/Time:
TR, 1100 - 155P
Room:
Capen 10
Credits:
4
Prerequisites:
CSE 250
Corequisites:
None
Type:
LEC
CSE 490 Computer Architecture
Examines system architecture with 32- and 64-bit microprocessors. Topics include the design of high-performance computer systems, such as workstations and multiprocessor systems using recent advanced microprocessor. Considers the internal architecture of recent microprocessors, followed by vector processing, memory hierarchy design, and communication subsystems for I/O and interprocessor communication.
Course Page:
Undergraduate Catalog Page
Status:
Open
Enrolled:
5/5
Instructor:
Dr. Kris Schindler
Dates:
May 20, 2013 - Jun 28, 2013
Days/Time:
MW, 1000 - 1255
Room:
Norton 214
Credits:
4
Prerequisites:
CSE 379 or CSE 341
Corequisites:
None
Type:
LEC
Undergraduate Advisement Questions?
Email
cse-ug-advise
and we'll try to respond to you on the same day.
Visit us in person! Find today's drop-in advisement hours in the
CSE Calendar
.