8. Using the Dictionary
8. Using the Dictionary
Write an algorithm for looking up words in the dictionaryExamine a standard hard copy dictionary and then write up the procedure you would use to look up a given word.
- What if the dictionary did not have headwords?
- What if it had an index?
- What if it were on a scroll?
- Try to invent the worst possible "obvious" algorithm for looking up a word in a dictionary.
- If the dictionary has 100 pages, each with about 25 words, how many pages, on average will that method involve looking at?
28 May 2018 22:24
Course tags: | Computational Thinking | Human Centered Design | 'Required' Purchase | Recommended Purchase | Request for Library |
In class for CT Session:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
homework for CT Session:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
See extra for CT Session:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Not in class for CT week:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Not homework for CT week:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Not extra for CT week:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Go to Course: Computational Thinking | Human Centered Design
