C949 Pre-assessment Exam Questions With
Correct Answers
Which |term |refers |to |a |template |for |creating |an |object? |- |CORRECT |ANSWER✔✔-Class
Which |characteristic |of |an |algorithm |is |independent |in |nature? |- |CORRECT |ANSWER✔✔-Uses |
an |agnostic |code |repository
What |is |referred |to |as |a |data |structure |that |stores |subitems? |- |CORRECT |ANSWER✔✔-Record
Which |factor |takes |the |ability |to |easily |update |an |algorithm |into |consideration? |- |CORRECT |
ANSWER✔✔-Maintainability
What |is |a |component |of |an |algorithm |that |specifies |a |stopping |point? |- |CORRECT |
ANSWER✔✔-Finiteness
Which |term |refers |to |a |type |of |search |algorithm? |- |CORRECT |ANSWER✔✔-Linear
What |is |a |high-level |consideration |in |an |algorithm's |design? |- |CORRECT |ANSWER✔✔-Simplicity
What |is |the |primary |method |used |to |search |for |an |item |in |a |sorted |array? |- |CORRECT |
ANSWER✔✔-Binary |Search
Which |review |of |an |algorithm |happens |after |implementation? |- |CORRECT |ANSWER✔✔-A |
posteriori |analysis
, Which |factor |helps |measure |the |reusability |of |an |algorithm? |- |CORRECT |ANSWER✔✔-
Extensibility
Which |search |algorithm |utilizes |the |divide-and-conquer |strategy? |- |CORRECT |ANSWER✔✔-
Binary |search
Which |algorithm |requires |data |sorting |as |its |first |step? |- |CORRECT |ANSWER✔✔-Binary
What |does |a |time |complexity |analysis |of |an |algorithm |include? |- |CORRECT |ANSWER✔✔-Worst
|case
Which |data |type |do |heap |sorts |work |with? |- |CORRECT |ANSWER✔✔-Tree-based |data |structure
Which |function |is |used |in |conjunction |with |a |merge |sort |algorithm? |- |CORRECT |ANSWER✔✔-
Recursive
Which |attribute |of |a |recursive |function |makes |it |unique? |- |CORRECT |ANSWER✔✔-Calls |itself
What |is |x |in |the |following |block |of |logic?
x |= |28
if |x |>= |10 |and |x |< |20
| x |= |20
elif |x |<= |30
| x |= |25
elif |x |>= |50
| x |= |100
Correct Answers
Which |term |refers |to |a |template |for |creating |an |object? |- |CORRECT |ANSWER✔✔-Class
Which |characteristic |of |an |algorithm |is |independent |in |nature? |- |CORRECT |ANSWER✔✔-Uses |
an |agnostic |code |repository
What |is |referred |to |as |a |data |structure |that |stores |subitems? |- |CORRECT |ANSWER✔✔-Record
Which |factor |takes |the |ability |to |easily |update |an |algorithm |into |consideration? |- |CORRECT |
ANSWER✔✔-Maintainability
What |is |a |component |of |an |algorithm |that |specifies |a |stopping |point? |- |CORRECT |
ANSWER✔✔-Finiteness
Which |term |refers |to |a |type |of |search |algorithm? |- |CORRECT |ANSWER✔✔-Linear
What |is |a |high-level |consideration |in |an |algorithm's |design? |- |CORRECT |ANSWER✔✔-Simplicity
What |is |the |primary |method |used |to |search |for |an |item |in |a |sorted |array? |- |CORRECT |
ANSWER✔✔-Binary |Search
Which |review |of |an |algorithm |happens |after |implementation? |- |CORRECT |ANSWER✔✔-A |
posteriori |analysis
, Which |factor |helps |measure |the |reusability |of |an |algorithm? |- |CORRECT |ANSWER✔✔-
Extensibility
Which |search |algorithm |utilizes |the |divide-and-conquer |strategy? |- |CORRECT |ANSWER✔✔-
Binary |search
Which |algorithm |requires |data |sorting |as |its |first |step? |- |CORRECT |ANSWER✔✔-Binary
What |does |a |time |complexity |analysis |of |an |algorithm |include? |- |CORRECT |ANSWER✔✔-Worst
|case
Which |data |type |do |heap |sorts |work |with? |- |CORRECT |ANSWER✔✔-Tree-based |data |structure
Which |function |is |used |in |conjunction |with |a |merge |sort |algorithm? |- |CORRECT |ANSWER✔✔-
Recursive
Which |attribute |of |a |recursive |function |makes |it |unique? |- |CORRECT |ANSWER✔✔-Calls |itself
What |is |x |in |the |following |block |of |logic?
x |= |28
if |x |>= |10 |and |x |< |20
| x |= |20
elif |x |<= |30
| x |= |25
elif |x |>= |50
| x |= |100
