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

“Encryption in transit” means protecting data while it moves across a network so that eavesdroppers cannot read or modify it. For email systems, this protection is most commonly provided byTLS (Transport Layer Security). TLS is a cryptographic protocol that can wrap application protocols (including mail protocols) to provide confidentiality, integrity, and server (and sometimes client) authentication. In practice, TLS is used to secure connections such as SMTP submission (often with STARTTLS or implicit TLS), IMAP over TLS, and POP3 over TLS. Textbooks present TLS as the standard successor to SSL and the foundation of secure communication on the modern Internet.

The other options are not correct in this context. FTP is a file transfer protocol and is traditionally unencrypted unless paired with additional security mechanisms (e.g., FTPS, which uses TLS, or SFTP, which uses SSH). HTTP is a web protocol; it becomes encrypted only when used as HTTPS, which again relies on TLS underneath. IMAP is an email retrieval protocol, butIMAP itself is not the encryption protocol—IMAP can be run over TLS (IMAPS) to become secure.

Therefore, the protocol that provides encryption while email messages (or email protocol traffic) are in transit is TLS.

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.

Python slicing uses the notation sequence[start:stop], where start is inclusive and stop is exclusive. When start is omitted, it defaults to 0, meaning the slice starts from the beginning of the sequence. Therefore, fam[:3] is equivalent to fam[0:3]. Because the stop index 3 is excluded, the slice includes elements at indices 0, 1, and 2—exactly the first three elements.

This convention is emphasized in programming textbooks because it makes many tasks natural and reduces boundary errors. For example, “take the first n items” is written as [:n], and “drop the first n items” is written as [n:]. The length of the slice is also easy to reason about: with step 1, it is stop - start, so here it is 3 - 0 = 3.

Option B is incorrect because including four elements would require fam[:4]. Option C would correspond to fam[:2]. Option D describes taking elements from the end, which would use negative indexing such as fam[-3:].

Slicing is widely used for batching, windowing in algorithms, splitting datasets into training/testing segments, and extracting prefixes in parsing tasks. Understanding the inclusive start and exclusive stop rule is essential for correct Python programming.