1. Welcome to COMP 285

Lecture 20: Midterm Review

COMP - 285

Advanced Algorithms

Lecturer: Luis Perez (laperez@ncat.edu)

What’s Covered?

• Material from Lecture 0 to Lecture 18
• 13,14 (Hashing) not so much
• Material from Homework 0 to Homework 5
• All solutions are available
• Material from Quiz 0 to Quiz 6
• All solutions are available
• The exam is applied:
• Big-Oh/Asymptotics
• Sorting/Divide & Conquer
• Trees/Binary Search Trees
• Recursion
• Graphs

​

What’s the format?

• In-Class, In-Person (50 minutes)
• Bring a pencil!
• You can start at max(12:00pm, time you walk in)
• You stop at 12:50pm
• 29 questions, 80 points total
• Multiple Choice
• True/False
• Pseudo-code

​

Can you tell us more?

• Mixture of concept and interview practice
• Concept Questions (~40 pt)
• Similar to quizzes
• Majority of questions
• Eg, run DFS on this graph, can you short faster than O(n log n), etc.
• Interview Practice (~40 pt):
• Design an algorithm to do X
• Justify correctness, analyze runtime
• Pseudo-code (similar to written homework, coding)

Is it difficult?

• Maybe?? I promise I tried to make it reasonable
• Might still be a bit long
• It’s okay to:
• Struggle with the exam/material
• Guess at an answer, even if it's not right
• That sounds stressful!!
• If you work hard and do your best
• you will not fail.
• Midterm Corrections!
• Half-page, front-back “cheat sheet”

Tuesday Review Session

3:30pm - 5:30pm (Student Center 313)

Wednesday Review Session

1pm-3pm (come with me to Eric)

Thursday Review Session

3:30pm-5:30pm (Student Center 303)

Friday Midterm

12pm-12:50pm (Graham Hall 210)

6

Any questions?

7

Let’s go over material :)

8