|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
1st Semester. Lect. 3, 3 credits. Introduction to basic concepts and techniques of artificial intelligence and intelligent systems. Topics include: facts representation, variables and quiers with emphasis on backtracking, definitions and inferences, arithmetic and list processing in Prolog, LISP, Scheme, etc. Rule based systems, machine intelligence, heuristic programming, and natural languages. Prerequisite: CSCI 0230 and CSCI 0300 or Departmental Approval.
-
2.00 - 3.00 Credits
2nd Semester. Lect. 2, Lab 2, 3 credits. Early image processing; images and shapes; motion understanding from images; shape representation, model based vision system; signal processing; feature extraction, recognition systems; kinematics and dynamics; trajectory and task planning; control; robot programming; locomotion. Prerequisites: MATH 0407, CSCI 0230 and CSCI 0485, or Departmental Approval.
-
2.00 - 3.00 Credits
2nd Semester. Lect. 2, Lab 2, 3 credits. VLSI technology, NMOS, CMOS; fabrication and design of chips; logic design; Design techniques for computer hardware; clocked and self timed systems; hardware synchronization circuits; finite state machines. Prerequisites: CSCI 0335 or Departmental Approval.
-
3.00 Credits
1st Semester. Lect. 3, 3 credits. Topics are selected to supplement and enrich existing courses and lead to the development of new courses. Prerequisites: Departmental Approval.
-
3.00 Credits
Cr. 3. Numerical approximations of solutions of ordinary and partial differential equations; numerical solution of eigen value problems, boundary value problems; error analysis; curve fitting. Prerequisites: MATH 0209 and MATH 0307 or Departmental Approval.
-
3.00 Credits
Cr. 3. Goals of DBMS relationships, logical, and physical organizations, schema and subschema, hierarchical, network and relational models; first, second, and third normal forms of data relations. Canonical schema. Data independence; forms, applications, examples, design strategies; relational algebra, relational calculus, data structures for establishing relations. Query functions. Design and translation strategies. Prerequisites: CSCI 0340 or Departmental Approval.
-
3.00 Credits
Cr. 3. This course will survey the variety of languages that are used as alternatives to or extensions of general purpose third-generation languages (i.e. PASCAL, FORTRAN, C). Some of these extensions are: programmable command languages (i.e. UNIX Shell), special purpose languages, and prototyping tools. Application of fourth-generation languages. The course work will include both conceptual and hands-on treatment. Prerequisites: CSCI 0230 or Departmental Approval.
-
3.00 Credits
2nd Semester. Lect. 3, 3 credits. This course will survey the variety of languages that are used as alternatives to or extensions of general purpose third-generation languages (i.e. PASCAL, FORTRAN, C). Some of these extensions are: programmable command languages (i.e. UNIX Shell), special purpose languages, and prototyping tools. Application of fourth-generation languages. The course work will include both conceptual and hands-on treatment. Prerequisites: CSCI 0230 or Departmental Approval.
-
3.00 Credits
Cr. 3. Algebraic structure of sequential machine, modular logic design, universal logic modules, array realizations, programmable logic arrays, physical circuit design, partitioning, placement, routing, magnetic bubble logic, fault diagnosis, fault tolerant design. Prerequisites: CSCI 0235 and CSCI 0300 or Departmental Approval.
-
3.00 Credits
Cr. 3. Error detection and correction, linear codes, cyclic codes, BCH codes, coding bounds, shift register sequences, and coding systems. Prerequisites: CSCI 0235, CSCI 0300 and MATH 0407 or Departmental Approval.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|