TUTORING SIGN-UP FORM

 

TUTORING SERVICES

Tutoring Services

AVAILABLE CLASSES

COP 2210 – Programming 1 A first course in computer science that uses a structured programming language to study programming and problem solving on the computer. Includes the design, construction and analysis of programs. Student
participation in a closed instructional lab is required.

COP 3337 – Programming 2 An intermediate level course in Object-Oriented programming. Topics include primitive types, control structures, strings, arrays, objects and classes, data abstraction inheritance polymorphism and an introduction
to data structures.

COP 4338 – Computer Programming III Programming in C and advanced programming in Unix environments, including multiprocessing and multi-threading.

COP 2250 – Programming in Java A first course in Programming for IT majors. Syntax and semantics of Java. Classes and Objects. Object Oriented program development. Not acceptable for credit for Computer Science majors.

COP 3804 – Intermediate Java A second course in programming. Continues Programming in Java by discussing object-oriented programming in more detail, with larger programming projects and emphasis on inheritence. Not acceptable for
credit for CS majors.

CDA 3103 – Fundamentals of Computing Systems
Overview of the computer systems organization. Data representation. Machine and assembly language programming.

CDA 4101 – Structured Computer Organization Covers the levels of organization in a computer. Design of memory, buses, ALU, CPU; design of micro-program. Covers virtual memory, I/O, multiple processes, CISC, RISC and parallel architectures.

COP 4710 – Database Management Logical aspects of databases. Topics include Semantic Binary, Relational, Network, and Hierarchical Models, E-R Model, Database design; SQL; Physical Database Organization; Deductive or Rule – based Databases; Fourth – Generational Language.

COT 3541 – Logic for Computer Science An introduction to the logical concepts and computational aspects of propositional and predicate logic, as well as to concepts and techniques underlying logic programming, in particular, the
computer language Prolog.

MAD 2104 – Discrete Mathematics  Sets, functions, relations, permutations, and combinations, propositional logic, matrix algebra, graphs and trees, Boolean algebra, switching circuits. Prerequisites: MAC 1105

COP 3530 – Data Structures and Algorithms Basic concepts of data organization, running time of a program, abstract types, data structures including linked lists, n-ary trees, sets and graphs, internal sorting.

MAD 3512 – Theory of Algorithms Strings, formal languages, finite state machines, Turing machines, primitive recursive and recursive functions, recursive unsolvability. Prerequisite: MAD 2104. Computer Science majors must also take
COT 3420. (F,S,SS)

MAC 1140 – Pre Calculus Algebra This course covers polynomials; rational functions; logarithmic, exponential, and piece-wise defined functions; inequalities; conic sections; determinants; sequence and series; mathematical induction; binomial theorem.

MAC 2311 – Calculus 1 Introduction to derivatives, differentiation formulas, differentials, applications of the derivative; introduction to anti-derivatives. Prerequisite: Trigonometry or MAC 2132, with a grade of C or better. (F,S,SS)

MAC 2312 – Calculus 2 Riemann sums, techniques of integration, applications of the integral, improper integrals, infinite series, Taylor series, polar and parametric functions. Prerequisite: MAC 2311, with a grade of C or better.
(F,S,SS)

STA 3033 – Introduction to Probability and Statistics for CS Basic probability laws, probability distributions, basic sampling theory, point and interval estimation, tests of hypotheses, regression and correlation.