|
Subject: Computer Literacy |
|
1. Topic-
|
|
2. Content-
|
1."big O notation"
2. primitive recursion
3. primitive recursive derivation
4. bounded existential quantification
5. bounded minimization
6. Quantification
7. Minimalization
8. I�-recursive functions |
|
|
3. Goals: Aims/Outcomes-
|
1. know Kleene's Theorem.
2. understand what is Asymptotic notation.
3. How does it all work together.
4. what is Gadel's incompleteness theorem
|
|
|
4. Objectives-
|
1. have group work together on the chapter.
2. ask classmates questions for better understanding and vis-vera.
3. help each other understand the symbols that were introduced in
the chapter.
|
|
|
5. Materials and Aids-
|
textbook
Internet sources
notes
library resources |
|
|
6. Procedures/Methods-
|
A. Introduction-
1. explain what the big o is.
2. introduce symbols and its meaning
3. know what place does the symbol step into.
4. explain how the big o would help them in the future. |
|
|
B. Development-
1. flashcard to help them understand the symbols
2. drawings and notes for better understanding
3. show how it all works to solve a quotation no matter how big it
is |
|
|
C. Practice-
1. give symbol quiz
2. give oral vocabulary quiz
3. ask questions to students for their better understanding. |
|
|
D. Independent Practice-
1. give assignments individually
2.test on the chapter following day.
3. study groups. |
|
|
Checking for understanding-
1. get more of the students on their opinion of the subject.
2. ask students what they understand in the big O
|
|
|
Closure-
give chapter reading review for next days test. |
|
|
7. Evaluation-
|
1. keep track with oral and written quizzes and tests.
2. make sure that there is an active involvement in group works and
reviews. |
|
|
8. Teacher Reflection-
|
review again the chapter and find the understanding of the students. |
|
|