|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Introduction to computing theory with examples and applications. Automata and formal languages; language recognition and generation; language hierarchy; deterministic and non-deterministic automata; regular expressions; pushdown automata and context-free grammars; properties of regular and context-free languages; Turing machines; computable and noncomputable functions; decidability. Prerequisite: CSC 28, CSC 130; CSC 130 may be taken concurrently. Graded: Graded Student. Units: 3.0
-
3.00 Credits
Introduction to computer graphics and advanced topics in object-oriented (OO) programming. The OO paradigm is used throughout, utilizing computer graphics as the vehicle for solidifying basic OO concepts, studying the implementation of event-driven systems, and for developing a thorough understanding of advanced OO concepts such as inheritance and polymorphism. Topics include fundamental concepts of object-oriented programming, software design patterns, graphic devices, line and surface drawing, simple 2D and 3D representation, and use of User Interface components. Prerequisite: CSC 130, CSC 131. Graded: Graded Student. Units: 3.0
-
3.00 Credits
File systems, storage structures and access methods; data modeling; Entity-Relationship analysis and data normalization; design of applications using database technology; elements of commercial database management systems; introduction to transaction processing; introduction to SQL; information interchange and XML; database processing on the Web. Prerequisite: CSC 130. Graded: Graded Student. Units: 3.0
-
3.00 Credits
Evolution and characteristics of programming languages. Scripting, procedural, object-oriented, functional and logic paradigms. Language specification; interpreters and compilers; virtual machines; parsing techniques. Design and implementation of selected features of programming languages. Programming languages used in the development of intelligent systems, with introduction to Artificial Intelligence. Trends in programming languages. Prerequisite: CSC 35, CSC 132. Graded: Graded Student. Units: 3.0
-
4.00 Credits
Introduction to computer organization and architecture. Topics include combinational devices, sequential and synchronized circuits, memory, bus structures, input/output and interrupt structures, CPU organization, control unit design and organization, and an introduction to modern processor and memory features. Projects include construction of a complete simple system using a schematic simulator and HDL. Lecture three hours, laboratory three hours. Prerequisite: CSC 28, CSC 35, CSC 130. Graded: Graded Student. Units: 4.0
-
3.00 Credits
Overview of the fundamentals of computer networks and connections between networks, from the physical layer up through peer-to-peer communications at the application level. Lower layer characteristics including serial vs. parallel, capacity issues, high-speed connections, LAN framing and error handling. LAN vs. WAN characteristics, network architecture and the ISO network model. Internetworking components including LANs, repeaters, routers, bridges, and gateways. Internet addresses, TCP/IP, and the Domain Name System. Common Internet client/server application protocols including SMTP and FTP. Client/Server programming involving sockets. World Wide Web characteristics including CGI and HTTP protocol, Web pages, Web browsers, Web servers, and Applets. Introduction to advanced Web issues such as Web security, search engine operations, and Web database operations. Prerequisite: CSC 35, CSC 60, CSC 130. Cross Listed: CPE 138; only one may be counted for credit. Graded: Graded Student. Units: 3.0
-
3.00 Credits
Contemporary operating system organization and structure. Topics include: process and thread, concurrency, scheduling, interprocess communication and synchronization, deadlock, real and virtual memory management, device management, file systems, network and distributed operating systems, security and protection. Prerequisite: CSC 60, CSC 137; or equivalents. Graded: Graded Student. Units: 3.0
-
3.00 Credits
Algorithm design using dynamic programming, randomization and greedy methods. Analysis using recurrence relations and amortization. String and network-flow algorithms. NP-completeness, reductions, and approximation algorithms. Review of divide-and-conquer design and asymptotic notation. Prerequisite: CSC 130. Graded: Graded Student. Units: 3.0
-
3.00 Credits
Design and performance issues of computers. Instruction set architecture, computer arithmetic, processor design, survey of contemporary architectures, interfacing I/O devices, hierarchal memory design and analysis, parallelism and multiprocessing, distributed systems, techniques for enhancing performance, and an introduction to EDA tools for design and verification of computers. Design and simulation of a microcomputer in an HDL. Note: Open to students with full CSC or CPE major standing only. Prerequisite: CSC 137 or CPE 166 and CPE 185. Cross Listed: CPE 142; only one may be counted for credit. Graded: Graded Student. Units: 3.0
-
3.00 Credits
Modeling and simulation techniques; Monte Carlo methods; queuing theory; model formulation, data collection and analysis, experimental design; model verification and validation. Prerequisite: MATH 31, STAT 50, and proficiency in a programming language. Graded: Graded Student. Units: 3.0
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|