KwickClips Java
Java: 196 short revision clips (page 3)
One idea per clip, with the answer written out underneath. Each clip links back to the full Java lesson it came from.
What does new int[5] put in the boxes?41 sec
Why not write i < 5?40 sec
Why start max and min at m[0]?39 sec
Does linear search need a sorted array?41 sec
How can 1000 items be searched in about 10 steps?40 sec
Which search suits a small unsorted list?40 sec
What does the exam answer print?40 sec
Why is it called bubble sort?40 sec
Can a sort swap only once per pass?39 sec
What is insertion sort like?37 sec
Which sort makes the fewest swaps?40 sec
Why does a 2D array need two indexes?44 sec
Why does my matrix print on one long line?41 sec
What changes between row sums and column sums?43 sec
What is a transpose?38 sec
What does extends do?39 sec
What are the two jobs of super?39 sec
Why can my child class not see a field?41 sec
Bird b = new Crow(); what does b.cry() print?41 sec
Can a class have two parents?40 sec
Why does new Shape() fail?43 sec
What is an interface?41 sec
Whose method runs: the variable's or the object's?43 sec
Who is the parent of a class with no extends?42 sec
Why will my file program not compile?42 sec
Can a program survive 10 / 0?43 sec
Which one needs an object?40 sec
How do you make your own exception?41 sec
Why is variable data lost?41 sec
What does w mode do to old text?40 sec
Which mode gives raw bytes?43 sec
Why does except OSError catch a missing file?38 sec
Where do waiting calls go?44 sec
Why does my recursion crash with StackOverflowError?41 sec
What is the base case of GCD?45 sec
Can you reverse a word without a loop?41 sec
Which plate comes off a pile first?44 sec
Who is served first in a ticket line?43 sec
Why does my queue say full when cells are empty?40 sec
What does top = -1 mean?42 sec
What does a node hold?43 sec
Why did my whole list vanish?41 sec
How do you visit every node without an index?43 sec
Which gives faster access to item k?43 sec
What is the degree of a node?43 sec
Which traversal prints the root last?43 sec
In a binary search tree, which side holds smaller values?41 sec
Which nodes are the leaves here?43 sec
