Free Foundations-of-Computer-Science Practice Test Questions and Answers (2026) | Cert Empire Practice Questions

NTFS (New Technology File System) is the standard, modern file system for Microsoft Windows operating systems. A key feature of NTFS is its support for access control lists (ACLs), which allow administrators to set granular permissions for files and folders, controlling which users and groups can access, read, write, or execute them. This makes it the correct choice for a Windows environment requiring security and permission management.

B. FAT32 is an older file system that lacks the robust, user-level file permissions found in NTFS.

C. HFS+ is a file system developed by Apple for macOS and is not natively used by Windows.

D. EXT4 is the standard file system for most Linux distributions and is not natively used by Windows.

1. Microsoft Docs, "NTFS overview." This document explicitly states, "NTFS is the primary file system for recent versions of Windows... NTFS includes features to improve reliability, such as... support for access control lists (ACLs)." (Source: Official Vendor Documentation)

2. Tanenbaum, A. S., & Bos, H. (2015). Modern Operating Systems (4th ed.). Pearson. Chapter 4, Section 4.3.4, "The NT File System (NTFS)." This section describes NTFS features, including its security model based on access control lists. (Source: University Courseware Material)

File permissions are a fundamental security mechanism in multi-user operating systems. They define access rights (e.g., read, write, execute) for the file's owner, a designated group, and all other users. This system ensures that users can only access and modify files for which they have been granted explicit authorization, thereby protecting data privacy and integrity from unauthorized access by other users or programs.

B. Screen brightness is a user-interface setting for the display hardware and has no connection to file system security or access control.

C. Monitor resolution is a display setting that determines the clarity and size of on-screen elements, not a security feature.

D. Clipboard history is a utility that stores recently copied data for easy pasting; it does not manage or enforce file access rules.

1. Arpaci-Dusseau, R. H., & Arpaci-Dusseau, A. C. (2018). Operating Systems: Three Easy Pieces. Arpaci-Dusseau Books. Chapter 39, Section 39.3, "Access Control," details how access control lists and permissions are used to mediate access to files.

2. Saltzer, J. H., & Schroeder, M. D. (1975). The Protection of Information in Computer Systems. Proceedings of the IEEE, 63(9), 1278–1308. Section I.A.1, "Controlling Access to Information," describes the basic principles of using access controls to protect information. https://doi.org/10.1109/PROC.1975.9939

Comments are annotations within the source code that are intended for human readers. Their primary purpose is to clarify the code's logic, document its purpose, or provide usage instructions. Compilers and interpreters are designed to ignore comments, so they have no effect on the final executable program. This allows developers to write explanatory text that improves code maintainability and readability without altering its functionality.

B. Comments are ignored during compilation, but they do not cause the compiler to skip the entire source file.

C. Comments are plain text and have no role in cryptographic operations like encrypting variables. Encryption is handled by specific code logic.

D. While comments explain code, they are not a substitute for clear, meaningful variable and function names, which is a core principle of clean code.

1. Kernighan, B. W., & Ritchie, D. M. (1988). The C Programming Language (2nd ed.). Prentice Hall. (Section 1.2, p. 9, introduces comments / ... / as notes that are ignored by the compiler.)

