Foundations-of-Computer-Science Exam Dumps - WGU Foundations of Computer Science

Outlier detection often relies on measuring how far values deviate from a “typical” center. While variance and standard deviation can be used in simple z-score based methods, they arenot robust: a few extreme outliers can inflate the mean and standard deviation, masking the very outliers you want to find. A widely taught robust alternative is themedian absolute deviation (MAD), which is based on the median rather than the mean and therefore resists distortion by extreme values.

MAD is computed by first taking the median of the data, then computing the absolute deviation of each point from that median, and finally taking the median of those deviations. Because medians are stable under extreme values, MAD provides a strong baseline for identifying unusually distant points. Many textbooks and data analysis references present MAD as a robust scale estimator for outlier detection, often combined with a threshold rule such as flagging points whose deviation exceeds a constant multiple of MAD (with a scaling factor sometimes used to make it comparable to standard deviation under normality assumptions).

In NumPy, you can implement MAD using np.median() and np.abs(). Mode is generally not useful for continuous numeric outlier detection, and variance/standard deviation are more sensitive to outliers than MAD. Thus, among the given options, the best statistical measure for detecting outliers robustly is the median absolute deviation.

Factorial and Fibonacci are classic examples used to teachrecursion, a technique where a function solves a problem by calling itself on smaller subproblems. The key requirement for recursion is (1) abase casethat stops further calls and (2) arecursive casethat reduces the problem size. For factorial, the definition is (n! = n \times (n-1)!) with base case (0! = 1) (or (1! = 1)). For Fibonacci, (F(n) = F(n-1) + F(n-2)) with base cases (F(0)=0) and (F(1)=1). These mathematical definitions map directly into recursive code, which is why textbooks frequently introduce recursion using these sequences.

While factorial and Fibonacci can also be computed iteratively, the question asks for the principle that can be used to implement such algorithms, and recursion is the canonical textbook answer. Recursion also connects to important CS topics: call stacks, activation records, and divide-and-conquer problem solving.

Option A (“procedural programming”) and option D (“object-oriented programming”) are broader paradigms rather than the specific technique used in the classic implementations. Option B (“iterative programming”) is a valid alternative approach, but the standard instructional principle highlighted for these particular examples is recursion. Textbooks also note that naive recursive Fibonacci is inefficient (exponential time) unless optimized with memoization or converted to an iterative or dynamic programming approach.

Most NumPy arrays enforce a key constraint: all elements share the samedtype(data type). This uniform typing is foundational to NumPy’s performance model. Because each element has the same size and representation, NumPy can store the array in a contiguous memory block and apply low-level, vectorized operations efficiently. This is why NumPy is widely used for numerical computing, statistics, and data analysis: operations like addition, multiplication, and reductions (sum/mean) can be implemented in optimized compiled code without per-element Python overhead.

Option B captures this textbook principle: elements in a typical ndarray are of the same data type. The other options are incorrect. NumPy is not restricted to strings (A), and it is not limited to integers (C); it supports floats, complex numbers, booleans, fixed-width strings, datetime types, and many others. Option D is misleading: NumPy does not continuously “adapt on the fly” during normal use. The dtype is generally fixed once the array exists. What NumPydoesdo is choose an appropriate common dtype when you create an array from mixed inputs (for example, mixing ints and floats yields floats). But after creation, assignments are cast into the existing dtype rather than dynamically changing the dtype to accommodate new values.

This restriction is precisely what differentiates NumPy arrays from Python lists and enables predictable memory layout and fast numerical computation.

In NumPy, every ndarray has a shape attribute that describes the size of the array along each dimension. For a 2D array, shape returns a tuple with two integers: (number_of_rows, number_of_columns). For example, if a = np.array([[1, 2, 3], [4, 5, 6]]), then a.shape is (2, 3), meaning 2 rows and 3 columns. This is a fundamental idea in matrix and array computing, because shape governs how indexing, slicing, broadcasting, and linear algebra operations behave.

Option A describes the dtype, which can be accessed with a.dtype, not a.shape. Option C is incorrect because shape provides per-dimension sizes, not their sum. Option D refers to the total number of elements, which NumPy provides via a.size (or equivalently np.prod(a.shape)).

Textbooks emphasize shape because many errors in numerical computing come from mismatched dimensions. For example, matrix multiplication requires compatible inner dimensions, and broadcasting rules depend on dimension sizes. By checking .shape, programmers can verify their data layout before applying algorithms, ensuring rows represent observations and columns represent features (or vice versa). Thus, for a 2D NumPy array, .shape indicates the number of rows and columns.

Depth-first search (DFS) explores a tree by going as deep as possible along a branch before backtracking. In binary trees, DFS gives rise to the classic traversal orderspre-order,in-order, andpost-order, each defined by when you “visit” the node relative to its left and right subtrees. Pre-order visits the node first, then left subtree, then right subtree. In-order visits left subtree, then the node, then right subtree. Post-order visits left subtree, then right subtree, then the node. These are all DFS-based because they fully explore subtrees before moving sideways to another branch.

Level-order traversalis different: it visits nodes layer by layer from the root outward (all nodes at depth 0, then depth 1, then depth 2, etc.). This is a hallmark ofbreadth-first search (BFS), not DFS. Textbooks emphasize this distinction because DFS and BFS have different properties: BFS naturally finds shortest paths in unweighted graphs and produces level-order traversal in trees, while DFS is useful for tasks like topological sorting, cycle detection, and exploring structure recursively.

Therefore, the traversal order that is impossible to produce as a depth-first traversal of a binary tree is level-order traversal. The DFS orders (pre-, in-, post-) are all achievable by depth-first strategies, typically implemented recursively or with an explicit stack.

The primary advantage of NumPy arrays in data analysis is their support for fast, vectorized computation over whole collections of numeric data. A NumPy `ndarray` stores elements in a contiguous memory block with a single, fixed data type, enabling efficient low-level operations implemented in optimized C/Fortran code. As a result, expressions like `arr + 5`, `arr * arr`, or `np.mean(arr)` operate over the entire array without explicit Python loops. This style is commonly called **vectorization**, and it is a central theme in scientific computing textbooks because it is both clearer to read and significantly faster for large datasets.

Option A describes a property of Python lists, not NumPy arrays. Python lists can mix types freely, but this flexibility comes with overhead. Option B is true—NumPy arrays typically hold a single dtype—but it is not the main advantage; it is more of an implementation feature that enables speed and memory efficiency. Option D is not a defining advantage; both lists and arrays can be concatenated, and NumPy provides dedicated functions such as `np.concatenate`, but concatenation is not the core reason NumPy dominates data analysis workflows.

# Because NumPy operations are applied element-wise across entire arrays and can leverage CPU vector instructions and efficient memory access patterns, they form the foundation for higher-level tools like pandas, SciPy, and many machine learning libraries. This is why the best answer is that NumPy arrays can perform calculations over entire collections of values.

On Windows,PowerShellis generally regarded as the most powerful command-line environment because it is both a shell and a scripting language designed for system administration and automation. TraditionalCommand Promptfocuses 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.

AnAcceptable Use Policy (AUP)defines how employees and users are permitted to use an 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.