BIT 115
Introduction to Programming

This introductory programming class emphasizes problem solving through exploration of computer programming, variable typing and assignment, basic control structures loops, branches, functions, subprograms and arrays. Students also explore how human culture affects the use of computer programs. Prerequisite(s): Completion of MATH 095 with a grade of 2.0 or higher. Placement by testing – Technology Placement Exam.

------------------------------------------------------------------------------------------------------------------------------------

BIT 116
Scripting

In learning JavaScript, students will apply their programming skills to develop web pages, including loops, conditionals, arrays and functions. Students are introduced to the JavaScript object model, user-defined objects, event handlers, forms, and cascading style sheets. Prerequisite(s): Completion of BIT 115 with a grade of 2.0 or higher.

------------------------------------------------------------------------------------------------------------------------------------

BIT 142
Intermediate Programming

Q - This is a first course in computer science using a language such as C#. This course covers variable types, control structures, functions, modular programming, pointers/references/etc., arrays, structures and an introduction to recursion. The course will introduce basic sorting and searching algorithms. The emphasis of this course will be program design, algorithmic (variables, expressions, statements), and abstraction (data types, functions). Prerequisite(s): Completion of one of the following: MATH 107, MATH 110, MATH 115, MATH 135 or PHIL 120 with a grade of 2.0 or higher. Completion of BIT 116 with a grade of 2.0 or higher.

------------------------------------------------------------------------------------------------------------------------------------

BIT 143
Programming-Data Structures

This course extends the fundamentals covered in Intermediate Programming. The course will cover program specification and design, abstract data types and classes. Topics will include dynamic arrays, stacks, queues, linked lists, binary trees and recursion. Taught in C#. Prerequisite(s): Completion of BIT 142 with a grade of 2.0 or higher.