SCRIPTING-AND-PROGRAMMING-FOUNDATIONS Practice Questions

A markup language, such as HTML or XML, is fundamentally different from a programming language. Its primary purpose is not to execute algorithms or perform logic but to annotate a document, defining the structure, layout, and meaning of its content. It uses tags to describe elements like headings, paragraphs, and images, rather than to declare variables or control program flow.

A. Decomposing programs into custom types is a feature of object-oriented programming languages like Java or C++, not markup languages.

B. Allowing variables to change type during execution is a characteristic of dynamically-typed programming languages like Python or JavaScript.

C. This statement also describes a feature of dynamically-typed programming languages, which is irrelevant to markup languages that lack variables and type systems.

1. MDN Web Docs. (2023). Getting started with HTML. "HTML (HyperText Markup Language) is not a programming language; it is a markup language used to tell your browser how to structure the webpages you visit."

2. World Wide Web Consortium (W3C). (2018). HTML 5.2, W3C Recommendation, Section 1.1. "HTML is the World Wide Web's core markup language." The document describes its role in structuring documents for the web.

The value for miles per gallon is calculated by the program based on user input (miles traveled and gas consumed). Since this value is computed during program execution and can change with different inputs, it must be stored in a variable. A constant is used for values that do not change. The result of division is often a decimal number, making float the appropriate data type to handle fractional values accurately. The name milesPerGallon clearly describes the data being stored.

A. The item should be a variable, not a constant, and milesTraveled is an input, not the calculated result.

C. The name milesTraveled is incorrect; the variable should hold the calculated miles per gallon.

D. The item must be a variable because its value is calculated and will change, not a constant.

1. Severance, C. R. (2016). Python for Everybody: Exploring Data Using Python 3. Chapter 2, "Variables, expressions, and statements," explains the concept of variables for storing values that can change.

2. MIT OpenCourseWare. (2016). 6.0001 Introduction to Computer Science and Programming in Python. Fall 2016. Lecture 1, "What is Computation?", introduces the distinction between fixed constants and variables that store results of computations.

3. The C++ Core Guidelines. (n.d.). Con: Constants and Immutability. Retrieved from https://isocpp.github.io/CppCoreGuidelines/CppCoreGuidelines#S-const (This resource, while for C++, explains the universal programming principle of using constants for unchanging values and variables for calculated results.)

Based on the provided flowchart logic, the algorithm first takes the input value x = 7. It then evaluates the condition x < 7. Since 7 is not less than 7, this evaluates to FALSE, directing the execution flow to the equation y = x - 7. Substituting the input value yields y = 7 - 7, which sets the variable y to 0. The next decision block checks if y == 0. Since 0 == 0 is TRUE, the program follows the TRUE branch, triggering the instruction to Put "Equal" to output. The program then terminates.

A: Incorrect because the algorithm successfully matches the y == 0 condition first and exits, never reaching the y <= 5 evaluation block.

B: Incorrect because the execution flow terminates at the TRUE branch of y == 0, bypassing the subsequent y <= 2 check entirely.

D: Incorrect because the computed difference y evaluates to 0, fulfilling the very first condition rather than falling through to the final FALSE branch.

Guttag, J. V. Introduction to Computation and Programming Using Python (3rd ed.). MIT Press. Section 2.1: Branching Programs (Conditionals and Control Flow).

Massachusetts Institute of Technology (MIT) OpenCourseWare. (2016). 6.0001 Introduction to Computer Science and Programming in Python. Lecture 2: Branching and Iteration, Slides 12-15. Retrieved from MIT OCW.

The provided algorithm evaluates the numerical value of the variable x using fundamental conditional control structures. The initial condition if x < 0 checks if the variable is strictly negative, triggering a specific state assignment (a = 1). The subsequent elseif x == 0 condition explicitly evaluates whether the value is exactly zero (a = 2). The final else clause acts as a catch-all for any remaining numerical possibilities, which mathematically must be strictly greater than zero (positive numbers, resulting in a = 3). Consequently, the algorithm strictly determines the mathematical sign and zero-status of the variable, sorting it into negative, zero, or positive categories.

A. The algorithm relies on relational magnitude operators (<, ==), not the modulo arithmetic (e.g., x % 2 == 0) strictly required to determine mathematical parity (evenness).

