|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Three Credits Fall and Spring Semesters Opportunity for upper-level students to do an advanced research project or investigation in a field of special interest not covered by a normally-scheduled course. Student and a full-time faculty member familiar with the student's area of interest agree on a plan of study and research and on evaluation methods. Before registering, the student must obtain the signatures of the faculty director and the Department Chairperson.
-
3.00 Credits
Three Credits Not Offered 2008-2009 An introduction to computers and programming using Visual Basic .NET. Problem solving using top-down design and procedural abstraction, visual design for the desktop and the web, databases, and fundamental hardware and software structures. Useful in any career that uses computer technology. No prerequisites.
-
4.00 Credits
Four Credits Fall Semester An introduction to programming and problemsolving using Java. Topics include: Input and Output; Selection; Repetition; Methods; Recursion; Arrays; Classes and Objects.
-
4.00 Credits
Four Credits Spring Semester Inheritance; Polymorphism; Exceptions; Stream IO; Elementary Data Structures; Graphics; Event Driven Programming. Prerequisite: CS 103.
-
3.00 Credits
Three Credits Spring Semester An exploration of how computers work: what goes on inside the computer (hardware), how to program computers (software), the Internet and communication revolution, artificial intelligence, and the limits of computation.
-
3.00 Credits
Three Credits Each Fall and Spring Semesters Discrete mathematical models for applications in computer science. Mathematical induction, graphs, trees, sets, equivalence relations, functions, and partially ordered sets. Asymptotic complexity, Big-O, and Big Omega, recursion and recurrence equations, finite and infinite sums. Predicate logic and first order logic. Basic counting methods, simple combinatorics. Probability and Markov Chains. Linear algebra, applications of linear algebra in computer science. Prerequisites: MA 126, CS 104.
-
3.00 Credits
Three Credits Each Fall and Spring Semesters Discrete mathematical models for applications in computer science. Mathematical induction, graphs, trees, sets, equivalence relations, functions, and partially ordered sets. Asymptotic complexity, Big-O, and Big Omega, recursion and recurrence equations, finite and infinite sums. Predicate logic and first order logic. Basic counting methods, simple combinatorics. Probability and Markov Chains. Linear algebra, applications of linear algebra in computer science. Prerequisites: MA 126, CS 104.
-
3.00 Credits
Three Credits Fall Semester The fundamental methods used to organize data in computer algorithms: stacks, queues, linked lists, trees, graphs, searching, and sorting. Design and analysis of algorithms. Prerequisite: CS 104.
-
3.00 Credits
Three Credits Alternate Years: Fall 2009, 2011 The basics of digital logic design. Binary representation of information, Boolean algebra, truth tables, combinatorial logic, Karnaugh maps. memory elements, flip flops, latches, registers, RAM and variations. ALU's, control logic, and finite state machines. The design of a simple computer. Gates and their implementation with transistors and integrated circuits.
-
3.00 Credits
Three Credits Spring Semester Advanced programming using Java. Multithreading. Graphical User Interfaces. Programming windows and events. Applets. Other topics may include network programming, servlets, and JDBC. Prerequisite: CS 211.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|