After successfully completing this week's content, you will be able to:
• Explain how tables and table lookups may be used in problem-solving.
• Design an algorithm to load values into a table.
• Distinguish between a sequential search of a table and a binary search of a table.
• Design an algorithm that searches a table using a sequential search.
• Design an algorithm that searches a table using a binary search.
• Design an algorithm that makes use of one or more program switches
• Design an algorithm that sorts values in a table.
Each week you can expect to read a chapter, review the topics, review the power point presentation and complete a assignments and a review test.
Be aware of all due dates.
Be sure to use Mail, from the left navigation column, to contact me.
|
Reading |
|
|
|
Learning Activities |
|
|
|
In-Class Assignment |
|
|
|
Assignment |
|
|
|
Assessment |
|
|