|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Credits: 4 Prerequisites: MTH 141 with a grade of C or higher required Corequisites: None Type: LEC/LAB Experience with the power of computation in exploring and solving problems in science, applied mathematics, and abstract mathematics, including such topics as the spread of diseases and forest fires, the motion of planets, and the sequencing of genes. Introduces a number of the basic tools of scientific computing and computational mathematics; programming in a high-level language such as Matlab or Maple; and the formulation, exploration and evaluation of mathematical models using simulation and visualization. Students will pursue in-depth projects involving some work in teams. Foundation for more advanced courses in mathematical modeling, numerical analysis, and computational mathematics, and for the use of computer simulations in other courses and student research projects. Offered irregularly. Cross-listed with MTH 337.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 41 or EE 378 Corequisites: None Type: LEC/REC 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.
-
3.00 Credits
Credits: 3 Prerequisites: CSE 41 or EE 378 Corequisites: CSE 380 Type: LEC Microprocessor architecture, machine language programming, microprocessor assemblers, assembly language programming, software development, memory and I/O interface, interrupts, microprocessor system design and microprocessor applications.
-
3.00 Credits
Credits: 3 Prerequisites: CSE 41 or EE 378 Corequisites: CSE 379 Type: LEC/LAB/REC 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.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 50 Corequisites: None Type: LEC/REC 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.
-
4.00 Credits
Credits: 4 Prerequisites: permission of instructor Corequisites: None Type: LEC Contents, format and required background vary from offering to offering. Intended for rapid introduction of timely material in computer science and engineering, which will not be repeated under this course number. Offered occasionally.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 41 or CSE 378 Corequisites: None Type: LEC/REC Teaches how to administer a network of computer workstations using an Operating System such as UNIX. Topics include managing user accounts, system backups, installing and configuring the operating system, setting up a computer network, shell programming, and computer security.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 41, CSE 305 Corequisites: None Type: LEC/REC 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.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 41 or permission of instructor Corequisites: None Type: LEC/REC 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.
-
4.00 Credits
Credits: 4 Prerequisites: CSE 331, MTH 14with a grade of C or higher Corequisites: None Type: LEC/REC Introduces basic elements of the design and analysis of algorithms. Topics include asymptotic notations and analysis, divide and conquer, greedy algorithms, dynamic programming, fundamental graph algorithms, NP-completeness, approximation algorithms, and network flows. For each topic, beside in-depth coverage, we discuss one or more representative problems and their algorithms. In addition to the design and analysis of algorithms, students are expected to gain substantial discrete mathematics problem solving skills essential for computer scientists and engineers.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Cookies Policy |
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|