Unit 2 Day 11 FOCS – Human Computer Interaction. Tower Building Presentation Explain your solution.

Slides:

Advertisements

Similar presentations

College of Information Technology & Design

Advertisements

Announcements You survived midterm 2! No Class / No Office hours Friday.

Binary Search This algorithm is for finding an item in a sorted list or determining that it is not in the list. Is Mr Nosey in the list opposite? This.

Searching Algorithms Finding what you are looking for.

 The amount of time it takes a computer to solve a particular problem depends on:  The hardware capabilities of the computer  The efficiency of the.

Outline Polymorphic References Polymorphism via Inheritance Polymorphism via Interfaces Sorting Searching Event Processing Revisited File Choosers and.

D1: Binary Search. The binary search is the only algorithm you study in D1 that searches through data. The idea of the binary search is that once the.

1 Chapter 11 l Basics of Recursion l Programming with Recursion Recursion.

Search and Recursion CS221 – 2/23/09. List Search Algorithms Linear Search: Simple search through unsorted data. Time complexity = O(n) Binary Search:

David Notkin Autumn 2009 CSE303 Lecture 7 bash today, C tomorrow Quick reprise: debugging, performance What’s homework 2B? (yes, it’s posted) Some looks.

Sorting and Searching. Searching List of numbers (5, 9, 2, 6, 3, 4, 8) Find 3 and tell me where it was.

Searching Arrays. COMP104 Lecture 22 / Slide 2 Unordered Linear Search * Search an unordered array of integers for a value and return its index if the.

Objectives Learn how to implement the sequential search algorithm Explore how to sort an array using the selection sort algorithm Learn how to implement.

CSC 2300 Data Structures & Algorithms January 30, 2007 Chapter 2. Algorithm Analysis.

Searching/Sorting Introduction to Computing Science and Programming I.

Topic 9B – Array Sorting and Searching

Unit 2 Day 10 FOCS – Human Computer Interaction. Journal Entry: Unit #2 Entry #9 Convert text to binary Convert the message ‘Poly pride’ into binary.

