Thesis (M.S.) and Non-thesis (M.S., M.SW.Engr.)
300 Nedderman Hall, 817-272-3605
341 Nedderman Hall, 817-272-3785
Das, Elmasri, Kung,
Peterson, Shirazi, Walker
Fegaras, Holder, Kamangar, Karaata, Kumar, Weems, Youn
Aslandogan, Huber, Oh, Reyes, Yerraballi, Zaruba
The purpose of the graduate programs in Computer Science and Computer Science and Engineering is to facilitate the student's continued professional and scholarly development. The Master of Science (M.S.) programs are designed to extend the student's knowledge and emphasize a particular area of concentration. The Master of Software Engineering (M.SW.Engr.) program is designed to provide the student with the opportunity for professional development in the software engineering field. A Telecommunications Engineering Certificate is available for the M.S. degree. The M.S. degree is available in traditional lecture and at distance through the UT TeleCampus (www.telecampus.utsystem.edu). The Doctor of Philosophy (Ph.D.) programs are designed to prepare the student to conduct research and development in an area of concentration.
Typical areas of concentration include
The CSE graduate admission committee bases its decision for graduate admission on the following criteria (in no specific order):
The above criteria are used as follows in relevance to the three possible admission decisions, i.e., Unconditional Status; Probationary Status; and Denied.
The basis for granting a Fellowship to a student will be as follows:
To fulfill its responsibility to graduate highly qualified professionals, the Department has established certain requirements that must be met by students continuing in the graduate programs. In addition to the requirements of the Graduate School listed elsewhere in the catalog, the Computer Science and Engineering Department has established additional requirements detailed in its Guide to Graduate Programs.
The Master of Science in Computer Science degree program is designed to develop the scholarship and research skills of the student. Thirty-one credit hours, which include one orientation seminar credit and six thesis credits, are required.
The Master of Science in Computer Science and Engineering, which is intended for students with a baccalaureate degree in engineering, requires 31 credit hours of which one is orientation seminar and six are thesis credits, and is designed to develop the scholarship and research skills of the student.
The Master of Science in Computer Science non-thesis options provide professional development in computer science. The structured option requires 37 credit hours of which one is orientation seminar.
The Master of Science in Computer Science and Engineering non-thesis options are intended for students with an engineering baccalaureate degree. The structured option requires 37 credit hours of which one is orientation seminar.
The Master of Engineering in Computer Science and Engineering provides professional development in computer science and engineering to the student with a baccalaureate degree in engineering. The degree requires 37 credit hours of which one is orientation seminar.
The Computer Science/Electrical Engineering (CS/EE) Online degree program is a collaboration between The University of Texas at Arlington and The University of Texas at Dallas for the purpose of providing telecommunications professionals an opportunity to get a Master's degree. The CS/EE Online Program is comprised of three degree options. Based on past experience and current career goals, a student can select which of the three will best serve their educational needs. Choices include master's degrees in Electrical Engineering, Computer Science or Computer Science and Engineering. To emphasize the multidisciplinary nature of this program, students in one department will be required to take at least two major courses from the other department. All three degrees are conferred with the Graduate Telecommunications Engineering Certificate.
Students with an engineering undergraduate degree are eligible to apply for the Master of Science in Computer Science and Engineering program. Both engineering and non-engineering students have the option of receiving a Master of Science in Computer Science degree from UT Arlington.
The CS/EE Online program is offered predominantly using the Internet, but may include supplemental materials such as video/audio tapes and CD-ROM. Students will not be required to attend the campuses at any time. However, some courses require proctored examinations which can be arranged at locations near the student. To learn more about this program, please visit http://www.telecampus.utsystem.edu/programs/Csee/csee.html
4 Core courses:
CSE 5311 Design and Analysis of Algorithms (UTA)
EE 5361 Fundamentals of Telecommunication Systems (UTA)
CS 6386 Telecommunications Software Design (UTD)
Either of these (the other may be used as an elective):
CSE 5350 Computer Architecture II (UTA)
CS 6378 Advanced Operating Systems (UTD)
1 Breadth Course chosen from below with remaining available as electives:
CSE 5324 Software Engineering Analysis, Design & Testing (UTA)
CSE 5330 Database I (UTA)
CS 6352 Performance of Computer Systems and Networks (UTD)
CS 6390 Advanced Computer Networks (UTD)
7 courses, at least two from online EE options. Refer to website for current listing
Degree Requirements: 36 hours
Note: A concentration (3 of the 12 courses) should be designed to fit a student's goals. Topics such as signals, wireless, mobile, network-based computing, or telecommunications software engineering would be typical.
The Ph.D. in Computer Science continues the development of the student's research capability. Coursework selection in each student's program is designed to support the dissertation area selected by the student.
A minimum of two semesters of full-time study is required during the dissertation phase. There is no foreign language requirement.
The Ph.D. in Computer Science and Engineering is available to students with a prior degree in engineering. It contains essentially the same requirements as the Ph.D. (Computer Science) degree except that it permits interdisciplinary research between Computer Science and one or more of the various engineering disciplines.
The grade of R (research in progress) is a permanent grade; it cannot be changed by completing course requirements in a later semester. To receive credit for an R-graded course, the student must continue to enroll in the course until a passing grade is received.
An incomplete grade (the grade of X) cannot be given in a course that is graded R, nor can the grade of R be given in a course that is graded X. To receive credit for a course in which the student earned an X, the student must complete the course requirements. A grade of X cannot be changed by enrolling again in the course in which an X was earned. At the discretion of the instructor, a final grade can be assigned through a change of grade form.
Three-hour thesis courses and three- and six-hour dissertation courses are graded R/F/W only (except social work thesis courses). The grade of P (required for degree completion for students enrolled in thesis or dissertation programs) can be earned only in six- or nine-hour thesis courses and nine-hour dissertation courses. In the course listings below, R-graded courses are designated either"Graded P/F/R" or "Graded R." Occasionally, the valid grades for a course change. Students should consult the appropriate Graduate Advisor or instructor for valid grade information for particular courses. (See also the sections titled "R" Grade, Credit for Research, Internship, Thesis or Dissertation Courses and Incomplete Grade in this catalog.)
Course fee information is published in the online Student Schedule of Classes at www.uta.edu/schedule. Please refer to this Web site for a detailed listing of specific course fees.
5194. ORIENTATION SEMINAR (1-0). Presentation of computer science research by CSE faculty, students, and invited speakers. Preparation of program of work. Prerequisite: Unconditional admission status in CSE Department or consent of CSE Graduate Advisor. Graded P/F/R.
5306. OPERATING SYSTEMS II (3-0). Hardware and software issues in modern operating systems, distributed and networked operating systems, and real time operating systems. Topics may include multithreading, distributed systems, device drivers, object oriented operating systems, advanced file systems, parallel virtual machines, and load balancing. Examples from current popular modern systems and research operating systems will be analyzed. Prerequisite: CSE 3320 or consent of instructor.
5307. PROGRAMMING LANGUAGE CONCEPTS (3-0). Study and evaluation of concepts in programming language for modern computer systems. Programming projects are selected from string-based, symbolic, algorithmic, and object-oriented languages. Prerequisite: CSE 3302 or consent of instructor.
5311. DESIGN AND ANALYSIS OF ALGORITHMS (3-0). Techniques for analyzing upper bounds for algorithms and lower bounds for problems. Problem areas include: sorting, data structures, graphs, dynamic programming, combinatorial algorithms, introduction to parallel models. Prerequisite: CSE 2320 and 3315, or consent of instructor.
5314. COMPUTATIONAL COMPLEXITY (3-0). Sequential and parallel complexity classes (e.g., NP-complete and P-complete) and representative problems in languages, logic and graphs. Reduction techniques. Approximate solutions. Complexity hierarchies. Prerequisite: CSE 2320 and 3315, or consent of instructor.
5315. NUMERICAL METHODS (3-0). Selected topics from the theory and practice of using automatic digital computers for approximating arithmetic operations, approximating functions, solving systems of linear and non-linear equations, and solving ordinary and partial differential equations. Prerequisite: CSE 2312 and linear algebra, or consent of instructor.
5316. MODELING, ANALYSIS, AND SIMULATION OF COMPUTER SYSTEMS (3-0). Mathematical formalism and techniques used for computer system modeling and analysis. Reviews probability, transform theory, coding theory, and Petri nets. Topics may include knowledge based modeling, validation procedures, various simulation techniques for stochastic process and real-time distributed systems. Prerequisite: CSE 2320, or consent of instructor.
5317. DESIGN AND CONSTRUCTION OF COMPILERS (3-0). Review of programming language structures, translation, and storage allocation. Introduction to context-free grammars and their description. Design and construction of compilers including lexical analysis, parsing and code generation techniques. Error analysis and simple code optimizations will be introduced. Prerequisite: CSE 3315 and 3302, or consent of instructor.
5318. APPLIED GRAPH THEORY AND COMBINATORICS
(3-0). Connected and disconnected graphs; trees; graph
planarity; Hamiltonian circuits and Euler tours; coloring; flow and
optimization algorithms, fundamentals of combinatorics; generating functions and recurrence relations; inclusion-exclusion principle; applications in telecommunications; mobile computing, parallel processing and multiprocessor architectures. Prerequisites: CSE 2320 and 3315 or consent of instructor.
5321. SOFTWARE TESTING (3-0). Study of software quality assurance, software testing process, methods, techniques and tools. Topics include formal review techniques, black box testing, white box testing, integration testing, acceptance testing, regression testing, performance testing, stress testings, and testing of object-oriented software. Prerequisite: CSE 5324.
5322. SOFTWARE DESIGN PATTERNS (3-0). Study and application of object-oriented software design patterns to software development and maintenance in the object-oriented paradigm. Prerequisite: CSE 5324.
5323. SOFTWARE ENGINEERING PROCESSES (3-0). Introduces software lifecycle models, process disciplines, project management concepts, and applies them by mastering the Personal Software Process (PSP). Prerequisites: CSE 3310 or CSE 5324, and IE 3301 or MATH 3313.
5324. SOFTWARE ENGINEERING: ANALYSIS, DESIGN, AND TESTING (3-0). Motivations, principles, and goals of software engineering; technical aspects of software projects, including: review of structured analysis and structured design, emphasis on object-oriented methods of requirements analysis and specification, design, and implementation; software testing concepts; team project. Prerequisite: CSE 2320 and 3315 (or concurrent enrollment), or consent of instructor.
5325. SOFTWARE ENGINEERING: MANAGEMENT, MAINTENANCE, AND QUALITY ASSURANCE (3-0). Issues and principles for software management; managerial and support aspects of software projects, including: processes, estimation techniques, planning and scheduling, risk analysis, metrics, and quality assurance. Other topics include: configuration management, verification and validation, and maintenance; team project. Prerequisite: CSE 5324, or consent of instructor.
5326. REAL-TIME SOFTWARE DESIGN (3-0). Specification, design, and analysis of real-time systems including real-time logics and decidability of real-time conditions; real-time scheduling approaches, and schedulability analysis, system requirement specifications and languages; procedural and object-oriented methods; specialized analysis techniques for distributed and for control applications; team project. Prerequisite: CSE 5324, or consent of instructor.
5327. TELECOMMUNICATIONS SOFTWARE DEVELOPMENT (3-0). General understanding and classification of telecommunications systems and applications. Issues relating to the analysis, design, implementation, and testing of telecommunications software. Prerequisites: CSE 5324 and CSE 5344.
5328. SOFTWARE ENGINEERING TEAM PROJECT I (1-2). Apply the knowledge and skills gained in other software engineering courses to synthesize a solution to a significant and realistic problem. Participate in team project activities, including: proposal writing, problem analysis, software requirements specification, software project planning, and preliminary software design. Prerequisite: CSE 5325 (or concurrent enrollment). Open to Master of Software Engineering candidates only.
5329. SOFTWARE ENGINEERING TEAM PROJECT II (1-2). Continuation of CSE 5328. Team project activities include: detailed software design, implementation, software quality assurance, software testing, integration, and demonstration. Prerequisite: CSE 5328. Open to Master of Software Engineering candidates only.
5330. DATABASE SYSTEMS I (3-0). Database system architecture; file structures for databases, including indexing, hashing, and B+-trees; the relational model, algebra, and calculus; the SQL database language; Entity-Relationship data modeling; and extended E-R modeling; functional dependencies, normalization, and database design. Prerequisite: CSE 2320.
5331. DATABASE SYSTEMS II (3-0). Review of the relational and the extended Entity-Relationship models; object-oriented and object-relational databases, database system implementation techniques, including transaction concepts, concurrency control, recovery, and query processing and optimization; database security; introduction to distributed databases and advanced database concepts. Prerequisite: CSE 3330/CSE 5330, or consent of instructor.
5343. REAL-TIME DATA ACQUISITION AND CONTROL SYSTEMS (2-3). Advanced course in design of microcomputer-based systems. Emphasis is on the application of state-of-the-art microprocessors, microcomputers, and other LSI and VLSI components to real-time, interactive, and/or embedded systems. Prerequisite: CSE 5442 or consent of instructor.
5344. COMPUTER NETWORKS (3-0). Study of computer network architectures, protocols, and interfaces. The OSI reference model and the Internet architecture will be discussed. Networking techniques such as multiple access, packet/cell switching, and internetworking will be studied. Discussion will also include end-to-end protocols, congestion control, high-speed networking, and network management. Emphasis will be on Internet and ATM. Prerequisite: CSE 3320, or consent of instructor.
5346. NETWORKS II (3-0). This course provides an in depth study and comparison of the two primary networking paradigms, Internet/broadcast and switched, using two technologies, IPv6 and ATM, as representative examples. The course is implementation-oriented, focusing on issues such as routing, broadcast, multicast, mobility, network configuration, and quality of service. Prerequisite: CSE 5344.
5347. TELECOMMUNICATION NETWORKS DESIGN (3-0). Design and analysis of telecommunication systems and networks, fundamental graph algorithms, basic concepts of distributed algorithms, centralized and distributed network topology design, routing and multicasting, capacity assignment, network reliability, network performance, modeling and simulation, wireless mobile networks. Prerequisites: CSE 5311, CSE 4344/5344, or consent of instructor.
5348. MULTIMEDIA SYSTEMS (3-0). Representations and techniques for processing, communicating, and compression of text, audio, graphics, and video in real time. Project integrating these topics. Prerequisite: CSE 3320.
5350. COMPUTER ARCHITECTURE II (3-0). A study of advanced uniprocessor and basic multiprocessor systems. Topics may include memory management systems, pipelined processors, array and vector processors, and introduction to architecture of multiprocessor systems. Prerequisite: CSE 3322, or consent of instructor.
5351. PARALLEL PROCESSING (3-0). Covers the theory
and practice of parallel processing. Theoretical topics include:
abstract models and algorithms for shared memory computation
(PRAM); algorithms for various topologies such as meshes and
hypercubes; efficiency and speedup analysis. Problem areas include data
structures, numerical methods, graphs, combinatorics. Practical topics
include synchronization, routing, scheduling, parallelizing serial
computations, programming languages. Includes programming exercises using
or more concurrent programming languages, on one or more parallel computers. Prerequisite: CSE 3320, or consent of instructor.
5353. DISTRIBUTED COMPUTING (3-0). Programming languages, support components, coordination models, and fundamental algorithms for distributed and clustered systems. Prerequisite: CSE 5306.
5355. COMPUTER SYSTEM PERFORMANCE EVALUATION (3-0). Queueing network models and simulation for studying the performance of overall computer systems and each subsystem such as CPU, memory, I/O, and interconnection. Topics also include capacity planning, hardware selection and upgrade, and tuning. Prerequisite: CSE 3322, or consent of instructor.
5360. ARTIFICIAL INTELLIGENCE I (3-0). Introduction to the methods, concepts and applications of artificial intelligence, including knowledge representation, search, theorem proving, planning, natural language processing, and study of AI programming languages. Prerequisite: CSE 2320 and 3315, or consent of instructor.
5361. ARTIFICIAL INTELLIGENCE II (3-0). Continuation of artificial intelligence methods and techniques, including uncertainty reasoning, machine learning, perception, and advanced topics in knowledge representation, search and planning. Emphasis on design and implementation of AI solutions. Prerequisite: CSE 5360, or consent of instructor.
5364. ROBOTICS (2-3). An introduction to robotics and the design and programming of autonomous robot systems. Topics include basic kinematics, dynamics, and control, as well as sensors, knowledge representation, and programming techniques. Coursework includes individual and group projects involving the building and programming of simulated and real robots. Prerequisite: CSE 2320 and CSE 3442.
5365. COMPUTER GRAPHICS (3-0). Input/output devices and programming techniques suitable for the visual representation of data and images. Prerequisite: CSE 1320, analytic geometry and linear algebra, or consent of instructor.
5366. DIGITAL SIGNAL PROCESSING (3-0). Introduction to principles and applications of digital signal processing. Topics include: analysis of signals and systems, Fourier and Z transforms, digital filter design techniques (FIR and IIR), autoregressive (AR) and autoregressive moving average (ARMA) modeling. Applications to science and engineering include: financial predictions and processing of digital music. Laboratory work includes some programming and use of high quality library routines and packages such as Mathematica, Matlab. Prerequisite: CSE 1320 and consent of Graduate Advisor.
5368. NEURAL NETWORKS (3-0). Theoretical principles of neurocomputing. Learning algorithms, information capacity, and mapping properties of feedforward and recurrent networks. Different neural network models will be implemented and their practical applications discussed. Prerequisite: CSE 1320 and calculus II, or consent of instructor.
5191, 5291, 5391. INDIVIDUAL STUDY IN COMPUTER SCIENCE. Topics dealing with special problems in Computer Science on an individual instruction basis. May be repeated for credit. Prerequisite: consent of instructor. Graded P/F/R.
5392. TOPICS IN COMPUTER SCIENCE (3-0). May be repeated for credit when the topics vary. Prerequisite: graduate standing and consent of instructor.
5393. DIRECTED STUDY IN COMPUTER SCIENCE. Topics dealing with special problems in Computer Science on an individual instruction basis. May be repeated for credit. Intended for use on thesis degree plans. Prerequisite: departmental approval of proposal submitted one month prior to beginning of semester.
5397. MASTER'S THESIS I. Preliminary research effort for the master's thesis, including problem definition and literature search, along with identification of resources, milestones, examining committee members, and external publication venue. Prerequisite: consent of instructor. Graded P/F.
5398. MASTER'S THESIS II. Completion of tasks in support of the thesis defined in Master's Thesis I, including oral defense of the written documents. Prerequisite: CSE 5397. Graded P/F/R.
5442. EMBEDDED COMPUTER SYSTEMS (3-3). Design of micro computer-based systems; microcomputer programming, component and system architectures, memory interfacing, parallel and serial I/O interfacing, A/D and D/A conversion, and typical applications. Prerequisite: CSE 3322, or consent of instructor.
6306. ADVANCED TOPICS IN OPERATING SYSTEMS (3-0). May be repeated for credit when topics change. Prerequisite: CSE 5306, or consent of instructor.
6314. ADVANCED TOPICS IN THEORETICAL COMPUTER SCIENCE (3-0). May be repeated for credit when topics change. Prerequisite: CSE 5314 or consent of instructor.
6323. FORMAL METHODS IN SOFTWARE ENGINEERING (3-0). Methods for modeling and reasoning that play a fundamental role in computer science. Topics include: advanced mathematical logic, formal proof methods, set theory, and formal specification languages and their applications to software engineering. Prerequisite: CSE 5324, or consent of instructor.
6324. ADVANCED TOPICS IN SOFTWARE ENGINEERING (3-0). May be repeated for credit when topics change. Prerequisite: CSE 5325 (or concurrent enrollment) and consent of instructor.
6330. EXTENDED DATABASE MODELS AND SYSTEMS (3-0). Advanced concepts and models, including active, deductive, spatial, temporal, multimedia, distributed databases, and multidatabases. New database applications, including data mining, data warehousing, document, and web databases. Prerequisite: CSE 4330/5331 or consent of instructor.
6331. ADVANCED TOPICS IN DATABASE SYSTEMS (3-0). May be repeated for credit when topics change. Prerequisite: CSE 5332 and consent of instructor.
6344. ADVANCED TOPICS IN COMMUNICATION NETWORKS (3-0). May be repeated for credit when topics change. Prerequisite: CSE 5346, or consent of instructor.
6345. MOBILE COMPUTING SYSTEMS (3-0). Mobility management, Mobile IP, hand-off, routing, multicasting, and reliable communication in wireless networks. Data management, push-pull based data acquisition, issues in wireless mobile systems, resource allocation, QoS issues and multimedia transmission over wireless, WAP and Bluetooth technologies, Third Generation systems. Prerequisite: CSE 5346.
6347. WIRELESS MOBILE NETWORKING AND COMPUTING (3-0). Wireless architectures and networking; multiple access protocols; channel assignment and resource allocation; mobility and location management mobile data access; wireless data networking and multimedia; call admission control and QoS provisioning; performance modeling; mobile IP and wireless Internet. Prerequisite: CSE 5347, or consent of instructor.
6350. ADVANCED TOPICS IN COMPUTER ARCHITECTURE (3-0). May be repeated for credit when topics change. Prerequisite: CSE 5350 and consent of instructor.
6351. TOPICS IN PARALLEL AND DISTRIBUTED COMPUTING (3-0). May be repeated for credit when topics change. Prerequisite: CSE 5350, 5351. or consent of instructor.
6352. FAULT-TOLERANT COMPUTING (3-0). Topics in reliable and fault-tolerant computing. May be repeated for credit when topics change. Prerequisite: CSE 5350 and consent of instructor.
6362. ADVANCED TOPICS IN ARTIFICIAL INTELLIGENCE (3-0). May be repeated for credit when the topic changes. Prerequisite: CSE 5361 and consent of instructor.
6363. MACHINE LEARNING (3-0). A detailed investigation of current machine learning methods, including statistical, connectionist, and symbolic learning. Presents theoretical results for comparing methods and determining what is learnable. Current issues in machine learning research will also be examined. Prerequisite: CSE 5361 and consent of instructor.
6366. DIGITAL IMAGE PROCESSING (3-0). Digitization and coding of images, characterization and representation of digital images in spatial and frequency domains, picture restoration and enhancement, filtering of two-dimensional signals, image reconstruction. Prerequisite: CSE 5366 or consent of instructor.
6367. COMPUTER VISION (3-0). Advanced techniques for interpretation, analysis, and classification of digital images. Topics include methods for segmentation, feature extraction, recognition, stereo vision, 3-D modeling, and analysis of time-varying imagery. Also taught as EE 6358. Prerequisite: CSE 6366 or EE 5356 or EE 5357, and consent of instructor.
6192, 6292, 6392. SPECIAL TOPICS IN ADVANCED COMPUTER SCIENCE. May be repeated for credit when the topics vary. Prerequisite: graduate standing and consent of instructor.
6197-6997. RESEARCH IN COMPUTER SCIENCE. Individually supervised research projects. Graded P/F/R. Prerequisite: graduate standing in computer science and approval of Graduate Advisor.
6399, 6699, 6999. DISSERTATION. Preparation of dissertation in computer science or computer science and engineering. 6399 and 6699 graded R/F only; 6999 graded P/F/R. Prerequisite: consent of instructor.
*CS 6352. Performance of Computer Systems & Networks (UT Dallas): Queueing theoretic performance modeling problems occur in several layers of data networks organization. The objectives of this course are (1) to learn queuing theoretic models and analysis techniques of computer and telecommunication network's performance and (2) to apply the principles to formulate and solve some practical performance problems in data networks.
*CS 6359. Object-Oriented Analysis And Design (UT Dallas): Analysis and practice of modern tools and concepts that can help produce software that is tolerant of change. Consideration of the primary tools of encapsulation and inheritance. Construction of "software-ICs" which show the parallel with hardware construction. Prerequisites: CS 6354 and either CS 5335 or CS 5336.
*CS 6378. Advanced Operating Systems (UT Dallas): The main focus of this course is on distributed and parallel operating systems. It emphasizes both theory and practice. On the theory side, students will be taught fundamental theory in distributed computing. Prerequisites: CS 5348 or equivalent; knowledge of C and UNIX.
*CS 6385. Telecommunication Networks: (UT Dallas): The design and analysis of telecommunication networks. Topics include network design issues, network design tools, analysis of loss and delay, modeling networks, review of fundamental graph algorithms, techniques for centralized network design, optimization of routing, ring architectures, mesh architectures, network reliability, survivable networks, wireless networks. Prerequisite: A first course in Probability Theory.
*CS 6386. Telecommunication Software Design (UT Dallas): Programming with sockets and remote procedure calls, real time programming concepts and strategies. Operating system design for real time systems. Encryption, file compression, and implementation of fire walls. An in-depth study of TCP/IP implementation. Introduction to discrete event simulation of networks. Prerequisites: CS 5390.
*CS 6390. Advanced Computer Networks (UT Dallas): Overview of the ISDN network and the SS7 protocol. High-speed networks including B-ISDN, Frame Relay and ATM. Congestion control algorithms, quality of service guarantees for throughput and delay. Prerequisite: CS 5390.
*CSE 5311. Design and Analysis of Algorithms (UT Arlington): This class will cover a number of ideas and techniques useful for designing and analyzing data structures and algorithms. In particular, it will introduce techniques for analyzing upper bounds for algorithms and lower bounds for problems. Problem areas include sorting, graphs, dynamic programming, combinatorial algorithms, computational geometry, encryption, parallel models, and NP-Completeness.
* Denotes offered online as part of the CSE/EE Online degree program.