Problem Solving

Fundamentals of Algorithmic Problem Solving

download Export
search_insights Statistics
stylus_note White Board
Quran
calculate Calculator
dictionary Dictionary
fullscreen Full Screen
QUESTION OF
volume_mute Read quiz aloud
Views #: 1422
Questions #: 20
Pass Score: 80.0%
Style
Mode

An algorithm is an answer to a problem

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

One may opt for an approximation algorithm for the following reasons

1 pts
volume_mute
  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
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

An algorithm can be described in words and in ________

1 pts
volume_mute
Missing
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

Pseudocode has a single form that everyone uses

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

A flowchart is a convenient way to represent a complex algorithm

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

Proving an approximation algorithm to be correct is decided if

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

Generality is always a desired characteristic in an algorithm

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

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

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

Verifying a coded algorithm in a program is by _______

1 pts
volume_mute
note_alt Add notes
✕
flag Flag
volume_mute

Correct Answer

Explanation

✕
0
sin cos tan
sin-1 cos-1 tan-1 π e
xy x3 x2 ex 10x
y√x 3√x √x ln log
( ) 1/x % n!
7 8 9 + MS
4 5 6 – M+
1 2 3 × M-
0 . EXP ÷ MR
± RND C = MC
Keywords
Year 10