3013-Algorithms

Roster

Class Roster

General Course Info

• Days: TTh 12:30 p.m. - 1:50 p.m.
• Location: BO 320
• Semester: Mon January 15^th - Fri May 4^th
• Holidays:
  • Spring Break: Sat March 10^th - Sun March 18^th
  • Holiday Break: Fri March 30^th - Sun April 1^st
• Last Day for “W”: Mon March 26^th
• Final Exam: Thursday May 10^th, 10:30 p.m. - 12:30 p.m.

Topics (Maybe more, maybe less .... we'll see):

• Array Based Structures vs List Based Structures (overview)
• Array Implementations:
  • Heap (Priority-Queue)
  • Heap Sort
  • Hash Tables
• Recursion
• Balanced Trees
  • Avl
  • Red Black Trees
• Graphs:
  • DFS (Depth-First Search)
  • BFS (Breadth-First Search)
  • Dijkstra's Algorithm (One Way Shortest Path)
  • Prim's Algorithm (Minimum Spanning Tree)
  • Kruskal's Algorithm (Minimum Spanning Tree)
• Sorting:
  • Merge Sort
  • Quick Sort

Resources

• http://opendatastructures.org/ods-cpp/
• https://github.com/ippeb/ACM-ICPC

Grading:

Categories		Grade
Exams (3)1	40%	A	89-100
Programs (5-8)2	25%	B	79-88
Final4	25%	C	69-78
Github Portfolio	10%	D	59-68
		F	below 59

1. Lowest exam grade replaced by Final Exam grade (Not a "right" but a privilege based on effort and attendance).

2. Despite the low overall value of the programming portion of the course, ALL programs must be turned in running to pass the course. They don't have to be necessarily correct, but they must run and they need to at least approach the solution (a "Hello World" program will not work).

3. The worth of the "homework/quizzes" section of the course will be calculated by a function based on the number of assignments and quizzes. If zero homeworks / quizzes are assigned then they will be assigned a 0% portion. If at least 10 are assigned then the full 25% will be assigned as its weight. If the full weight is not used the class will decide how the remaining percentage points will be assigned.

4. Plane ticket prices, events like weddings, or trips out of the country are not valid excuses for missing the final exam at its scheduled time. I will not make accommodations for anything other than an issue vetted by the dean of students.

Misc:

• https://repl.it

• https://code.visualstudio.com/download

• Attending class is one of the primary keys to doing well in this class. Students may be dropped for excessive absences. There is no distinction made between excused and unexcused.

• Make-up exams are not given. If I see fit, then I will replace a missed exam with your final exam test grade. If you do miss an exam without prior approval, a letter from the dean of students will be needed as an excuse.

• A number of programming assignments will be made to code and execute. Microsoft Visual Studio 2015 / 2017 is recommended or just Visual Studio Code.

• Programs containing syntax errors are unacceptable and will be returned without grading (your programs must work). All submitted programs need to be submitted via Github.

• Periodically homework assignments will be taken up and graded. It is the student's responsibility to keep up with assignments and to ask questions over the assigned work, even if absent. All homework assignments are due at the specified time that may or may not be in conjunction with a class day. All assignments / homeworks will be uploaded via Github.