Computational Thinking Algorithms and Programming

Computational Thinking Algorithms and Programming

Open Ended

A program needs to store the names of plants that are in a garden, so they can be easily found and accessed in alphabetical order . State the type of tree shown.

Open Ended

A program needs to store the names of plants that are in a garden, so they can be easily found and accessed in alphabetical order . Show the output of a breadth-first traversal of the tree shown

Binary Tree/Binary Search Tree

show the output of a breadth-first traversal of the three shown (review the image in detail and select from the options on the next slide)

Multiple Select

Show the output of a breadth-first traversal of the tree shown.(Click on the image to enlarge)

• 1st layer Lily

  2nd Layer Daisy, Sunflower,

  3rd Layer Begonia, Hosta, Peony

  4th Layer Rose

• 1st layer Lily

  2nd Layer Daisy, Begonia,

  3rd Layer Sunflower, Hosta, Peony

  4th Layer Rose

Open Ended

Explain how backtracking is used in depth first (post-order) traversal. Use the tree in fig.2.1 (click the image to enlarge)

Fill in the Blanks

The element in the tree Fig 2.1 are read into a linked list producing an alphabetised list. Complete the following table to show the linked list for the data

Fill in the Blanks

A new plant, Lavender, needs adding to the linked list. The linked list needs to retain its alphabetical order. Complete the table to show the linked list after Lavender is added e.g. (Complete the NextPointer column)

Multiple Select

identify the type of branching statements used in the function

• if

• While

• For

Multiple Select

Identify the parameters in the function displayed

• num1

• function

• num2

Multiple Select

Explain the difference between branching and iteration. (there are 3 possible options)

• Branching decides which code is run

• parameters are declared

• only runs code once

• Iteration repeatedly runs the same code in the same sequence

Multiple Select

State weather the parameters should be passed by value or by reference. (select 3 options explaining the operators function and a example)

• By Value .. the original value do not need to be modified

• parameters are declared

• byRef would not work

• would cause the routine to crash

Multiple Select

Describe the arithmetic operation of MOD. Use an example in your answer (select 3 options explaining the operators function and a example)

• Divides multiple elements

• 9 MOD 3 = 3

• 10 MOD 3 = 1

• Give the remainder after division

Multiple Select

Trace the recursive function when it is called by the statement GCD(250, 20).

Give the final value returned (select 3 options explaining and giving the final result returned)

• Num2 != 0 therefore return GCD(20,10)

• Num2 != 0 therefore return GCD(10,0)

• Final return value = 10

• Final return value = 0

• Num2 != 0 therefore return GCD(12,5)

Open Ended

The function has been rewritten using iteration instead of recursion.

state one benefit and one drawback