Searches and Sorts

Which of these is a type of searching algorithm

• Bubble

• Hulks

• Binary

• Merge

Which of these is the fastest?

• Bubble Sort

• Merge Sort

• Insertion Sort

• Quick Sort

Which of these is an advantage of merge sort?

• It uses more memory

• Good for large programs

• It is easy to implement

• It works on unordered lists

Which of these is a sorting algorithm?

• Linear

• Binary

• Merge

• Fibonacci

Which of these do not work on unsorted lists

• Binary search

• Merge Sort

• Linear search

• Bubble Sort

Bubble sort is good because...

• It works well with large lists

• It works well with unsorted lists

• It is very easy to implement

• It takes a short amount of time to sort items

Fill in the missing word. Reverse ______ Notation

Convert this post-fix to Infix: AB + CD -*

• (A + B) * (C + D)

• (A * B) - (C + D)

• (C - D) * (A + B)

• (B + C) * (A - D)

What does a in-order traversal of a binary tree do?

• Produce an infix expression

• Produce a post-fix expression

• Produce a binary expression

• Produce a prefix expression

What is iteration?

• Splitting data into separate lists

• Repeating the same task only if a decision says so

• Repeating the same task several times

• Typing the same order till you get bored