|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
This is a lab course that provides practical experience in designing, implementing, testing, documenting, and supporting a medium-sized software application. Topics covered include application and user interface specification, module and API design, code re-use, code review, software maintenance and support, unit and integration testing, and debugging procedures. Students gain experience in the application of common algorithms, design patterns, and data structures to novel problems. Students have a choice of working in Java or C++, and work both individually and in groups. Specific application areas vary by semester. Prerequisites: sophomore standing and CSE 132. CSE 241 is recommended.
-
1.00 Credits
This course provides an overview of practical implementation skills. Topics include compilation and linking, memory management, pointers and references, using code libraries, testing and debugging. Prerequisites: CSE 132.
-
3.00 Credits
Introduces elements of logic and discrete mathematics that allow reasoning about computational structures and processes. Generally, the areas of discrete structures, proof techniques, and computational models are covered. Topics typically include propositional and predicate logic; sets, relations, functions, and graphs; proof by contradiction, induction, and reduction; and finite state machines and regular languages. Prerequisite: CSE 131 or other introductory programming background.
-
3.00 Credits
Study of fundamental algorithms, data structures, and their effective use in a variety of applications. Emphasizes importance of data structure choice and implementation for obtaining the most efficient algorithm for solving a given problem. A key component of this course is worst-case asymptotic analysis, which provides a quick and simple method for determining the scalability and effectiveness of an algorithm. Other topics covered generally include: divide-and-conquer algorithms, sorting algorithms, decision tree lower-bound technique, hashing, binary heaps, skip lists, B-trees, basic graph algorithms. Prerequisites: CSE 131, CSE 240 (or some basic discrete mathematics background) is strongly recommended.
-
3.00 Credits
Introduction to design methods for digital logic and fundamentals of computer architecture. Boolean algebra and logic minimization techniques; sources of delay in combinational circuits and effect on circuit performance; survey of common combinational circuit components; sequential circuit design and analysis; timing analysis of sequential circuits; use of computer-aided design tools for digital logic design (schematic capture, hardware description languages, simulation); design of simple processors and memory subsystems; program execution in simple processors; basic techniques for enhancing processor performance; configurable logic devices. Prerequisites: CSE 131 or comparable programming experience.
-
3.00 Credits
Same as CSE 220S
-
3.00 Credits
This course introduces aspects of the rapid prototype development and creative thinking. Through this course, students acquire necessary skills to develop modern applications for the new world of Web 2.0 and beyond. The concepts covered include: LAMP (Linux, Apache, MySQL, PHP), AJAX (Asynchronous Javascript and XML), XML-RPC (remote procedure calls), script languages for rapid prototyping (Perl, Python), CMSs (Content Management Systems), current web APIs, and the new development tools and libraries. The course is in an interactive studio format, i.e., after a formal presentation of a topic, students develop a related project under the supervision of the instructor. Prerequisite: CSE 131 or equivalent.
-
3.00 Credits
Intensive focus on practical aspects of designing, implementing and debugging object-oriented software. Topics covered include developing, documenting, and testing representative applications using object-oriented and generic frameworks and C++. Design and implementation based on frameworks are central themes to enable the construction of reusable, extensible, efficient, and maintainable software. Prerequisites: CSE 132 and 241.
-
3.00 Credits
Introduction to the hardware and software foundations of computer processing systems. Examines the process whereby computer systems manage, interpret, and execute applications. Covers fundamental algorithms for numerical computation, memory organization and access, storage allocation, and the sequencing and control of peripheral devices. Weekly laboratories, exercises, and a final laboratory project. Prerequisite: CSE 131.
-
3.00 Credits
Study of interaction and design philosophy of hardware and software for digital computer systems. Processor architecture, instruction set architecture, assembly language, memory hierarchy design, I/O considerations. Comparison of computer architectures. Prerequisite: CSE 260M.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|