|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
String processing; concatenation, substrings, matching; internal searching and sorting; recursion; linked lists and linear allocation (stacks, queues, deques). Elementary data structures; file structures and algorithms; searching and sorting; trees and algorithms for their manipulation; notions of algorithm complexity; memory and data management systems.
-
3.00 Credits
Boolean algebra and predicate calculus; proof methods; sets, functions, and relations; combinatorics; graph theory and algorithms; mathematical induction and recursion; probability and average case analysis of algorithms. Prerequisite: three years of high school mathematics.
-
0.00 - 6.00 Credits
Boolean algebra and predicate calculus; proof methods; sets, functions, and relations; combinatorics; finite state machines and regular expressions; trees and tree transversals; context-free grammars; graph theory and algorithms; mathematical induction and recursion; probability and average case analysis of algorithms; gates and circuits.
-
3.00 Credits
Deterministic and nondeterministic finite state automata; regular grammars and regular expressions; languages generated by regular expressions; equivalence of regular expressions and finite automata; solvable problems concerning finite automata; context-free grammars; languages generated by context-free grammars; derivation trees; simplification of context-free grammars; pushdown automata; properties of context-free languages; solvable and unsolvable problems concerning context-free languages; Turing machine model; Universal Turing machine; Halting problem; further examples of solvable and unsolvable problems about Turing machines, grammars, and sets. Prerequisite: COMP 1504C.
-
3.00 - 4.00 Credits
Basic logic functions. Synthesis of more complex combinational circuits. Electronic implementation of these functions. Simple synchronous circuits. Major components of a computer. Machine and assembly lan?guage instruction set. Implementation of the instruction set electronic circuits. Circuits needed to perform arithmetic oper?ations. Memory and I/O implementation.
-
3.00 - 4.00 Credits
Basic logic functions. Synthesis of more complex combinational circuits. Electronic implementation of these functions. Simple synchronous circuits. Major components of a computer. Machine and assembly language instruction set. Implementation of the instruction set electronic circuits. Circuits needed to perform arithmetic operations. Memory and I/O implementation.
-
3.00 Credits
Fundamentals of networking and communications: network concepts, hardware, software, and programming. Data communications; wide and local area networks; communications architecture and protocols. Network programming in C/C++ and Java. Advanced elective. Prerequisite: COMP 2545C.
-
0.00 - 6.00 Credits
No course description available.
-
4.00 Credits
Advanced data structures and algorithms: tables, AVL and red-black trees, B and B+ trees, heaps, disjoint sets. Graph algorithms: minimum spanning trees, shortest path, and maximum flow algorithms. Selected algorithms in parallel computers, string matching, and computational geometry. Lecture: 3 hours; lab: 2 hours. Prerequisites: COMP 1320C, COMP 1504C, MATH 1412.
-
3.00 Credits
Design of algorithms and applications of data structure permutations, polynomials, derivations, matrices, sorting, discrete simulation; list marking, garbage collection, analysis of algorithms; space and time efficiency; comparison of sorting techniques; discrete Fourier Transform; pattern matching; computational models, Turing machines, complex hierarchies. Advanced elective. Prerequisite: COMP 2545C.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|