Fall 2019 - CMPT 307 D200
Data Structures and Algorithms (3)
Class Number: 8909
Delivery Method: In Person
Course Times + Location:
Mo, We, Fr 12:30 PM – 1:20 PM
AQ 3003, Burnaby
Exam Times + Location:
Dec 8, 2019
12:00 PM – 3:00 PM
SWH 10081, Burnaby
1 778 782-3780
Prerequisites:CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.
Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms.
The objective of this course is to introduce concepts and problem-solving techniques that are used in the design and analysis of efficient algorithms. This is done by studying various algorithms, algorithmic techniques, and data structures.
COURSE-LEVEL EDUCATIONAL GOALS:
- Introduction and Mathematical Preliminaries (Review): Models of Computation, Big-O Analysis
- Searching and Sorting: Divide & Conquer Paradigm, Analysis of Recurrences, Master Method
- Sorting and Order Statistics: Heapsort, Quicksort, Non-comparison sorts, Lower bounds, Median
- Randomized algorithms, Average case analysis
- Simple Data Structures: Lists, Stacks, Queues, Trees
- Dictionaries and Priority Queues: (Balanced) Binary search trees, Heaps
- Graphs: Representations, Path Searching, Spanning Trees
- Amortized Analysis: Aggregate, Accounting, Potential Methods
- Optimization Problems: Dynamic programming, Greedy algorithms
The course has a final examination, homework assignments, and quizzes or midterms. The grade distribution will be announced during the first week of classes.
Students must attain an overall passing grade on the weighted average of exams in the course in order to obtain a clear pass (C- or better).
MATERIALS + SUPPLIES:
- Algorithm Design , J. Kleinberg, E. Tardos, Addison-Wesley, 2006, 9780321295354
Introduction to Algorithms (3rd Edition)
T.H. Cormen, C.E. Leiserson
R.L. Rivest, C. Stein
SFU’s Academic Integrity web site http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating. Check out the site for more information and videos that help explain the issues in plain English.
Each student is responsible for his or her conduct as it affects the University community. Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS