Fall 2023 - CMPT 307 E100
Data Structures and Algorithms (3)
Class Number: 7926
Delivery Method: In Person
Course Times + Location:
Sep 6 – Dec 5, 2023: Mon, 5:30–6:50 p.m.
Oct 10, 2023: Tue, 5:30–6:50 p.m.
Sep 6 – Dec 5, 2023: Wed, 5:30–6:50 p.m.
Exam Times + Location:
Dec 10, 2023
Sun, 7:00–10:00 p.m.
Instructor:Kay C Wiese
Prerequisites:CMPT 225, (MACM 201 or CMPT 210), (MATH 150 or MATH 151), and (MATH 232 or MATH 240), all with a minimum grade of C-. MATH 154 or MATH 157 with a grade of at least B+ may be substituted for MATH 150 or MATH 151.
Design and analysis of efficient data structures and algorithms. General techniques for building and analyzing algorithms (greedy, divide & conquer, dynamic programming, network flows). Introduction to NP-completeness.
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, data structures, and application
- Algorithms with Numbers: Asymptotics, Arithmetic, Cryptography, Hashing, Randomization
- Divide-and-Conquer: Recurrences, Sorting, Selection, Lower bounds, Fast Fourier Transform
- Graphs: Graph Searches and Applications, Trees, Shortest paths, Priority queues and heaps
- Greedy Algorithms: Spanning trees, Disjoint sets, Amortized analysis, Huffman encoding
- Dynamic Programming: Shortest paths, Longest subsequences, Edit distance, Sequence alignment
- Introduction to NP-Completeness: Reductions, Approximation algorithms
- Linear Programming
The course grade will be based on a midterm exam and final examination. There will be some graded assignments as well. The exact grade distribution will be announced during the first week of classes in a detailed course outline.
Students must pass the final exam in order to pass the course.
MATERIALS + SUPPLIES:
See Required and Recommended Reading Section
- S. Dasgupta, C. Papadimitriou, U. Vazirani,
- McGraw-Hill Higher Education,
An e-text version is available: ISBN 9780077244330
- 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, MIT Press, 2009, 9780262033848
REQUIRED READING NOTES:
Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS
SFU’s Academic Integrity website 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
Students with a faith background who may need accommodations during the semester are encouraged to assess their needs as soon as possible and review the Multifaith religious accommodations website. The page outlines ways they begin working toward an accommodation and ensure solutions can be reached in a timely fashion.