|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
4 hours, 4 credits. Introduction to the organizational principles of data communication and their implementation in particular networks. Examination of the way operating networks approach and solve communication problems. Examination of user utilities from a computer scientist's point of view. PREREQ: CMP 334 and CMP 338.
-
2.00 Credits
4 hours, 2 credits. Introduction to installation and configuration of networking equipment, network monitoring and trouble-shooting, and network management. Use of typical networking equipment. Some programming in Java or C will be required. PREREQ: CMP 338. COREQ or PREREQ: CMP 405. Note: Not allowed as one of the electives in the Computer Science B.S. or B.A. degrees; however, if both CMP 335 and CMP 406 are taken, the combination can be used as one of the electives for the Computer Science B.S. degree.
-
4.00 Credits
4 hours, 4 credits. Compilation of simple expressions and statements. Organization of a compiler, including compile-time and run-time symbol tables, lexical scan, object code generation, error diagnostics, object-code optimization techniques, such as register allocation via graph coloring, and method in-lining. Use of compiler writing languages and bootstrapping. Note: Students will work on a compiler for a small language. PREREQ: CMP 339.
-
4.00 Credits
4 hours, 4 credits. Classical and object-oriented software engineering. System life cycle, structured coding techniques, modularity, data encapsulation, and generic facilities. Verification, validation, and testing techniques: static analysis, input-output assertions, structured induction, and symbolic execution. PREREQ: CMP 338.
-
4.00 Credits
4 hours, 4 credits. Design and analysis of algorithms: Worst and average case behavior. Design strategies, such as divide and conquer, the greedy principle, dynamic programming, and backtracking, are illustrated by examples chosen from sorting and searching, applications of graph theory, scheduling, pattern matching, matrix multiplication, and other topics. NP-complete problems. Parallel processing and algorithms. PREREQ: CMP 338. PRE- or COREQ: MAT 313.
-
4.00 Credits
4 hours, 4 credits. Techniques of producing graphical displays. Two-dimensional transformations. World vs. Screen coordinates. Line drawing algorithms. Clipping. Motion. Use of devices such as light pens, graphics tablets, and mouses. PREREQ: CMP 326. PRE- or COREQ: MAT 313.
-
4.00 Credits
4 hours, 4 credits. Survey of artificial intelligence with an introduction to L.I.S.P. programming. Graph-searching algorithms applied to problem solving. Selected topics from pattern recognition, natural language processing, and expert systems. PREREQ: CMP 338.
-
4.00 Credits
4 hours, 4 credits. Mathematical formulation of computability theory and abstract machine theory. Finite-state machines and Turing machines; Church-Turing Thesis; recursive functions and recursively enumerable sets; unsolvability and the Halting Problem. PREREQ: CMP 232 and CMP 326.
-
4.00 Credits
4 hours, 4 credits. Methods for transforming information into cryptic messages and for deciphering secret code. Review of selected topics in elementary number theory. Construction of linear, quadratic, and exponential ciphers, as well as key exchange protocols. PREREQ: MAT 313.
-
4.00 Credits
4 hours, 4 credits. Development of many systems will be studied using a structured approach to system design. Feasibility study, project cost estimation, top down design, Hierarchy/Input/Process/Output (H.I.P.O.), dataflow diagrams, data dictionaries, backup, security, maintenance, and testing system. PREREQ: CMP 326.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|