UW Computer Science & Engineering
Intro Exam Database
143x Final Practice Questions
1. Binary Tree Traversals
Name
Binary Tree Traversal
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversal
Binary Tree Traversals
Binary Tree Traversal
Binary Tree Traversal
Binary Tree Traversal
Binary Tree Traversals
Binary Tree Traversal
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversals
Binary Tree Traversal
2. Recursive Programming
Name
printTwos
printRange
evens
digitMatch
isPalindrome
writeNumbers
writeNums
repeat
substring
parenthesize
replace
printDashed
countToBy
writeSquares
indexOf
isReverse
moveToEnd
digitProduct
printPattern
commonChars
vowelsToEnd
showSplit
sameDashes
collapseSequences
dedup
sameDashes
parenthesize
Recursive Programming
largestDigit
Recursion
mod
Recursive Programming
Recursive Tracing
nthFromEnd
isReveresal
Recursion
times
3. Details of Inheritance
Name
Raph
Searching and Sorting
Green
Searching and Sorting
Details of inheritance
Inheritance and Polymorphism
Inheritance and Polymorphism
Inheritance/Polymorphism Mystery
Inheritance/Polymorphism
Details of Inheritance
Details of Inheritance
Inheritance and Polymorphism
RiggedDice
Inheritance/Polymorphism Mystery
Inheritance and Polymorphism
Inheritance
Programming with Inheritance
WishListAccount
Inheritance/Casting Question
MinMaxIntList
Find the errors
4. Collections Programming (easier)
Name
retainEqual
equals
extractEqual
retainAll
removeEvenLength
convert
removeDuplicates
acronymFor
retainEvenLength
retainAll
5. Stacks and Queues
Name
rearrange
switchPairs
shift
compressDuplicates
removeMax
isConsecutive
collapse
reorder
interleave
reverseByN
mirror
equals
removeMin
isPalindrome
isConsecutive
removeMin
mirrorHalves
expunge
isSorted
removeMin
mirror
isSortedTriples
numUnique
sort
rotateBy
rearrangeDuplicates
hasAlternatingParity
parityMachines
isPairwiseConsecutive
isSorted
mirror
compressDuplicates
reverseFirstK
isBalanced
swap
isSorted
maxToTop
getMax
expand
pushNumTimes
6. Binary Trees (easier)
Name
printLeaves
isFull
printLeaves
inorderList
purebredOdds
countMultiples
printLevel
numEmpty
toString
equals
oddDepthSum
hasPathSum
printLeaves
toString
printLevel
evenBranches
countMultiples
nodesAtLevels
hasPath
hasPathSum
oddPathSum
alternateParity
printLevel
sameStructure
sameStructure
printLevel
Binary Trees
hasPathSum
evenBranches
pairsOfTwins
leavesAtDepthN
7. Collections Programming (harder)
Name
convert
rarestAge
commonFirstLetters
byAge
pointCount
indexMap
convert
split
sumStrings
whereinTheWorld
recordGrade
convertNames
recordScore
smallestSection
birthdayMonths
byMonth
studentGrades
recordDate
acronyms
Collections Programming
exactShorterThan
recordDate
recordMoves
Collections
printOverspent
8. Comparable Class
Name
FoodData
Complex
Location
MapLocation
FoodData
FoodData
BookData
USCurrency
Rectangle
ItemOrder
TeamData
BookData
TeamData
TimeSpan
RadioStation
ClockTime
TimeSpan
Movie
AdmissionEntry
PokemonTrainer
Chromosome
Donation
RentalCar
FoodData
BookData
Beverage
ClockTime
Office
USCurrency
Inheritance and Comparable Programming
MovieRating
GasPoweredCar
ScoreHistory
Fractions
9. Binary Trees (harder)
Name
limitPathSum
construct
countNodes
tighten
mirror
makeFull
limitLeaves
removeLeaves
construct
combineWith
stretch
removeLeftLeaves
stretch
add
completeToLevel
limitPathSum
matches
trim
flip
makeFull
Binary Trees
limitLeaves
removeRightLeaves
makeFull
removeLeftLeaves
trim
limitLeaves
Binary Trees
makeFull
SwapChildrenAtLevel
makePerfect
sumLeaves
evenLevels
stretch
countBelow
removeMatchingLeaves
expand
doubleIt
removeSmallLeaves
Gardening
cloneLonelyChildren
10. Linked Lists
Name
mergeFrom
removeEvens
interleave
removeDuplicates
reverse3
reorder3
bubble
switchPairs
shift
markMultiples
compressDuplicates
shift
rearrange
doubleList
takeSmallerFrom
removeFrom
expand
trimEnds
padMultiplesOf
rotate3
sortPairs
removeRange
weave
removeEvens
interleave
surroundWith
insertMultiplesOfN
removeEveryIthElement
removeEveryOther