|
Credit Course Descriptions (Spring 2008)
CS 180Introduction to Artificial Intelligence (3 CR) Prerequisite: CIS 145 or DP 145 or CIS 148 or DP 148 or CIS 150 or DP 150 or CS 200 Upon successful completion of this course, students should be able to
understand simple computer programs illustrating introductory concepts in
artificial intelligence, define terms and application areas in the field
and describe knowledge representation and problem-resolution techniques
used in artificial intelligence. 3 hrs. lecture/wk. CS 200Concepts of Programming Algorithms Using C++ (4 CR) Prerequisite: CIS 134 or ENGR 171 or equivalent experience This course emphasizes programming methodology and problem solving.
Algorithm design and development, data abstraction, good programming
style, testing and debugging will be presented. An appropriate
block-structured high-level programming language will be studied and used
to implement algorithms. 3 hrs. lecture, 2 hrs. lab by arrangement/wk.
Four-credit-hour CS courses have two hours of open lab per week. CS 201Concepts of Programming Algorithms using C# (4 CR) Prerequisite: CIS 134 or ENGR 171 or equivalent experience This course emphasizes programming methodology and problem-solving using
C#. Algorithm design and development, data abstraction, good programming
style, testing and debugging will be presented. 3 hrs. lecture, 1.5 hrs.
lab/wk. Four credit hours CS courses have two hours of open lab per
week. CS 205Concepts of Programming Algorithms using JAVA (4 CR) Prerequisite: CIS 134 or ENGR 171 or equivalent experience This course emphasizes programming methodology and problem-solving using
Java. Algorithm design and development, data abstraction, good
programming style, testing and debugging will be presented. 3 hrs.
lecture, 1.5 hrs. lab/wk. Four-credit-hour CS courses have two hours of
open lab per week. CS 210Discrete Structures I (3 CR) Prerequisites: MATH 171 or both MATH 116 and CIS 134 or appropriate math assessment scores Upon successful completion of this course, the student should be able to
use fundamental discrete mathematics as it relates to computers and
computer applications. The student will be exposed to a variety of
discrete mathematical topics. The course will include fundamental
mathematical principles, combinatorial analysis, mathematical reasoning,
graphs and trees, and Boolean logic circuits. 3 hrs. lecture/wk. CS 211Discrete Structures II (3 CR) Prerequisite: CS 210 Upon successful completion of this course, the student should be able to
use fundamental discrete mathematics as it relates to computers and
computer applications. The student will experiment with a variety of
discrete mathematical topics. The course will include fundamental
mathematical principles, combinatorial analysis, mathematical reasoning,
graphs and trees, and Boolean logic circuits. 3 hrs. lecture/wk. CS 250Basic Data Structures using C++ (4 CR) Prerequisite:CS 200 Prerequisite or corequisite: CS 210 for students transferring to most four-year computer science programs This course will cover advanced programming topics using C++. Files,
recursion, data structures and large program organization will be
implemented in projects using object-oriented methodology. Students will
write programs using the concepts covered in the lecture. 3 hrs. lecture,
2 hrs. lab/wk. Four-credit-hour CS courses have two hours of open lab per
week. CS 255Basic Data Structures using JAVA (4 CR) Prerequisite: CS 205 This course will cover advanced programming topics using Java. Files,
recursion, data structures and large program organization will be
implemented in projects using object-oriented methodology. Students will
write programs using queues, stacks, lists and other concepts covered in
the lecture. 3 hrs. lecture, 1.5 hrs. lab/wk. Four-credit-hour CS courses
have two hours of open lab per week. |