The WGU Foundations of Computer Science (Foundations-of-Computer-Science)

Python lists are ordered sequences indexed starting from 0. This zero-based indexing is standard in many programming languages and is a core concept in data structures. For the list `employees = ["Anika", "Omar", "Li", "Alex"] `, the mapping of indices to elements is: index 0 → "Anika", index 1 → "Omar", index 2 → "Li", index 3 → "Alex". Therefore, the expression `employees[3]` selects the element at index 3, which is `"Alex"`, and `print(employees[3] )` outputs `Alex` (strings print without quotes in normal output).

Option A would be correct for `employees[1]`, option D would be correct for `employees[2] `, and option C would be correct for `employees[0]`. This kind of question tests understanding of list indexing, which is essential for iteration, slicing, and algorithm implementation.

# Textbooks also note the difference between indexing and slicing: indexing returns a single element, while slicing returns a sublist. Here, because square brackets contain a single integer index, it is indexing. If you attempted an index that is out of range, Python would raise an `IndexError`, which reinforces careful reasoning about list length and positions. Understanding these fundamentals is critical for correctly manipulating datasets, where row/column positions and offsets frequently matter.

Python slicing follows the rule `sequence[start:stop]`, where the `start` index is **inclusive** and the `stop` index is **exclusive**. This convention is taught widely because it makes many algorithms and boundary cases simpler: the length of the slice is `stop - start` (when step is 1), and adjacent slices can partition a sequence without overlap. For a list named `fam`, the slice `fam[3:6] ` starts at index 3 and includes the elements at indices 3, 4, and 5, but it stops before index 6.

This is a frequent source of off-by-one errors for beginners, so textbooks emphasize remembering: “start is included, stop is not.” If `fam` had at least 6 elements, then `fam[3:6]` would produce a new list of exactly three elements (positions 3, 4, 5). If `fam` had fewer than 6 elements, Python would still return a valid slice up to the end without raising an error, because slicing is designed to be safe within bounds.

# Option A is incorrect because it skips index 3 and incorrectly includes index 6. Option B is incorrect because it includes index 6, which the stop boundary excludes. Option D is incorrect because slicing returns a sublist, not a single element; a single element would require indexing like `fam[6]`.

Python lists are mutable sequences, which means elements can be changed in place after the list has been created. The expression list1[0] = "California" uses indexing to target the element at position 0 (the first element, because Python uses zero-based indexing) and assignment (=) to replace that element with a new value. As a result, the list keeps the same length, but its first entry becomes "California".

This operation does not create a new list (so option A is incorrect); it modifies the existing list object referenced by list1. It also does not append to the end of the list (so option C is incorrect). Appending would use methods like list1.append("California"). Option D is not meaningful in Python list semantics; assignment to a single index replaces exactly one element rather than “adding a second element to the line.”

Textbooks highlight this difference between mutable and immutable sequence types. For example, strings are immutable, so you cannot assign to some_string[0]. Lists, however, are designed for collections that change over time, supporting updates, insertions, deletions, and reordering. Index assignment is fundamental for many algorithms: updating an array-like buffer, modifying a dataset row, replacing incorrect values, or implementing in-place transformations efficiently.

In Python, a list is a mutable sequence, meaning its elements can be changed after the list is created. The standard textbook method for updating a specific element is index 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.

In NumPy, a 2D array can be visualized as a table of rows and columns. When you write np_2d[0], you are using zero-based indexing to select the first row of 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.

In a 2D NumPy array, indexing is written as array[row_index, column_index] using zero-based indices. 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.

Binary search is a classic algorithm for finding a target value in a sorted list or array. Its key idea is to eliminate half of the remaining search space at each step. The algorithm compares the target with the middle element. If the target is smaller, it continues searching in the left half; if larger, it searches the right half. Because each comparison reduces the problem size from n to approximately n/2, the number of steps grows with the number of times you can halve n before reaching 1 element.

This repeated halving leads to a logarithmic running time. Formally, the recurrence is often written as T(n) = T(n/2) + O(1), which solves to T(n) = O(log n). ( GeeksforGeeks ) Textbooks emphasize that this is dramatically faster than linear search (O(n)) for large datasets, but only when the data is already sorted (or can be sorted once and searched many times).

The other options do not match binary search behavior: O(n^2) is typical of certain nested-loop algorithms, and O(2^n) is associated with exponential-time brute force in combinatorial problems. Binary search’s hallmark is its logarithmic growth in comparisons, making it a foundational technique in algorithms courses. ( GeeksforGeeks )

A central rule in NumPy is that an ndarray has a single, fixed data type called its dtype . That dtype is chosen when the array is created (for example, int64, float64, etc.), and it normally does not change just because you assign a new value into one element. When you attempt an assignment, NumPy tries to cast the assigned value into the array’s existing dtype. If the cast is possible, the assignment succeeds; if the cast is impossible, NumPy raises an error.

So, if you have a numeric array such as arr = np.array([1, 2, 3]), its dtype is an integer type. Trying arr[0] = "hello" cannot be converted into an integer, so NumPy raises a ValueError (a casting/conversion error). This is exactly the behavior textbooks highlight when contrasting NumPy arrays with Python lists: lists can hold mixed types freely, but NumPy arrays trade that flexibility for speed and memory efficiency via uniform typing.

Option A is a common misconception. While NumPy may “upcast” values to a more general dtype at array creation time when mixed types are provided (e.g., numbers and strings in the same constructor), a pre-existing numeric array will not automatically convert itself into a string array during a single-element assignment. Options C and D do not reflect NumPy’s assignment rules.

In Python, external libraries are brought into a program using the import statement. NumPy, which provides the ndarray type and a large collection of numerical computing functions, is conventionally imported with an alias for convenience. The standard and widely taught pattern is import numpy as np. This imports the numpy module and binds it to the shorter name np, making code more readable and reducing repeated typing, especially in mathematical expressions such as np.array(...), np.mean(...), or np.dot(...).

Option A is incorrect because the module name is numpy, not num_py. Options C and D resemble syntax from other languages (for example, “using” in C# or “include” in C/C++), but they are not valid Python import mechanisms. Python’s module system is based on imports, and the aliasing feature (as np) is built into the import statement.

Textbooks also emphasize that importing a package requires that it be installed in the active Python environment. If NumPy is not installed, import numpy as np will raise an ImportError (or ModuleNotFoundError in modern Python). Once imported, the alias np is used consistently in scientific computing materials, notebooks, and professional data analysis codebases, which is why this option is considered the correct and expected answer.