|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
2.00 Credits
Prerequisite: 3113 or 5004, and Engineering 3293 or Mathematics 4753. Study of queuing network models and their applications to operating systems, communication networks, and multi-access computing systems. (Sp)
-
3.00 Credits
Prerequisite: 3113 or 5004 or permission of instructor. Comprehensive treatment of data networking principles including: layered protocol designs and their functions, tools for performance analysis, multi-access communication, routing and flow control. No student may earn credit for both 4133 and 5133. (F)
-
4.00 Credits
Prerequisite: 4133 or 5133, or equivalent. Basic concepts in networks; modeling and evaluation techniques; network analysis: delay, loss and throughput, centralized network design; distributed network design, network reliability; applications to local area wireless, wide area, multi-service networking, etc.; network management: SNMP, OSI management, distributed network management and architectures. (Sp)
-
5.00 Credits
Prerequisite: 4133 or 5133. Topics in network security including the inter-network security model, introduction to cryptography, public key encryption and hash functions, network security practice, and system security. (Sp)
-
6.00 Credits
Prerequisites: 2613 and 3113 and Mathematics 3333. Theory and practice of connecting computational systems to the physical world through sensors and actuators. No student may earn credit for both 4163 and 5163. (Sp)
-
9.00 Credits
Prerequisite: permission of instructor. May be repeated; maximum credit 12 hours. Topics vary; deals with issues related to networks and distributed systems. (F)
-
1.00 Credits
Prerequisite: 3113 or 3823 or 5004. Effective processes for software requirements specification, planning, design, documentation, development, review, defect tracking, testing, product delivery, and product evaluation. Emphasis on resource tracking and software quality. Students work in teams to develop, deliver, and evaluate software products. (F)
-
1.00 Credits
Prerequisite: 4413 and 3823 or 5813. Computational complexity theory dealing with various models of computation and a detailed analysis of P and NP hard problems. (Sp)
-
3.00 Credits
Prerequisite: mathematics 3333 and 4413 or concurrent enrollment in 4413. Linear programming: simplex method for LP problems, degeneracy and anticycling strategies, duality theory and complementary slackness conditions, revised simplex method, sensitivity analysis and simplex method for general LP problems. Network optimization: the transshipment problem, network simplex method, shortest path algorithms, the maximum flow problem, and the primal dual method. No student may earn credit for both 4433 and 5433. (F)
-
4.00 Credits
Prerequisite: 4413. Review of basic algorithm techniques: DFS, BFS, shortest paths, min-cost spanning tree, etc.; maximum flow problem: labeling and preflow-push algorithms, maximum flow in unit capacity networks and complexity analysis; min cost-flow problems: duality theory, network simplex, primal-dual and relaxation methods; matching: bipartite matching, weighted matching and optimum assignment problems; connectivity: biconnectivity and K-connectivity algorithms; heuristics and approximation algorithms; applications: network design, network reliability and Q0s routing etc. (Sp)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Cookies Policy |
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|