Learn Flowcharting and Pseudocode. Be a better programmer!
4.0 (83 ratings)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
919 students enrolled
Wishlisted Wishlist

Please confirm that you want to add Learn Flowcharting and Pseudocode. Be a better programmer! to your Wishlist.

Add to Wishlist

Learn Flowcharting and Pseudocode. Be a better programmer!

Learn the 2 most important skills in a programmer's tool box. Simplify your learning curve for any programming language.
Bestselling
4.0 (83 ratings)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
919 students enrolled
Created by Richard Vannoy
Last updated 8/2016
English
Current price: $10 Original price: $25 Discount: 60% off
4 days left at this price!
30-Day Money-Back Guarantee
Includes:
  • 6 hours on-demand video
  • 1 Supplemental Resource
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
What Will I Learn?
  • In this course, you will learn to effectively use the two major computer programming tools, pseudocode (Sue-dough-code) and Flow Charts. The student will be able to start with a programming task or problem, break it down into its parts and accurately present the solution in either flow chart or pseudocode format.
View Curriculum
Requirements
  • No prerequisite knowledge is required.
  • Flowcharting software is suggested but not required. Microsoft PowerPoint and Visio are excellent applications if you have either. If not, your instructor will recommend a number of FREE or inexpensive applications.
Description
This is a great place to start your programming career or hobby. This course is best for you:
........If you have never programmed before, or

........If you are fairly new to programming, or

........If you can program, but are not familiar with flowcharting and pseudocode techniques.


This is a generic course, meaning you will not write source code in any specific programming language. You will learn to use pseudocode and flow charts, two major tools that all programmers can use in any programming language. Pseudocode is simple. You just write out the steps to be taken to perform any task, no matter how big or small. Flow charts do essentially the same thing using software that creates a visual chart showing accurately the flow of the process and the specific steps needed to accomplish your goal. Specific shapes are used to represent the type of action to be taken. It won’t be long before you become proficient at using both of these great programmer’s tools. (Flowcharting software is NOT required for this class. If you have Microsoft PowerPoint or Visio, you can use either of those. If not, your instructor will recommend a number of FREE and affordable software applications.)

Teaching methods: Expect to see mostly 10 to 20 minute video sessions where the instructor presents the topic in a slide show format. Later in the course, there will be Exercises for you to do, with answers supplied. Several handouts will be provided to supplement the lectures. The instructor will answer all of your questions promptly (usually within 24 hours.)

This course requires no prerequisite knowledge. Everything is explained in simple, easy to follow steps. In a very short time, you will be able to take a programming situation and reduce it to a series of steps that can be transferred to any programming language. Whether you are learning one of the top 10 languages, like Java, PHP, Python, JavaScript, C, C++, C# Visual Basic, Perl, or Lua, or one of the obscure entries on the more than 650 languages listed in Wikipedia's "List of Programming Languages", the skills you learn here will be valuable to you.

This course is taught by Richard Vannoy, a professional programmer and college programming instructor for over 25 years.

Who is the target audience?
  • Students who are new to programming, no matter what programming language they use or are thinking about.
Students Who Viewed This Course Also Viewed
Curriculum For This Course
21 Lectures
05:44:44
+
Introduction: Course Objectives, definition of Flow Charts, Pseudocode, Algorithms, Computer Operations and Data Types
6 Lectures 01:10:58
This video explains the content of this course. A brief definition and description of flow charts and pseudocode is given.
Preview 03:44

Provides the course objectives with some examples to give the student a preview of the course content. The course will teach the fundamentals of flowcharting and pseudocode.
Preview 10:24

Answers the questions: "What is a flow chart?" and "What is pseudocode?" These are explained by showing samples of pseudocode and flow charts, emphasizing the simplicity of pseudocode and that the shapes of flow chart symbols have a specific meaning.
Introduction to Flow Charts
10:09

Pseudocode is a way of writing steps to solve a problem in a way that clearly shows how the computer works through the problem.
Pseudocode
07:40

The term algorithm is defined as it relates to computer programming.

Creating a computer program is a very structured activity. This lecture describes one of several ways this can be achieved by identifying and organizing the process. 

Program Development Steps & Algorithms
23:17

All computers have a very limited set of operations they perform. These steps are explained to give the student a fundamental view at the inside of a computer and how it functions. Knowing these operations allows the programmer to have a clear understanding of what the computer expects to see.
All information stored by a computer program has a specific data type. The simplest two data types are character information and numeric information. A list of data types in several languages is provided to acquaint the student with many of the specific ways a computer stores information.
Computer Operations & Data Types
15:44
+
Introduction to Flow Chart Symbols
2 Lectures 24:30
Flow charts use many symbols. This lecture walks through the main symbols used in flowcharting and explains the shapes and the purpose of each shape.
The Main Flowcharting Symbols
12:58

