CSP-Algorithm

• Algorithm 1 calculates the correct sum, but algorithm 2 does not.

• Algorithm 2 calculates the correct sum, but algorithm 1 does not.

• Both algorithms calculate the correct sum.

• Neither algorithm calculates the correct sum.

• 1/n

• n^2

• n

• n^3

A high school provides email addresses to freshman students. The email system typically assigns an email address in the format "[e-mail]". However, if a student has the same name as a previous student, the system assigns them a different format.

In order to figure out whether an email address is already assigned, the system does a binary search through its list of existing email addresses.

Which of these statements is true?

• The list of email addresses must be sorted for binary search to work.

• In the worst case that the email address is not in the list, binary search will need to look at every item in the list.

• The code for the binary search algorithm must be written in binary to achieve optimum efficiency.

• The list of email addresses don't need to be sorted for binary search to work, but that would improve the efficiency of the algorithm.

Ryland is creating an article about commonly used compression algorithms for an online educational site.

He's debating whether to express each algorithm in natural language, flow charts, pseudocode, or C++, a general-purpose programming language.

Which of these is a good argument for expressing the algorithm in pseudocode?

• Pseudocode can express more detail than natural language, flow charts, and C++.

• Pseudocode doesn't depend on the syntax and subtleties of a particular programming language, so his readers will be able to understand it as long as they know at least one language.

• Pseudocode can be understood by anyone, even those without any programming experience.

• Pseudocode can run on any computer, so all his readers will be able to run the algorithm themselves.

• 1900 false

  1984 true

  2000 false

  2002 false

• 1900 true

  1984 true

  2000 false

  2002 false

• 1900 false

  1984 true

  2000 true

  2002 false

• 1900 true

  1984 true

  2000 true

  2002 false

解決同一個問題有a,b,c,d四個程式能做到，其時間複雜度分別為

A.6n^2

B.6n

C.1/n

D.2^n

請依據效能由好到壞排序(假設n很大)

• C > B > A > D

• B>D>A>C

• D>B>C>A

• A>B>C>D

• Yes, that test case is sufficient proof that the procedure works as intended for all possible lists of numbers.

• No, since the expected return value is not [1, 2, 3, 4] for that test case.

• No, but the programmer can conclude that it always works when generating lists that are 4 numbers long.

• No, they've only verified that it works for that test case. Additional analysis and reasoning is necessary.

the variable n starts off as 5, what would be displayed as a result of executing this algorithm?

• 31

• 1

• 16 8 4 2 1

• 5 16 8 4 2

• Selection

• Sequencing

• Iteration

• None of the above

• Creating an image that visualizes the game and the pieces in their current location

• Calculating the path from a piece's start position to a clicked position

• Sorting the high scores of the top players

• Choosing a good move when the computer is playing against the human