1027 Exam Prep

Indicate which of the following is an example of a non-linear collection

• Stack

• Queue

• Tree

• Both a and c are true

The term "time complexity" is the measure of

• how many basic operation needs to be executed

• the duration of the program execution

• the clock speed of the computer running the program

• how long it takes to program the algorithm

Indicate which statement is true regarding the time complexity of the pop() method on a stack

• In ArrayStack, pop() has a time complexity of O(1)

•  In ArrayStack, pop() has a time complexity of O(n)

• In LinkedStack, pop() has a time complexity of O(1)

• Both a and c are true

How could you access the second element in a singly linked list, assuming front points to the first element of the linked list?

• front[1]

•  front.getNext() 

• front.getNode(1) 

• front.getList[1]

Indicate what would be printed to the console if we called the following function with: System.out.println(run(15))

• -1

• 0

• 1

• 4

 Indicate what would be printed to the console if we called the following function with: System.out.println(work(3));

• 1

• 3

• 4

• 5

When performing a postorder traversal on a binary search tree, the last node visited is:

• The root node

• The leftmost node

• The rightmost node

• The node with the largest value

Determine the number of leaf nodes in the tree depicted

• 1

• 2

• 3

• 5

Determine the preorder traversal on the tree depicted in the diagram

• 1 3 4 5 7 9

• 9 5 3 1 7 4

• 9 5 1 3 7 4

• 5 3 9 1 7 4

Determine the inorder traversal on the tree depicted in the diagram

• 9 5 1 3 7 4

• 9 5 3 1 7 4

• 3 5 9 7 1 4

• 5 3 9 7 1 4