|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Prerequisites: CS - 245, CS - 326, CS - 336. Overview of local and wide-area computer networks and contemporary lower-layer network protocols. Topics to be chosen from: switched networks, broadcast networks, multiplexing, layered protocol models, physical aspects of data transmission, data-link protocols, network modeling, performance issues, and current research in network design. Term paper or project required. Offered Spring 2007.
-
4.00 Credits
Prerequisites: CS - 245, CS - 326, CS - 336. Network application programming. Upper-layer protocols and their interfaces. Topics to be chosen from: TCP/IP, sockets, remote procedure calls, network management, client/server programming, internet protocols (FTP, SMTP, HTTP, and SNMP), higher-level interoperability (CORBA), performance issues, and security. Project required. Four hours lecture. Offered Spring 2006.
-
4.00 Credits
Prerequisites: CS - 245, CS - 315, CS - 326. Introduction to shared- and distributed-memory architectures. Mechanisms for parallelism: locks, barriers, semaphores, monitors, message-passing, RPC, and active messages. Programming shared- and distributed-memory systems. Introduction to parallel algorithms and parallel performance prediction and measurement. Programming languages and libraries that support parallel and distributed computing. Four hours lecture. Offered Fall 2006.
-
4.00 Credits
Prerequisite: CS - 210 or equivalent experience with Intel 80x86 Assembly Language. In-depth introduction to the protected-mode architecture of Pentium-family processors and supporting peripheral controllers. Topics include memory segmentation and paging, privilege transitions, multitasking, exception handling, debugging, performance monitoring, system management mode, virtual-8086 emulation mode, and APIC interprocessor interrupts. Four hours lecture. Offered Spring 2006.
-
4.00 Credits
Prerequisite: requires knowledge of C/C++ and acquaintance with UNIX/Linux operating systems. This course focuses on advanced hardware and software topics in systems programming, such asdevice-driver design, interprocess communication, and kernel-module programming in the Linux environment. Four hours lecture. Offered Spring 2007.
-
4.00 Credits
Prerequisites: CS - 245, CS - 315, CS - 326. Study of the design and implementation of modern operating systems. Topics chosen from: operating system structure, scheduling, protection, virtual memory, communication mechanisms, concurrency, threads, multiprocessor support, distributed systems, performance evaluation, and current operating systems research. Project required. Four hours lecture. Offered Spring 2006.
-
4.00 Credits
Prerequisites: CS - 419 or all of MATH - 202 , CS - 245 , and knowledge of a graphics API. Concepts, algorithms, and mathematics of computer graphics in two and three dimensions. Homogeneous coordinates; modeling and viewing transformations. Geometric, procedural, and lighting models. Rendering, shading, and animation methods. Four hours lecture. Offered Fall 2005.
-
4.00 Credits
Prerequisites: CS - 326 and either CS - 345 or CS - 414. Study of the design and implementation of software development languages. Topics chosen from: syntax, semantics, translation, run-time systems, advanced programming techniques, and debugging. Language families to be chosen include: functional, logic, visual, formal specification, design, pattern, database, and concurrent. Project required. Four hours lecture. Offered Spring 2006.
-
4.00 Credits
Prerequisite: CS - 245. Use of artificial intelligence techniques to solve large scale problems. Search strategies, knowledge representation, and other topics chosen from: simulated annealing, constraint satisfaction, logical and probabilistic reasoning, machine learning, expert systems, natural language processing, neural networks, genetic algorithms, and fuzzy logic. Both theoretical foundations and practical applications will be covered. Coursework includes written assignments and programming projects. Four hours lecture. Offered Fall 2005.
-
4.00 Credits
Prerequisite: CS - 245. Algorithm analysis and asymptotic running time estimates. Expected running times and amortized analysis. Design techniques, including divide and conquer, greedy, and dynamic programming. Algorithms for searching and sorting, graphs, and advanced topics. Four hours lecture. Offered Spring 2007.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|