B. Divisibility tests inherently require modular division operations to check for remainders. This control flow evaluates a number's relative position to zero, not its mathematical factors.

C. Identifying an odd integer requires confirming a non-zero remainder upon division by two. The provided code block lacks the necessary arithmetic operators to evaluate this property.

Massachusetts Institute of Technology (MIT) OpenCourseWare. 6.0001 Introduction to Computer Science and Programming in Python (Fall 2024/26). Lecture 2: Branching and Iteration. Specifically refers to conditional branching for sign evaluation.

Stanford University. CS106A Programming Methodology (2024/26). Course Reader, Chapter 3: Control Statements. Details the application of basic relational operators (<, ==) for comparative numeric logic.

The defining characteristic of an object-oriented language is its support for creating programs as a collection of objects. An object is a construct that encapsulates both data (attributes or properties) and the operations (methods) that can be performed on that data. This bundling of data and functionality into a single unit is a core principle of object-oriented programming (OOP), distinguishing it from other paradigms like procedural programming, which typically separates data structures from the procedures that manipulate them.

A. This describes procedural programming, which organizes programs around functions or procedures rather than objects.

B. This describes a compiled language. A language's compilation model is independent of its support for the object-oriented paradigm.

C. This describes an interpreted language. The execution model (interpreted vs. compiled) is orthogonal to the object-oriented paradigm.

1. Oracle. (2024). The Java™ Tutorials: Object-Oriented Programming Concepts. In the lesson "What Is an Object?", it states, "An object bundles its data (state) and behavior (operations) together into a single unit."

2. Weisfeld, M. (2019). The Object-Oriented Thought Process (5th ed.). Addison-Wesley Professional. Chapter 1, "Introduction to Object-Oriented Concepts". This chapter introduces the fundamental concept of an object as a combination of data and behavior.

3. Guttag, J. V. (2016). 6.0001 Introduction to Computer Science and Programming in Python, Fall 2016. MIT OpenCourseWare. Lecture 8 Notes, p. 1. The notes define objects as containing both data and methods that operate on that data.

The defining characteristic of object-oriented programming (OOP) is the concept of bundling data (attributes) and the methods (functions) that operate on that data into a single unit called an "object." This allows a program to be decomposed into a collection of interacting objects. This principle, often involving concepts like encapsulation, inheritance, and polymorphism, is unique to OOP and distinguishes it from procedural and functional paradigms, which organize programs around procedures or functions, respectively.

A. Recursion is a prominent feature of functional programming, where problems are often solved by applying a function to its own output.

B. Modular programming and calling subroutines (procedures or functions) are the foundational concepts of the procedural programming paradigm.

C. Treating programs as the evaluation of mathematical functions is the core principle of the functional programming paradigm.

1. Abelson, H., & Sussman, G. J. (1996). Structure and Interpretation of Computer Programs (2nd ed.). MIT Press. Chapter 3, "Modularity, Objects, and State." Section 3.1 discusses the concept of assignment and local state, which leads to the object-oriented paradigm of grouping state and operations.

2. Guttag, J. V. (2021). 6.0001 Introduction to Computer Science and Programming in Python. Massachusetts Institute of Technology: MIT OpenCourseWare. Lecture 8: Object Oriented Programming. Defines OOP as a style of programming that involves bundling data and functions that work on that data into objects.

3. Weisfeld, M. (2019). The Object-Oriented Thought Process (5th ed.). Addison-Wesley Professional. Chapter 1, "Introduction to Object-Oriented Concepts." "The fundamental concept of object-oriented (OO) development is to view a system as a set of interacting objects."

The question asks to check for the "difference of two values." The mathematical operation used to find the difference between two numbers is subtraction. After performing the subtraction, the result can then be compared to see if it is greater than 1. For example, to check if the difference between x and y is greater than 1, you would compute x - y and then evaluate if the result is > 1.

A. Multiplication is used to find the product of two values, not their difference.

C. Addition is used to find the sum of two values, not their difference.

D. Division is used to find the quotient of two values, not their difference.

1. Python Software Foundation. Python 3.12.3 Documentation, "The Python Tutorial," Section 3.1.1. Numbers. This section lists - as the operator for subtraction.

2. Guttag, J. V. (2021). Introduction to Computation and Programming Using Python (3rd ed.). MIT Press. Chapter 2, "Objects, Expressions, and Numerical Types," introduces basic arithmetic operators, defining subtraction for calculating differences.

