|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Introduction to standard integrated circuits: gates, flip-flops, shift registers, counters, latches. Construction and debugging techniques. Design of digital systems using LSI and MSI components. Practical use of circuits in a laboratory environment, including implementation of small digital systems such as arithmetic modules, displays, and timers. Prerequisites: CS 151 or concurrent enrollment; satisfactory completion of the lower-division writing requirement. Formerly ICS 155A.
-
4.00 Credits
Design of basic computer components and small complete digital systems. Emphasis on practical use of Computer- Aided Design (CAD) tools, modeling of computer systems, and design practices in a laboratory environment. Prerequisite or corequisite: CS 151. Formerly ICS 155B.
-
4.00 Credits
Time and space complexity of algorithms. Models of computation, techniques for efficient algorithm design, effect of data structure choice on efficiency of an algorithm. Fast algorithms for problems such as sorting, set manipulation, graph problems, matrix multiplication, Fourier transforms, and pattern matching. NP-complete problems. Prerequisites: ICS 23/CSE23 and ICS 51 or CSE31/EECS31 with grades of C or better; ICS 6D/Mathematics 6D; ICS 6B/Mathematics 6B; Mathematics 6G or 3A; Mathematics 2B; satisfactory completion of the lower division writing requirement. Same as CSE161.
-
4.00 Credits
Formal aspects of describing and recognizing languages by grammars and automata. Parsing regular and context-free languages. Ambiguity, nondeterminism. Elements of computability; Turing machines, random access machines, undecidable problems, NPcompleteness. Prerequisites: ICS 23/CSE23 and ICS 51 with grades of C or better; Mathematics 2A-B and Statistics 67/Mathematics 67; ICS 6D/ Mathematics 6D; ICS 6B/Mathematics 6B; Mathematics 6G or 3A. Same as Linguistics 102. Formerly ICS 162.
-
4.00 Credits
Algorithms for solving fundamental problems in graph theory. Graph representations, graph traversal, network flow, connectivity, graph layout, matching problems. Prerequisite: CS 161/CSE161. Formerly ICS 163.
-
4.00 Credits
Algorithms and data structures for geometric computation and graphics programming. Fundamental problems of computational geometry such as convex hulls, Voronoi diagrams, Delaunay triangulations, polygon partitioning, arrangements, geometric searching, hidden surface elimination, motion planning. Prerequisite: CS 161/CSE161 or equivalent. Formerly ICS 164.
-
4.00 Credits
Design, implementation, execution, and analysis of algorithms for problems such as sorting, searching, data compression, and data encryption. Time-space-structure trade-offs. Prerequisite: CS 161/CSE161. Formerly ICS 165.
-
4.00 Credits
An introduction to the essential aspects of applied cryptography, as it is used in practice. Topics include classical cryptography, block ciphers, stream ciphers, public-key cryptography, digital signatures, one-way hash functions, basic cryptographic protocols, and digital certificates and credentials. Prerequisites: ICS 6D/ Mathematics 6D; ICS 22/CSE22 or Informatics 42; CS 161/CSE161 and/or upper-division standing.
-
4.00 Credits
Network modeling techniques and related algorithms for solving large-scale integer programming problems. Exact methods and heuristic techniques. Applications include computer and communications networks and transportation and logistics networks. Prerequisite: upper-division standing or consent of instructor.
-
4.00 Credits
A broad introduction to optimization. Unconstrained and constrained optimization. Equality and inequality constraints. Linear and integer programming. Stochastic dynamic programming. Prerequisites: Mathematics 2D, Mathematics 3A or 6G, Mathematics 67/Statistics 67. Concurrent with CS 268.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|