Unsere Prüfungsunterlage zu WGU Foundations-of-Computer-Science（WGU Foundations of Computer Science）enthältet alle echten, originalen und richtigen Fragen und Antworten. Die Abdeckungsrate unserer Unterlage (Fragen und Antworten) zu WGU Foundations-of-Computer-Science（WGU Foundations of Computer Science）ist normalerweise mehr als 98%.
| Section | Objectives |
|---|---|
| Topic 1: Computer Science Fundamentals | - Data Structures Introduction
|
| Topic 2: Programming Foundations | - Programming Concepts
|
| Topic 3: Data & Security Basics | - Security Fundamentals
|
| Topic 4: Operating Systems & Architecture | - OS Fundamentals
|
>> Foundations-of-Computer-Science Fragenpool <<
Wir It-Pruefung bietet Ihnen die Prüfungsfragen und Antworten zur WGU Foundations-of-Computer-Science von höchster Qualität, damit Sie viel näher von Ihrem Erfolg sind. Wenn Sie noch ein paar Sorgen haben, können Sie die Foundations-of-Computer-Science Demo durch die Webseite It-Pruefung herunterladen. Hier versprechen wir Ihnen, dass wir Ihnen noch einjähriger Aktualisierung kostenlos anbieten werden, nachdem Sie die Prüfungsfragen und Antworten zur WGU Foundations-of-Computer-Science gekauft haben.
28. Frage
How does the data type of a variable get set in Python?
Antwort: B
Begründung:
Python usesdynamic typing, a core concept emphasized in programming language textbooks. In dynamically typed languages, a variable name does not permanently "own" a type. Instead, theobjectcreated by an expression has a type, and the variable becomes a reference to that object. Therefore, the type associated with a variable at any moment is determined by the value assigned to it. For example, after x = 7, x refers to an integer object. After x = "seven", the same name now refers to a string object. The type changes because the binding changes, not because the variable's type declaration was edited.
Option A describesstatic typingsystems (common in languages like Java, C, or C++), where programmers declare types and compilers enforce them. Python does not require such declarations for ordinary variables.
Option B is incorrect because type assignment is deterministic, not random. Option C is incorrect because Python does not default variables to strings; it assigns whatever type results from the right-hand-side expression.
This model is closely tied to Python's runtime behavior: type checks occur during execution, and functions can accept values of different types as long as the operations used are valid (often discussed as
"duck typing"). This flexibility supports rapid development, but also motivates careful testing and, in larger systems, optional type hints for documentation and tool support.
29. Frage
What is another term for the inputs into a function?
Antwort: B
Begründung:
In programming, a function takes inputs, performs computation, and may return an output. The standard term for a function's inputs isarguments(also commonly discussed alongside the closely related termparameters).
Textbooks typically distinguish the two:parametersare the names listed in the function definition, while argumentsare the actual values supplied when the function is called. For example, in def f(x, y):, x and y are parameters. In the call f(3, 5), 3 and 5 are arguments. Many introductory materials use "arguments" informally to refer to the inputs overall, which matches the wording of this question.
Options A, B, and C do not fit the textbook definition. "Variables" is too broad; inputs can be literals, expressions, or variables, but the conceptual role is "arguments." "Procedures" are callable units of code (often used in some languages to mean functions without return values), not the inputs. "Outputs" refers to returned results, not what you pass in.
Understanding arguments is important because it connects to call semantics, scope, and correctness.
Different languages support positional arguments, keyword arguments, default values, and variadic arguments (e.g., *args, **kwargs in Python). This flexibility shapes API design and influences how programmers structure reusable code.
30. Frage
Which principle can be used to implement an algorithm to calculate factorial or Fibonacci sequence?
Antwort: A
Begründung:
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.
31. Frage
What code would print a subarray of the first 5 elements in numpy_array?
Antwort: A
Begründung:
NumPy arrays support slicing using the same start:stop convention as Python sequences. To take the first five elements, you want indices 0 through 4. The slice numpy_array[:5] means "start from the beginning (default start is 0) and stop before index 5." Because the stop index is exclusive, this returns exactly the first five elements. Printing that slice with print(numpy_array[:5]) displays a 1D view (or copy depending on context) containing those elements.
Option A, numpy_array[1:5], starts at index 1, so it returns elements 1 through 4-only four elements-and it excludes the element at index 0, so it is not the first five elements. Options B and D are incorrect because NumPy arrays do not provide a .get() method for slicing in this manner; .get() is a method associated with dictionaries, not arrays.
Textbooks stress slicing because it is efficient and expressive, especially in data analysis. With slicing, you can take prefixes, suffixes, windows, or regularly spaced samples without writing loops. In NumPy, slicing is particularly important because many slices create views into the same underlying data buffer, enabling memory-efficient operations on large datasets. Understanding inclusive start and exclusive stop boundaries is critical to avoid off-by-one mistakes and to work correctly with batches and segments of numerical data.
32. Frage
What is an ndarray in Python?
Antwort: A
Begründung:
An ndarray is NumPy's fundamental data structure: ann-dimensional arraydesigned for efficient numerical computation. The term stands for "N-dimensional array," and it is implemented as numpy.ndarray. Unlike Python's built-in list, an ndarray stores elements in a compact, homogeneous format defined by its dtype (such as integers or floating-point numbers). This uniform representation enables fast, vectorized operations and efficient use of memory, which is why ndarray is central in scientific computing and data analysis.
An ndarray supports multiple dimensions: a 1D array behaves like a vector, a 2D array like a matrix (rows and columns), and higher-dimensional arrays represent tensors. Textbooks emphasize that ndarray operations are typically element-wise by default (for example, a + b adds corresponding elements), and that slicing and broadcasting allow powerful computations without explicit loops. This approach is both expressive and efficient because the heavy lifting happens in optimized low-level code.
Option A is incorrect because ndarray is not built into core Python; it comes from NumPy. Option B describes a tree, which is a different data structure entirely. Option D is incorrect because sockets and XML-related functionality belong to other parts of Python's standard library, not to NumPy or ndarray.
In short, an ndarray is the primary array object of NumPy, providing high-performance multi- dimensional numerical storage and computation.
33. Frage
......
It-Pruefung ist führend in der neuesten WGU Foundations-of-Computer-Science Zertifizierungsprüfung und Prüfungsvorbereitung. Unsere Ressourcen werden ständig überarbeitet und aktualisiert mit einer engenVerknüpfung. Wenn Sie sich heute auf die WGU Foundations-of-Computer-Science Zertifizierungsprüfung vorbereiten, sollen Sie bald die neueste Schulung beginnen und die nächste Prüfungsfragen bestehen. Weil die Mehrheit unserer Fragen monatlich aktualisiert ist, werden Sie die besten Ressourcen mit marktfrischer Qualität und Zuverlässigkeit bekommen.
Foundations-of-Computer-Science Tests: https://www.it-pruefung.com/Foundations-of-Computer-Science.html