|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Credits: 3 Examines principles and practices relating computer architecture to programming execution and efficiency. Presents new approach that stresses performance and cost of architecture. Examines principles of compiler and OS implications, instructions sets, basic processors, pipelines, and memory-hierarchy. Topics may include RISC machines, cache memories, register usage, and vector machines. Prerequisites CS 540 or 571, or equivalent. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Advanced topics in design and implementation of microkernel-based, object-oriented, and distributed operating systems. Specific topics include support for interprocess communication, interaction between computer architecture and operating systems, distributed file systems, transactions, and distributed shared memory. Prerequisites CS 571, or permission of instructor Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Theory and practice of analytical models of computer systems. Topics include queuing networks, single and multiple class mean-value analysis, models of centralized and client- server systems, software performance engineering, and web servers performance. Prerequisites CS 571 and MATH 351, or permission of instructor Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Focuses on technological and development environments in developing multimedia applications. Projects involve experience with multimedia authoring tools and simulations to assess performance. Prerequisites CS 571. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Issues in design and implementation of distributed systems and applications. Topics include distributed communication paradigms, middleware, coordination and synchronization, distributed transactions, consistency and replication, fault-tolerance and reliability, and peer-to-peer systems. Prerequisites CS 571 or permission of instructor. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Explores principles of designing computer programs that respond appropriately to questions, commands, and statements expressed in human language, particularly English. Role of knowledge representation and linguistic theory. Students become familiar with current literature to implement a limited natural language processor. Prerequisites CS 540 and 580. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Design, construction, and evaluation of software systems that solve problems generally deemed to require human expertise. Focuses on study and use of relevant languages, environments, mathematics, and logic. Case studies of successful systems. Programming projects include development of tools or small-scale systems. Prerequisites CS 580. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Study of computational models of visual perception and their implementation in computer systems. Topics include early visual processing, edge detection, segmentation, intrinsic images, image modeling, representation of visual knowledge, and image understanding. Prerequisites CS 580 and 583. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Examines design and analysis of parallel algorithms. Material focuses on algorithms for both theoretical and practical models of parallel computation. Considers algorithm design and analysis for PRAM and existing SIMD and MIMD type architectures. Topics include sorting, graph algorithms, numerical algorithms, and computational complexity. Prerequisites CS 583; CS 635 recommended. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Data structures and analytical techniques to study graph algorithms. Data structures include disjoint sets, heaps, and dynamic trees. Algorithms include minimum spanning trees, shortest path, maximum flow, and graph planarity. Prerequisites CS 583. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|