Summer 2010 Course Descriptions
CSE 101 Computers: A General Introduction
Credits:4
Semester(s):F Sp Su
Prerequisites:Basic knowledge of
arithmetic. No experience with computers needed.
Corequisites:None
Type:LEC/LAB
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.
CSE 111 Great Ideas in Computer Science
Credits:4
Semester(s):F Sp
Prerequisites:None
Corequisites:None
Type:LEC/LAB
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.
CSE 113 Introduction to Computer Programming I
Credits:4
Semester(s):F Sp Su
Prerequisites:None
Corequisites:None
Type:LEC/REC
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.
CSE 115 Introduction to Computer Science for Majors I
Credits:4
Semester(s):F Sp Su
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.
CSE 116 Introduction to Computer Science for Majors II
Credits:4
Semester(s):F Sp Su
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).
CSE 191 Discrete Structures
Credits:4
Semester(s):F Sp
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.
CSE 241 Digital Systems
Credits:4
Semester(s):F Sp
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.
CSE 250 Data Structures
Credits:4
Semester(s):F Sp
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. CSE 191 may also be used as a corequisite.
CSE 305 Introduction to Programming Languages
Credits:4
Semester(s):Sp
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.
CSE 462 Database Concepts
Credits:4
Semester(s):N/A
Prerequisites:CSE
250
Corequisites:None
Type:LEC/REC
Discusses basic concepts of modern database management systems. Topics include: data models, query languages, integrity constraints, indexing, query optimization, and transaction management. Students implement an example database application. Offered irregularly.
