WGU Updated Foundations-of-Computer-Science Exam Questions and Answers by iona

A hash table is a data structure that supports fast lookup, insertion, and deletion by using ahash functionto map keys to positions in an underlying storage structure. In Python, the built-in data structure that provides hash-table behavior is thedictionary, written with curly braces like {"a": 1, "b": 2}. Dictionaries store key–value pairs and are designed so that accessing a value by key, such as d["a"], is efficient on average. Textbooks typically describe this expected efficiency as average-case constant time, often written as O(1), assuming a good hash function and a well-managed table size.

Tuples and lists are sequence types. Lists provide indexed access by integer position, not hashing by arbitrary keys. Tuples are immutable sequences and likewise do not provide key-based hashing semantics. “Array” is not the core built-in mapping structure in Python; while Python has an array module and NumPy has arrays, neither is the built-in hash table abstraction for general key–value storage.

Python dictionaries require keys to be hashable, meaning the key’s hash value is stable during its lifetime (common examples: strings, numbers, tuples of hashable items). This requirement is directly tied to hash-table implementation. Dictionaries are used throughout computer science applications: symbol tables in interpreters, caches and memoization, frequency counting, indexing, and implementing graphs via adjacency maps.

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.

Authenticationis the security process of proving or establishing a user’s identity. In textbook terminology, authentication answers the question: “Who are you?” Common authentication factors include something you know (password, PIN), something you have (smart card, hardware token), and something you are (biometrics). Username and password is the classic “something you know” mechanism, where the username identifies the account and the password serves as a secret used to validate that the user is the rightful owner of that account.

Authentication is distinct fromauthorization, which determines what an authenticated user is allowed to do (permissions, roles). It is also distinct from registration, which is the administrative act of creating an account or enrolling a user in a system. “Verification” is a general term that can appear in many contexts, but in security frameworks the precise term for identity establishment is authentication. “Certification” usually refers to issuing or validating credentials such as digital certificates (PKI) or professional certifications, not the act of logging in with a password.

Textbooks emphasize that authentication should be strengthened with practices like hashing and salting passwords, multi-factor authentication (MFA), lockout policies, and secure transport (e.g., TLS) to prevent credential theft. The core concept remains: the process that establishes identity using credentials like a username and password is authentication.

Binary search is a classic algorithm for finding a target value in asortedlist 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)