Test 2 Review
I.
II.
III.
IV.
Intro to Programming Languages (pg 152, book is much more detailed)
a. Binary Code
b. Assembly Code
c. Source Code
d. Compiler
Data Types
a. Number
i. +,-,*,/,%
b. Text
i. Join/+
ii. Equals(),=
c. Boolean
i. True or False
ii. >,<,=,!=
iii. && (AND), ||(OR), !(NOT)
d. List (Array)
i. Length
ii. myList[index]
iii. 0-base index vs 1-base index
iv. Get random item from list
e. Reference
i. AnyComponent
1. ImageSprite
2. Button
3. Label
4. Textbox
Algorithms
a. Search
i. Linear Search (pg 212 as Sequential Search)
ii. Binary Search (pg 215)
1. Tree
2. Array
b. Sort
i. Insertion Sort (pg 222)
ii. Merge Sort (not in book)
Control Statements
a. If, If Else, If Else If…Else (pg 203)
i. When a single decision is to be made
V.
VI.
b. While Loops (pg 204)
i. Repeated instructions
ii. Good for loops without a known end, eg. Password input
c. For Loops (not in book)
i. Also repeated instructions
ii. Good for loops that will execute a “known” number of times, eg. Checking Items
in a list
Creating Procedures using the above (pg 195 goes over some methodology)
a. Examples similar to what you might have to create
i. Umbrella and Pants question
ii. Countdown
iii. Max/Min of numbers, list
iv. Average of numbers, list
v. Password Checker
b. Creating the procedure
i. Appropriate Name
ii. Parenthesis with Parameters, if any
iii. Using proper indentation
iv. Write/Read
v. Returning a result if needed
c. Using the procedure
i. Procedure call with appropriate arguments
Data Structures
a. Linked List (pg 249)
b. Binary Tree (pg 251)
i. Binary Search Tree (pg 254)
ii. Heap (not in book)
c. Hash Table (not in book)
i. Key
ii. Value
iii. Hash function
iv. Hash