Computational Thinking Algorithms and Programming
Presentation
•
Computers
•
12th Grade
•
Practice Problem
•
Hard
J Bangura
Used 17+ times
FREE Resource
2 Slides • 13 Questions
1
Computational Thinking Algorithms and Programming
2
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.
3
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
4
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)
5
Multiple Select
Show the output of a breadth-first traversal of the tree shown.(Click on the image to enlarge)
6
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)
7
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
Type answer...
8
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)
Type answer...
9
Multiple Select
identify the type of branching statements used in the function
10
Multiple Select
Identify the parameters in the function displayed
11
Multiple Select
Explain the difference between branching and iteration. (there are 3 possible options)
12
Multiple Select
State weather the parameters should be passed by value or by reference. (select 3 options explaining the operators function and a example)
13
Multiple Select
Describe the arithmetic operation of MOD. Use an example in your answer (select 3 options explaining the operators function and a example)
14
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)
15
Open Ended
Computational Thinking Algorithms and Programming
Show answer
Auto Play
Slide 1 / 15
SLIDE