3. University of California, Berkeley. CS 61A: Structure and Interpretation of Computer Programs, "Expressions." The course materials define arithmetic operators, including subtraction for finding the difference between numbers.

The pseudocode initializes the variable x to 2. It then initiates a for loop where the counter i starts at 3. The loop condition specifies that it will run as long as i < 6, incrementing i by 1 after each pass. Inside the loop, x is continuously reassigned to the result of 3 * i. The loop executes for i values of 3, 4, and 5. During the final iteration where the condition holds true (i = 5), x is calculated as 3 multiplied by 5, resulting in 15. The counter i then increments to 6, failing the i < 6 condition and terminating the loop. The final instruction outputs the last assigned value of x, which is 15.

A. 6

This is incorrect because it reflects the outcome only if the loop ran for i = 2, or if the operation was a simple addition like x = i + 3 during the first iteration.

B. 12

This represents the value of x during the second iteration of the loop when i = 4 (3 times 4), missing the final loop execution.

D. 18

This would be the result if the loop condition was i <= 6, which would allow one additional iteration where x = 3 * 6.

Massachusetts Institute of Technology (MIT) OpenCourseWare. "Introduction to Computer Science and Programming in Python" (6.0001). Lecture 2: Branching and Iteration. Focuses on control flow mechanisms and tracking variable state changes during iterations.

Stanford University. "Programming Methodology" (CS106A). Courseware materials on definitive loops, control structures, and evaluating terminal conditions in standard programming paradigms.

Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. Section 2.1: Insertion sort (includes detailed methodology for analyzing loop invariants and termination steps).

The scenario describes repeating an action (playing a game) an unknown number of times, based on user input. This is a classic example of indefinite iteration. A while loop is the appropriate structure because it can be set to continue executing the game logic as long as a condition, such as playagain == 'yes', is true. The loop terminates only when the user decides not to play again, changing the condition to false.

A. Nested for loops are for iterating through multi-dimensional data or when one definite loop must run inside another; this is not applicable here.

B. A single for loop is used for definite iteration, where the number of repetitions is known beforehand, which is not the case in this scenario.

D. An if-else statement makes a one-time decision. It cannot, by itself, cause the program to loop and play the game again.

1. Guttag, J. V. (2016). Introduction to Computation and Programming Using Python (2nd ed.). MIT Press. Chapter 3, "Some Simple Numerical Programs," discusses iteration and the use of loops for repetitive tasks based on conditions.

2. The Python Software Foundation. (2023). The Python Tutorial, 4.3. The while statement. Python 3.12.0 documentation. Retrieved from https://docs.python.org/3/tutorial/controlflow.html#the-while-statement. (The documentation explains that while loops are used for repeated execution as long as an expression is true).

3. Horstmann, C. S. (2019). Core Java SE 9 for the Impatient (2nd ed.). Addison-Wesley Professional. Chapter 1, "Fundamental Programming Structures," Section 1.6.3, "While Loops," describes their use for repeating statements while a condition is true.

The implementation phase of the software development life cycle is where the design is translated into executable code. Creating a function—which involves writing the programming logic, defining parameters, and producing a return value—is the core activity of implementation (also known as coding or construction). The function for calculating shipping costs is a tangible piece of software created by a developer during this phase, based on requirements from the analysis phase and blueprints from the design phase.

B: The analysis phase gathers requirements, defining what the function should do, not actually creating it.

C: The design phase creates a plan or blueprint for the function's structure and its place in the system, but does not involve writing code.

D: The testing phase occurs after implementation to verify that the created function works as specified.

- Sommerville, I. (2016). Software Engineering (10th ed.). Pearson. Chapter 2, "Software Processes," describes the fundamental activities of software development, identifying "Software implementation" (p. 39) as the stage where the system is developed by programming and configuring software.

- Pressman, R. S., & Maxim, B. R. (2020). Software Engineering: A Practitioner's Approach (9th ed.). McGraw-Hill Education. In Chapter 4, "Process Models," the "Construction" activity is defined as the combination of coding and testing, with coding being the primary task of implementation.

- Georgia Institute of Technology. (n.d.). CS 6300: Software Development Process. Course materials on the Software Development Life Cycle (SDLC) distinguish implementation as the phase dedicated to writing code based on design documents.