Entire Course Link
Watch “Intro to Algorithms” from the Khan Academy course Algorithms.
Note: All Khan Academy content is available for free at www.khanacademy.org.
Discuss a potential business problem for which you might use a sequence structure to design an algorithm.
Using pseudocode, show how that might algorithm look. What logic do you see in the algorithms?
The flow of a program is controlled by different structures. The three basic control structures in computer programs are sequence structures, decision structures (also called selection structures), and repetition structures (also called iteration structures).
Discuss the differences between decision structures and repetition structures used in algorithms. Provide examples of when you might use each.
Read “Representing Loops in Flowcharts” from “Planning, Flowcharts” on the Code Avengerswebsite.
Note: This reading will help you as you create flowcharts this week.
Remember, decision structures are also called selection structures.
Describe decision processing control structures. Provide a unique scenario that requires the use of decision processing to solve a business problem
View the Microsoft® PowerPoint® presentation from Ch. 8, “Arrays,” of Starting Out with Programming Logic and Design.
Note: This presentation provides examples that will help you with this week’s discussion and individual activities.
Watch the following lessons of the Lynda.com® course Programming Foundations: Code Efficiency with Simon Allardice:
Note: This video will help you with this week’s discussion.
Research data manipulation, efficiency, and memory in programming.
Discuss why data manipulation, efficiency, and memory are useful in programming
Often programmers are asked to find errors in code that has been created previously, and often not by them or anyone currently with the organization.
As a team, complete the “Debugging Exercises” in Ch. 8, “Arrays,” of Starting Out with Programming Logic and Design.
Discuss the errors your team found. How could these errors be avoided?