Fall 2014 Courses

  • The College Catalogue has a class finder tool to search for courses by title, instructor, department, and more.
  • Login to Blackboard. Instructional materials are available on a course-by-course basis.
CSCI 1101A. Introduction to Computer Science.
What is computer science, what are its applications in other disciplines, and what is its impact in society? A step-by-step introduction to the art of problem solving using the computer and programming. Provides a broad introduction to computer science and programming through real-life applications. Weekly labs provide experiments with the concepts presented in class. Assumes no prior knowledge of computers or programming.
CSCI 1101B. Introduction to Computer Science.
What is computer science, what are its applications in other disciplines, and what is its impact in society? A step-by-step introduction to the art of problem solving using the computer and programming. Provides a broad introduction to computer science and programming through real-life applications. Weekly labs provide experiments with the concepts presented in class. Assumes no prior knowledge of computers or programming.
CSCI 2101. Data Structures.
Solving complex algorithmic problems requires the use of appropriate data structures such as stacks, priority queues, search trees, dictionaries, hash tables, and graphs. It also requires the ability to measure the efficiency of operations such as sorting and searching in order to make effective choices among alternative solutions. Offers a study of data structures, their efficiency, and their use in solving computational problems. Laboratory exercises provide an opportunity to design and implement these structures. Students interested in taking Computer Science 2101 are required to pass the computer science placement examination before class starts.
CSCI 2200. Algorithms.
An introductory course on the design and analysis of algorithms. Introduces a number of basic algorithms for a variety of problems such as searching, sorting, selection, and graph problems (e.g., spanning trees and shortest paths). Discusses analysis techniques, such as recurrences and amortization, as well as algorithm design paradigms such as divide-and-conquer, dynamic programming, and greedy algorithms.
CSCI 2310. Operating Systems.
An introduction to operating systems concepts, design, and implementation. Operating systems (OS) are essential to any computer system and, although we have witnessed rapid changes in applications and in the use of computers, the fundamental concepts that underlie an OS remain the same. Students get hands-on experience experimenting with Linux, a real, widely used, open source OS. However, the core concepts are applicable to most operating systems: Windows, OS X, FreeBSD, Solaris. Compares differences in design choices among these other systems. Topics include process management (scheduling, threads, interprocess synchronization, and deadlocks), main memory and virtual memory, file and I/O subsystems, and the basics of OS protection and security.
CSCI 2325. Principles of Programming Languages.
Focuses on different paradigms for solving problems, and their representation in programming languages. These paradigms correspond to distinct ways of thinking about problems. For example, “functional” languages (such as Haskell) focus attention on the behavioral aspects of the real-world phenomena being modeled; “logic programming” languages (such as Prolog) focus attention on the declarative aspects of problem-solving. Covers principles of language design and implementation including syntax, semantics, type systems, control structures, and compilers.
CSCI 2400. Artificial Intelligence.
Explores the principles and techniques involved in programming computers to do tasks that would require intelligence if people did them. State-space and heuristic search techniques, logic and other knowledge representations, reinforcement learning, neural networks, and other approaches are applied to a variety of problems with an emphasis on agent-based approaches.
CSCI 3225. GIS Algorithms and Data Structures.
Geographic information systems (GIS) handle geographical data such as boundaries of countries; course of rivers; height of mountains; and location of cities, roads, railways, and power lines. GIS can help determine the closest public hospital, find areas susceptible to flooding or erosion, track the position of a car on a map, or find the shortest route from one location to another. Because GIS deal with large datasets, making it important to process data efficiently, they provide a rich source of problems in computer science. Topics covered include data representation, triangulation, range searching, point location, map overlay, meshes and quadtrees, terrain simplification, and visualization.