Foundations-of-Computer-Science Practice Questions

A parameter is a variable declared in a function's definition that acts as a placeholder for data that will be passed to the function when it is called. Parameters define the function's interface, specifying the number and types of values it expects to receive as input. When the function is invoked, the values passed to it, known as arguments, are assigned to the corresponding parameters, allowing the function to operate on that specific data.

B. Parameters are necessary for a function to receive data and run; they do not prevent its execution.

C. A function's return type, not its parameters, determines the data type of the value it outputs.

D. Saving a function is a file system operation managed by the programmer or IDE, not a function of its parameters.

1. Abelson, H., & Sussman, G. J. (1996). Structure and Interpretation of Computer Programs (2nd ed.). MIT Press. Section 1.1.5, "The Substitution Model for Procedure Application," explains that to apply a procedure, you substitute the formal parameters with the arguments.

2. Guttag, J. V. (2013). Introduction to Computation and Programming Using Python (Rev. and expanded ed.). MIT Press. Chapter 4, "Functions, Scoping, and Abstraction," defines a function's parameters as the variables that are bound to the arguments of the function call.

3. Stanford University. (n.d.). CS106A Course Materials. "Functions." The course reader explains that parameters are the variables in the function's parentheses that hold the values passed in by the caller.

The primary purpose of an operating system (OS) is to function as an intermediary between computer hardware and the user or application programs. It has two main objectives: managing the hardware resources of the computer system (such as the CPU, memory, and I/O devices) and providing a stable, consistent set of services and APIs (Application Programming Interfaces) for applications to use. This abstraction simplifies application development and ensures fair and efficient resource allocation among multiple competing processes.

A. Designing websites is a function of specialized application software (e.g., web development tools), not an OS.

C. The OS provides the platform for application software to run; it does not replace it.

D. The OS manages the CPU that performs calculations, but its role is broad resource management, not just computation.

1. Silberschatz, A., Galvin, P. B., & Gagne, G. (2018). Operating System Concepts (10th ed.). Wiley. Chapter 1, "Introduction," Section 1.1 What Operating Systems Do, p. 4.

2. Tanenbaum, A. S., & Bos, H. (2015). Modern Operating Systems (4th ed.). Pearson. Chapter 1, "Introduction," Section 1.1 What Is an Operating System, p. 1.

3. MIT OpenCourseWare. (2012). 6.828: Operating System Engineering, Fall 2012. Lecture 1: Introduction to Operating Systems.

The selection sort algorithm works by repeatedly finding the minimum element from the unsorted part of the list and placing it at the beginning of that unsorted part. In each pass, it identifies the minimum value and swaps it with the element at the current position (the first unsorted element). If the element at the current position is already the minimum, the algorithm still performs the swap operation, effectively swapping the element with itself. This ensures the algorithm's logic remains consistent regardless of the data's initial order.

A. The first number is increased by one: This is not an operation performed by the selection sort algorithm.

B. The first number is duplicated: Duplication is not a part of the selection sort algorithm's logic.

C. It swaps the selected element with the last unsorted element: This describes a different sorting logic, not selection sort.

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to Algorithms (4th ed.). MIT Press. Chapter 2, "Getting Started," Problem 2-2, describes the logic of selection sort.

2. MIT OpenCourseWare. (2011). 6.006 Introduction to Algorithms, Fall 2011. Lecture 3: Sorting I. This lecture describes the mechanics of selection sort, including the invariant that the minimum element is swapped with the first element of the unsorted partition.

The expression fam[3:6] demonstrates list slicing in Python. The syntax [start:stop] extracts a sub-list. The start index, 3, is inclusive, meaning the element at index 3 is the first one included. The stop index, 6, is exclusive, meaning the slicing stops just before index 6. Therefore, the expression returns a new list containing the elements from fam at indices 3, 4, and 5.

A. This is incorrect because the starting index in a slice is inclusive. The element at index 3 would be included.

B. This is incorrect because the stopping index in a slice is exclusive. The element at index 6 would not be included.

D. This is incorrect because a slice with a start and stop index returns a range of elements, not a single element.

1. Python Software Foundation. (2023). The Python Tutorial, 3.1.3. Lists. Python 3.11.4 documentation. Retrieved from https://docs.python.org/3/tutorial/introduction.html#lists

2. DeNero, J. (n.d.). Composing Programs, 2.4.2 Slicing. University of California, Berkeley. Based on the textbook "Structure and Interpretation of Computer Programs." Retrieved from http://composingprograms.com/pages/24-sequences.html#slicing

