|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
(Also MTH 228) 3 class hours, 3 laboratory hours; 4 credits Elementary set theory, functions, relations, and Boolean algebra. Elements of graph theory, matrix representation of finite functions and graphs, and matrix manipulation. Switching circuits, gating networks, and finite state machines. Applications of graph theory to computer science. Related algorithms. Introduction to combinatorial computing. Prerequisites: CSC 211; MTH 123 or MTH 130 or MTH 230 or MTH 231 or MTH 235
-
6.00 Credits
6 hours; 4 credits Programming elements: operators, flow control, repetition, selection, logical conditions, arrays, data import, vectors, matrices, functions. Introduction to numerical techniques using scientific software: graphing, integration, roots of equations, linear equations, eigenvectors, eigenvalues, interpolation, signal processing. Not open to students who have successfully completed CSC 120 or CSC 126. Prerequisite: MTH 231
-
3.00 Credits
3 class hours, 3 laboratory hours; 4 credits Files and file structures. Physical versus logical files. Secondary storage devices and system software. Input/output and access techniques. File organizations, indexing and processing. The capabilities of file handling in at least one higher-level programming language will be explored. Prerequisite: CSC 126
-
3.00 Credits
3 class hours, 3 laboratory hours; 4 credits Organization and processing of various types of information. Storage allocation techniques. Linear list structures including stacks and queues, deques, rings, and linked arrays. Tree structures and multi-linked structures. Advanced sorting and searching techniques. Scatter storage techniques. Recursive programming. Prerequisites: CSC 211 or ENS 336; a knowledge of C programming language
-
3.00 Credits
3 class hours, 3 laboratory hours; 4 credits Large-scale software design issues, object-oriented design paradigms, encapsulation, polymorphism, inheritance, reusability, and specifics of an object-oriented language and associated development tools. Students will be required to implement a substantial and well-engineered project using an object-oriented language. Prerequisite: CSC 326
-
3.00 Credits
3 class hours, 3 laboratory hours; 4 credits Introduction to operating systems. Task management and scheduling. Process and data management. Interrupts. Resource allocation and management. Time sharing. Deadlock mutual exclusion, and synchronization. Case studies of typical operating systems. Prerequisites: CSC 220 or ENS 362, and CSC 326
-
4.00 Credits
4 hours; 4 credits The course covers concepts of hardware and software systems and programming concepts common to the corporate data processing environment. Topics include fundamentals of hardware and software, rudiments of operating systems, and communication between microcomputers and mainframes. Various software application and utility packages utilizing both mainframes and microcomputers will be studied. Prerequisite: CSC 310
-
4.00 Credits
4 hours; 4 credits Codes—error checking and correcting capabilities. Boolean algebra, minimization of combinational circuits. Definition and representation of finite state automata and sequential machines. Equivalence of states and machines, congruence, reduced machines, and analysis and synthesis of machines. Prerequisites: CSC 220
-
4.00 Credits
4 hours; 2 credits The design and implementation of circuitry found in modern computers. Physical realizations of minimized switching functions. Design and implementation of finite state machines including synchronous sequential circuits and asynchronous sequential circuits. Prerequisite: CSC 346
-
4.00 Credits
4 hours; 4 credits Algorithm development, including running time analysis and correctness arguments. Topics include: asymptotic notation and complexity analysis; use of mathematical techniques to determine the computational complexity of algorithms such as sorting and searching. The course provides an introduction and analysis of elementary graph algorithms and programming techniques such as greedy, backtracking, and dynamic programming. Projects will be assigned to correlate the computational complexity and real-time execution time of the algorithms. Prerequisites: CSC 326 and CSC/MTH 228 Pre- or corerequisite: MTH 311
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Cookies Policy |
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|