Spring 2023 - CMPT 307 D100
Data Structures and Algorithms (3)
Class Number: 6573
Delivery Method: In Person
Course Times + Location:
Mo 1:30 PM – 2:20 PM
SSCC 9002, Burnaby
We 1:30 PM – 2:20 PM
WMC 3260, Burnaby
Fr 1:30 PM – 2:20 PM
WMC 3260, Burnaby
Exam Times + Location:
Apr 13, 2023
8:30 AM – 11:30 AM
SSCB 9200, Burnaby
1 778 782-6705
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 for the design and analysis of efficient algorithms through studying data structures, algorithms, and algorithmic techniques.
COURSE-LEVEL EDUCATIONAL GOALS:
- The following topics may be included
- Introduction 1: algorithm design and analysis examples, computation models, Big-O analysis
- Introduction 2: divide and conquer, analysis of recurrence, randomized algorithms
- Sorting and order statistics: Heapsort, Quicksort, other sorting problems
- Simple data structures: lists, stacks, queues, trees, hash tables
- Algorithm design and analysis techniques, dynamic programming, greedy, amortized analysis
- Advanced data structures
- Graph algorithms, graph search, minimum spanning trees, shortest paths
- Selected topics, NP-completeness, string matching, maximum flow
The course has a final examination, homework assignments, and in class 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).
- Introduction to Algorithms (4rd Edition)
- T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein
- MIT Press
- ISBN 9780262046305
- Algorithm Design
- J. Kleinberg, E. Tardos
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