Flow Chart Symbols Quiz
5 questions

The On-Page and Off-Page Connectors are the means to direct the program flow from one part of a page to another, or from one page to another in a flow chart. This lecture shows specific examples so the student can correctly use these connectors in their flow charts.
On-Page and Off-Page Connectors
11:32
+
Introduction to Control Structures
2 Lectures 30:55

All computer programs are put together using only three structures; Sequence, Decision (or Selection) and Repetition (or Loops). This lecture defines all three and gives examples so the student can identify and later create computer programs using these three structures.

Sequence, Decision and Repetition
12:25

 This quiz tests your knowledge of the three main constructs in computer programming.

Sequence, Decision and Repetition Quiz
3 questions

Twenty Three Hundred years ago, Euclid created the oldest algorithm that is still in use today in computers. The Greatest Common Divisor (GCD) algorithm is discussed in detail because of its historical significance and because it uses all three of the main control structures described in the previous lecture.
Euclid's Algorithm
18:30

Algorithm and Control Structure Quiz
3 questions
+
Sequential Operations
1 Lecture 07:11
The most common control structure is Sequential Operations, where actions take place one after the other. This lecture describes this structure and gives examples of how to flow chart and write pseudocode for sequential operations. After the lecture, open the Lab below to practice the concepts of the lecture.
Sequential Operations
07:11
+
Decisions or Selection Structure
6 Lectures 02:05:46
Comparison operators are the universal means by which computer programs can make comparisons and ask True/False questions to decide what action to take next. These operators will be covered in this lecture:  =, ==, <, <=, >, >=, <> and !=.
Decisions: Comparison Operators
25:21

Single Selection means: Ask a True/False question - - Take one action if the answer to the question is True, take no action if it is False. This lecture shows how to identify single selection situations and how to create accurate pseudocode and flow charts for these situations.

Decisions: Single Selection
30:11

The control structure Dual Selection refers to locations in a computer program where one of two possible actions must be taken. Pseudocode and flow chart examples are given to show the student how to recognize and create this structure. After the lecture, open the Lab below to practice what you have learned.
Decisions: Dual Selection
18:10

In computer programming, there are often questions that can be answered in three or more ways, depending on the answers to a number of True/False questions. This lecture shows you how to recognize these occasions and how to create correct pseudocode and flow charts. Open the Lab below after the lecture to practice the skills learned here.
Decisions: Three or More Choices
18:42

Many times a question needs to be asked inside another question. This lecture shows how this is a nested statement, how to recognize it, and how to accurately produce accurate pseudocode and flow charts in these situations. Open the Lab below after the lecture to practice creating nested if structures.
Decisions: Nested Ifs
16:58

The Boolean Operators AND, OR, NOT are explained in detail. How to use these operators to correctly ask true/false questions is shown by example.
Decisions: Boolean Operators
16:24

This quiz tests your knowledge of the three Boolean operators: AND, OR, NOT.
Do you understand how these operators are used in computer programming?
AND... OR... NOT...
4 questions
+
Repetition or Loops
2 Lectures 48:19

Loops are the structures in computer programming that allow the computer to process one or many steps over and over until some condition is met.

This lecture covers the main types of loops (while, do...while, for...next), how to recognize the situation where a loop is needed and how to create loops.

Loops Part 1
20:48

This quiz covers the basics of loop construction, or how the computer sets up the parameters for operations that need to be repeated a number of times.
Loops, Part 1 Quiz
3 questions

The information on loops is continued here in more detail.
Loops Part 2
27:31

 This quiz test your knowledge of the control structure called the loop in computer programming.

Loops, Part 2 Quiz
4 questions
+
Examples and Practice Exercises
1 Lecture 34:20
Examples
34:20
+
Summary and Close
1 Lecture 02:45
Summary
02:45
About the Instructor
Richard Vannoy
4.6 Average rating
317 Reviews
1,500 Students
10 Courses
College programming, database and electronics instructor

College teacher for computer programming (Visual Basic, C, C++, Python, Java), database (SQL, Access), microcontrollers, Programmable Logic Controllers, basic and intermediate electronics for 20 years. Teaching awards include Instructor of the Quarter (Four Awards), Regional Instructor of the Quarter, Employee of the Year, Employee of the Month (Two Awards)

Ten years employed as computer programmer.

Degrees: A.S. Computer Programming, B.S. Electronics, M.S. Information Technology.

Interests: Arduino, 8051 Assembly Programming, robotics, electronics

Founder and past president of San Diego Robotics Society. Member and guest lecturer Riverside and Long Beach Robotics Societies.