PRG 211 All participations

PRG 211 All participations

Entire Course Link

https://plus.google.com/u/0/108200033792883877670/posts/dWT4sDYbQKM

 
PRG/211

ALGORITHMS AND LOGIC FOR COMPUTER PROGRAMMING

 

The Latest Version A+ Study Guide

 

**********************************************

PRG 211 All participations Link

https://uopcourses.com/category/prg-211-all-participations/

**********************************************

 

 

PRG 211 Week 1 Ch. 1, Starting Out with Programming Logic and Design
 

 

Read Ch. 1, “Introduction to Computers and Programming,” of Starting Out with Programming Logic and Design.
 

 

 
 

 

 

PRG 211 Week 1 Ch. 2, Starting Out with Programming Logic and Design
 

 

 
 

 

 

PRG 211 Week 1 Lynda.com®: What Is Programming
 

 

 
 

 

 

PRG 211 Week 1 Khan Academy: Intro to Algorithms
 

Watch “Intro to Algorithms” from the Khan Academy course Algorithms.

Note: All Khan Academy content is available for free at www.khanacademy.org.

 

 
 

 

 

PRG 211 Week 1 Lynda.com®: Writing Pseudocode
 

 

Watch “Writing Pseudocode” from Lesson 9, “Programming Style,” of the Lynda.com® course Programming Foundations: Fundamentals with Simon Alladrice.
 

 

 
 

 

 

PRG 211 Week 2 Ch. 2, Starting Out With Programming Logic and Design
 

 

Read Ch. 2, “Input, Processing, and Output,” of Starting Out With Programming Logic & Desig
 

 

 

 

PRG 211 Week 2 Ch. 4, Starting Out with Programming Logic and Design
 

 

 
 

 

 

PRG 211 Week 2 Ch. 5, Starting Out with Programming Logic and Design
 

 

 
 

 

 

PRG 211 Week 2 Discussion Question: Sequence Structure
 

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?

 

 
 

 

 

PRG 211 Week 2 Discussion Question: Decision and Repetition Structures
 

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.

 

 
 

 

 

PRG 211 Week 3 Appendix C, Starting Out with Programming Logic and Design
 

 

Read Appendix C, “Pseudocode Reference,” of Starting Out with Programming Logic and Design
 

 

 
 

 

 

PRG 211 Week 3 Ch. 4, Microsoft® PowerPoint® Presentation
 

 

View the Microsoft® PowerPoint® presentation from Ch. 4, “Decision Structures and Boolean Logic,” of Starting out with Programming Logic and Design.
 

 

 
 

 

 

PRG 211 Week 3 Ch. 5, Microsoft® PowerPoint® Presentation
 

 

View the Microsoft® PowerPoint® presentation from Ch. 5, “Repetition Structures,” of Starting out with Programming Logic and Design.
 

 

 
 

 

 

PRG 211 Week 3 Representing Loops in Flowcharts
 

Read “Representing Loops in Flowcharts” from “Planning, Flowcharts” on the Code Avengerswebsite.

Note: This reading will help you as you create flowcharts this week.

 

 
 

 

 

PRG 211 Week 3 Discussion Question: Decision Processing Control Structures
 

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

 

 
 

 

 

PRG 211 Week 4 Ch. 8, Starting out with Programming Logic and Design
 

 

 
 

 

 

PRG 211 Week 4 Ch. 8, Microsoft® PowerPoint® Presentation
 

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.

 

 
 

 

 

PRG 211 Week 4 Lynda.com®: Programming Foundations: Code Efficiency
 

Watch the following lessons of the Lynda.com® course Programming Foundations: Code Efficiency with Simon Allardice:

 

 

 

“Introduction”
 

 

Lesson 1, “Approaching Efficiency”
 

 

Lesson 3, “Memory”
 

 

Note: This video will help you with this week’s discussion.

 

 
 

 

 

PRG 211 Week 4 Discussion Question: Data Manipulation
 

Research data manipulation, efficiency, and memory in programming.

Discuss why data manipulation, efficiency, and memory are useful in programming

 

 
 

 

 

PRG 211 Week 4 Learning Team Collaboration: Ch. 8, Debugging
 

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?

 

 
 

 

 
 

 

 

PRG 211 Week 5 Ch. 10, Starting Out with Programming Logic and Design
 

 

Read Ch. 10, “Files,” of Starting Out with Programming Logic and Design
 

 

 
 

 

 

PRG 211 Week 5 Ch. 14, Starting Out With Programming Logic and Design
 

 

 
 

 

 

PRG 211 Week 5 Ch. 10, Microsoft® PowerPoint® Presentation
 

 

 
 

 

 

PRG 211 Week 5 Lynda.com®: Core Concepts
 

 

Watch Lesson 1, “Core Concepts,” of the Lynda.com® course Foundations of Programming: Object-Oriented Design with Simon Allardice.
 

 

 
 

 

 

PRG 211 Week 5 Lynda.com®: Introduction to Object-Oriented Terms
 

 

Watch “Introduction to Object-Orientation Terms” from Lesson 5, “Working with Objects,” of the Lynda.com® course Objective-C Essential Training with Simon Allardice.
 

 
 
Powered by