Problem Solving

by Osama M. Khaled last modified 2022-06-10T02:56:46+01:00

Fundamentals of Algorithmic Problem Solving

Questions #: 20
Pass Score: 80.0%

    An algorithm is an answer to a problem

    True
    False

    For an algorithm designer, understanding the given problem is not always necessary

    True
    False

    An instance of a problem that an algorithm will solve is considered

    an input
    an output
    set of instructions
    insignificant

    A correct algorithm may work most of the time and acceptable to fail in some special cases

    True
    False

    An algorithm designer may risk redoing his work if problem is not completely understood

    True
    False

    Should I worry so much about computer speed when designing my algorithm?

    Yes
    No
    It depends

    Why would one opt for an approximation algorithm not an exact one?

    1. Some problems cannot be solved exactly
    2. The algorithm to find the exact solution may be unacceptably slow because of the complexity of the problem
    3. It may be a part of a more sophisticated algorithm that solves a problem exactly
    True
    False

    One does not have to pay close attention to choosing data structures appropriate for the operations performed by the algorithm

    True
    False

    An algorithm can be described in words and in ________

    Missing

    Describing an algorithm in words using a natural language is always precise and clear

    True
    False

    Pseudocode has a single form that everyone uses

    True
    False

    A flowchart is a convenient way to represent a complex algorithm

    True
    False

    Proving that an algorithm outputs a required result for every legitimate input in a finite amount of time is called

    efficiency
    effectiveness
    correctness
    none of the above

    You need just a single instance of algorithm's input for which the algorithm fails in order to show that the algorithm is incorrect

    True
    False

    Mathematical induction is commonly used to prove the correctness of an algorithm

    True
    False

    Proving an approximation algorithm to be correct is decided if

    all legitimate inputs exactly produce the required results
    all legitimate inputs produce the required results within a predefined error boundary

    Simplicity is a required characteristic in a good algorithm that can be mathematically verified

    True
    False

    Generality is always a desired characteristic in an algorithm

    True
    False

    It is expected to get the right algorithm from the first trial

    True
    False

    Verifying a coded algorithm in a program is by _______

    reading
    consulting
    testing
    re-coding