Introduction - Final Course Assignment

Loading...

En provenance du cours de University of Michigan

Python Basics

1104 notes

University of Michigan

Python Basics

1104 notes

Cours 1 sur 5 dans Specialization Python 3 Programming

This course introduces the basics of Python 3, including conditional execution and iteration as control structures, and strings and lists as data structures. You'll program an on-screen Turtle to draw pretty pictures. You'll also learn to draw reference diagrams as a way to reason about program executions, which will help to build up your debugging skills. The course has no prerequisites. It will cover Chapters 1-9 of the textbook "Fundamentals of Python Programming," which is the accompanying text (optional and free) for this course. The course is for you if you're a newcomer to Python programming, if you need a refresher on Python basics, or if you may have had some exposure to Python programming but want a more in-depth exposition and vocabulary for describing and reasoning about programs. This is the first of five courses in the Python 3 Programming Specialization.

À partir de la leçon

Sequence Mutation and Accumulation Patterns

In week four we will present deeper knowledge on using lists, strings, and python objects in general. We will also cover how to use the accumulation pattern with lists and with strings. The final assignment will test your knowledge and skills through application, much like previous assessments and assignments did, though with a more difficult set of tasks now that you have learned the basics.

Introduction - Final Course Assignment4:08

Rencontrer les enseignants

Paul Resnick
Michael D. Cohen Collegiate Professor
School of Information
Steve Oney
Assistant Professor
School of Information
Jaclyn Cohen
Lecturer
School of Information

Hello, I'm here to tell you about your end of course project.

This course project that you're about to do,

will cover a lot of the concepts that you've already covered in the course.

You'll have to do a series of problems that are of

varying types and covering varying concepts.

But all of these problems that you'll be doing

are the kind of programs that lots of people use in their real lives.

Accumulation, gathering data together,

changing what it looks like in this little program.

These kinds of programs that you're about to write in your project are

possibly very applicable to your everyday life in school or work or wherever.

I want to remind you of some tips that may be

useful as you start to work on this project.

So, first of all, as you know,

you should always change one thing in a program,

predict what will happen when you eventually run that program,

after changing this and then try it.

That way, if you've only changed one thing,

made a prediction and then tried it,

you will know whether or not that worked,

whether or not your prediction was right.

You'll know if you have a good understanding of what you're working on in that moment.

If you do a bunch of different things and then try it,

you might have to dig through all those different things,

to figure out what was good and what was not good and what you need to do

to finish that program and get it to happen the way you want.

Always change one thing,

predict and then try it.

I also want to remind you to use variable names that are clear to you.

For instance, if you're using an accumulator pattern or any for-loop,

you never want the iterator variable to be plural,

because it's always going to be bound to one singular thing.

You wouldn't want to plural variable name for

a singular thing because that can be really

confusing when you talk and think about your code.

Similarly, I would advise you not to use the word L-I-S-T inside a variable name.

It couldn't be a list because that's going to

get confusing too when you read your code later.

You'll think it's a list and then it will not be a list.

All of these problems that you're about to do in this end of

course project are different,

but they're all similar patterns,

problems that you've seen or done before.

As you work on them I'd advise you to think about those

and think about how they're similar to other stuff you've done.

That will make it easier to progress on these.

For each one, you should go through,

make a step-by-step plan in words,

no code at all for how you're going to solve the problem and

then make sure that you can translate each of those pieces into code.

For example, in an accumulation problem,

you should talk through step-by-step as if you're talking to

a robot or write down what each of those steps are,

that needs to happen in that program, that little task.

You can think step-by-step about how to translate each of those things into code.

How can you translate your words into a program that will run and

continue with changing one thing and then trying it to make sure that the code runs.

Finally, if you see a problem,

for example, maybe the last problem in this end of course project,

where there is a complex task to do for each one of a set of things,

do something with each string, for example.

You should think about your plan for each individual task,

say for doing that complex task for one string and make sure that that works,

that everything is fine for just one string.

If your code for doing the task one time with one string is successful,

then you can move to building all of your code and

putting it into a for- loop and implementing the full solution,

so that all of your code is successful for that program.

All of these problems are really useful for

applications in almost everybody's everyday life in one way or another.

I think they're fun. I hope you will enjoy yourself and I wish you good luck.

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.

Coursera propose un accès universel à la meilleure formation au monde, en partenariat avec des universités et des organisations du plus haut niveau, pour proposer des cours en ligne.

© 2019 Coursera Inc. Tous droits réservés.

Télécharger dans l'App Store

Disponible sur Google Play