|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.50 Credits
(Prerequisite CSC 200, CSC 208) Introduction to modern programming design techniques using C++. A study of basic programming constructs, techniques and fundamental control structures. Emphasis is on Object Oriented and modular programming. Coverage includes data types, functions, arrays and pointers. The course examines problem analysis, decomposition and modern programming paradigms and methodologies.
-
4.50 Credits
(Prerequisite CSC 242) fundamentals of Object-Oriented Programming in C++ including class definition and object instantiation, inheritance and polymorphism. Detailed coverage of exception handling, operator overloading, I/O and file streams, templates, and the Standard Template Library (STL). Exposure to Data Structures and basic algorithms for sorting and searching. .
-
4.50 Credits
(Prerequisite: Math 215) The course introduces the Java programming language and its features. Topics include introduction to object oriented programming, basic control structures, java graphics and GUI objects, multimedia components, exposure to event driven programming, arrays and strings in java. Coverage includes encapsulation, inheritance, and polymorphism.
-
4.50 Credits
(Prerequisite: CSC 252) Covers the key concepts and methodologies required for object-oriented design, evaluation and development with focus on practical techniques such as use-case, CRC analysis, and patterns. The Unified Modeling Language (UML) is presented in detail. Special emphasis is given to the use of object patterns in developing software systems.
-
4.50 Credits
(Prerequisite: CSC 208) Study of vectors in the plane and space, systems of linear equations, matrices, determinants, linear transformations, eigenvalues and eigenvectors. The computer algebra system MATLAB will be used throughout the course. Students will also develop experience applying abstract concepts to concrete problems drawn from engineering and Computer Science.
-
4.50 Credits
(Cross-listed and equivalent to MTH 325) (Prerequisite: CSC 252, CSC 310) A theoretical foundation for computer science. Introduction to topics such as sets, propositional logic, Boolean algebra, counting techniques, recursive equations and solution techniques, graph algorithms with application to trees. Introduction to mathematical proofs. Students may not receive credit for both CSC 331 and MTH 325.
-
4.50 Credits
(Prerequisite: CSC 300, CSC 331) An overview of data structure concepts, arrays, stack, queues, trees, and graphs. Discussion of various implementations of these data objects, programming styles, and run-time representations. Course also examines algorithms for sorting, searching and some graph algorithms. Algorithm analysis and efficient code design is discussed.
-
4.50 Credits
(Prerequisite: CSC 335) Techniques of designing efficient computer algorithms, proving correctness, and analyzing time complexity. General topics include asymptotic behavior, solution to recurrence relations, algorithm design techniques such as divide-and-conquer, dynamic programming, and greedy algorithms applied to sorting, searching and graphs. An introduction to the theory of parallel and distributed algorithms.
-
4.50 Credits
(Prerequisite CSC 200, CSC 208) Foundation in design and analysis of the operation of digital gates. Design and implementation of combinational and sequential logic circuits. Concepts of Boolean algebra, Karnaugh maps, flip-flops, registers, and counters along with various logic families and comparison of their behavior and characteristics.
-
1.50 Credits
(1.5 quarter units) (Prerequisite or co-registration: CSC 340) A study of basic digital logic circuit design and implementation. Circuit schematic development and computer modeling and simulation of digital systems. Experiments explore designs with combinational and sequential logic. Students work through design activities, which include testing, troubleshooting and documentation.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|