|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
(3 Units) Study of programming language concepts such as binding, data structures, string handling, control structures, as embodied in various programming languages. Satisfies upper-division writing proficiency requirement. Prerequisites: Completion of the Writing Proficiency Screening Test with a passing score and CS 3100. (Spring)
-
3.00 Credits
(3 Units) Modeling, development, and implementation of database systems using storage structures, data definition languages, and data manipulation languages for the relational approach to database management. Database integrity and security problems. Historical development of database systems. Prerequisites: CS 3050 and 3100. (Lecture, 2 hours; laboratory, 2 hours) (Spring)
-
3.00 Credits
(3 Units) Study of technologies and architectures of large, complex, and robust Ecommerce Systems. Discussion of the design and implementation of major subsystems of Ecommerce Systems. Topics: Java and OO design, n-tier architectures, DB access, Java Servlets, and a significant project. Prerequisites: CS 3050 and basic Java. (Lecture, 2 hours; laboratory, 2 hours)
-
3.00 Credits
(3 Units) Lexical, syntactic, and semantic analyses and syntax directed translation of programming languages. Includes symbol table construction, error diagnostics, and code generation. Prerequisites: CS 4100. (Lecture, 2 hours; laboratory, 2 hours) (Fall)
-
3.00 Credits
(3 Units) Finite state concepts; sequential machines and state minimization; Chomsky grammar; algorithms on grammars; computability and Turing machines; non-computable functions. Prerequisites: CS 4100. (Spring)
-
3.00 Credits
(3 Units) A systematic study of the design and efficiency analysis of algorithms. Coverage of fundamental techniques of algorithms such as greedy, divide-and-conquer, dynamic programming, graph techniques, probabilistic, and parallel. An introduction to computational complexity theory: problem reduction, NP-complete problems, and other complexity classes. Prerequisites: CS 3100 and MATH 2300. (Spring)
-
3.00 Credits
(3 Units) Topics to be selected from error detecting and correcting codes, encryption and decryption techniques, RSA and knapsack codes, algebraic coding theory, Hamming distance, sphere packing and its relation to optimal codes, Hamming, Huffman and Gray codes, entropy, channel capacity and Shannon's theorem, bandwidth and the sampling theorem. Prerequisites: CS 3100 or MATH 2300 or equivalent. (Fall)
-
3.00 Credits
(3 Units) Notational systems, structures, and strategies for their choice; search strategies; parallel vs. serial processing; communication and perception; applications in psychology, medicine, and robotics. Prerequisites: CS 3100.
-
3.00 Credits
(3 Units) Computer graphics algorithms and techniques, implementing the graphics techniques used in CS 3600. Projections and transformations, color models, polygon interpolation, advanced splines, ray tracing, volume rendering, and various specialized techniques. Prerequisites: CS 3600; MATH 2530 or equivalent is recommended. (Spring)
-
3.00 Credits
(3 Units) A study of operating systems theory, design, and implementation. Topics may include kernel internals; distributed systems; experimental systems; system programming, generation, and configuration; process coordination; and protection and security. (Formerly CS 3760) Prerequisites: CS 3750. (Lecture, 2 hours; laboratory, 2 hours) (Spring)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|