Unit 8 -THINKING COMPUTATIONALLY
Lesson 08 - Models and Simulations
Lesson 08 - Models and Simulations
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
Objectives
Objectives
Students will be able to:
Students will be able to:
- identify real-world examples of models and simulations.
- understand that models and simulations are used to generate new knowledge, as well as to formulate, refine, and test hypotheses.
Supplementary Resources
Supplementary Resources
NOTES
Lesson 07 - UNSOLVABLE PROBLEMS
Lesson 07 - UNSOLVABLE PROBLEMS
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
Objectives
Objectives
Students will be able to:
Students will be able to:
- Learn that computers can’t do everything, and never actually will be able to.
Supplementary Resources
Supplementary Resources
- Videos
- Explanimator on Unsolvable Problems
- Udiprod on the Halting Problem
- It turns out, many practical problems reduce to the halting problem or other unsolvable problems. However, rather than giving up on these problems entirely, computer scientists use guidelines, or heuristics, to reach good-enough solutions. Check out this page by 101 Computing on heuristic approaches to problems and this thread by Quora on different ways of thinking about heuristics.
- Notes
- Unsolvable Problems(PDF)
Lesson 05 - Computational Complexity
Lesson 05 - Computational Complexity
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
Objectives
Objectives
Students will be able to:
Students will be able to:
- Analyse Computational Complexity of algorithms, in particular considering the theoretical worst-case and best-case scenarios when running programs.
Supplementary Resources
Supplementary Resources
Lecture
Lecture
Shorts Video
Shorts Video
Lesson 04 - Other Sorting Algorithms
Lesson 04 - Other Sorting Algorithms
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
Objectives
Objectives
Students will be able to:
Students will be able to:
- Observe how some ways of sorting algorithms are more efficient than others.
Supplementary Resources
Supplementary Resources
SELECTION SORT
SELECTION SORT
Lecture(Part 0)
Lecture(Part 0)
Lecture(Part 1)
Lecture(Part 1)
Shorts Video
Shorts Video
INSERTION SORT
INSERTION SORT
Lecture(Part 0)
Lecture(Part 0)
Lecture(Part 1)
Lecture(Part 1)
Shorts Video
Shorts Video
Lesson 03 - Sorting Algorithms - Bubble Sort
Lesson 03 - Sorting Algorithms - Bubble Sort
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
Objectives
Objectives
Students will be able to:
Students will be able to:
- describe bubble sort algorithm in pseudocode and in JavaScript.
Supplementary Resources
Supplementary Resources
Lecture(Part 0)
Lecture(Part 0)
Lecture(Part 1)
Lecture(Part 1)
Shorts Video
Shorts Video
Notes
Notes
- Bubble Sort(PDF)
Lesson 02 - binary SEARCH ALGORITHM
Lesson 02 - binary SEARCH ALGORITHM
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
Objectives
Objectives
Students will be able to:
Students will be able to:
- describe binary algorithm in pseudocode and in JavaScript.
Supplementary Resources
Supplementary Resources
Lecture
Lecture
Shorts Video
Shorts Video
- Binary Search(Doug)
Notes
Notes
- Binary Search(PDF)
Lesson 01 - Linear(SEQUENTIAL) SEARCH ALGORITHM
Lesson 01 - Linear(SEQUENTIAL) SEARCH ALGORITHM
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
LESSON MATERIALS (YOU CAN ACCESS ONLY VIA @BERGEN.ORG ACCOUNT)
Objectives
Objectives
Students will be able to:
Students will be able to:
- describe linear(sequential) algorithm in pseudocode and in JavaScript.
Supplementary Resources
Supplementary Resources