- Teacher: Steven Benzel

Category: Spring 2017

- Teacher: Steven Benzel

Category: Spring 2017

- Teacher: Anja Remshagen

Category: Spring 2016

- Teacher: James Church

Category: Spring 2015

- Teacher: Anja Remshagen

Category: Spring 2014

- Teacher: Anja Remshagen

Category: Spring 2013

- Teacher: Anja Remshagen

Category: Fall 2012

- Teacher: Anja Remshagen

Category: Fall 2011

- Teacher: Anja Remshagen

Category: Spring 2010

An integrated approach to the study of data structures, algorithm analysis, and discrete mathematics. Topics include: induction and recursion, time and space complexity, and big-O notation, propositional logic, proof techniques, sorting, mathematical properties of data structures, including lists.

- Teacher: Anja Remshagen

Category: Spring 2006

An integrated approach to the study of data structures, algorithm analysis, and discrete mathematics. Topics include: induction and recursion, time and space complexity, and big-O notation, propositional logic, proof techniques, sorting, mathematical properties of data structures, including lists.

Pre-requisites: CS1302 and MATH 1634

View the Department Course Profile

Pre-requisites: CS1302 and MATH 1634

View the Department Course Profile

- Teacher: Anja Remshagen

Category: Spring 2005

The course covers fundamental concepts of computer networks. Topics include: OSI model; LAN/WAN architecture & design; network services and protocols such as TCP/IP, IPv6, mobile IP; DNS, ICMP, telnet, ftp, etc; distributed object systems; and collaboration technology and groupware. Students are expected to complete a project that covers the essentials of set-up, configuration and administration of multi-protocol servers and clients.

Pre-requisites: CS3151 and CS3211

View the Department Course Profile

Pre-requisites: CS3151 and CS3211

View the Department Course Profile

- Teacher: Muhammad Rahman

Category: Spring 2005

An integrated approach to the study of data structures, algorithm analysis, and discrete mathematics. Topics include: induction and recursion, time and space complexity, and big-O notation, propositional logic, proof techniques, sorting, mathematical properties of data structures, including lists.

Pre-requisites: CS1302 and MATH 1634

Pre-requisites: CS1302 and MATH 1634

Category: Spring 2004

You are not logged in. (Log in)