2. Python Software Foundation. (n.d.). Python 3.12.3 documentation. The Python Tutorial, Section 3.1.1: Numbers. (Describes comments starting with the hash character # and explains they are for clarifying code and are ignored by the interpreter.)

3. Martin, R. C. (2008). Clean Code: A Handbook of Agile Software Craftsmanship. Prentice Hall. (Chapter 4: "Comments," emphasizes that comments exist to explain code that cannot be made self-explanatory.)

A process is a program in execution. When a program is loaded from secondary storage (like a hard drive) into main memory (RAM) to be run, it becomes a process. The operating system manages these processes, allocating resources like CPU time and memory to them. A process includes the program's code, data, program counter, processor registers, and a stack for temporary data.

B. A cable connecting two computers is a physical hardware component used for networking, not a software concept within an operating system.

C. A type of spreadsheet chart is a data visualization tool within an application and is unrelated to core operating system functionality.

D. A file that cannot be opened describes a file's state or permissions, not an active, executing program managed by the OS.

1. Silberschatz, A., Galvin, P. B., & Gagne, G. (2018). Operating System Concepts (10th ed.). Wiley. Chapter 3, Section 3.1.1, "The Process," states, "a process is a program in execution. A process is more than the program code... It also includes the current activity, as represented by the value of the program counter and the contents of the processor’s registers."

2. MIT OpenCourseWare. (2006). 6.033 Computer System Engineering. Spring 2006. Lecture 5: The Process Abstraction. The lecture defines a process as an instance of a running program, which is the OS abstraction for execution.

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.

Linear search, also known as sequential search, is a method for finding an element within a list. It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched. It is the simplest search algorithm and does not require the list to be sorted.

A. Binary search requires a sorted list and works by repeatedly dividing the search interval in half, not by checking one by one.

B. Hash search uses a hash function to directly compute an index to the item, which is much faster than a sequential check.

D. Depth-first search is a traversal algorithm for tree or graph data structures, not a sequential search on a linear list.

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. (Chapter 2, Section 2.1, describes insertion sort, which uses a linear search-like process for finding the position).

2. MIT OpenCourseWare. (2011). 6.006 Introduction to Algorithms, Fall 2011. Lecture 1: Algorithmic Thinking, Peak Finding. (Linear search is discussed as the straightforward O(n) approach).

3. Knuth, D. E. (1998). The Art of Computer Programming, Volume 3: Sorting and Searching (2nd ed.). Addison-Wesley. (Section 6.1: Sequential Searching).

The main purpose of algorithm analysis is to evaluate its efficiency and scalability. By determining an algorithm's time and space complexity (e.g., using Big O notation), we can estimate how its performance will degrade as the input size grows. This theoretical analysis is crucial for selecting an algorithm that will remain performant and feasible when deployed on large-scale datasets, thereby avoiding costly performance bottlenecks that might only appear after implementation and deployment.

B. Algorithm analysis is used to estimate memory usage (space complexity), not to eliminate it entirely.

C. Analysis is a theoretical tool for performance prediction; it does not replace the need for testing to ensure correctness.

D. Algorithm analysis is concerned with computational efficiency, which is unrelated to user interface aesthetics.

- Sedgewick, R., & Wayne, K. (2011). Algorithms (4th ed.). Addison-Wesley Professional. Section 1.4, "Analysis of Algorithms," establishes the framework for predicting performance and comparing algorithms.

- MIT OpenCourseWare. (2011). 6.006 Introduction to Algorithms, Fall 2011. Lecture 1: Algorithmic Thinking, Peak Finding. The lecture introduces the core motivation for algorithm analysis as a way to reason about scalability.

In computer science, a graph is an abstract data type used to represent connections or relationships between pairs of objects. It consists of a finite set of vertices (also called nodes) and a set of edges that connect these vertices. Graphs are a fundamental data structure used to model networks, such as social networks, computer networks, road maps, and dependencies in a project. They are not inherently visual like a chart but are a mathematical and logical structure.

A. A bar chart is a data visualization tool. While it can represent data, it is not the abstract data structure known as a graph in computer science.

C. The data associated with vertices or edges in a graph can be of any type (integers, strings, objects, etc.), not just positive integers.

D. An operating system process is an instance of a running program. This is a concept related to operating systems, not the graph data structure.

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to Algorithms (4th ed.). MIT Press. Chapter 20, "Elementary Graph Algorithms," defines a graph G as a pair (V, E), where V is a set of vertices and E is a set of edges (Section 20.1).

2. MIT OpenCourseWare. (2011). 6.006 Introduction to Algorithms, Fall 2011. Lecture 13: Breadth-First Search (BFS). The lecture begins by defining a graph as a set of vertices and edges, emphasizing its use in modeling relationships.

The question is unanswerable as the code snippet is missing. However, assuming the intent was to test the creation of a sequence, a common Python expression to produce the output [1, 2, 3, 4] is list(range(1, 5)). The range(1, 5) function generates numbers starting from 1 up to, but not including, 5. The list() constructor then converts this sequence into a list.

A. This output would require a different list or a multiplication operation on the elements of a list like [1, 2, 3, 4].

B. This output would require different logic, such as selecting specific elements from a larger, undefined list.

D. This output format, array(...), is characteristic of the NumPy library, not a standard Python list, and would require importing NumPy.

1. Python Software Foundation. (2023). The Python Tutorial, 4.3. The range() Function. Python 3.11.4 documentation. Retrieved from https://docs.python.org/3/tutorial/controlflow.html#the-range-function

2. Guttag, J. V. (2016). 6.0001 Introduction to Computer Science and Programming in Python, Fall 2016. MIT OpenCourseWare. Lecture 3 notes cover lists and ranges. Retrieved from https://ocw.mit.edu/courses/6-0001-introduction-to-computer-science-and-programming-in-python-fall-2016/

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.

In NumPy, array slicing uses the format [start:stop:step]. To select the last two rows, the slice is [-2:], which starts from the second-to-last element and goes to the end. Similarly, to select the last two columns, the slice is [-2:]. Combining these for a 2D array results in the syntax array[-2:, -2:], which correctly subsets the desired rows and columns.

A. array[-2:, :] selects the last two rows but includes all columns, not just the last two.

B. array[-1:, -1:] selects only the very last row and the very last column, not the last two of each.

D. array[:, -2:] selects all rows and only the last two columns, failing to subset the rows.

1. NumPy v1.26 Manual, "Indexing on ndarrays," Section: "Slicing and striding." The documentation explains that negative indices count from the end of the array and that a slice i:j includes elements from i up to (but not including) j. A blank j implies the rest of the array. (Source: Official Vendor Documentation)

2. VanderPlas, J. (2016). Python Data Science Handbook. O'Reilly Media. Chapter 2, Section: "The Basics of NumPy Arrays," Sub-section: "Array Slicing: Accessing Subarrays." This section details how to use comma-separated slices to access subarrays, e.g., x[rowslice, colslice]. (Source: Peer-reviewed academic publication)

A compiler is a specialized program that translates source code written in a high-level programming language (e.g., C++, Java) into a lower-level language, such as assembly or machine code. This process, known as compilation, allows the computer's central processing unit (CPU) to directly execute the instructions. The compiler performs syntax checking, optimization, and code generation to create an efficient and executable program from the human-readable source code.

B. A device that stores files permanently is a storage device like a hard disk drive (HDD) or solid-state drive (SSD), not a compiler.

C. A user account permission manager is a component of an operating system that handles access control, which is unrelated to code translation.

D. A graphical tool for drawing charts is a type of application software, which serves a different purpose than a language processor like a compiler.

1. Aho, A. V., Lam, M. S., Sethi, R., & Ullman, J. D. (2007). Compilers: Principles, Techniques, and Tools (2nd ed.). Pearson/Addison Wesley. In Chapter 1, Section 1.1, "Language Processors," the text defines a compiler as a program that "reads a program written in one language—the source language—and translates it into an equivalent program in another language—the target language."

2. MIT OpenCourseWare. (2017). 6.004 Computation Structures, Spring 2017. Unit 4: The Digital Abstraction, Lecture 15. The lecture materials describe the compilation process as the translation from high-level languages down to the instruction set architecture that the hardware can execute.

Decomposition is a fundamental principle of computational thinking. It involves breaking down a complex problem or system into smaller, more manageable, and understandable sub-problems. Each sub-problem can then be solved independently, and the solutions can be combined to solve the original complex problem. This approach simplifies the development, testing, and maintenance process.

B. Turning off a computer is a user action related to hardware operation, not a problem-solving methodology.

C. Combining files is an act of aggregation or archiving, which is the conceptual opposite of decomposition.

D. Replacing variables with constants is a specific coding practice, not the broad problem-solving strategy of decomposition.

1. Wing, J. M. (2006). Computational thinking. Communications of the ACM, 49(3), 33-35. (Section: "The concepts of computational thinking", para. 2). https://doi.org/10.1145/1118178.1118215

2. Grover, S., & Pea, R. (2013). Computational Thinking in K–12: A Review of the State of the Field. Educational Researcher, 42(1), 38-43. (Section: "What is Computational Thinking?", p. 39). https://doi.org/10.3102/0013189X12463051

3. MIT OpenCourseWare. (2016). 6.0001 Introduction to Computer Science and Programming in Python, Fall 2016. Lecture 1: What is Computation? Notes. (The concept is introduced as a core problem-solving technique).

A tree is a widely used abstract data type that represents a hierarchical structure. It consists of a collection of nodes connected by directed (or undirected) edges. Each tree has a special "root" node, and every other node has exactly one parent, with the root having no parent. This parent-child relationship is the defining characteristic of a tree's hierarchical nature, distinguishing it from linear structures like lists or cyclical structures like graphs.

A. This describes a linear data structure, such as a doubly linked list, not a hierarchical tree structure.

C. Trees are abstract data types and can store any kind of data in their nodes, including strings, objects, or other complex types.

D. This describes a hardware monitoring function within an operating system, which is unrelated to the concept of a tree data structure.

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to Algorithms (4th ed.). MIT Press. (Chapter 10, Section 10.4 "Representing rooted trees," pp. 269-272, defines trees based on parent-child-sibling pointers.)

2. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1983). Data Structures and Algorithms. Addison-Wesley. (Chapter 3, "Trees," p. 55, defines a tree recursively as a set of nodes with a root and disjoint subtrees.)

3. Stanford University. (n.d.). CS106B: Programming Abstractions Course Reader. (Section on "Trees," which introduces the concept as a collection of nodes organized in a hierarchy.)

Algorithm efficiency describes how the performance of an algorithm scales with the size of its input. It is primarily measured by its time complexity (the amount of time it takes to run) and its space complexity (the amount of memory it requires). This analysis, often expressed using asymptotic notation like Big O, quantifies the relationship between the input size (n) and the resources consumed, allowing for a standardized comparison of different algorithms' performance characteristics, especially as the input grows very large.

A. The visual design of an interface relates to user experience (UX) and usability, not computational efficiency.

C. Code comments are for human readability and maintainability; they do not affect the algorithm's execution performance.

D. The number of concurrent users relates to system scalability and architecture, a broader concept than single-algorithm efficiency.

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. Chapter 2, "Getting Started," Section 2.2 Analyzing algorithms, p. 24-29.

2. Stanford University. (n.d.). CS161: Design and Analysis of Algorithms. Course Notes, "Asymptotic Analysis." Retrieved from https://web.stanford.edu/class/cs161/

3. MIT OpenCourseWare. (2011). 6.006 Introduction to Algorithms, Fall 2011. Lecture 1: Algorithmic Thinking, Peak Finding.