• COMP2521 20T2 Summary
• Final Exam
• After COMP2521

❖ COMP2521 20T2 Summary

Data Structures and Algorithms

• ADTs, Algorithms, Complexity analysis
• Trees: ADT, BSTs, Splay, AVL, 2-3-4, Red-black
• Graphs: ADT, Breadth/Depth-first, MSTs, SSSP
• Priority: Heaps, Priority queues
• Searching: Hashing, Tries
• Sorting: O(n²)  algorithms, O(n log n)  algorithms
• Strings: pattern matching, text compression
• Tools: make, gdb, gprof, recursion, Higher-order functions

❖ ... COMP2521 20T2 Summary

Assessments

• Assignment 1 (trees) ... worth 15%
• Assignment 2 (~graphs) ... worth 15%
• Labs ... best 5 of 7 ... worth 18%
• Quizzes ... best 6 of 8 ... worth 12%
• Final Exam (most topics) ... worth 40%

Note: must score ≥ 17/40 on final exam, otherwise UF

❖ Final Exam

Held on Saturday 15 August, starting at 10am

• runs over 24 hours (Sat 10am - Sun 10am)
• 2 programming questions (15 + 15 marks)
• 6 "written" questions (30 marks total)
• paper will be available via Webcms3
• submit answers using Give or Webcms3
• can work on home machine or on CSE servers
• do at your own pace; should take ~3 hours of work

Sample Exam available now to show structure  (under "Exam Stuff")

❖ ... Final Exam

Written questions  (6 of them)

• like the Tutorial questions (see Sample Exam)
• template *.txt files, edit with any text editor

Programming questions  (2 of them)

• like the Practice Programming Problems
• template *.c files, Makefile, testing stuff
• knowing gdb can help to get you out of trouble
• do another question if you get stuck, come back to it

How much time per question?   Allow at least 3*marks

❖ After COMP2521

COMP2521 is a gateway course to many COMP[349]xxx courses