SDD HSC Quiz 4Review Q1-10

Which of the following lists is in the correct order of creation?

• System models, algorithms, data structures.
• Data structures, system models, algorithms.
• System models, data structures, algorithms.
• Algorithms, system models, data structures.

Which of the following statements is true?

• Linear searches are generally faster than binary searches.
• The data items must be sorted before a linear search.
• Binary searches discard half the list after each comparison.
• A binary search will examine every data item in the list.

At least one item must be in its correct final position after a single pass through the data items when using:

• an insertion or bubble sort.
• a selection or insertion sort.
• a selection or bubble sort.
• a selection sort only.

Adding a new string into the middle of an existing string could be called:

• extracting.
• deleting.
• inserting.
• copying.

Which sort does not involve swapping data items?

• Insertion sort.
• Selection sort.
• Bubble sort.
• Both insertion and selection sorts.

Finding the largest value in an unsorted list of items is:

• similar to one pass of a selection sort.
• the main concept behind an insertion sort.
• accomplished using a binary search.
• possible only when the data is numeric.

Adding one string to one or more other strings is called:

• concatenation.
• inserting.
• combining.
• ampersand.

A data structure where each individual data item may have a different data type is:

• an array of records.
• a record.
• an array.
• a multi-dimensional array.

Records that need to be accessed directly would be stored in a:

• sequential file.
• relative file.
• text file.
• binary file.

Languages that use an event-driven approach contain all the following features EXCEPT:

• Programs written in them have a distinct start and finish.
• The user controls the order of processing.
• They often use a GUI.
• Subroutines are executed as a result of some user action.