CS139 – Algorithm Development Aug 23, 2004 WELCOME!

Slides:



Advertisements
Similar presentations
Instructions for Setting up Your Lab Notebook
Advertisements

6-1 Chapter Goals Determine whether a problem is suitable for a computer solution Describe the computer problem-solving process and relate it to Polya’s.
Problem Solving and Algorithm Design
Chapter 6 Problem Solving and Algorithm Design. 6-2 Chapter Goals Determine whether a problem is suitable for a computer solution Describe the computer.
1.Every Person in your group needs a piece of paper, a pencil, graph paper, and a calculator. 2.Every Person in your group needs a letter, either T,
Problem of the Day Problem of the Day next Geometry - Connect the Dots
© Janice Regan Problem-Solving Process 1. State the Problem (Problem Specification) 2. Analyze the problem: outline solution requirements and design.
Algorithms and Problem Solving-1 Algorithms and Problem Solving Mainly based on Chapter 6: “Problem Solving and Algorithm Design” from the Book: “Computer.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
Lecture 14 Go over midterm results Algorithms Efficiency More on prime numbers.
Algorithms and Problem Solving
COMS W1004 Introduction to Computer Science May 28, 2008.
Chapter 6 Problem Solving and Algorithm Design Nell Dale John Lewis.
Welcome to CS201!!! Introduction to Programming Using Visual Basic.
6-1 Problem Solving Problem solving is the act of finding a solution to a perplexing, distressing, vexing, or unsettled question.
Lecture Notes 8/30/05 Program Design & Intro to Algorithms.
Linear Functions and Their Properties Section 4.1.
1.Every Person in your group needs a piece of paper, a pencil, graph paper, and a calculator. 2.Every Person in your group needs a letter, either T, R,
Objectives: 1.Quiz 2.Group Work and Presentations on 2.1: Matter.
1. Take out a blank piece of paper. 2. Label your paper 1-30 down the left-hand side. 3. You have 15s to complete each question. 4. At the end of this.
POD basic advanced -8x ≥ 120 Create a real-world situation (word problem) that could be solved with the inequality 5n ≥ 25 ÷-8 ÷-8 x ≤ -15.
CS 390 Introduction to Theoretical Computer Science.
1.Every Person in your group needs a piece of paper, a pencil, graph paper, and a calculator. 2.Every Person in your group needs a letter, either T, R,
MA/CSSE 473 Day 02 Some Numeric Algorithms and their Analysis.
CS 100Lecture 51 CS100J Lecture 5 n Previous Lecture –Programming Concepts n Rules of thumb –learn and use patterns –inspiration from hand-working problem.
ACADEMIC VOCABULARY PERSONAL DICTIONARY HOW TO SET IT UP.
Database Systems Microsoft Access Practical #3 Queries Nos 215.
Algorithms CS139 – Aug 30, Problem Solving Your roommate, who is taking CS139, is in a panic. He is worried that he might lose his financial aid.
Lecture 6 Problem Solving: Algorithm Design & Analysis.
Problem Solving using the Science of Computing MSE 2400 EaLiCaRA Spring 2015 Dr. Tom Way.
Chapter 1 Program Development Asserting Java © Rick Mercer.
Number Representation, Data Types and Elementary Programming Shirley Moore CS 1401 February 5-7, 2013.
Chapter 1 Data Structures and Algorithms. Primary Goals Present commonly used data structures Present commonly used data structures Introduce the idea.
What's The Plan? Algorithmic Thinking Step-by-step directions for whatever someone, or the computer, needs to do © 2004 Lawrence Snyder.
MA/CSSE 473 Day 02 Some Numeric Algorithms and their Analysis.
Algorithms CS280 – 10/20/05. Announcement  Part 1 of project 2 due.  Read chapters 10, 7 for this unit  Tuesday we will also be in the classroom We.
Exploring Algorithms PROGRAMMING FUNDAMENTALS. As you come in Find your section area. Find your team. One person from each team should get the team folder.
CS 161 Computer Science I Andrew Scholer
Welcome! Directions: Answer the following questions on a blank piece of paper in the Catalyst section of your binder, silently and independently Take out.
Add Whole Numbers Unit Two Lesson Four.
Flowcharts C++ Lab. Algorithm An informal definition of an algorithm is: a step-by-step method for solving a problem or doing a task. Input data A step-by-step.
1. Take out a blank piece of paper. 2. Label your paper 1-30 down the left-hand side. 3. You have 18s to complete each question. 4. At the end of this.
Earth Layers Foldable Follow each of the steps carefully in this presentation to complete your foldable.
{ Module 4 Lesson 3 Model tiling with centimeter and inch unit squares as a strategy to measure area.
Algorithms Sept 4, Tuesday’s Lab You developed an algorithm Input – an 8 ½ x 11 inch piece of paper Audience – Fellow classmates Process – Instructions.
Warm-up Solve by linear combination
Engineering drawing Robotics IQ.
Problem Solving & Computer Programming
Topic: Introduction to Computing Science and Programming + Algorithm
More Functional Decomposition
Using Video and Technology in the Classroom: Using Video
מדינת ישראל הוועדה לאנרגיה אטומית
Class Notes 11.2 The Quadratic Formula.
CS 139 – Programming Fundamentals
CS212 Data Structures 2018 Second Semester.
More Functional Decomposition
Problem Solving and Algorithm Design
Money.
More Functional Decomposition
Adding 2-Digit Numbers Name: ___________________________
Test Booklet- Begin on page 4 Answer Booklet- Pages 5-7 Questions 1-21
Changing Your Schedule
Test Booklet- begin on page 4 Answer Booklet- pages 5-9 questions 1-26
The PlayStation Example
Algorithms File Systems Lab Environment.
U3L1 The Need For Programming
More Functional Decomposition
It's time for some trashketball!!!.
More Functional Decomposition
Presentation transcript:

CS139 – Algorithm Development Aug 23, 2004 WELCOME!

In Class Exercise Take out a clean blank 8 ½ by 11 inch piece of paper. In the top right hand corner of the paper, write your name and your section (lab meets at 9:30 – 1, 11:00 – 2, 12:30 - 3).

On the paper, write the following numbers

Now, average the four numbers

Result should be Let’s do a second one. Write down the following numbers:

Now average the three numbers.

The result should be 16.

Next, work with a group Get into groups of 3 or 4 people. Put your group member’s names below your name on the page. The person with the last name closer to the end of the alphabet will be the recorder for this exercise. All answers will go on her/his paper.

Final Exercise Write down, in detail, the steps that you went through to compute the averages. Note that in one case we had 4 numbers, in the other 3. Make sure that your steps include the possibility for n numbers where n is the count of the numbers to average. You should have no more than 3 or 4 steps.

What did you come up with? Have the person whose first name is closest to the letter “M” (blank follows) be the reporter for this exercise. Have the reporter write the directions for your group up on the whiteboard.

What did we just build? Algorithm – An unambiguous (and precise) set of steps for solving a problem (or sub-problem) in a finite amount of time using a finite amount of data. (Dale and Lewis definition). Algorithm – A step by step process for solving a problem. (Lewis and Loftus definition).

This course is all about algorithms We will learn how to think in terms of step by step solutions and implement those solutions on the computer. We will use the Java programming language for implementation of the algorithms. Let’s look at the syllabus.