Week 7

Learning objectives

Upon finishing this learning module, you should be able to:

  • Describe the requirements of an algorithm
  • Execute basic searching and sorting algorithms by hand
  • Conduct a "best first" heuristic search of a graph
  • Use logical operators to express complex conditions
Quiz 3 is open this Thurs-Saturday. It covers the materials from weeks 5 and 6.

Class Schedule

First Class Meeting

  • Searching and Sorting Algorithms
  • Work on Programming

Independent:

  • Search and Sort Worksheet
  • Programming - Complete Ch 24
  • Programming - Ch 25 Reading

Second Class Meeting

  • Algorithm of the Week - AI Search
  • Work on Programming

Independent:

  • AI Search Worksheet
  • Programming - Complete Ch 25
  • Programming - Ch 26 Reading
  • Work on the Impacts of Computing assignment

Programming

Do the following assignments based on Programming chapters from Welcome To CS. Completion assignments are graded for accuracy. Reading assignments are graded for attempting all of the interactive elements on the assigned pages.

  • Ch 24 - Completion
  • Ch 25 - Reading & Completion
  • Ch 26 - Reading - Stop when you hit the Chapter Summary
Make sure you are logged into the book so your work is saved and you get credit. The surest way to make sure you are logged in is to start the programming assignment by clicking on the button in the corresponding assignment in Elearn.

Basic Searching And Sorting Algorithms

Searching and sorting are two fundamental tasks that any program dealing with lists of data generally needs to do. We will be studying some algorithms for accomplishing these tasks this week. Next week we will use these algorithms as the basis to learn about how we compare the efficiencies of algorithms.

  • Start by reading Ch 8.1-8.8 (Algorithms) in Welcome to CS.(Stop when you hit Efficiency - 8.9)
  • Do the SearchAndSort worksheet. See the SortExamples document for examples of how to properly do the sorts. (Class Files in elearn)
  • Optional: These videos on how Selection and Insertion sort work might be handy:


This is NOT in Nine Algorithms. We will resume working out if it next week.

  • Read these pages on Search and AI.

  • Do the AISearchPractice worksheet.


Impacts of Computing

We are going to explore the topic of Automatic Vehicle Recognition in a week 6 discussion. As preparation for that discussion, you need to do some research and thinking this week.

See the Canvas assignment in this week's module for specific instructionson what to do for this week.

Optional Extras

Insertion Sort, the new dance craze: