Compsci exam study help

star goldstar goldstar goldstar goldstar greyFemaleMale
10 Questions - Developed by: Ivan - Developed on: - 1.731 taken

  • 1
    With a sequential search, the bigger the list of items, the more work is done.
  • 2
    Ease of understanding, elegance, efficiency, and correctness are all desirable properties of algorithms.
  • 3
    3 types of operations used to construct algorithms are sequential, conditional, and iterative.
  • 4
    If a mixture is too dry, then add one half cup of water to the bowl. This is a conditional statement.
  • 5
    If we were to run a sequential search operation many times with random input values occurring at various places in the list we would find that the average number of comparisons would be n/2.
  • 6
    Control operations allow us to alter the normal sequential flow of control in an algorithm.
  • 7
    Wireless communications are a 5th generation innovation in computing.
  • 8
    In the sequential search algorithm the worst case occurs when the value being searched for is the first one in the list.
  • 9
    One of the most fundamentally important virtues of an algorithm is that if we can specify an algorithm to solve a problem, we can automate the solution.
  • 10
    A computer program is often written to be used only once to solve a single instance of a problem.

Comments (0)

autorenew