main navigation
my pace

100

CS 113 Mathematical Structures for Computer Science

Course Description: Mathematical logic: propositional logic, predicate logic, program loop invariants and correctness proof, Boolean algebra and its application in the design of combinatorial circuits; set theory: operations, counting, relations, functions, partial/full ordering; introduction to graph theory: basic and weighted graphs, paths, and trees.

Course Rotation: NY and PL: Fall

4 credits

Prerequisites

MAT 103 Minimum Grade of C or Math Placement 40

CS 121 Computer Programming I

Course Description: Introduction to Java programming and computer science concepts. Java environment setting up. Variables, basic built-in data types and arrays. Expressions. Assignment, conditional and iterative statements. Computation abstraction and reuse with methods and objects. Parameter passing. String processing. Exception handling. Text file I/O. Problem-solving through course projects.

Course Rotation: Fall and Spring.

4 credits

Prerequisites

###############################################################################################################################################################################################################################################################

CS 122 Computer Programming II

Course Description: Java packages. Abstract classes and interfaces. Class inheritance and polymorphism. Recursion and linked lists. Object modeling and UMI. Event-driven programming and basic GUI design. Multi-threading and thread synchronization. Problem-solving through course projects.

Course Rotation: Fall and Spring.

4 credits

Prerequisites

CS 121 Minimum Grade of C

CS 199V Topic: Formal Discrete Structures

Prerequisite: MAT 130 or equivalent.

Course Description: Students study a number of topics in discrete mathematics. One of the topics is an initial discussion of formal methods, a logical approach to writing computer programs. Students also study an introduction to mathematical logic (propositional and predicate calculus), mathematical induction, theory of sets, theory of integers and sequences, along with some introduction to graph theory. Mathematical logic is treated as an integral part of each topic of the course. A semiautomatic theorem prover is used to assist students in proving theorems.

4 credits

Prerequisites

MAT 130 Min Grade D