|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Provides the background for graduate students who do not have an undergraduate degree in computer science to take selective, graduate-level computer science courses. Computer organization from both hardware and software viewpoints is discussed. Includes computer system organization, digital logic, microprogramming, conventional machine language, operating systems, assembly language, advanced computer architectures, and data structures.
-
3.00 Credits
Application of software engineering principles and basic computer science to the total development of a software system. Consideration of the software system design process, including requirements and design detail. Development and evaluation of aprototype accomplished through design team activity. Comprehensive written and oral project report is required.
-
1.00 - 6.00 Credits
Used for the following types of study: readings in the literature of computer science, introductory research projects, major computer programming projects, seminars, or new course development. Work may be done in any CSC area such as software, hardware utilization, programming languages, numerical methods or telecommunications. Departmental Approval Required.
-
1.00 - 6.00 Credits
Independent investigation of a research problem under faculty supervision. Departmental Approval Required.
-
3.00 Credits
Fundamental issues related to the design of operating systems. Process scheduling and coordination, deadlock, memory management and elements of distributed systems.
-
3.00 Credits
Introduction to the conceptual and formal apparatus of mathematical logic, to mathematical concepts underlying the process of logical formalization, and to the applications of various logics across a broad spectrum of problems in computer science and artificial intelligence.
-
3.00 Credits
Algorithm design techniques: use of data structures, divide and conquer, dynamic programming, greedy techniques, local and global search. Complexity and analysis of algorithms: asymptotic analysis, worst case and average case, recurrences, lower bounds, NP-completeness. Algorithms for classical problems including sorting, searching and graph problems (connectivity, shortest paths, minimum spanning trees).
-
3.00 Credits
The need for parallel and massively parallel computers. Taxonomy of parallel computer architecture, and programming models for parallel architectures. Example parallel algorithms. Shared-memory vs. distributed-memory architectures. Correctness and performance issues. Cache coherence and memory consistency. Bus-based and scalable directory-based multiprocessors. Interconnection-network topologies and switch design. Brief overview of advanced topics such as multiprocessor prefetching and speculative parallel execution.
-
3.00 Credits
An introduction to software life cycle models; size estimation; cost and schedule estimation; project management; risk management; formal technical reviews; analysis, design, coding and testing methods; configuration management and change control; and software reliability estimation. Emphasis on large development projects. An individual project required following good software engineering practices throughout the semester.
-
3.00 Credits
Theory and practice of compiler writing. Lexical analysis, table driven LL(1), LR(1) and LALR(1) parsers, code generation, flow analysis, run-time storage organization and optimization. Writing a compiler using software tools a significant part of course.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|