|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Develops advanced programming skills using objects, classes, instance variables, inheritance, and polymorphism. Examines object behavior and identity, along with encapsulation of state. Explores late binding, inner classes and the problems and advantages of multiple inheritance. Prerequisite(s): CS 308;
-
3.00 Credits
Studies applications of automata theory to lexical analysis, syntax analysis, regular expressions, non-deterministic finite state automata, top-down and bottom-up parsing techniques and syntax-driven code generation. Requires implementation of a recursive descent parser of the LL (1) variety and an LR (k) parser. Prerequisite(s): CS 300 CS 308;
-
3.00 Credits
Includes processor scheduling, multiprocessor scheduling, deadlock detection and prevention, memory management, hashing, performance directed cache design, multilevel cache hierarchies, virtual memory, demand paging, thrashing and locality, disk scheduling, distributed systems, networked environments, and performance analysis based on mathematical modeling techniques. Prerequisite(s): CS 300 MT 360A;
-
3.00 Credits
Studies data organization and structure. Includes relations, graphs, trees, primitive and structured data types, arrays, records, files, fields, ordered lists, linked lists, directories, mappings, addressing schemes and complex files. Additional Prerequisite(s): or permission of Instructor required. Prerequisite(s): CS 300 CS 308;
-
3.00 Credits
Studies combinational and sequential logic circuits using standard and mixed logic. Includes minimization, multiplexers, demultiplexers, plas, counters, registers, decoders, encoders, flip-flops, finite sate machines, design of RISC machines, systolic architectures, nmos, pmos, CMOS, VLSI design using stick diagrams, channel routing algorithms, design for test, latch-up and fabrication techniques. Prerequisite(s): CS 300;
-
3.00 Credits
Emphasizes the relational model including a relational algebra, a relational calculus, functional dependencies, irreducible covers, normalization, database integrity, domain checking, closure, data protection, optimization of queries, distributed databases, client server systems and object oriented systems. Additional Prerequisite(s): or Permission of Instructor required. Prerequisite(s): CS 300 CS 308;
-
3.00 Credits
Concentrates on NP-complete problems and the algorithms that solve NP-complete problems. Involves designing and analyzing algorithms from an efficiency point of view. Additional Prerequisite(s): or equivalent prerequisite required. Prerequisite(s): MT 360B;
-
3.00 Credits
Introduces digital signal processing synthesis and analysis, the Fourier and Fast Fourier transform, and computational and programming techniques. Prerequisite(s): MT 360A;
-
3.00 Credits
Examines object-oriented techniques to ensure reliable, flexible, modular, and well-designed software. Introduces UML and the software lifecycle including project management and quality assurance. Emphasizes the implementation of design patterns such as the Bridge, Abstract Factory, and Singleton. Prerequisite(s): CS 427;
-
3.00 Credits
Covers mathematical models based on queuing theory, stochastic processes, Markov chains and mean value analysis. Discusses applications to computer systems for the purpose of optimizing performance. Includes problems and a project requiring the modeling contemporary disk technologies and system balancing techniques. Prerequisite(s): CS 300 MT 360A;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|