B. To achieve better results, we have to practice EVERY DAY. Here is the plan:
Create Barron's online test account: http://barronsbooks.com/ap/ap-computer-sci
Mon-Thur, 10 MC questions each day. Publish your answers to this forum, explain why you choose each answer briefly. Sat and Sun, I will post 1 FRQ (part a and b) each day. Post your code in this forum under the same week. All assignments are DUE by midnight of each day.
C. Searching a list for a specific value (key):
Sequential search: how do we search for a key in a a) unsorted lists, or b) sorted lists? What are the best case and worst case scenario in a) and b)?
Binary search: how do we search for a key in a list that is always sorted? What are the best case and worst case scenario?