**
****UNT-Spring 2018**

**CSCE 4110.001: Algorithms**

**Instructor:**

Farhad Shahrokhi

Professor, Department of Computer Science & Engineering

Office: NTDP F276

Office Hours: Tuesday & Thursday 4:00 PM to 5:00 PM

**
**E-Mail: farhad.shahrokhi@unt.edu

**Instructional assistant:**

Harika Rodda

Office: NTDP F232

Office Hours: Monday & Wednesday : 2.15 PM to 3.45 PM

**
**E-Mail: harikarodda@my.unt.edu

**Class Hours:**

Tuesday & Thursday - 2.30 PM to 3.50 PM

**Class Room:**

NTDP B142

**Course Information**

**Final Exam:**

Final Exam is scheduled for **May 8, 2018, from 1:30 PM to 3.30 PM.** (Exam is closed notes and closed book. NO electronic devices are allowed including iPads, Laptops, cell phones, calculator, Watches with internet access. Class computers in front of you can not be used and must be off. All electronic devices as well as Cell phones (which also be turned off) and books, notes must be placed inside of your bags. You must put your bags next to the wall. We will provide the paper.You only need a pen.)
**An Old Test**

Mid Term Exam:

Mid term exam is scheduled for **Feb 22nd, from 2:30 PM to 3.50 PM.** (Exam is closed notes and closed book. NO electronic devices are allowed including iPads, Laptops, cell phones, calculator, Watches with internet access. Class computers in front of you can not be used and must be off. All electronic devices as well as Cell phones (which also be turned off) and books, notes must be placed inside of your bags. You must put your bags next to the wall. We will provide the paper.You only need a pen.)
The exam will have about 6 questions and you may have optional questions to choose from. You should expect questions from whatever we have covered in class including the material covered on Feb15th.

**An Old Test(mid)**

**Some Resources:**

Some basic examples of recurrence relations

Review Material from 3110

Some notes on divide & conquer and activity selection

Knapsack Algorithm

Minimum spanning tree algorithms

Dijkstra's Algorithm

Some slides for Dynamic Programming and Approximation Algorithms

**Homeworks:**

Homework 1 -90points (Due: Jan.30th, In class)

Homework 2 -40points(Due: Feb.13 in class)

Homework 3 -45points(Due: 1st March in class)

Homework 4-45points(Due: 27th March in class)

Homework 5-40points (Due: 26th April in class)

**Homework Soultions:**

Homework 1

Homework 2

Homework 3

Homework 4

**Term Project**

**Due date for Electronic Submission of the project: 10PM on April 2nd,2018**

**Term Project Description(Hard Copy due date: April 3rd,2018 In Class) **

** Instructions for Electronic Submission **

**Note: e-Mail submissions of the project are NOT accepted.**

To pick up your final exam papers, please stop by NTDP F259 (Graph Theory lab) on May 15 (Tuesday), between 10 AM - 12 PM