|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
No course description available.
-
3.00 Credits
No course description available.
-
4.00 Credits
No course description available.
-
3.00 Credits
Goals of DBMS, including data independence, relationships, logical and physical organization, schema and subschema; hierarchical, network, and relational modes; examples of implementation of various models; first, second, and third normal forms of data relations; canonical schema; data description languages: forms, applications, examples, design strategies; query facilities: relational algebra, calculus, data structures for establishing relations; query functions; file organization; index organization; file security; data integrity and reliability. .
-
3.00 Credits
Review of instruction sets. I/O and interrupts, addressing schemes, microprogramming; dynamic procedure activation; dynamic storage allocation; design methodology, monitors, kernels, networks of operating system modules; elementary queuing; memory management: virtual memory, paging, segmentation; memory protection; multiprogramming. .
-
3.00 Credits
Formal language concepts, including basic characteristics of syntax and grammars; regular, context-free, and ambiguous grammars; constructs for specifying and manipulating data types; language features affecting static and dynamic storage management; control structures and data flow; subroutines, procedures, block structures, interrupts, decision tables, recursion; relationship with good programming style; run-time considerations; interpretative languages, lexical analysis and parsing.
-
3.00 Credits
Grammars, languages, and their syntax and semantics; parsing and ambiguity; scanners; implementation of symbol tables; parsers; major parsing algorithms; techniques for machine-independent code generation; code optimization; syntax-directed translation schema.
-
3.00 Credits
Heuristic versus algorithmic methods, cognitive processes, investigation of methods of making machines behave intelligently, problem solving, theorem probing, game playing, pattern recognition, question answering, learning self-organization, methods of programming such procedures, data structures and program organization, the mind-brain problem; and the nature of intelligence.
-
3.00 Credits
Introduction to expert systems; components of an ideal expert system: knowledge base, rules, interpreter; secondary components: justifier, scheduler, consistency enforcer, blackboard; search space size, exhaustive search, single line of reasoning, hierarchical, generate, and test; combining evidence from multiple sources; utilizing meta-knowledge; meta-rules and their source; detecting simple errors in rules; justification of rules; expert system tools: EMYCIN, OPS5, HEARSAY?III.
-
3.00 Credits
Software, hardware, and mathematical tools for the representation, manipulation, and display of topological and two- and three-dimensional objects; display devices; problems and objectives of computer graphics; point, vector, curve, and character generation; interactive versus passive graphics; graphics data structures, graphics packages and graphics languages; two-dimensional graphics: generation, transformation, window clipping, segmented display files and display procedures; interactive graphics: input devices, input techniques, event handling, and input functions; raster graphics fundamentals; three-dimensional graphics: hidden-line problems, windowing, transformations, perspective projections, and shading.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|