Ordered Arrays An array is ordered if the elements are in ascending or descending order. The array may be ordered numerically or alphabetically (which.

Searching Arrays. COMP104 Array Sorting & Searching / Slide 2 Unordered Linear Search * Search an unordered array of integers for a value and save its.

1 Sorting/Searching and File I/O Sorting Searching Reading for this lecture: L&L

Final Review FOCS – Human Computer Interaction. Journal Entry: Unit #1 Entry #3 Go to and use the wayback machine to compare a.

COMP 1001: Introduction to Computers for Arts and Social Sciences Searching Algorithms Monday, May 30, 2011.

SEARCHING UNIT II. Divide and Conquer The most well known algorithm design strategy: 1. Divide instance of problem into two or more smaller instances.

Chapter 11Java: an Introduction to Computer Science & Programming - Walter Savitch 1 Chapter 11 l Basics of Recursion l Programming with Recursion Recursion.

A PowerPoint about Algorithm’s. What is an algorithm? A list Of cammands / instructions to do a tasks.

1 2. Program Construction in Java. 2.8 Searching.

SEARCHING. Vocabulary List A collection of heterogeneous data (values can be different types) Dynamic in size Array A collection of homogenous data (values.

Searching and Sorting Topics Linear and Binary Searches Selection Sort Bubble Sort.

SEARCHING.  This is a technique for searching a particular element in sequential manner until the desired element is found.  If an element is found.

Intro to Sorting Intro to Computer Science CS1510 Dr. Sarah Diesburg.

A PowerPoint about Algorithm’s. What is an algorithm? A step by step process of instruction.

Chapter 12. Recursion Basics of Recursion Programming with Recursion Computer Programming with JAVA.

Review 1 Arrays & Strings Array Array Elements Accessing array elements Declaring an array Initializing an array Two-dimensional Array Array of Structure.

September 26, 2011 Sorting and Searching Lists. Agenda Review quiz #3 Team assignment #1 due tonight  One per team Arcade game Searching  Linear  Binary.

Lecture on Binary Search and Sorting. Another Algorithm Example SEARCHING: a common problem in computer science involves storing and maintaining large.

CS Class 22 Today  A word from the Real World What happens when software goes bad…  Binary Search Announcements  Exam 3 – Nov. 25 th in class.

SORTING & SEARCHING - Bubble SortBubble Sort - Insertion SortInsertion Sort - Quick SortQuick Sort - Binary SearchBinary Search 2 nd June 2005 Thursday.

1 Searching and Sorting Searching algorithms with simple arrays Sorting algorithms with simple arrays –Selection Sort –Insertion Sort –Bubble Sort –Quick.

New Mexico Computer Science For All Search Algorithms Maureen Psaila-Dombrowski.

Linear and Binary Search Algorithms

Course Code #IDCGRF001-A 5.1: Searching and sorting concepts Programming Techniques.

Searching & Sorting. Algorithms Step by step recipe to do a task…

Searching/Sorting. Searching Searching is the problem of Looking up a specific item within a collection of items. Searching is the problem of Looking.

Lists and Sorting Algorithms

OCR A Level F453: Data structures and data manipulation Data structures and data manipulation a. explain how static data structures may be.

Searching and Sorting Algorithms

Linear and Binary Search Algorithms

Intro to Computer Science CS1510 Dr. Sarah Diesburg

IGCSE 6 Cambridge Effectiveness of algorithms Computer Science

Sorting by Tammy Bailey

Intro to Computer Science CS1510 Dr. Sarah Diesburg

Searching CSCE 121 J. Michael Moore.

Intro to Computer Science CS1510 Dr. Sarah Diesburg

Binary Search and Intro to Sorting

Intro to Computer Science CS1510 Dr. Sarah Diesburg

Searching & Sorting.

Computer Science — An Overview J. Glenn Brookshear

Linear Search Binary Search Tree

Guess the letter!.

Searching and Sorting Arrays

Intro to Computer Science CS1510 Dr. Sarah Diesburg

Intro to Computer Science CS1510 Dr. Sarah Diesburg

CPS120: Introduction to Computer Science

CPS120: Introduction to Computer Science

Binary Search Counting

Unit 2: Computational Thinking, Algorithms & Programming

Relative Rates of Growth

Presentation transcript:

Unit 2 Day 11 FOCS – Human Computer Interaction

Tower Building Presentation Explain your solution.

Journal Entry: Unit #2 Entry #10 Build a tower Donald trump wants to build a tower 1000 meters tall. Using the same rules we talked about yesterday, how fast could he build it. Explain the process you used to determine the solution.

Pick a letter in the alphabet In groups of two: One person picks a letter in the alphabet The other person tries to guess it The only response is ‘yes’ or ‘no’ Do this three times and then switch the guesser. Keep track of how many guesses it take each person for each letter

Did you have a search algorithm? What algorithm did you choose to determine the letter you would guess? Why did you choose that algorithm?

Pick a number from 1 to 100 In groups of two: One person picks a number from 1 to 100 The other person tries to guess it The only response is ‘higher’ or ‘lower’ Do this three times and then switch the guesser. Keep track of how many guesses it take each person for each number

Did you have a search algorithm? What algorithm did you choose to determine the number you would guess? Why did you choose that algorithm?

Linear vs. Binary Search Linear Search: A type of search in which you start at the beginning of a list, and look at each item until you find what you are looking for, or you get to the end of the list. Binary Search: Look at the middle item in a list. If that is not the item you are looking for, eliminate half the list that does not include the item you looking for. Repeat until you find the item or there are no items left.

Journal Entry: Unit #2 Entry #11 Binary vs. Linear Search Explain the difference between the search strategies. When would it make more sense to use one versus the other. Which is faster? Why wouldn’t you always use the faster method?