Computer Science (CS)

This course teaches introductory skills in computer programming using a high-level computer programming language. There is an emphasis on both the principles and practice of computer programming. Covers principles of problem solving by computer and requires completion of a number of programming assignments. Lecture: 3 credits (45 contact hours).

The course covers introductory object-oriented problem solving, design, and programming engineering. Fundamentals elements of data structures and algorithm design will be addressed. An equally balanced effort will be devoted to the three main threads in the course: concepts, programming language skills, and rudiments of object-oriented programming and software engineering. Lecture: 4 credits (60 contact hours).

Software engineering topics include: life cycles, metrics, requirements specifications, design methodologies, validation and verification, testing, reliability and project planning. Implementation of large programming projects using object-oriented design techniques and software tools in a modern development environment will be stressed. Lecture: 3 credits (45 contact hours).

This course covers the theory and implementation of commonly used data structures and their related algorithms. Emphasis will be placed on implementing data structures and on advanced programming language concepts related to these implementations. Topics include linear data structures (stacks, queues, hash tables, etc.), non-linear data structures (trees and graphs), and techniques for analyzing the performance of data structures (Big-O notation). Lecture: 3 credits (45 contact hours).

Implementation of substantial programming projects using object-oriented design techniques and software tools for development, maintenance, and testing in a modern development environment. Using and interacting with low-level operating system facilities, including filesystems and processes. Lecture: 3 credits (45 contact hours).

Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions, Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees. Lecture: 4 credits (60 contact hours).