## Class: CS251 Data Structures And Algorithms (Fall 2017)

##

### Lecture room: Mathematical Sciences Building, room 175

### Lecture times are MWF: 9:30-10:20am (Atallah) 10:30-11:20am (Tricoche)

## Instructors:

##

###
Mikhail (Mike) Atallah) Office: LWSN 2116D Email: matallah@purdue.edu Office Hours: After the end of each class

###
Xavier Tricoche Office: LWSN 3154P Email: xmt@purdue.edu Office Hours: MWF 1:00-2:00pm

## Course objective:

The goal of the course is to provide students with knowledge of the techniques used for
designing data structures and algorithms, analyzing their time and space requirements, and
using them to efficiently solve important practical problems. That knowledge includes both
theoretical and implementation aspects of data structures and algorithms.

## Course work weights that will be used for letter-grade computation:

### 40% for projects (5 x 8%)

### 10% for homework (2 x 5%)

### 20% for midterm exam

### 25% for final exam

### 5% for quizzes

## News items:

### * Final exam is an evening exam, on Dec 13 - 7-9pm in EE 129 and MATH 175

### * To compensate for the evening midterm, we'll cancel the classes of October 30 and November 20

## Project and homework assignments:

###
Homework 1 (filled scantron due 10/2/2017)

###
Homework 2 (filled scantron due 12/1/2017)

## Solution keys to some quizzes, homework, etc:

## Teaching materials:

### Textbook: Algorithms, 4th Edition, Robert Sedgewick and Kevin Wayne

### Slides used in lectures (copyrighted to textbook authors):

#### From this point on we cover the remaining topics in a different order: Geometric Search, Dynamic Programming,
Reductions, Substring Search, Regular Expressions (as much as time allows, but in that order)