WGU Foundations-of-Computer-Science Exam Dumps - Actual Questions Answers

In a singly linked list, each node is a small record that typically contains two main parts: a data field and a pointer field. The data field stores the actual value being kept in the list. The pointer field stores the address or reference of another node. The pointer element’s purpose is to connect one node to the next by indicating where the next node is located in memory. This is essential because linked-list nodes are not stored in contiguous memory locations the way array elements are. Nodes may exist anywhere in memory, and the pointer is what preserves the logical sequence of the list.

This design supports efficient structural changes. For traversal, a program starts at the head node and repeatedly follows the pointer to reach subsequent nodes. For insertion, a new node can be added by adjusting a small number of pointers instead of shifting many elements, as would be required in an array. For deletion, the list can “skip over” a node by updating the pointer in the previous node to reference the node after the removed one. The end of the list is typically represented by a null pointer value, signaling there is no next node.

Keeping track of list size or current position is not the responsibility of each node’s pointer field; these are usually handled by separate variables or computed during traversal.

In Python and NumPy, indexing iszero-based, meaning the first element of a 1D sequence is at index 0, the second element is at index 1, and so on. A NumPy array behaves like a sequence for basic indexing, so numpy_array[1] returns the element stored at position 1 in the array. This is a fundamental concept taught in introductory programming and scientific computing: indexing selects a single element, while slicing selects a range.

For example, if numpy_array = np.array([5, 8, 13]), then numpy_array[0] is 5, numpy_array[1] is 8, and numpy_array[2] is 13. The expression numpy_array[1] therefore evaluates to thesecond element(8 in this example). This does not display the entire array (that would happen with print(numpy_array)), and it does not produce an error unless the array is too short. An error such as IndexError occurs only if index 1 is out of bounds, for example when the array has length 1 and you try to access numpy_array[1].

Textbooks emphasize careful reasoning about indices because off-by-one errors are common. In data analysis, correct indexing is crucial for extracting the right observations, features, or time steps from numerical datasets.

Selection sort is the algorithm that repeatedly scans the unsorted portion of a list to find the lowest (or highest) value and then places it into its correct position in the sorted portion. It begins at the first index (position 0) and treats that as the boundary between sorted and unsorted regions. On the first pass, it moves a scanning pointer through the entire list to determine the minimum element and swaps it into position 0. On the second pass, it starts from position 1, scans to the end to find the next minimum, and swaps it into position 1. This continues until the list is sorted.

This matches the question’s description: “starts at the first position and moves the pointer until the end of the list, determining the lowest value.” Textbooks often describe selection sort with two indices: one for the current boundary position and one for scanning the remainder of the list to find the minimum. The algorithm is simple and uses O(1) extra space, but it is inefficient for large lists because it performs O(n²) comparisons regardless of input order.

The other options are not standard algorithm names in typical computer science curricula. While many sorting algorithms exist (insertion sort, merge sort, quicksort, heap sort), “incremental,” “progressive,” and “pointer sort” are not canonical textbook algorithms in this context. Therefore, the correct answer is selection sort.