| 2007/2008 Tentative Course Schedule for other
Networked Systems Breadth and Concentration Courses |
Name |
Course Number |
Freq. |
Fall |
Winter |
Spring |
| Digital Image Processing |
EECS 203A |
1 |
Healey |
|
|
| Advanced System Software |
EECS 211 |
1 |
|
Doemer |
|
| Computer Architecture |
EECS 213 |
1 |
|
Lang |
|
| Design and Analysis of Algorithms |
EECS 215 |
1 |
Chou |
|
|
| Distributed Software Architecture & Design |
EECS 219 |
1 |
|
|
|
| Real-Time Computer Systems |
EECS 223 |
1 |
|
Lin |
|
Fault-Tolerant Computing |
EECS 224 |
2 |
|
Kim |
|
| Advanced Data Engineering |
EECS 225 |
2 |
|
|
|
| Random Processes |
EECS 240 |
1 |
Jafarkhani |
|
|
| Digital Communications I |
EECS 241A |
1 |
Ayanoglu |
|
|
| Digital Communications II |
EECS 241B |
1 |
|
Ayanoglu |
|
| Information Theory |
EECS 242 |
1 |
|
|
Jafar |
| Error Correcting Codes |
EECS 243 |
2 |
|
Jafarkhani |
|
| Wireless Communications |
EECS 244 |
2 |
|
|
Eltawil |
| Digital Signal Processing I |
EECS 250 |
2 |
Swindlehurst |
|
|
| Detection & Estimation Theory I |
EECS 251A |
r |
|
|
? |
| Detection & Estimation Theory II |
EECS 251B |
r |
|
|
|
| Linear Systems I |
EECS 260A |
1 |
|
|
|
| Linear Systems II |
EECS 260B |
r |
|
|
|
| Advanced Analog Integrated Circuit Design I |
EECS 270A |
1 |
Burke |
|
|
| Cryptography & Computer Security |
CS 201 |
2 |
|
|
|
| Multimedia Systems and Applications |
CS 212 |
2 |
Jain |
|
|
| Principles of Data Management |
CS 222 |
1 |
Mehotra |
|
|
| Distributed Computer Systems |
CS 230 |
1 |
|
Scherson |
|
| Introduction to Embedded and Ubiquitous Systems |
CS 244 |
1 |
Givargis |
|
|
| Computer Systems Architecture |
CS 250A |
1 |
|
Veidenbaum |
|
| Fundamentals of the Design and Analysis of Algorithms |
CS 260 |
1 |
Dillencourt |
Leuker? |
|
| Data Structures |
CS 261 |
1 |
|
Eppstein? |
|
| Graph Algorithms |
CS 265 |
2 |
|
|
|
| Data Compression |
CS 267 |
1 |
Hirshberg |
|
|
| Computer-Supported Cooperative Work |
Inf 251 |
2 |
|
|
|
| Social Analysis of Computing |
Inf 261 |
1 |
Dourish |
|
|
| Computing and Cyberspace |
Inf 267 |
r |
|
|
|
| Computer Law |
Inf 269 |
2 |
|
|
staff? |
| Transportation Systems Analysis I |
CEE 221A |
1 |
Please check the online Schedule of Classes. |
| Transportation Systems Analysis II |
CEE 221B |
r |
| Urban Transportation Networks I |
CEE 228A |
1 |
| Urban Transportation Networks II |
CEE 228B |
r |
| Instructional Design and Education Technology |
Educ 240 |
r |
| Issues in Educational Policy and Reform |
Educ 251 |
r |
| New Information and Communication Technologies for Administrators |
Educ 270 |
r |
| School Restructuring and Resource Allocation |
Educ 277B |
r |
| Instructional Technology |
Educ 331 |
|
| Instructional Technology |
Educ 351 |
|
| Instructional in Computer-Based Technology |
Educ 383 |
|
| Management Science |
MBA 201B |
1 |
| Strategic Information Systems |
MBA 275 |
2 |
| Managing Electronic Business |
MBA 277 |
2 |
| Political/Social Impacts of Computing |
PoliSci 155B |
r |
[Freq.: "1" = Offered most years, "2" = Offered approximately every 2 years, "r" = Offered rarely]
Catalog Descriptions of Networked Systems Courses:
NetSys 201 Internet (4) [cross-listed with EECS 248A & CS 232]. A broad overview of basic Internet concepts. Internet architecture and protocols, including addressing, routing, TCP/IP, quality of service, and streaming. Prerequisite: EECS 148, CS 132, or consent of instructor.
NetSys 202 Networking Laboratory (4) [cross-listed
with CS 233].
A laboratory-based introduction to basic networking concepts such
as addressing, sub-netting, bridging, ARP, and routing. Network simulation
and design. Structured around weekly readings and laboratory assignments.
Prerequisite: NetSys 201.
NetSys 210 Advanced Networks (4) [cross-listed with CS 234]. Fundamental concepts of switching, advanced medium access control methods, virtual circuits, integrated services, quality of service, performance models, simulation, measurement. Prerequisite: NetSys 201.
NetSys 220 Internet Technology (4) [cross-listed
with CS 235]. Application
layer Internet protocols, potentially including client/server, WWW,
file sharing, group communications, Internet programming. Prerequisite:
NetSys 201.
NetSys 230 Wireless and Mobile Networking (4) [cross-listed
with CS 236]. Introduction to wireless networking. The focus is on layers
2 and 3 of the OSI reference model, design, performance analysis,
and protocols. Topics covered include: an introduction to wireless
networking, digital cellular, next generation cellular, wireless
LANs, and mobile IP. Prerequisite: NetSys 201, and an introductory course
in probability or consent of instructor.
NetSys 240 Network and Distributed System Security (4) [cross-listed
with CS 203]. Overview
of modern computer and networks security: attacks and countermeasures.
Authentication, identification, data secrecy, data integrity, authorization,
access control, computer viruses, network security. Group communication
and multicast security techniques. Also covers secure e-commerce
and applications of public key methods, digital certificates, and
credentials. Prerequisites: NetSys 201.
NetSys 250 Performance Analysis of Computer Communication Networks (4)
[cross-listed with EECS 248B]. Introduction to performance analysis of computer communication networks. Error correction codes and data link layer protocols. Queuing models for communication networks. Multi-access communication. Flow and congestion controls. Routing and admission control. Mathematical modeling and optimization of network performance and design. Prerequisite: NetSys 201.
NetSys 251 Queueing Networks (4) [cross-listed
with CS 231]. Probability,
random processes and queueing theory applied to computer networks.
Poisson processes, Markov chains, queues, queueing networks, simulation.
Prerequisite: NetSys 201, and an introductory course in probability.
NetSys 253 Linear Optimization Methods (3) [cross-listed
with EECS 261A].
Formulation, solution, and analysis of linear programming and linear
network flow problems. Simplex methods, dual ascent methods, interior
point algorithms and auction algorithms. Duality theory and sensitivity
analysis. Shortest path, max-flow, assignment, and minimum cost flow
problems. Prerequisite: Mathematics 2J or consent of instructor.
NetSys 254 Nonlinear Optimization Methods (3) [cross-listed
with EECS 261B]. Formulation, solution, and analysis of nonlinear programming
problems. Unconstrained optimization, optimization over a convex
set, Lagrange multiplier theory, Lagrange multiplier algorithms,
duality theory, convex programming, dual methods, and multi-objective
optimization theory. Emphasizes mathematical analysis. Prerequisite:
Mathematics 2J or consent of instructor.
NetSys 260 Middleware for Networked and Distributed Systems (4) [cross-listed
with CS 237]. Discusses concepts, techniques, and issues in developing distributed
systems middleware that provides high performance and Quality of
Service for emerging applications. Also covers existing standards
(e.g., CORBA, DCOM, Jini, Espeak) and discuss their relative advantages
and shortcomings. Prerequisite: an undergraduate-level course in
operating systems and networks, or consent of instructor.
NetSys 261 Distributed Computer Systems (3) [cross-listed with EECS 218]. Design and analysis techniques for decentralized computer architectures, communication protocols, and hardware-software interface. Performance and reliability considerations. Design tools. Prerequisites: EECS 211 and EECS 213.
NetSys 270 Topics in Networked Systems (4). Study of Networked Systems
concepts. Prerequisite: consent of instructor. May be repeated for
credit as topics vary.
NetSys 295 Networked Systems Seminar (2). Current research in networked
systems. Includes talks by UCI faculty, visiting researchers, and
networked systems graduate students. May be repeated for credit.
|