Important WGU Scripting and Programming Foundations Exam Questions

Answer: B

Explanation:

Dijkstra's shortest path algorithm is designed to find the shortest path between nodes in a graph. This can be applied to various scenarios, such as routing problems, network optimization, and in this case, determining the most fuel-efficient flight plan. The algorithm works by iteratively selecting the unvisited vertex with the smallest tentative distance from the source, then visiting the neighbors of this vertex and updating their tentative distances if a shorter path is found. This process continues until the destination vertex is reached or all reachable vertices have been visited.

In the context of the given options, Dijkstra's algorithm is best suited for option B, where the goal is to find the most fuel-efficient path (i.e., the shortest path) between multiple points (coordinates of five positions). The algorithm is not designed to solve problems like searching for an element in an array (option A), finding the longest common subsequence (option C), or searching for a name in a list (option D).

GeeksforGeeks article on Dijkstra's Algorithm1

Wikipedia page on Dijkstra's Algorithm2

Programiz explanation of Dijkstra's Algorithm3

Answer: A

Explanation:

To find an expression that evaluates to 14 wheny = 13, let's evaluate each option:

A .11 + y % 5: The modulo operation (%) gives the remainder after division. Fory = 13,13 % 5equals 3. Adding 11 to 3 results in 14, so this expression is correct.

B .11 - y / 5.0: Dividing 13 by 5.0 gives 2.6. Subtracting 2.6 from 11 does not yield 14, so this expression is incorrect.

C .(11 + y) % 5: Adding 11 to 13 results in 24. Taking the modulo of 24 with 5 gives 4, which is not equal to 14. Therefore, this expression is incorrect.

D .11.0 - y / 5: Dividing 13 by 5 gives 2.6. Subtracting 2.6 from 11.0 does not yield 14, so this expression is incorrect.

The correct expression isA. 11 + y % 5.

Prealgebra: Simplifying and Evaluating Expressions With Integers

MathPapa: Evaluating Expressions Using Algebra Calculator

GeeksforGeeks: Expression Evaluation

Answer: B

Explanation:

Comprehensive and Detailed Explanation From Exact Extract:

An interpreted language is executed directly by an interpreter, which reads and executes the source code line by line without requiring a separate compilation step. According to foundational programming principles, this allows for flexibility, such as running code interactively or one statement at a time.

Option A: 'Generates syntax errors during compilation.' This is incorrect. Interpreted languages (e.g., Python, JavaScript) do not undergo a compilation phase. Syntax errors are detected during execution by the interpreter, not during a compilation step.

Option B: 'Can be run by a user one statement at a time.' This is correct. Interpreted languages often support interactive execution, where users can input and execute code one statement at a time (e.g., in Python's REPL or JavaScript's browser console). This is a hallmark of interpreters.

Option C: 'Has a programmer writing machine code.' This is incorrect. No high-level programming language, interpreted or compiled, requires programmers to write machine code. Interpreted languages use high-level source code executed by an interpreter.

Option D: 'Is restricted to running on one machine.' This is incorrect. Interpreted languages are typically portable across machines, as long as the interpreter is available (e.g., Python runs on Windows, macOS, and Linux with the same source code).

Certiport Scripting and Programming Foundations Study Guide (Section on Interpreted Languages).

Python Documentation: ''Interactive Mode'' (https://docs.python.org/3/tutorial/interpreter.html).

W3Schools: ''JavaScript Introduction'' (https://www.w3schools.com/js/js_intro.asp).

Answer: C

Explanation:

Comprehensive and Detailed Explanation From Exact Extract:

The term ''based on a series of cells'' is commonly associated with markup languages, particularly in the context of web development, where content is structured in a hierarchical or cell-based layout (e.g., HTML tables or CSS grid systems). According to foundational programming principles, markup languages like HTML are characterized by their use of tags to define elements, which can be visualized as cells or containers for content.

Option A: 'Functional.' This is incorrect. Functional languages (e.g., Haskell, Lisp) focus on functions as first-class citizens and immutability, not on a cell-based structure.

Option B: 'Static.' This is incorrect. ''Static'' refers to typing (where types are fixed at compile time) or analysis, not a cell-based structure.

Option C: 'Markup.' This is correct. Markup languages like HTML use tags to create elements that can be arranged in a cell-like structure (e.g., <table> or