| source University of Texas at Austin (X) |
level Graduate (57) |
department Computer Sciences (X) |
Basics of static analysis and transformation techniques; exploration in depth of one aspect of compilation and optimization. Three lecture hours a week for one semester. Computer Sciences 380C and 395T (Topic: Compilers ) may not both be counted. Prerequisite: Graduate standing; Computer Sciences 357 and 375 are recommended.
Score: 11.422403 Details | Listing | Web page
Models of distributed systems; language issues, proving properties of distributed systems; time, clocks, partial ordering of events; deadlock and termination detection; diffusing computations; computing in hostile environments; distributed resource management. Three lecture hours a week for one semester. Prerequisite: Graduate standing and Computer Sciences 372.
Score: 11.422403 Details | Listing | Web page
Study of the formal structure, design principles, organization, implementation, and performance analysis of multiprogramming and/or multiprocessor computer systems. Three lecture hours a week for one semester. Prerequisite: Graduate standing, and Computer Sciences 372 or consent of instructor.
Score: 11.422403 Details | Listing | Web page
Theory and applications of Markovian models: birth-death models, queueing models, and networks of queues. Numerical methods: computational algorithms, approximation techniques, discrete-event simulation. Performance of scheduling disciplines: priority, time-sharing, multiple access. Three lecture hours a week for one semester. Prerequisite: Graduate standing and an undergraduate course in probability theory.
Score: 11.422403 Details | Listing | Web page
Explores parallel systems, from languages to hardware, from large-scale parallel computers to multicore chips, and from traditional parallel scientific computing to modern uses of parallelism. Includes discussion of and research methods in graphics, languages, compilers, architecture, and scientific computing. Three lecture hours a week for one semester. Computer Sciences 380P and 395T (Topic: Parallel Systems ) may not both be counted. Prerequisite: Graduate standing.
Score: 11.422403 Details | Listing | Web page
Survey of modern security, designed to introduce the basic techniques used in the design and analysis of secure systems. Three lecture hours a week for one semester. Prerequisite: Graduate standing, and Computer Sciences 353 and 372 or consent of instructor.
Score: 11.422403 Details | Listing | Web page
Use of computers in problem solving, game playing, theorem proving, natural language understanding, and related tasks; methods of search, knowledge representation, learning, and other topics. Three lecture hours a week for one semester. Prerequisite: Graduate standing, and Computer Sciences 351 or consent of instructor.
Score: 11.422403 Details | Listing | Web page
Algorithms and their realizations, special techniques for coding, addressing, and control; integration of computer units; relations between programming and design considerations. Three lecture hours a week for one semester. Prerequisite: Graduate standing.
Score: 11.422403 Details | Listing | Web page
Same as Computational and Applied Mathematics 383C and Mathematics 383E. Survey of numerical methods in linear algebra: floating-point computation, solution of linear equations, least squares problems, algebraic eigenvalue problems. Three lecture hours a week for one semester. Prerequisite: Graduate standing, either consent of instructor or Mathematics 341 or 340L, and either Mathematics 368K or Computer Sciences 367.
Score: 11.422403 Details | Listing | Web page
Same as Computational and Applied Mathematics 383D and Mathematics 383F. Survey of numerical methods for interpolation, functional approximation, integration, and solution of differential equations. Three lecture hours a week for one semester. Prerequisite: Graduate standing; either consent of instructor or Mathematics 427K and 365C; and Computational and Applied Mathematics 383C, Computer Sciences 383C, or Mathematics 383E.
Score: 11.422403 Details | Listing | Web page
Same as Computational and Applied Mathematics 384G. Advanced material in computer graphics, including in-depth treatments of techniques for realistic image synthesis, advanced geometric modeling methods, animation and dynamic simulation, scientific visualization, and high-performance graphics architectures. Three lecture hours a week for one semester. Prerequisite: Graduate standing; and Computer Sciences 354 or another introductory course in computer graphics, or equivalent background and consent of instructor.
Score: 11.422403 Details | Listing | Web page
Theoretical and practical issues in advanced systems, including multimedia systems, digital audio and video compression techniques, operating system and network support for digital audio and video, and multimedia conferencing systems. Three lecture hours a week for one semester. Prerequisite: Graduate standing; and either Computer Sciences 356 and 372 or 380D and 380L.
Score: 11.422403 Details | Listing | Web page
Computational image processing, computational geometry and geometric modeling algorithms with an emphasis on spatial realism, and the programmatic use of physiological simulation and visualization to quantitatively depict how things work at the molecular, cellular, tissue, organ, and system levels. Three lecture hours a week for one semester. Computer Sciences 384R and 395T (Topic: Graphics, Modeling, and Visualization ) may not both be counted; Computer Sciences 384R and 395T (Topic: Multiscale Bio-Modeling and Visualization ) may not both be counted; Computer Sciences 384R and 395T (Topic: Physically Based Geometric Modeling ) may not both be counted. Prerequisite: Graduate standing, and Computer Sciences 354 or consent of instructor.
Score: 11.422403 Details | Listing | Web page
Basic techniques required to design custom negative metal oxide semiconductor digital integrated circuits. Three lecture hours a week for one semester. Prerequisite: Graduate standing, and Computer Sciences 352 or consent of instructor.
Score: 11.422403 Details | Listing | Web page
System models from synchronous to asynchronous, with emphasis on in-between models such as the timed asynchronous model. Control structures such as timed state-transition systems, and constraints in temporal and real-time logics. Analysis techniques such as model checking of timed systems, and extended Presburger arithmetic. Basic building blocks such as clock synchronization, synchronous atomic broadcast, time-bounded membership protocols, real-time scheduling theory, and state recovery methods. Practical implementation issues such as special operating system data structures and algorithms, open system design, and security concerns. Three lecture hours a week for one semester. Computer Sciences 386C and 395T (Topic: Dependable Computing Systems ) may not both be counted. Prerequisite: Graduate standing, and an undergraduate course in operating systems or consent of instructor.
Score: 11.422403 Details | Listing | Web page
Introduction to the principles of database systems, including fundamental ideas and algorithms used in the construction of centralized database management systems, distributed database management systems, and database machines and their roles in Internet infrastructure. Topics include data storage and indexing algorithms, query processing and optimization, concurrency control, recovery, XML and object-oriented databases, database evaluation and tuning, and recent directions in database research. Three lecture hours a week for one semester. Computer Sciences 386 and 386D may not both be counted; Computer Sciences 386D and 387H may not both be counted. Prerequisite: Graduate standing and Computer Sciences 347 and 375.
Score: 11.422403 Details | Listing | Web page
The analysis of numerical methods for solving ordinary and partial differential equations. Three lecture hours a week for one semester. Only one of the following may be counted: Computational and Applied Mathematics 386K, Computer Sciences 386K, Mathematics 383G. Prerequisite: Graduate standing; and Computational and Applied Mathematics 383D, Computer Sciences 383D, Mathematics 368K, 383F, or consent of instructor.
Score: 11.422403 Details | Listing | Web page
Topics include formal syntax representations, program correctness, typing, and data abstraction. Features and problems in languages that allow parallelism. Exploration of different programming styles, such as imperative, functional, logic, data flow, and object-oriented programming. Three lecture hours a week for one semester. Prerequisite: Graduate standing, and Computer Sciences 345 or consent of instructor.
Score: 11.422403 Details | Listing | Web page
Switching techniques, network and protocol architectures, communication protocols, resource allocation problems, internetworking, design and analysis methods. Three lecture hours a week for one semester. Prerequisite: Graduate standing.
Score: 11.422403 Details | Listing | Web page
Techniques and research in Internet and network security. Three lecture hours a week for one semester. Computer Sciences 386S and 395T (Topic: Secure Network Protocols ) may not both be counted. Prerequisite: Graduate standing.
Score: 11.422403 Details | Listing | Web page
Fundamental concepts and principles of wireless network technologies and protocol design, ranging from physical layer to application layer, and in-depth studies of current wireless research. Three lecture hours a week for one semester. Computer Sciences 386W and 395T (Topic: Wireless Networking ) may not both be counted. Prerequisite: Graduate standing.
Score: 11.422403 Details | Listing | Web page
Computational methods for syntactic and semantic analysis of structures representing meanings of natural language; study of current natural language processing systems; methods for computing outlines and discourse structures of descriptive text. Three lecture hours a week for one semester. Prerequisite: Graduate standing, and a course in artificial intelligence or consent of instructor.
Score: 11.422403 Details | Listing | Web page
Counting, matching theory, extremal set theory, Ramsey theory, probabilistic method, linear algebra method, coding theory. Applications to computer science, including randomized algorithms. Three lecture hours a week for one semester. Prerequisite: Graduate standing, and Computer Sciences 336 or the equivalent or consent of instructor. An understanding of elementary proof and counting techniques is assumed.
Score: 11.422403 Details | Listing | Web page
Formal grammars, languages and related classes of automata, language hierarchies, operations on languages, decidability, related complexity issues, closure properties, other classes of automata. Three lecture hours a week for one semester. Prerequisite: Graduate standing, and Linguistics 340 or consent of instructor.
Score: 11.422403 Details | Listing | Web page
Sorting and searching algorithms, graph algorithms, algorithm design techniques, lower bound theory, fast Fourier transforms, NP-completeness. Three lecture hours a week for one semester. Prerequisite: Graduate standing, and Computer Sciences 357 or the equivalent or consent of instructor.
Score: 11.422403 Details | Listing | Web page