Learning Objectives

The learning objectives that you can demonstrate your proficiency/mastery on for quiz 10 are:

  1. Defining variables with appropriate type in Java a. Proficiency - basic types, M - Collections with generics
  2. Writing loops (definite and indefinite) in Java a. Proficiency - basic loops, M - Nested loops
  3. Defining methods in Java a. Proficiency - method without parameters/return value, M - parameters and return value
  4. Instantiating and using objects in Java a. Proficiency - using without parameters/return value, M - using method with parameters and return value
  5. Using interfaces a. Proficiency - implement a specified interface, M - define your own interface
  6. Using inheritance a. Proficiency - simple subclass, M - use call to super to build on super’s method
  7. Using linked lists
  8. Explaining time complexity of linked list operations a. Proficiency - define Big-O of specified operation, M - demonstrate how you get that Big-O
  9. Explaining time complexity of stack operations a. Proficiency - define Big-O of specified operation, M - demonstrate how you get that Big-O
  10. Explaining time complexity of queue operations a. Proficiency - define Big-O of specified operation, M - demonstrate how you get that Big-O
  11. Explaining quicksort
  12. Explaining time complexity of quicksort a. Proficiency - define Big-O of best and worst case, M - explain how you get those Big-O
  13. Using recursion a. Proficiency - defining the “three laws of recursion”, M - writing a recursive function
  14. Using balanced search trees a. Proficiency - demonstrate adding in basic case to 2-3 tree, M - demonstrate adding that requires splitting and promotion
  15. Using heaps
  16. Explaining time complexity of heapsort a. Proficiency - define Big-O in worst case, M - demonstrate how you get that Big-O
  17. Demonstrating breadth-first search a. Proficiency - indicate first level of BFS, M - demonstrate full BFS
  18. Explaining time complexity of breadth-first search a. Proficiency - define Big-O in worst case in terms of just V, M - demonstrate how you get that Big-O
  19. Demonstrating depth-first search a. Proficiency - indicate first sequence of DFS, M - demonstrate full DFS
  20. Demonstrating hash tables
  21. Explaining time complexity of hashing a. Proficiency - define Big-O in worst case, M - explain how you get that Big-O

You are not allowed to bring anything to the self-scheduled final, so instead you should fill out the checklist form linked on Moodle and I will include your checklist in your exam booklet.

Suggestions

Good ways to study for the quizzes are:

  • Go back and re-solve the problems from previous quizzes
  • Finish any labs that you hadn’t finished or redo ones that you did finish
  • Go back over the readings/videos relevant to the learning objectives
  • Try any of the exercises at the ends of relevant chapters that are about the learning objectives
  • Attend the prefect sessions