|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
(245) Semester by arrangement. Three credits. Prerequisite: CSE 2304 or 3666; STAT 3025Q or STAT 3345Q or STAT 3375Q or MATH 3160. Introduction to computer networks and data communications. Network types, components and topology, protocol architecture, routing algorithms, and performance. Case studies including LAN and other architectures.
-
3.00 Credits
(252) (Also offered as ECE 3401.) Second semester. Three credits. Prerequisite: CSE 2300W. Design and evaluation of control and data structures for digital systems. Hardware design languages are used to describe and design alternative register transfer level architectures and control units with a micro-programming emphasis. Consideration of computer architecture, memories, digital interfacing timing and synchronization, and microprocessor systems.
-
3.00 Credits
(280) (Also offered as ECE 4401.) Second semester. Three credits. Four hours of laboratory. Prerequisite or corequisite: Either CSE 3302 or ECE 3401. Digital designing with PLA and FPGA, A/D and D/A conversion, floating point processing, ALU design, synchronous and asynchronous controllers, control path; bus master; bus slave; memory interface; I/O interface; logic circuits analysis, testing, and trouble shooting; PBC; design and manufacturing.
-
3.00 Credits
(259) Either semester. Three credits. Three class periods. Prerequisite: CSE 2100 and 2500. Design and analysis of efficient computer algorithms. Algorithm design techniques, including divide-and-conquer, depth-first search, and greedy approaches. Worst-case and average-case analysis. Models of computation. NP-complete problems.
-
3.00 Credits
(237) Either semester. Three credits. Prerequisite: CSE 2100 and 2500. Formal models of computation, such as finite state automata, pushdown automata, and Turing machines, and their corresponding elements in formal languages (regular, context-free, recursively enumerable). The complexity hierarchy. Church's thesis and undecidability. NP completeness. Theoretical basis of design and compiler construction.
-
3.00 Credits
(221) Either semester. Three credits. Prerequisite: CSE 2100; and 2500; and one of STAT 3025Q or 3375Q or MATH 3160. Introduction to the probabilistic techniques which can be used to represent random processes in computer systems. Markov processes, generating functions and their application to performance analysis. Models which can be used to describe the probabilistic performance of digital systems.
-
3.00 Credits
(220) Either semester. Three credits. Three one-hour lectures and one one-hour laboratory period. Prerequisite: CSE 2100 and 2300W. Cannot be taken after CSE 4302 or 4901. This course and CSE 2304 may not both be taken for credit. This course and CSE 243 may not both be taken for credit. Structure and operation of digital systems and computers. Machine organization, control and data paths, instruction sets, and addressing modes. Integer and floating-point arithmetic, the memory hierarchy, the I/O subsystem. Assembly language and basic program organization, interrupts, I/O, and memory allocation.
-
3.00 Credits
(277) (Also offered as BME 4800.) Either semester. Three credits. Prerequisite: BIOL 1107, CSE 2500, and either STAT 3025Q or STAT 3345Q. Fundamental mathematical models and computational techniques in bioinformatics. Exact and approximate string matching, suffix trees, pairwise and multiple sequence alignment, Markov chains and hidden Markov models. Applications to sequence analysis, gene finding, database search, phylogenetic tree reconstruction.
-
3.00 Credits
(257) (Also offered as ECE 3431.) First semester. Three credits. Prerequisite: CSE 1100C and MATH 2110Q and 2410Q and prerequisite or corequisite: MATH 2210Q. MATH 2210Q may be taken concurrently. Introduction to the numerical algorithms fundamental to scientific computation. Equation solving, function approximation, integration, difference and differential equations, special computer techniques. Emphasis is placed on efficient use of computers to optimize speed and accuracy in numerical computations. Extensive digital computer usage for algorithm verification.
-
3.00 Credits
(298) Semester and credits by arrangement. Prerequisite: Announced separately for each course. With a change in content, this course may be repeated for credit. Classroom course in special topics as announced in advance for each semester.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|