Seven Steps in Action: Developing an Algorithm

Loading...

Из курса от партнера Duke University

Java Programming: Solving Problems with Software

2027 оценок

Duke University

Java Programming: Solving Problems with Software

2027 оценок

Курс 1 из 4 — Specialization Object Oriented Programming in Java

Learn to code in Java and improve your programming and problem-solving skills. You will learn to design algorithms as well as develop and debug programs. Using custom open-source classes, you will write programs that access and transform images, websites, and other types of data. At the end of the course you will build a program that determines the popularity of different baby names in the US over time by analyzing comma separated value (CSV) files. After completing this course you will be able to: 1. Edit, compile, and run a Java program; 2. Use conditionals and loops in a Java program; 3. Use Java API documentation in writing programs. 4. Debug a Java program using the scientific method; 5. Write a Java method to solve a specific problem; 6. Develop a set of test cases as part of developing a program; 7. Create a class with multiple methods that work together to solve a problem; and 8. Use divide-and-conquer design techniques for a program that uses multiple methods.

Из урока

Fundamental Java Syntax and Semantics

In this module, you will learn to write and run your first Java programs, including one program that prints “Hello!” in various countries’ languages and another where you will analyze the perimeters and other information of shapes. To accomplish these tasks, you will learn the basics of Java syntax and how to design stepwise solutions with programs. By the end of this module, you will be able to: (1) Download and run BlueJ, the Java programming environment for this course; (2) Access the documentation for the Java libraries specially designed for this course; (3) Edit, compile, and run a Java program; (4) Construct methods, variables, if else statements, and for each loops in Java; and (5) Use Iterables (like DirectoryResource) to run a program that iterates over multiples lines in a document or webpage or multiple files in a directory.

Solving Programming: A Seven Step Approach6:03

Seven Steps in Action: Developing an Algorithm7:51

Seven Steps in Action: Testing the Algorithm4:12

Seven Steps in Action: Translating to Code5:02

Познакомьтесь с преподавателями

Owen Astrachan
Professor of the Practice
Computer Science
Robert Duvall
Lecturer
Computer Science
Andrew D. Hilton
Associate Professor of the Practice
Electrical and Computer Engineering
Susan H. Rodger
Professor of the Practice
Computer Science

Hi, in this video we're going to walk through

an example of using our seven step process to solve a programming problem.

In particular, the problem we're going to work on is,

given a shape, find its perimeter.

Step one is to work an instance of the problem yourself.

That means you'll need to draw a shape and find its perimeter.

We'll need a little domain knowledge here for this problem.

Specifically, what is the perimeter of a shape?

If you don't recall,

the perimeter is the sum of the lengths of all the sides of the shape.

We'll need to know that a shape is defined by its points, and

the points are listed in order as they appear around the perimeter.

First, we'll draw a coordinate grid, so

we can draw our shape precisely and carefully.

Then we'll draw a shape on that grid.

We're noting the coordinates of each point in the shape as we draw it.

This will allow us to easily do math on them to compute the lengths of

the edges of our shape.

Once we have the shape, we can start finding its perimeter.

This left edge has length 4, and this bottom edge has length 5.

So we can add them together and get 9, the running total of our perimeter.

The next edge is the diagonal, so we'll need to do a little bit of math.

The difference in the x's is 3, and the difference in the y's is 4.

The square root of 3 squared + 4 squared, 9 + 16, or 25, is 5.

That's the length of this edge.

We can then add 9 + 5, so that our running total is 14.

Now we see that the last edge has length 2.

We add 2 to 14 to get 16.

So 16 is our answer for this particular instance of the perimeter problem.

Now you're ready for step two.

Writing down specifically what we just did.

First, we found the distance from the first point to the second point,

which was 4.

Then we took the second point to the third point, which was 5.

Then we added 4 + 5 to get a running total of 9.

Next, we found the distance from the third point to the fourth point, which was 5.

And added 9 + 5, so our running total is 14.

Then we found the distance from the fourth point back to the first point,

which is 2, and we added 14 + 2 to get 16.

Last, we said that 16 was our answer.

So we can write down the steps to solve this particular instance of the problem,

as you can see here.

Now we're ready to move on to step three, where we're going to find the patterns and

generalize to find the perimeter of any shape, not just the one we just saw.

One thing you might notice is that we're doing almost the same thing repeatedly.

When we generalize, we want to look for similar steps and

express them as repetition.

To do this, we'll need to make them match up exactly.

Which we might do here by starting out by adding 0 + 4 to get 4.

Why does this seem like a good way to make these match up?

We'll keep adding the previous result to our running total of all the lengths.

So it makes sense to start with 0 for

our running total, and add our current result to it.

The next thing we might do in generalizing this algorithm is give this

quantity a name.

It won't always have these values.

So we should name the quantity and refer to it by that name.

We'll call it currDist, since it's the current distance.

When we name this quantity currDist, we'll also want to change all the places we used

that value when we computed it to reflect the name that we just chose.

This gives us an algorithm that looks like this.

Next, we should give this quantity a name.

Here, total parameter makes sense, or totalPerim, as this quantity is the total

parameter of the shape that we're calculating as we go through the steps.

Again, when we name the quantity, we'll need to replace

the places we used that value using the name we just gave it, totalPerim.

This gives us an algorithm that looks like this.

Let's stop and look at this algorithm for a second.

Does anything strike you as maybe just a little bit odd?

What about this place that we used 0?

It isn't a previous value that we computed, but

why did we put this line in to begin with?

We wanted all the steps to repeat exactly, but now they look different.

Can we make them look the same?

Sure, we can make totalPerim start at 0 before we begin the repetitive steps.

Then we can just update totalPerim in our first step.

Now these steps form a repetitive pattern.

They're the same, except for which particular points they're working with.

The first point in each of the repetition counts to the points of the shape

in the order in which they appear.

That's great, we like it when we can iterate over a sequence,

because we can ultimately express this in code with a foreach loop.

But this second point in each repetition is a bit more problematic.

We'd have to have a way to get to the point after the current one.

Now, there are ways that we could set up our shape's interface, or

API, to iterate over the points and ask for the next one too.

But let's do something very clever.

Let's reorder the steps, so

that we do the distance from the fourth point to the first point first.

That is, let us write the steps in this order.

First, is it okay to do this?

When we want to reorder things, we have to think about it and be very careful.

Here, the reordering is totally fine.

It's totally fine since addition is commutative,

it doesn't matter what order we do the addition in.

Second, why is it useful?

Well, now we're going to the points in order, giving us a natural for

each repetition.

But the other point, which does not lend itself for each repetition,

is the one we just used.

That means we can simply remember the previous point in a variable and

use it with the next point.

We express this idea by updating our algorithm to look like this.

Notice how we update prevPt to be the point we just finished with

before moving on to the next point.

Then we make use of that point in the next set of steps.

But what about this point?

We can use the same idea we saw earlier when we initialized totalPerim to 0.

Start prevPt out with the value we want before we begin repeating the steps.

But will it always be the fourth point?

No, it just happens that we had four points here, but

in general, we'll want to start prevPt as the last point in our shape.

Okay, great.

Now we have nice repetitive steps where the only difference

is the point we're working on.

And those go in order through the points in the shape.

So we can express all these steps in the colored boxes that you see here

as a repetition for each point of the steps.

This gives us a nice general algorithm for finding the perimeter of any shape.

Later, we'll translate this into code.

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.

Coursera делает лучшее в мире образование доступным каждому, предлагая онлайн-курсы от ведущих университетов и организаций.

© Coursera Inc., 2018 Все права защищены.

Загрузить из App Store

Загрузить в Google Play