WGU C949 DATA STRUCTURES AND
ALGORITHMS ACTUAL EXAM
⩥ Define definiteness in the context of algorithms. Answer: An
algorithm needs clear and exact definitions for each step to ensure
understanding.
⩥ What are inputs in an algorithm? Answer: The values supplied to the
algorithm before processing, coming from a predetermined range.
⩥ What is the output of an algorithm? Answer: The result produced after
all steps of the algorithm are completed.
⩥ Explain the effectiveness of an algorithm. Answer: An algorithm's
steps must be straightforward and feasible to execute in finite time.
⩥ What does generality mean in algorithms? Answer: An algorithm
should solve a group of issues rather than being limited to a single case.
⩥ What is modularity in algorithms? Answer: Refers to breaking down a
problem into smaller, manageable modules or steps.
,⩥ Define correctness in the context of algorithms. Answer: The
algorithm produces the desired output for given inputs.
⩥ What does maintainability refer to in algorithms? Answer: The
algorithm is structured so that redefining it requires minimal changes.
⩥ What is functionality in algorithms? Answer: Considers various
logical steps to solve a real-world problem.
⩥ Explain robustness in algorithms. Answer: Refers to an algorithm's
ability to clearly define the problem it addresses.
⩥ What does user-friendly mean in the context of algorithms? Answer:
An algorithm is easy to understand and explain.
⩥ Why is simplicity important in algorithms? Answer: It makes an
algorithm easier to understand and implement.
⩥ What is extensibility in algorithms? Answer: The algorithm can be
adapted or used by other designers or programmers.
⩥ What is a brute force algorithm? Answer: A straightforward approach
that tries all possible solutions, suitable for small problems.
,⩥ Define a recursive algorithm. Answer: A method that breaks a
problem into smaller subproblems and solves them recursively.
⩥ What is an encryption algorithm? Answer: An algorithm that
transforms data into a secure form to ensure confidentiality.
⩥ What is a backtracking algorithm? Answer: A trial-and-error technique
used to explore potential solutions by undoing choices.
⩥ What is the purpose of a searching algorithm? Answer: To find a
specific target within a dataset efficiently.
⩥ What does a sorting algorithm do? Answer: It arranges elements in a
specific order for better organization and retrieval.
⩥ What is a hashing algorithm? Answer: It converts data into a fixed-
size hash value for rapid access in databases.
⩥ Explain the divide and conquer algorithm. Answer: It breaks a
complex problem into smaller subproblems, solves them independently,
and combines the solutions.
, ⩥ What is a greedy algorithm? Answer: An algorithm that makes locally
optimal choices at each step to find a global optimum.
⩥ Define dynamic programming algorithm. Answer: It stores and reuses
intermediate results to enhance efficiency in solving problems.
⩥ What is a randomized algorithm? Answer: An algorithm that uses
randomness in its steps to achieve a solution.
⩥ What is a base case in recursive algorithms? Answer: The condition
under which the recursion stops, representing the simplest instance of
the problem.
⩥ What is a recursive case in recursive algorithms? Answer: The part of
the algorithm that breaks the problem down into smaller instances and
calls itself.
⩥ What is the role of the stack in recursive algorithms? Answer: Each
recursive call is placed on the system call stack, unwinding when the
base case is reached.
⩥ What is the time complexity of linear search? Answer: O(n), where n
is the number of elements in the array.
ALGORITHMS ACTUAL EXAM
⩥ Define definiteness in the context of algorithms. Answer: An
algorithm needs clear and exact definitions for each step to ensure
understanding.
⩥ What are inputs in an algorithm? Answer: The values supplied to the
algorithm before processing, coming from a predetermined range.
⩥ What is the output of an algorithm? Answer: The result produced after
all steps of the algorithm are completed.
⩥ Explain the effectiveness of an algorithm. Answer: An algorithm's
steps must be straightforward and feasible to execute in finite time.
⩥ What does generality mean in algorithms? Answer: An algorithm
should solve a group of issues rather than being limited to a single case.
⩥ What is modularity in algorithms? Answer: Refers to breaking down a
problem into smaller, manageable modules or steps.
,⩥ Define correctness in the context of algorithms. Answer: The
algorithm produces the desired output for given inputs.
⩥ What does maintainability refer to in algorithms? Answer: The
algorithm is structured so that redefining it requires minimal changes.
⩥ What is functionality in algorithms? Answer: Considers various
logical steps to solve a real-world problem.
⩥ Explain robustness in algorithms. Answer: Refers to an algorithm's
ability to clearly define the problem it addresses.
⩥ What does user-friendly mean in the context of algorithms? Answer:
An algorithm is easy to understand and explain.
⩥ Why is simplicity important in algorithms? Answer: It makes an
algorithm easier to understand and implement.
⩥ What is extensibility in algorithms? Answer: The algorithm can be
adapted or used by other designers or programmers.
⩥ What is a brute force algorithm? Answer: A straightforward approach
that tries all possible solutions, suitable for small problems.
,⩥ Define a recursive algorithm. Answer: A method that breaks a
problem into smaller subproblems and solves them recursively.
⩥ What is an encryption algorithm? Answer: An algorithm that
transforms data into a secure form to ensure confidentiality.
⩥ What is a backtracking algorithm? Answer: A trial-and-error technique
used to explore potential solutions by undoing choices.
⩥ What is the purpose of a searching algorithm? Answer: To find a
specific target within a dataset efficiently.
⩥ What does a sorting algorithm do? Answer: It arranges elements in a
specific order for better organization and retrieval.
⩥ What is a hashing algorithm? Answer: It converts data into a fixed-
size hash value for rapid access in databases.
⩥ Explain the divide and conquer algorithm. Answer: It breaks a
complex problem into smaller subproblems, solves them independently,
and combines the solutions.
, ⩥ What is a greedy algorithm? Answer: An algorithm that makes locally
optimal choices at each step to find a global optimum.
⩥ Define dynamic programming algorithm. Answer: It stores and reuses
intermediate results to enhance efficiency in solving problems.
⩥ What is a randomized algorithm? Answer: An algorithm that uses
randomness in its steps to achieve a solution.
⩥ What is a base case in recursive algorithms? Answer: The condition
under which the recursion stops, representing the simplest instance of
the problem.
⩥ What is a recursive case in recursive algorithms? Answer: The part of
the algorithm that breaks the problem down into smaller instances and
calls itself.
⩥ What is the role of the stack in recursive algorithms? Answer: Each
recursive call is placed on the system call stack, unwinding when the
base case is reached.
⩥ What is the time complexity of linear search? Answer: O(n), where n
is the number of elements in the array.
