EE 422 C Review
Fall 2015
Announcements
Project 6 due tomorrow. No slip days.
eCIS due tomorrow at 5 PM.
Final exam review by Xavier S. on Tuesday,
Dec. 8, at 4:30 PM. Location TBD.
Sign up for project 6 checkout.
My office hours on Tuesday afternoon at 1
PM – 2 PM.
Final exam tips
There will be some programs and some code tracing.
All semester topics will be covered.
Go through class code, and make sure that you can
write it yourself.
Try out old exams.
Do exercises at the back of the book.
Ask questions on Piazza on how to solve problems.
Read the exam through before answering. There is
plenty of time.
Use scratch paper liberally.
Topics covered
Java basics
– JDK, JRE, JVM
– Eclipse, compilation, execution, errors
Sorting, searching
Big-O
Classes, constructors, methods, members
Inheritance, Interfaces, Polymorphism
Java Collections
– ArrayList, LinkedList, Iterators, Maps, Sets
Topics covered contd.
Recursion
Exceptions, try/catch
Breadth-first and depth-first search
– Graphs (briefly)
Java generics, generic wild cards
Binary Search Trees
Binary Heaps, Priority Queues
Hash Tables
Topics covered contd.
Queues, Radix sort
File I/O, keyboard/console I/O
– Scanner, PrintStream, File
JUnit testing
Reflection
Multi-threading
JavaFX
MVC architecture, UML diagrams, Javadoc
iClicker
The Big-O time complexity of BFS and DFS
to find a value in a finite graph with V vertices
and E edges are, respectively:
A. O(V*2) and O(E)
B. O(V*E) and O(V*E)
C. O(V+E) and O(V+E)
D. O(V) and O(E)
E. None of the above
iClicker
The Big-O space complexity of BFS and
DFS to find a value in a finite graph with V
vertices and E edges are, respectively:
A. O(V*2) and O(E)
B. O(V*E) and O(V*E)
C. O(V+E) and O(V+E)
D. O(V) and O(V)
E. None of the above