DLCS18.HS.3

Digital Literacy and Computer Science (2018) Grade(s): 09-12

DLCS18.HS.3

Differentiate between a generalized expression of an algorithm in pseudocode and its concrete implementation in a programming language.

Unpacked Content

Knowledge

Students know:
  • that differences exist in pseudocode and a programming language.
  • that programming languages have certain requirements for language and syntax.
a.
  • that some programs cannot return a result in a reasonable time frame, therefore approximations must be allowed in those cases.
b.
  • how to identify sequential statements, conditional statements, and/or iterations in code.
  • the differences between sequential statements, conditional statements, and/or iterations.
  • trade-offs exist with using one control structure over another.
c.
  • some decisions in a program will require the use of iterative loops, selection constructs, or recursion.
d.
  • programs can be written to satisfy a number of needs such as performance, reusability, and ease of implementation.
  • that most times, algorithms will differ based on the need of the program; performance, reusability, or ease of implementation.
e.
  • that programs can be written with specific priorities in mind.
  • that there are multiple correct ways to write a program.
  • that solutions are often chosen to meet the priority need of the program.

Skills

Students are able to:
  • distinguish between a generalized expression of an algorithm in pseudocode and its concrete implementation in a programming language.
  • point out similarities in vocabulary and syntax between pseudocode and an algorithm.
  • point out differences in vocabulary and syntax between pseudocode and an algorithm.
a.
  • explain that some algorithms do not lead to exact solutions in a reasonable amount of time and thus approximations are acceptable.
b.
  • identify sequential statements, conditional statements, and/or iterations in code.
  • identify tradeoffs associated with using one control structure over another.
c.
  • distinguish when a problem solution requires decisions to be made among alternatives or when a solution needs to be iteratively processed to arrive at a result.
d.
  • evaluate and select algorithms based on performance, reusability, and ease of implementation.
e.
  • explain how more than one algorithm may solve the same problem and yet be characterized with different priorities.

Understanding

Students understand that:
  • similarities and differences exist in pseudocode and programming code.
  • some programming languages more closely resemble pseudocode than do other programming languages.
a.
  • due to time or financial constraints, some programs may return an approximation of a solution.
b.
  • both benefits and drawbacks exist when selecting one control structure over another in a code.
c.
  • programs can use multiple methods to arrive at a solution.
d.
  • there are times when a program needs to be selected for a specific purpose, such as performance, reusability, and/or ease of implementation.
e.
  • multiple algorithms can solve the same problem.
  • algorithms can operate with a specific priority in mind, such as speed, simplicity, and/or safety.

Vocabulary

  • pseudocode
  • programming language
a.
  • approximated
b.
  • iteration
  • conditional statements
  • control structures
c.
  • iterative loop
  • selection constructs
  • recursion

Aligned Learning Resources

Computer Science Principles Unit 3 Chapter 1 Lesson 1: The Need for Programming Languages
Computer Science Principles Unit 3 Chapter 1 Lesson 2: The Need for Algorithms
Computer Science Principles Unit 3 Chapter 1 Lesson 3: Creativity in Algorithms
Computer Science Principles Unit 3 Chapter 1 Lesson 4: Using Simple Commands
Computer Science Principles Unit 3 Chapter 1 Lesson 5: Creating Functions
Computer Science Principles Unit 3 Chapter 1 Lesson 6: Functions and Top-Down Design
Computer Science Principles Unit 3 Chapter 1 Lesson 7: APIs and Using Functions With Parameters
Computer Science Principles Unit 3 Chapter 1 Lesson 8: Creating Functions With Parameters
Computer Science Principles Unit 3 Chapter 1 Lesson 9: Looping and Random Numbers
Computer Science Principles Unit 5 Chapter 1 Lesson 10: Building an App: Color Sleuth
Computer Science Principles Unit 5 Chapter 2 Lesson 11: While Loops
Computer Science Principles Unit 5 Chapter 2 Lesson 16: Functions With Return Values
Algorithms
Programming Languages
Complexity and Tractability
Formal Languages
How Computers Calculate - the ALU: Crash Course Computer Science #5
The Central Processing Unit (CPU): Crash Course Computer Science #7
Early Programming: Crash Course Computer Science #10
The First Programming Languages: Crash Course Computer Science #11
Programming Basics: Statements & Functions: Crash Course Computer Science #12
Intro to Algorithms: Crash Course Computer Science #13
Software Engineering: Crash Course Computer Science #16
ALSDE LOGO

This site may contain links to other websites or content belonging to or originating from third parties or links to websites and features in banners or other advertising. Such external links are not investigated, monitored, or checked for accuracy, adequacy, validity, reliability, availability, or completeness by us. WE DO NOT WARRANT, ENDORSE, GUARANTEE, OR ASSUME RESPONSIBILITY FOR THE ACCURACY OR RELIABILITY OF ANY INFORMATION OFFERED BY THIRD-PARTY WEBSITES LINKED THROUGH THIS SITE.
Alabama Learning Exchange © 2002-2023 by Alabama State Department of Education is licensed under Attribution-NonCommercial-ShareAlike 4.0 International

Design by Adaptive Theme