Quiz
A find_linear(customersList)
B print(linear_search(customersList, search_value))
C linear_search()(customersList)
D search_linear(customersList, search_value)
linear_search(customersList, search_value): defines a function named linear_search that requires two
arguments when called: a list (or sequence) of customer items and the value being searched for. A
correct call must therefore supply both arguments in the same order: linear_search(customersList,
search_value).
Quiz
A Network Security Policy
B Physical Security Policy
C Acceptable Use Policy
D Data Retention Policy
organization’s computing resources—such as email, internet access, file storage, endpoints, and
networks—and it typically specifies prohibited behaviors and the consequences of violations. In security
and IT governance textbooks, the AUP is framed as both a behavioral contract and a risk-management
tool: it reduces misuse, clarifies expectations, and provides an enforceable basis for disciplinary action.
The “ramifications of abusing company resources” (for example, installing unauthorized software,
excessive personal use, accessing inappropriate content, attempting to bypass security controls, or
sharing credentials) are precisely the kinds of issues an AUP addresses. The policy often includes
monitoring statements (users have limited expectation of privacy), compliance requirements, and
escalation paths for violations.
A Network Security Policy (A) focuses on technical rules for network protection—firewalls, segmentation,
remote access, and intrusion detection—rather than broad user conduct and disciplinary consequences.
A Physical Security Policy (B) addresses protection of facilities and hardware—badges, locks, visitor
procedures, secure areas. A Data Retention Policy (D) defines how long data is stored, how it is
archived, and how it is disposed, which is different from defining misuse consequences.
Thus, the policy aspect that defines permissible behavior and the consequences for abusing resources is
the Acceptable Use Policy.
Quiz
30, 40]])?
A np_2d[3, 1]
B np_2d[1, 3]
C np_2d[0, 4]
D np_2d[4, 1]
The array np_2d = np.array([[1, 2, 3, 4], [10, 20, 30, 40]]) has two rows (indices 0 and 1) and four
columns (indices 0, 1, 2, 3). The value 40 is located in the second row and the fourth column. Using
zero-based indexing, that corresponds to row index 1 and column index 3. Therefore, np_2d[1, 3] returns
40.
Option A attempts to access row 3, which does not exist and would raise an IndexError. Option C
attempts to access column 4 in row 0, but valid column indices are only 0 through 3, so it would also
error. Option D likewise refers to a non-existent row 4. Only option B uses valid indices and points to the
correct location.
Textbooks emphasize multi-dimensional indexing because it underlies matrix operations, dataset
manipulation, and feature extraction in data science. Correctly interpreting rows and columns is essential
when rows represent observations (like people) and columns represent attributes (like age, weight,
height). This question tests precise control over row/column addressing, which prevents subtle bugs in
numerical analysis.
Quiz
A The first number is increased by one.
B The first number is duplicated.
C It swaps the selected element with the last unsorted element.
D It swaps the selected element with the first unsorted element.
pass, the algorithm finds the smallest value in the unsorted portion and places it into the first position of
that unsorted portion (which is also the next position in the sorted prefix). This is usually done by
swapping the element at the minimum’s index with the element at the boundary index (the “first unsorted
element”). That description matches option D.
If the first element of the unsorted portion is already the smallest, then the minimum’s index equals the
boundary index. In textbook implementations, the algorithm may still execute a swap operation, but it
becomes a swap of an element with itself (a no-op), leaving the array unchanged. Many implementations
include a small optimization: perform the swap only if the minimum index differs from the boundary
index. Either way, conceptually the “action taken” by selection sort is still “swap the selected minimum
into the first unsorted position,” which is exactly what option D states.
Options A and B are unrelated to sorting; selection sort never increases or duplicates values. Option C is
incorrect because selection sort swaps the minimum with thefirstunsorted element, not the last. After the
swap (or no-op), the sorted region grows by one element, and the algorithm repeats from the next
boundary position.
This logic is fundamental for understanding how selection sort ensures correctness: after pass i, the
smallest i+1 elements are fixed in their final positions.
Quiz
A np_2d[1, 3]
B np_2d[2, 0]
C np_2d[3, 1]
D np_2d[0, 2]
array, indexing is typically written in the form array[row_index, column_index]. The first index selects the
row, and the second index selects the column. Therefore, the “first row” corresponds to row index 0.
Within that row, the “third element” corresponds to column index 2, because the columns are indexed 0,
1, 2, 3, and so on.
So, np_2d[0, 2] directly selects the element at row 0 and column 2, which is the third element in the first
row. This is considered an “alternative” to approaches like two-step indexing (np_2d[0][2]), and it is the
standard idiom taught for multi-dimensional NumPy arrays.
The other choices point to different locations. np_2d[1, 3] is the fourth element of the second row, not the
third element of the first row. np_2d[2, 0] and np_2d[3, 1] attempt to access the third or fourth row, which
would often be out of bounds in a small 2-row example and would raise an IndexError. Correct indexing
is a cornerstone of array programming because it determines which observation, feature, or matrix entry
your computations will use.
Quiz
A array[-2:, :]
B array[-1:, -1:]
C array[-2:, -2:]
D array[:, -2:]
indices to count from the end. In a 2D array, slicing is written as array[rows, columns]. To get thelast two
rows, you use -2: in the row position, meaning “start two rows from the end and go to the end.” Similarly,
to get thelast two columns, you use -2: in the column position. Combining these gives array[-2:, -2:],
which selects the bottom-right 2×2 subarray.
Option A, array[-2:, :], selects the last two rows butall columns, so it is not restricted to the last two
columns. Option D, array[:, -2:], selects all rows but only the last two columns. Option B, array[-1:, -1:],
selects only the last row and the last column, producing a 1×1 (or 1×1 view) subarray, not a 2×2.
This kind of slicing is widely taught because it is essential for matrix operations, extracting submatrices,
working with sliding windows, and manipulating image or time-series data where “take the last k
observations/features” is common. Negative indexing reduces errors and makes code clearer, especially
compared with computing explicit indices like array[rows-2:rows, cols-2:cols].
Quiz
A NTFS
B FAT32
C HFS+
D EXT4
drives because it supports advanced features required for modern operating systems. One of the most
important features is support forfile and folder permissionsvia Access Control Lists (ACLs). Permissions
enable the OS to enforce security policies by controlling which users and groups can read, write,
execute, modify, or delete specific resources. This is fundamental to multi-user security and is a
standard topic in operating systems and security textbooks.
FAT32 is an older file system designed for simplicity and broad compatibility. It does not provide the
same fine-grained permission model as NTFS, which is why it is often used for removable media where
cross-platform compatibility matters more than access control. HFS+ is historically associated with
Apple’s macOS systems, and EXT4 is widely used on Linux. While these file systems have their own
permission and feature models, they are not the common Windows default for permission-managed
storage in typical Windows deployments.
NTFS also supports journaling (improving reliability after crashes), large file sizes, quotas, compression,
and encryption features (through Windows facilities). In enterprise environments, NTFS permissions
integrate with Windows authentication and directory services, enabling centralized user management.
Therefore, for Windows systems requiring file permissions, NTFS is the correct answer.
Quiz
A Use square brackets and the equals sign
B Use parentheses and the plus sign
C Use curly brackets and the equals sign
D Use the del keyword and the element’s value
The standard textbook method for updating a specific element isindex assignment, which uses square
brackets to select the position and the equals sign to assign a new value. For example, if nums = [10, 20,
30], then nums[1] = 99 changes the element at index 1 from 20 to 99, producing [10, 99, 30]. This works
because lists store references to objects and allow those references to be updated in-place.
Option B is incorrect because parentheses are used for function calls and tuples, and the plus sign
typically performs concatenation (creating a new list) rather than modifying an existing element by
position. Option C is incorrect because curly brackets denote dictionaries or sets, not lists. Option D is
incorrect because del removes elements by index or slice (for example, del nums[1]), and it does not
delete by “the element’s value” unless you first find the index. Deleting is not the same as changing;
deletion reduces the list’s length and shifts later indices.
Index assignment is fundamental in list manipulation and appears in standard algorithms: updating
counters, replacing sentinel values, editing collections, and implementing in-place transformations
efficiently without allocating a new list.
Quiz
A Task Manager
B Command Prompt
C Control Panel
D PowerShell
it is both a shell and a scripting language designed for system administration and automation. Traditional
Command Prompt focuses on running console commands and batch files with plain-text input and
output. PowerShell, by contrast, uses an object-oriented pipeline: commands (calledcmdlets) output
structured objects rather than raw text. This enables more reliable scripting and data manipulation, since
you can filter, sort, and transform results without fragile text parsing.
Textbooks covering operating systems and administration emphasize automation and management at
scale. PowerShell integrates tightly with Windows management technologies, such as WMI/CIM, the
registry, services, event logs, and Active Directory environments. It also supports remote management,
scripting modules, robust error handling, and modern security features. This makes it particularly suitable
for tasks like provisioning users, configuring machines, auditing systems, and orchestrating
deployments.
The other options are not command-line interfaces in the same sense. Task Manager is a GUI tool for
viewing processes and performance. Control Panel is also GUI-based for system configuration.
Command Prompt is a command line interface, but it is less capable for complex administration
compared to PowerShell’s scripting and object pipeline.
Therefore, from a computer science and systems perspective, PowerShell is the most powerful Windows
CLI environment among the choices.
Quiz
A [10, 20, 30, 40]
B [1, 10]
C [1, 2, 3, 4]
D array([10, 20, 30, 40])
are usingzero-based indexingto select thefirst rowof that 2D array. This is a standard convention in
Python and many other programming languages: index 0 refers to the first element, index 1 to the
second, and so on.
Therefore, np_2d[0] returns all the elements in row 0.
With a typical construction such as np_2d = np.array([[1, 2, 3, 4], [10, 20, 30, 40]]), the first row is [1, 2,
3, 4], so printing np_2d[0] displays that row. NumPy returns the row as a 1D NumPy array, and when
printed it often appears in bracket form like [1 2 3 4] (spaces rather than commas are common in
NumPy’s display).
Conceptually, however, the contents are exactly the first row values, matching option C.
Option A and D show the second row (index 1), not the first. Option B incorrectly suggests a column
extraction rather than a row selection.
Foundations-of-Computer-Science: WGU Foundations of Computer Science Practice test unlocks all online simulator questions
Thank you for choosing the free version of the Foundations-of-Computer-Science: WGU Foundations of Computer Science practice test! Further deepen your knowledge on WGU Simulator; by unlocking the full version of our Foundations-of-Computer-Science: WGU Foundations of Computer Science Simulator you will be able to take tests with over 71 constantly updated questions and easily pass your exam. 98% of people pass the exam in the first attempt after preparing with our 71 questions.
BUY NOWWhat to expect from our Foundations-of-Computer-Science: WGU Foundations of Computer Science practice tests and how to prepare for any exam?
The Foundations-of-Computer-Science: WGU Foundations of Computer Science Simulator Practice Tests are part of the WGU Database and are the best way to prepare for any Foundations-of-Computer-Science: WGU Foundations of Computer Science exam. The Foundations-of-Computer-Science: WGU Foundations of Computer Science practice tests consist of 71 questions and are written by experts to help you and prepare you to pass the exam on the first attempt. The Foundations-of-Computer-Science: WGU Foundations of Computer Science database includes questions from previous and other exams, which means you will be able to practice simulating past and future questions. Preparation with Foundations-of-Computer-Science: WGU Foundations of Computer Science Simulator will also give you an idea of the time it will take to complete each section of the Foundations-of-Computer-Science: WGU Foundations of Computer Science practice test . It is important to note that the Foundations-of-Computer-Science: WGU Foundations of Computer Science Simulator does not replace the classic Foundations-of-Computer-Science: WGU Foundations of Computer Science study guides; however, the Simulator provides valuable insights into what to expect and how much work needs to be done to prepare for the Foundations-of-Computer-Science: WGU Foundations of Computer Science exam.
BUY NOWFoundations-of-Computer-Science: WGU Foundations of Computer Science Practice test therefore represents an excellent tool to prepare for the actual exam together with our WGU practice test . Our Foundations-of-Computer-Science: WGU Foundations of Computer Science Simulator will help you assess your level of preparation and understand your strengths and weaknesses. Below you can read all the quizzes you will find in our Foundations-of-Computer-Science: WGU Foundations of Computer Science Simulator and how our unique Foundations-of-Computer-Science: WGU Foundations of Computer Science Database made up of real questions:
Info quiz:
- Quiz name:Foundations-of-Computer-Science: WGU Foundations of Computer Science
- Total number of questions:71
- Number of questions for the test:50
- Pass score:80%
You can prepare for the Foundations-of-Computer-Science: WGU Foundations of Computer Science exams with our mobile app. It is very easy to use and even works offline in case of network failure, with all the functions you need to study and practice with our Foundations-of-Computer-Science: WGU Foundations of Computer Science Simulator.
Use our Mobile App, available for both Android and iOS devices, with our Foundations-of-Computer-Science: WGU Foundations of Computer Science Simulator . You can use it anywhere and always remember that our mobile app is free and available on all stores.
Our Mobile App contains all Foundations-of-Computer-Science: WGU Foundations of Computer Science practice tests which consist of 71 questions and also provide study material to pass the final Foundations-of-Computer-Science: WGU Foundations of Computer Science exam with guaranteed success. Our Foundations-of-Computer-Science: WGU Foundations of Computer Science database contain hundreds of questions and WGU Tests related to Foundations-of-Computer-Science: WGU Foundations of Computer Science Exam. This way you can practice anywhere you want, even offline without the internet.
BUY NOW