Description
This is an advanced course in computer science, studying different ways of processing data using various structures and algorithms. This course covers data structures such as heaps, trees, graphs as well as their applications in the construction of efficient algorithms for select, sort, balance, match, etc. Advanced topics such as dynamic programming, network flow, and linear programming are also discussed. Prerequisites: CS171, CS224, mathematical maturity.
Topics:
Fundamentals of Algorithm Design and Analysis
Worst case analysis of algorithms
Asymptotics and nonlinear recurrence relations
Sorting algorithms
Order Statistics
Divide and Conquer paradigm
Dynamic Computing paradigm
Greed paradigm
Amortized analysis
Topics:
Fundamentals of Algorithm Design and Analysis
Worst case analysis of algorithms
Asymptotics and nonlinear recurrence relations
Sorting algorithms
Order Statistics
Divide and Conquer paradigm
Dynamic Computing paradigm
Greed paradigm
Amortized analysis
General Information
Hours
TTh 14:30 - 15:45
Instructor
Avani Wildani (Dr. Will) (avani@mathcs.emory.edu)
Pranav Bhandari (TA) (pranav.bhandari@emory.edu)
Pranav Bhandari (TA) (pranav.bhandari@emory.edu)
Textbook
The official course textbook is Introduction to Algorithms, 3rd edition, by Cormen et al. . This is one of those books that you will be keeping and referring to for the rest of your careers, so I highly recommend you get your own copy.
One of the textbook authors also contributed to this excellent Khan Academy course. We’ll be referencing this throughout the semester:
https://www.khanacademy.org/computing/computer-science/algorithms
One of the textbook authors also contributed to this excellent Khan Academy course. We’ll be referencing this throughout the semester:
https://www.khanacademy.org/computing/computer-science/algorithms
Grading
Homework assignments: 50% - Weekly!
Midterm #1: 25%
Midterm #2: 25%
Final exam: 25%
Lowest 25% is dropped.
Your work is governed by the Emory Honor Code and the Math/CS SPCA. Honor code violations on any submission will be referred to the Emory Honor Council.
Midterm #1: 25%
Midterm #2: 25%
Final exam: 25%
Lowest 25% is dropped.
Your work is governed by the Emory Honor Code and the Math/CS SPCA. Honor code violations on any submission will be referred to the Emory Honor Council.
Homework
Homework will be posted to Piazza every Tuesday after class and will be due by the start of class the following Tuesday. Typically, we will spend the beginning of Tuesday lectures going over last week’s homework, so there will be no credit for late assignments. In addition, I will provide solution keys to homework assignments in class as a study aid. These solution keys are not to be distributed, as per the honor code.
Homework in this class often will take some time to process. Start early. A typical problem set is designed to take from 8-12 hours, but this is a high variance estimate. There will be some extra credit offered throughout the term, but it will only count if the associated homework is complete and on time.
The homeworks will also be hard. Come to office hours!
Homework in this class often will take some time to process. Start early. A typical problem set is designed to take from 8-12 hours, but this is a high variance estimate. There will be some extra credit offered throughout the term, but it will only count if the associated homework is complete and on time.
The homeworks will also be hard. Come to office hours!
Collaboration
alking through problems with each other is great! There are 2 caveats:
If you work with another student, you MUST write their name on your homework as a collaborator
You can discuss assignments to your heart’s content, but everyone must type up their OWN homework.
If you work with another student, you MUST write their name on your homework as a collaborator
You can discuss assignments to your heart’s content, but everyone must type up their OWN homework.
| Name | Office Hours | |
|---|---|---|
Avani Wildani | When? Where? | |
Pranav Bhandari | When? Where? |