Informatics 02

This is the ............ algorithm

• Bubble sort

• Insertion Sort

• Merge Sort

• Quick Sort

Calculate the complexity of this algorithm ?

• O(logn)
  

• O(n)

• O(nlogn)

• O(2^n)

Which algorithm does this picture illustrate ?

• Heap Sort

• Bubble Sort

• Insertion Sort

• Merge Sort

This is the ................. algorithm

• factorial checking

• prime number checking

• odd number checking

• even number checking

What is the output of the above program ?

• 10

• 5

• 15

• 5, 10

Which algorithm does this picture illustrate ?

• Binary Search

• Linear Search

What is a pointer ?

• is a variable whose value is the address of another variable

• must be declared before its use to store any variable address

• could be initialized with NULL

• None of these above

Properties of Pass By Value

• function parameters receive copies of the data sent in

• The parameters are still local to the function, but they are reference variables

• Changes to these variables in the function will affect the originals

• No copy is made, so the overhead of copying (time, storage) is saved.

What type of searching algorithm does this picture illustrate ?

• Linear Search

• Binary Search

• Jump search

• None of these above

What are the terminal nodes ?

• A, D, E, H

• B,C,G,I

• F

• A,F,I,H