|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Introduces basic computer security concepts and methods. Explains concerns regarding computer security, describes methods to provide various forms of computer security, and implement some of these methods. Primarily based on UNIX/Linux (for uniformity and security issues) but also explains Windows-based concepts when applicable. Pre- or co-requisite: CS215. Spring semester, even-numbered years. 3 credits. Fee.
-
3.00 Credits
Concepts of boolean algebra, gates, simplification of logical expressions, karnaugh maps, flip-flops, clocked circuits, shift registers, counters, state diagrams, half-adders, full-adders, parallel binary adders,1’s complement and 2’s complement addition,BCDadders, carry-look-ahead adders, multiplication, random-access memories, decoders, multiplexers, input-output devices, the control unit, and microprogramming. Students will learn the IBM PC assembly language. Prerequisites: CS140 or CS220, and MA205. Spring semester, even-numbered years. 3 credits. Fee.
-
3.00 Credits
The topics in this course include: definitions and implementations of basic data structures including arrays, stacks, queues, and linked lists; recursion as an algorithm design tool; searching and sorting algorithms and their designs, implementations, and applications; advanced data structures including balanced trees, graphs, tree and graph traversal, and their applications; file management techniques including hashing and indexing. Students will use the programming language C. Prerequisites: CS140 and MA205. Fall semester, odd-numbered years. 3 credits. Fee.
-
3.00 Credits
This course in an introduction to the essentials of computer graphics knowledge. The student will be given an extensive explanation for each drawing technique and the algorithms behind it. Both drawing and animation will be studied. Various computer software will be used with an emphasis placed on C. Prerequisite: CS220 or CS290. Spring semester, even-numbered years. 3 credits. Fee.
-
3.00 Credits
The concepts and methods of system analysis are introduced. A detailed case study is considered, processed from the initial specifics of the system requirements through analysis and design. Structured techniques are stressed,and communications skills are emphasized by required progress reports. Prerequisites: CS220 or CS290. Fall semester, even-numbered years. 3 credits.
-
1.00 Credits
Study of ethical questions that arise as a consequence of the development and implementation of computing technologies. Students will study the issues and problems that have arisen with the rapid growth of information technology and will explore ways of reaching wise solutions to these problems. Prerequisite: CS115 or CS130. Fall semester, even-numbered years. 1 credit.
-
3.00 Credits
Students will acquire a working knowledge of the basics to the three operating systems commonly used in industrial and academic settings:Windows,Apple OS, and Linux/Unix. The course covers the fundamental attributes of each operating system. Prerequisite: CS110. Summer, even-numbered years. 3 credits. Fee.
-
3.00 Credits
An introduction to the fundamentals of operating systems. Topics include interprocess communication, process scheduling, deadlocks, memory management, virtual memory, file systems, and distributed systems. Formal principles are illustrated with examples from various operating systems. Prerequisites: CS215 or CS220 or CS290. Spring semester, even-numbered years. 3 credits. Fee.
-
3.00 Credits
Introduction to the design and analysis of computer algorithms. Topics include fundamental algorithms, mathematical tools for analyzing algorithms, and strategies for designing algorithms. Fundamental algorithms include graph algorithms, and algorithms for sorting, searching, hashing, integer arithmetic, and selected combinatorial tasks. Mathematical tools include asymptotic notations and methods for solving recurrences. Algorithm design strategies include scanning, greedy method, divide and conquer, dynamic programming, and randomization. Prerequisites: CS220 or CS290, and MA130. Fall semester, odd-numbered years. 3 credits. Fee.
-
3.00 Credits
Topics include: regular grammers, finite automata, context-free grammers, push-down automata, and Turing machines. Introductory treatment of computable and non-computable functions. Halting problems will also be covered. Prerequisite: CS220 or CS290. Spring semester, even-numbered years. 3 credits. Fee.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|