|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
A review of sets, functions, relations, mathematical induction and algorithmic analysis as applied to Computer Science. Graph theory, including minimal and maximal algorithms and the critical path method, is studied as well as automata theory and formal languages. Prerequisite: MATH 170 or MATH 161, CSCI 180.
-
3.00 Credits
The classic data structures, such as stacks, queues, linked lists, binary trees, etc. are studied. Sorting and searching are stressed. Computational analysis is also studied. Prerequisites: CSCI 180, MATH 170 or MATH 161.
-
3.00 Credits
For computer majors. A detailed study of the COBOL languages with application to business problems: identification, environment, data and procedure divisions, syntax structure. File organization is discussed in connection with the data processing system. Prerequisite: CSCI 180. (Offered regularly, but not every semester.)
-
3.00 Credits
Various data models, including hierarchical, network, relational, and object oriented, are introduced. The major part of the course is devoted to relational databases. Topics covered are the mathematical foundation, the three-level ANSISPARC architecture, and the SQL language. The SQL language includes the data manipulation and data definition components that are used to construct and query databases and also to provide access control to safeguard security. Entityrelationship modeling is presented and used to design the external level. Functional dependency and normalization techniques are used for the logical design of databases. Problems of concurrency control in multi-user database management systems are discussed. Prerequisite: CSCI-260
-
3.00 Credits
Synchronous sequential circuits, interactive networks, transformation of sequential machines. Asynchronous sequential circuits, the structure of sequential machines, state identification, finite state recognizers. Prerequisite: CSCI 130 or equivalent. (Offered regularly, but not every semester.)
-
3.00 Credits
A study of the ANSI Standard C programming language and the UNIX programming environment. Topics covered include the syntax of C, basic UNIX commands, the UNIX file system, filters and pipes, shell programming and using UNIX system calls in C. C++, the object-oriented extension of C, will also be introduced. Prerequisite: CSCI 260.
-
3.00 Credits
The basic concepts of the theory of computation are studied including set theory, finite automata, context free and context sensitive languages, Turing machines, Church's thesis and uncomputability. The classes of computation complexity and their practical limitations are studied. Prerequisite: CSCI 230
-
3.00 Credits
Formal definition of programming languages including specification of syntax and semantics. A comparative analysis of various high-level programming languages with emphasis on the appropriateness of languages for certain applications. Prerequisite: CSCI 260
-
3.00 Credits
Introduction to the principles of interactive computer graphics, including input techniques and devices, display devices, display files, interactive graphic techniques, two- and three-dimensional computer graphics, and transformations. Graphic oriented languages are also discussed. Prerequisites: MATH 310, and CSCI 260 or equivalent. (Offered regularly, but not every semester.)
-
3.00 Credits
The design and implementation of a compiler is studied, including compiler organization, lexical analysis, searching methods and symbol tables, formal languages and grammar, parser construction, code syntax and code generation. Prerequisites: CSCI 260, CSCI 170.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|