SI Exam 2 Review

12345678910111213141516171819202122232425262728293031323334353637
Across
  1. 1. A graph search algorithm that finds a path, if one exists between a start and a finish node
  2. 3. Method that gets all valid/invalid successors of this config
  3. 4. method that initializes all JavaFX components
  4. 5. Arithmetic Exception, ClassCast Exception, Illegal Argument Exception, IndexOutOfBounds Exception and NullPointer Exception are all examples of _______ Exceptions
  5. 9. What type of exception must be handled when thrown or explicitly deferred (hint: _______ at compile time)
  6. 10. EOFException, FileNotFOund Exception, and UnknownHost Exception are all examples of ______ Exceptions
  7. 12. Units of data are sent out to the I/O device one at a time
  8. 17. A student in your CS2 class who has taken the class before, holds supplementary sessions, and is there to help with content understanding.
  9. 20. True or false? A rooted tree is a directed acyclic graph?
  10. 21. Organizes elements in top, left, center, right, and bottom sections
  11. 22. "Out of virtual memory" is an error, checked exception, or unchecked exception?
  12. 23. List or Matrix? An Adjacency _____ takes O(1) time to find if an edge exists between vertices and is better for dense graphs
  13. 24. time complexity for both BFS and DFS
  14. 27. Method that process command-line arguments
  15. 28. The parameter required by start()
  16. 29. a search technique that guarantees the shortest path will be found from a start to finish node
  17. 30. The number of components a scene or stage can hold
  18. 32. Unit of data for Reader and Writer (text I/O)
  19. 33. An exceptional condition external to the application and not meant to be handled
  20. 34. Has a time complexity of O(2^N)
  21. 35. The concept of building an object with new capabilities out of an existing object with necessary fundamentals
  22. 36. Method that checks if this config is valid or not
  23. 37. Method that checks to see if this config the solution or not
Down
  1. 2. Can hold multiple components; ordered left to right and top to bottom
  2. 6. What type of exception does not need to be explicitly handled and is not checked at compile time
  3. 7. A number of vertices that are connected to each other by a number of edges
  4. 8. List or Matrix? An Adjacency _____ is space-efficient and better for sparse graphs
  5. 11. Improves the efficiency of expensive operations like reading from a device
  6. 12. method called when the GUI is shut down
  7. 13. Design pattern for developing user interfaces that divides the application into three parts
  8. 14. 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)
  9. 15. Units of data fetched from the I/O device one at a time
  10. 16. Uses a grid system to hold components, placed in col, row order
  11. 17. Method that registers event handlers
  12. 18. A technique that improves performance by discarding an invalid child without ever fully populating it
  13. 19. Responds to user interaction and performs interactions on the model
  14. 25. A visual representation of the application
  15. 26. Unit of data for InputStream and OutputStream (binary I/O)
  16. 31. Manages data, logic, and rules
  17. 33. An event, which occurs during the execution of a program, that disrupts the normal flow of the program's instructions