Final Review
Rules for the final
- Everyone must sit in front of the railing. No one can sit at the tables or on the floor behind the rail.
- You must stay in the room until the end of the final period (14:30). If you anticipate finishing early, bring something to do. You may not surf the net nor use your cell phone.
- You may not leave to go the the bathroom or for any other reason. Go to the bathroom before the exam and tell your friends you will return cell phone calls and text messages after the exam.
- Bring your student ID card. I will randomly ask to see your ID. If you do not have it, you will receive no crdeit for the exam
- Before you leave the room, you will need to sign a log with your name, the time, and your ID. Then show me your ID
- Bring a power strip
- Bring a USB memory stick that you can leave with me.
Inserting elements into a binary search tree
- Insert these elements into a binary search tree: 50 30 40 70 44 35 75 10
Traversing a Tree
- Give inorder, preorder and postorder traversal of this tree
Can you ... ?
- find the smallest child in a binary search tree
- reroute links in a linked list to reorder the nodes
- work with the doubly linked list in Worked Example 16.1
- find the Big-O efficiency of algorithms
- write a class that implements the Comparator interface, make and use an object of that class
- read a file with a Scanner
- Create a Scanner using a String and read from the String
- Use try/catch blocks
- instaniate and throw an exception