The question is unanswerable as the line of code is missing. However, the "no output" option strongly implies the line was a comment. In Python, any line beginning with a hash symbol (#) is a comment. The interpreter ignores comments entirely during execution, so a line like # 20 + 5 would be valid but produce no output.

A. The string "20 + 5" would only be output if the code was an explicit print statement, such as print("20 + 5").

C. A comment is never displayed as output. The value 25 would be the output of print(20 + 5), not #25.

D. A line containing only a comment is syntactically correct in Python and would not raise a SyntaxError.

1. Python Software Foundation. (2023). The Python Language Reference, 2.1.5. Comments. Python 3.11.4 documentation. Retrieved from https://docs.python.org/3/reference/lexicalanalysis.html#comments

2. Van Rossum, G., Warsaw, B., & Coghlan, N. (2001). PEP 8 – Style Guide for Python Code. Python Enhancement Proposals. Retrieved from https://peps.python.org/pep-0008/#comments

A NumPy ndarray object is a data structure that consists of a pointer to a contiguous block of memory (the data) and metadata used to interpret that data. This metadata fundamentally includes the data type (dtype), the array's dimensions (shape), and information on how to traverse the data (strides). An encryption key is not a standard component of the NumPy array's internal structure. While a NumPy array's data can be encrypted through external libraries or custom implementations, encryption is not an intrinsic property or attribute of the ndarray object itself.

A. The data pointer is a core component, pointing to the memory location where the array's elements are actually stored.

B. The shape of the array is essential metadata, defining the size of the array in each dimension as a tuple of integers.

C. The data type or dtype is a fundamental attribute that describes the type of data (e.g., int32, float64) stored in the array.

1. NumPy v1.26 Manual, "NumPy fundamentals," Section: "The N-dimensional array (ndarray)." The documentation describes the internal memory layout and essential attributes of an ndarray, which include ndarray.shape, ndarray.dtype, and a pointer to the data buffer, but makes no mention of an encryption key. (Source: Official Vendor Documentation)

2. Harris, C. R., Millman, K. J., van der Walt, S. J., et al. (2020). Array programming with NumPy. Nature, 585, 357–362. https://doi.org/10.1038/s41586-020-2649-2. The paper describes the NumPy array as a "multidimensional, homogeneous array of fixed-size items" and discusses its core components like shape and dtype.

3. Stanford University, CS231n: "Convolutional Neural Networks for Visual Recognition," Python/Numpy Tutorial. The tutorial explains the ndarray object, highlighting its key attributes like shape, dtype, and size, without any mention of encryption as a built-in feature. (Source: University Courseware)

An algorithm is a well-defined, step-by-step procedure or set of rules designed to solve a specific problem or perform a computation. A key characteristic of an algorithm is that it must be finite, meaning it is guaranteed to terminate after a certain number of steps. It must also be unambiguous, with each step being precisely defined, to ensure a correct and predictable outcome for a given input.

A. A random collection of computer parts: This describes computer hardware, not a logical process for problem-solving.

C. A type of monitor resolution: This is a specification for a display device, indicating the number of pixels, and is unrelated to algorithms.

D. A storage device used for backups: This describes a hardware component used for data preservation, not a computational method.

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. Chapter 1, Section 1.1, "Algorithms," defines an algorithm as "any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output."

2. Knuth, D. E. (1997). The Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd ed.). Addison-Wesley. Section 1.1, "Algorithms," lists five key features of an algorithm, including finiteness.

Most programming languages follow a standard order of operations, often referred to as operator precedence. In this hierarchy, multiplication () and division (/) have higher precedence than addition (+) and subtraction (-). Therefore, in the expression 3 + 2 4, the multiplication 2 4 is performed first, yielding 8. Then, the addition 3 + 8 is performed, resulting in a final value of 11.

A. The result 20 would come from (3 + 2) 4, which incorrectly prioritizes addition over multiplication, violating standard precedence rules.

C. The result 14 cannot be obtained through any standard interpretation of the mathematical operators in this expression.

D. The result 24 cannot be obtained through any standard interpretation of the mathematical operators in this expression.

1. Python Software Foundation. (n.d.). The Python Language Reference. Section 6.17, "Operator precedence." The documentation provides a table showing that (multiplication) has a higher precedence than + (addition). Retrieved from https://docs.python.org/3/reference/expressions.html#operator-precedence

2. Oracle. (n.d.). The Java™ Tutorials: Operators. In the "Summary of Operators" section, a table clearly lists the precedence of operators, showing multiplicative operators (, /, %) are evaluated before additive operators (+, -).

A file system is a core component of an operating system that provides a method for storing, organizing, and retrieving files from a storage device, such as a hard drive or solid-state drive. It manages the physical location of data, tracks file metadata (like permissions, size, and creation date), and presents a hierarchical structure of directories and files to the user. This abstraction allows programs and users to interact with data without needing to know the specific physical details of the storage medium.

A. CPU task scheduling is a function of the operating system's process scheduler, which manages the execution of processes, not the file system.

C. Processor cooling is a hardware function managed by physical components like heat sinks and fans, completely unrelated to software or file systems.

D. Translating source code into machine code is the job of a compiler or an interpreter, which are programming language processing tools.

1. Arpaci-Dusseau, R. H., & Arpaci-Dusseau, A. C. (2018). Operating Systems: Three Easy Pieces. Arpaci-Dusseau Books. Chapter 39, "Files and Directories," Section 39.1, p. 1.

2. Silberschatz, A., Galvin, P. B., & Gagne, G. (2018). Operating System Concepts (10th ed.). Wiley. Chapter 12, "File-System Structure," Section 12.1, p. 537.

An if statement is a fundamental conditional control structure in programming. It evaluates a Boolean expression (a condition). If the condition is true, a specific block of code is executed. If the condition is false, that block is skipped, and the program's control flow proceeds to the next statement. This allows a program to make decisions and execute different code paths based on varying inputs or states, which is a core concept of controlling the flow of program execution.

A. This describes an infinite loop, a repetitive control structure, not a conditional one like an if statement.

C. Storing values is the function of variables and data structures, not control flow statements.

D. This is the function of a compiler or interpreter, which translates source code into machine-executable code.

1. Downey, A. B. (2015). Think Python: How to Think Like a Computer Scientist (2nd ed.). O'Reilly Media. Chapter 5, "Conditionals and Recursion," Section 5.1.

2. Guttag, J. V. (2016). Introduction to Computation and Programming Using Python (2nd ed.). MIT Press. Chapter 3, "Some Simple Numerical Programs," Section 3.1 Branching Programs.

3. MIT OpenCourseWare. (2016). 6.0001 Introduction to Computer Science and Programming in Python, Fall 2016. Lecture 2: Branching and Iteration.