Final Exam Review

Edit Answers
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
Across
  1. 3. What type of exception does not need to be explicitly handled and is not checked at compile time
  2. 4. initializes the state of a new object
  3. 8. keyword used to reference parent class
  4. 11. The concept of building an object with new capabilities out of an existing object with necessary fundamentals
  5. 12. Improves the efficiency of expensive operations like reading from a device
  6. 14. allows a type or method to operate on objects of various types; provides compile-time safety
  7. 15. A graph search algorithm that finds a path, if one exists between a start and a finish node
  8. 18. method used to block a thread from ending until the thread joining on it finishes
  9. 22. like a class, but only contain method signatures and static fields; cannot be instantiated
  10. 27. the condition of occurring in several forms
  11. 28. an auto-balancing red-black tree; elements are ordered and must be unique; O(logN)
  12. 29. Units of data are sent out to the I/O device one at a time
  13. 31. EOFException, FileNotFOund Exception, and UnknownHost Exception are all examples of ______ Exceptions
  14. 32. Arithmetic Exception, ClassCast Exception, Illegal Argument Exception, IndexOutOfBounds Exception and NullPointer Exception are all examples of _______ Exceptions
  15. 36. a search algorithm that is guaranteed to find the shortest path, if one exists, on a weighted graph
  16. 38. used for fast but unreliable communication and is a connectionless protocol
  17. 40. Method that gets all valid/invalid successors of this config
  18. 42. What type of exception must be handled when thrown or explicitly deferred (hint: _______ at compile time)
  19. 43. method that initializes all JavaFX components
  20. 44. error that happens at compile time
  21. 46. natural order comparison; must implement compareTo
  22. 49. method called when the GUI is shut down
  23. 51. a search technique that guarantees the shortest path will be found from a start to finish node
  24. 52. Units of data fetched from the I/O device one at a time
  25. 53. can call without a class instance; “class level” object
  26. 55. + |V|log|V|) time complexity of Dijkstra’s Algorithm (heap)
  27. 56. method used to pause execution of a thread
  28. 58. Manages data, logic, and rules
  29. 59. keys are unique and ordered, any value
  30. 62. Method that registers event handlers
  31. 63. implemented as a hash table and uses unique keys/elements
Down
  1. 1. The parameter required by start()
  2. 2. when a new class is declared and implicitly inherits from Object using the extends keyword
  3. 5. Responds to user interaction and performs interactions on the model
  4. 6. Method that checks if this config is valid or not
  5. 7. the bundling of data with the methods that operate on the data into a class
  6. 9. The BFS algorithm uses three data structures: the graph of nodes, a queue to order the node visitation, and _____ to avoid cycles and construct the shortest path (if one exists)
  7. 10. An event, which occurs during the execution of a program, that disrupts the normal flow of the program's instructions
  8. 13. Can hold multiple components; ordered left to right and top to bottom
  9. 16. keyword used to protect a critical region
  10. 17. also known as getters; get an object’s state (non-mutating)
  11. 19. Uses a grid system to hold components, placed in col, row order
  12. 20. override natural order comparison; must implement compare
  13. 21. keys are unique and hashed, any value
  14. 23. method used to wake a paused thread
  15. 24. A technique that improves performance by discarding an invalid child without ever fully populating it
  16. 25. level of visibility when only a parent and its descendants (and classes in the same package) can access
  17. 26. Organizes elements in top, left, center, right, and bottom sections
  18. 30. this method directly runs the threads synchronously in the main thread
  19. 33. Design pattern for developing user interfaces that divides the application into three parts
  20. 34. List or Matrix? An Adjacency _____ takes O(1) time to find if an edge exists between vertices and is better for dense graphs
  21. 35. also known as setters; changes the object’s state
  22. 37. a ______ class is not allowed to be directly instantiated and usually acts as a superclass for concrete subclasses.
  23. 39. Has a time complexity of O(2^N)
  24. 41. one endpoint of a two-way communication link
  25. 45. used to specify format of communication between two machines
  26. 47. time complexity for both BFS and DFS
  27. 48. Method that process command-line arguments
  28. 49. this method used to have threads run concurrently
  29. 50. a self contained execution environment that owns its own memory space and resources
  30. 54. An exceptional condition external to the application and not meant to be handled
  31. 57. exists within a process and shares resources like memory and open files
  32. 59. used for reliable and ordered communication and is a connection-based protocol
  33. 60. IP address and _____ number is used to specify an application on a remote machine to communicate
  34. 61. List or Matrix? An Adjacency _____ is space-efficient and better for sparse graphs