search algorithms, decomposition, sorting algorithms

Which of these are fundamental control structures in any computer program?

• branching

• sequence

• selection

• repetition

• iteration

For which of the problems would the bubble sort algorithm provide an appropriate solution. Choose all that apply.

• Arranging a deck of cards from the lowest to the highest value cards.

• Looking up a name in the phone book.

• Sorting a stack of paper money into denominations -- i.e., £5, £10, £20 etc.

• Sorting a basket of laundry into socks, shirts, shorts, and sheets.

• Arranging books on a bookshelf by author's last name.

For what purpose would a merge sort algorithm be used?

• To list items alphabetically.

• To reorder a single list.

• To combine identical lists together.

• To reorder multiple lists into a singular ordered list.

Which of the following blocks of code is an example of a selection?

Answers: 2

• 
• 
• 
• 
• 

1. What's on line 5?

• 2D array

• 1D array

• Variable

• Function

What is the time complexity of this algorithm?

• O(n)

• O(2ⁿ)

• O(log n)

• O(n²)

• O(1)

....................... takes each item in turn, compare it to items in the sorted sublist and places it in the correct position.

• Bubble sort

• Insertion sort

• Binary search

Merge Sort is?

• When a list is kept as one and compared
• List is split into 2 and merged together
• List is split into 2 and kept seperate
• Nothing

What are these?

• Boolean operators

• Arithmetic operators

• Smooth operators

• Comparative operators

What is line 2 doing?

• Writing the content of a file

• Reading the content of a file

• Closing a file

• Opening a file