C949 STUDY | FROM QUESTION TO PERFECTION| STUDY
WITH CONFIDENCE!
Course Code:
Course Title:
Programme:
Academic Year: 2026/2027
Duration: 2 Hours
Total Marks: 70%
Candidate Instructions:
1) Write your Registration Number on every answer booklet used.
2) Answer ALL questions in Section A and ANY TWO (2) questions in Section B.
3) Read each question carefully before answering.
4) Begin each question on a new page.
5) The marks for each question are indicated in brackets.
6) This paper consists of several printed pages, including this page.
7) Ensure your copy is complete before the examination begins.
8) Unauthorized materials and communication with other candidates are not permitted.
Turn Over.
APPHIA – Crafted with Care and Precision for Academic Excellence.
1
,Finiteness Answer: An algorithm must always have a finite number of steps before it ends.
When the operation is finished, it must have a defined endpoint or output and not enter an
endless loop.
Definiteness Answer: An algorithm needs to have exact definitions for each step. Clear and
straightforward directions ensure that every step is understood and can be taken easily.
Input Answer: An algorithm requires one or more inputs. The values that are first supplied to
the algorithm before its processing are known as inputs. These inputs come from a
predetermined range of acceptable values.
Output Answer: One or more outputs must be produced by an algorithm. The output is the
outcome of the algorithm after every step has been completed. The relationship between the
input and the result should be clear.
Effectiveness Answer: An algorithm's stages must be sufficiently straightforward to be carried
out in a finite time utilizing fundamental operations. With the resources at hand, every operation
in the algorithm should be doable and practicable.
Generality Answer: Rather than being limited to a single particular case, an algorithm should be
able to solve a group of issues. It should offer a generic fix that manages a variety of inputs
inside a predetermined range or domain.
Modularity Answer: This feature was perfectly designed for the algorithm if you are given a
problem and break it down into small-small modules or small-small steps, which is a basic
definition of an algorithm.
Correctness Answer: An algorithm's correctness is defined as when the given inputs produce the
desired output, indicating that the algorithm was designed correctly. An algorithm's analysis has
been completed correctly.
Maintainability Answer: It means that the algorithm should be designed in a straightforward,
structured way so that when you redefine the algorithm, no significant changes are made to the
algorithm.
Functionality Answer: It takes into account various logical steps to solve a real-world problem.
Robustness Answer: Robustness refers to an algorithm's ability to define your problem clearly.
User-friendly Answer: If the algorithm is difficult to understand, the designer will not explain it
to the programmer.
Simplicity Answer: If an algorithm is simple, it is simple to understand.
Extensibility Answer: Your algorithm should be extensible if another algorithm designer or
programmer wants to use it.
APPHIA – Crafted with Care and Precision for Academic Excellence.
2
, Brute Force Algorithm Answer: A straightforward approach that exhaustively tries all possible
solutions, suitable for small problem instances but may become impractical for larger ones due
to its high time complexity.
Recursive Algorithm Answer: A method that breaks a problem into smaller, similar
subproblems and repeatedly applies itself to solve them until reaching a base case, making it
effective for tasks with recursive structures.
Encryption Algorithm Answer: Utilized to transform data into a secure, unreadable form using
cryptographic techniques, ensuring confidentiality and privacy in digital communications and
transactions.
Backtracking Algorithm Answer: A trial-and-error technique used to explore potential solutions
by undoing choices when they lead to an incorrect outcome, commonly employed in puzzles
and optimization problems.
Searching Algorithm Answer: Designed to find a specific target within a dataset, enabling
efficient retrieval of information from sorted or unsorted collections.
Sorting Algorithm Answer: Aimed at arranging elements in a specific order, like numerical or
alphabetical, to enhance data organization and retrieval.
Hashing Algorithm Answer: Converts data into a fixed-size hash value, enabling rapid data
access and retrieval in hash tables, commonly used in databases and password storage.
Divide and Conquer Algorithm Answer: Breaks a complex problem into smaller subproblems,
solves them independently, and then combines their solutions to address the original problem
effectively.
Greedy Algorithm Answer: Makes locally optimal choices at each step in the hope of finding a
global optimum, useful for optimization problems but may not always lead to the best solution.
Dynamic Programming Algorithm Answer: Stores and reuses intermediate results to avoid
redundant computations, enhancing the efficiency of solving complex problems.
Randomized Algorithm Answer: Utilizes randomness in its steps to achieve a solution, often
used in situations where an approximate or probabilistic answer suffices.
Base Case Answer: The condition under which the recursion stops, representing the simplest
instance of the problem that can be solved directly.
Recursive Case Answer: The part of the algorithm that breaks the problem down into smaller
instances and calls the algorithm recursively on these instances.
Stack Answer: Each recursive call is placed on the system call stack, which unwinds as each
instance of the function returns its result.
Factorial Calculation Answer: A classic example of a recursive algorithm defined as O! = 1
(Base Case) and N! = n * (n-1)! for n > 0 (Recursive Case).
APPHIA – Crafted with Care and Precision for Academic Excellence.
3
WITH CONFIDENCE!
Course Code:
Course Title:
Programme:
Academic Year: 2026/2027
Duration: 2 Hours
Total Marks: 70%
Candidate Instructions:
1) Write your Registration Number on every answer booklet used.
2) Answer ALL questions in Section A and ANY TWO (2) questions in Section B.
3) Read each question carefully before answering.
4) Begin each question on a new page.
5) The marks for each question are indicated in brackets.
6) This paper consists of several printed pages, including this page.
7) Ensure your copy is complete before the examination begins.
8) Unauthorized materials and communication with other candidates are not permitted.
Turn Over.
APPHIA – Crafted with Care and Precision for Academic Excellence.
1
,Finiteness Answer: An algorithm must always have a finite number of steps before it ends.
When the operation is finished, it must have a defined endpoint or output and not enter an
endless loop.
Definiteness Answer: An algorithm needs to have exact definitions for each step. Clear and
straightforward directions ensure that every step is understood and can be taken easily.
Input Answer: An algorithm requires one or more inputs. The values that are first supplied to
the algorithm before its processing are known as inputs. These inputs come from a
predetermined range of acceptable values.
Output Answer: One or more outputs must be produced by an algorithm. The output is the
outcome of the algorithm after every step has been completed. The relationship between the
input and the result should be clear.
Effectiveness Answer: An algorithm's stages must be sufficiently straightforward to be carried
out in a finite time utilizing fundamental operations. With the resources at hand, every operation
in the algorithm should be doable and practicable.
Generality Answer: Rather than being limited to a single particular case, an algorithm should be
able to solve a group of issues. It should offer a generic fix that manages a variety of inputs
inside a predetermined range or domain.
Modularity Answer: This feature was perfectly designed for the algorithm if you are given a
problem and break it down into small-small modules or small-small steps, which is a basic
definition of an algorithm.
Correctness Answer: An algorithm's correctness is defined as when the given inputs produce the
desired output, indicating that the algorithm was designed correctly. An algorithm's analysis has
been completed correctly.
Maintainability Answer: It means that the algorithm should be designed in a straightforward,
structured way so that when you redefine the algorithm, no significant changes are made to the
algorithm.
Functionality Answer: It takes into account various logical steps to solve a real-world problem.
Robustness Answer: Robustness refers to an algorithm's ability to define your problem clearly.
User-friendly Answer: If the algorithm is difficult to understand, the designer will not explain it
to the programmer.
Simplicity Answer: If an algorithm is simple, it is simple to understand.
Extensibility Answer: Your algorithm should be extensible if another algorithm designer or
programmer wants to use it.
APPHIA – Crafted with Care and Precision for Academic Excellence.
2
, Brute Force Algorithm Answer: A straightforward approach that exhaustively tries all possible
solutions, suitable for small problem instances but may become impractical for larger ones due
to its high time complexity.
Recursive Algorithm Answer: A method that breaks a problem into smaller, similar
subproblems and repeatedly applies itself to solve them until reaching a base case, making it
effective for tasks with recursive structures.
Encryption Algorithm Answer: Utilized to transform data into a secure, unreadable form using
cryptographic techniques, ensuring confidentiality and privacy in digital communications and
transactions.
Backtracking Algorithm Answer: A trial-and-error technique used to explore potential solutions
by undoing choices when they lead to an incorrect outcome, commonly employed in puzzles
and optimization problems.
Searching Algorithm Answer: Designed to find a specific target within a dataset, enabling
efficient retrieval of information from sorted or unsorted collections.
Sorting Algorithm Answer: Aimed at arranging elements in a specific order, like numerical or
alphabetical, to enhance data organization and retrieval.
Hashing Algorithm Answer: Converts data into a fixed-size hash value, enabling rapid data
access and retrieval in hash tables, commonly used in databases and password storage.
Divide and Conquer Algorithm Answer: Breaks a complex problem into smaller subproblems,
solves them independently, and then combines their solutions to address the original problem
effectively.
Greedy Algorithm Answer: Makes locally optimal choices at each step in the hope of finding a
global optimum, useful for optimization problems but may not always lead to the best solution.
Dynamic Programming Algorithm Answer: Stores and reuses intermediate results to avoid
redundant computations, enhancing the efficiency of solving complex problems.
Randomized Algorithm Answer: Utilizes randomness in its steps to achieve a solution, often
used in situations where an approximate or probabilistic answer suffices.
Base Case Answer: The condition under which the recursion stops, representing the simplest
instance of the problem that can be solved directly.
Recursive Case Answer: The part of the algorithm that breaks the problem down into smaller
instances and calls the algorithm recursively on these instances.
Stack Answer: Each recursive call is placed on the system call stack, which unwinds as each
instance of the function returns its result.
Factorial Calculation Answer: A classic example of a recursive algorithm defined as O! = 1
(Base Case) and N! = n * (n-1)! for n > 0 (Recursive Case).
APPHIA – Crafted with Care and Precision for Academic Excellence.
3
