|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Concepts and applications in the field of Human Computer Interaction. Topics include humancomputer interaction, GUI design and multimedia systems. Application projects using VB required. Prerequisite: CS 1100 or consent of instructor.
-
3.00 Credits
An overview of the main features of major programming languages. Various programming languages will be compared in their handling of variables, types, control structures, and input-output. Prerequisite: CS 2300.
-
3.00 Credits
An introduction to object-oriented programming. Topics include objects, classes, inheritance, class extension, interfaces, polymorphism, and objectoriented design. Prerequisite: CS 1110 or consent of instructor.
-
3.00 Credits
Design alternatives in computer architecture including instruction set architectures, memory subsystem organization, interfacing concepts, interprocessor communication, datapath and control of a processor, and pipelining. Prerequisite: CS 2200.
-
3.00 Credits
An introduction to computer graphics. Topics include: basic geometric primitives, transformations, clipping, viewing, color models, animation, and rendering. Programming: using OpenGL and appropriate languages. Prerequisites: CS 2300 and MATH 1151.
-
1.00 - 3.00 Credits
Individual reading and research on some topics not included in the regular offerings of the department. May be repeated for a maximum of 3 semester hours. Prerequisite: CS 2300 or consent.
-
3.00 - 8.00 Credits
Opportunity for students to gain knowledge in areas of computer science, both theoretical and applied, that would not normally be included as part of the department's curriculum. Internship contract must be completed prior to beginning work/learning experience. May be repeated for a maximum of 16 semester hours. A maximum of 8 semester hours may be applied to any one degree. Prerequisites: consent of department Internship Committee and if taken for graduate credit, approval of graduate adviser.
-
3.00 Credits
Techniques needed to analyze algorithms. The application of these techniques to topics such as sorting, graph algorithms, fast Fourier transforms, dynamic programming, and NP-completeness. Prerequisite: CS 2300 and MATH 1151.
-
3.00 Credits
Includes finite-state automata, pushdown automata, and Turing machines. The topics of regular expressions, context-free languages, the halting problem, Post's correspondence problem, P, NP, NP-completeness, and some NPcomplete problems will be discussed. Prerequisite: CS 2400 or MATH 2410.
-
3.00 Credits
Finite difference interpolation, numerical differentiation and integration, numerical solution of nonlinear equations, numerical solution of ordinary differential equations. Computational techniques stressed and extensive quantity of problems to be solved on a digital computer. Prerequisites: CS 1110 and MATH 1152.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Cookies Policy |
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|