|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
This course introduces computer organization using several levels of abstraction to represent a simple computer, starting with logic gates, progressing to assembly language, and ending with a high-level programming language.The course concludes with the design of an assembler/simulator for the model computer.(Prerequisite: CS 142) Three credits.
-
3.00 Credits
For course description see MA 231 Discrete Mathematics.
-
3.00 Credits
This course presents problem solving with abstract data types such as lists, linked lists, stacks, queues, graphs, and trees.The close connection between data and algorithms is stressed.(Prerequisite: CS/MA 142 or CS 132) Three credits.
-
3.00 Credits
This course introduces object-oriented programming using the C++ programming language.The first part of the course introduces C++ extensions the C language such as stream input/output, classes, and operator overloading.The second part of the course focuses on design of a graphics interface and illustrates the object-oriented programming concepts of inheritance, object constructors/destructors, and message passing.Three credits.
-
3.00 Credits
This course focuses on the object-oriented design methods using a modern object-oriented programming language like Java.Students will learn how to design Applets that can be run on web pages as well as Java applications.Topics examined include graphical user interfaces (GUI), inheritance, polymorphism, exception handling, file input/output (I/O), threads, UML, interfaces, graphics, and networking basics.(Prerequisite: CS 232) Three credits.
-
3.00 Credits
This course examines the theory of logic design including gates, timing diagrams, truth tables, design of basic arithmetic operations, and control mechanisms, as well as general properties of major hardware components (central processing unit, arithmetic-logic unit, memory, input/output devices) and communication between them (buses, interrupts).Surveys actual computer systems.(Prerequisite: CS 221) Three credits.
-
3.00 Credits
This course reviews conventional logic design using MSI building blocks: multiplexers, decoders, comparators, arithmetic-logic units, registers, and memory.It intro-duces microprocessor controllers, applying them to the design of several small projects such as a serial-parallel converter, a four-function calculator, and a traffic-light controller.Students design a process controller as a final project.(Prerequisite: CS 221) Three credits.
-
3.00 Credits
This course introduces the major system utilities of a general-purpose computer: editors, assemblers, interpreters, linkers, loaders, and compilers.The course then presents the operating system for the computer: command language, access and privacy, management of processes, memory, and input/output devices.(Prerequisite: CS 232) Three credits.
-
3.00 Credits
This course explores what computers can and can't do, although it does not require any background in computer science or programming.Topics include finite state machines, push-down automata, Turing machines and recursive functions; mechanisms for formal languages, such as regular grammars, context-free grammars, context-sensitive grammars; and decidable versus undecidable problems.Also listed as CS 342.(Prerequisite: MA 231 or permission of the department chair) Three credits.
-
3.00 Credits
Like CS 342, this course is interested in how computers can solve problems.When doing a computation, two resources are in great demand - time and memory.If solving a problem takes too much time or too much memory, then it will be very difficult to get an answer.This course looks at how to design algorithms so that the algorithms include their use of time and memory.Topics include algorithm complexity measures, determination of upper bounds and mean performance of algorithms, determination of lower bounds for problems, and NP completeness.(Prerequisite: CS 232) Three credits.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|