|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Problem solving through writing FORTRAN programs. Particular elements include: careful development of FORTRAN programs from specifications; documentation and style; appropriate use of control structures, data types and subprograms; abstractions and verification; engineering applications.
-
3.00 Credits
An introductory course in computing in C++. Emphasis on algorithm development and problem solving. Particular elements include: careful and methodical development of C++ programs from specifications; documentation and style; appropriate use of control structures, data types and subprograms; data abstraction and verification; numeric and nonnumeric applications; introduction to object-oriented programming and design.
-
3.00 Credits
An introductory course in computing in Java. Emphasis on algorithm development and problem solving. Careful and methodical development of Java applications and applets from specifications; documentation and style; appropriate use of control structures; classes and methods; data types and data abstraction; object-oriented programming and design; graphical user interface design.
-
3.00 Credits
Survey of basic principles of computer hardware, communications, operating systems, microcomputer issues, security, impact on society, system development, and use in organizations. Hands-on use of software, including operating system commands, wordprocessing, spreadsheets, and database managers. Demonstration and application of current end-user applications. May not be used by CSC major as a restricted elective.
-
3.00 Credits
Software design in a high-level language: abstract data types, modular programming, management of large programs. Dynamic memory management: linked lists, pointers, allocation and deallocation. Alternate programming paradigms: recursive list processing, object-oriented programming.
-
3.00 Credits
The second course in computing, intended for majors. Emphasis is placed on interpretation of inductive definitions (functions and data types); testing strategies; specification and implementation of finite-state machine; encapsulation; polymorphism; inheritance; class invariants; and resource management
-
3.00 Credits
Formal logic. Methods of proof including induction. Introduction to grammars and finite state machines. Recurrence relations and asymptotic behavior of functions. Sets and counting. Boolean expressions and logic networks. Graphs and relations.
-
3.00 Credits
Propositional logic and the predicate calculus. Logic gates and circuits. Methods of proof. Elementary set theory. Mathematical induction. Recursive definitions and algorithms. Solving recurrences. The analysis of algorithms and asymptotic growth of functions. Elementary combinatorics. Introduction to graph theory. Ordered sets, including posets and equivalence relations. Introduction to formal languages and automata.
-
3.00 Credits
Details of C programming as compared with Java; Lexical structure, syntax, semantics, and pragmatics (idioms, common uses) of C; Stages of compliation, linking and execution; Strings, arrays, structures, pointers, and memory management; C libraries;Tools for design, maintenance, and debugging of programs; Separate compliation, modular programming; Integrated development environments.
-
3.00 Credits
Number systems, von Neuman machines, instruction sets and machine code, data representation, assemblers and assembly language programming, compilers, external and internal processor organization, memory, I/O organization and devices. Detailed study of a contemporary processor architecture.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|