Fall 2018

CSCE 5150.001: Algorithms

Instructor:

Farhad Shahrokhi

Professor, Department of Computer Science & Engineering

Office: NTDP F276

Office Hours: Tuesday and Thursday 1:00PM-2:00PM or by appointment

E-Mail: farhad.shahrokhi@unt.edu

Instructional Assistant:

Maloku, Latif

Office: NTDP F232 (help lab)

Office Hours: Monday and Wednesday 12:00PM-1:00PM

E-Mail: latifmaloku@my.unt.edu


Class Hours: Tuesday & Thursday 4:00 PM-5:20 PM

Class Room: NTDP B158

Course Information

Old Mid-Term Test

Homework:

Homework 1

Homework 2 (Due: October 4th)

Homework 3 (Due: October 23)

Homework 4 (Due: Novemeber 1)

Homework 5 (Due: Novemeber 20)

Homework 5 solutions (Due: Novemeber 20)

Homework 6 (Due: Novemeber 27)

Homework 6 solutions (Due: Novemeber 20)

Resources:

Some notes on divide & conquer and activity selection

Elementary Graph Algorithms

Longest Path

Lecture Notes on Chromatic number of a Graph

Some slides for Dynamic Programming and Approximation Algorithms

Some problems and their solutions

Lecture notes on Network Flows

Lecture notes on Turing Machines

Lecture notes on NP-completeness

Lecture notes More NP-completeness

Lecture notes on SAT

Approximability

Selection

Parictice Questions

Final Exam Study Guide

Final exam will be held on 13th December, 2018 from 1:30 PM - 3:30 PM (Exam will be closed book, closed notes and no electronic devices allowed.If you bring your cell phone, the cell phone must be turned off and it must be placed in your backpack.)