# COIS 2020H S61 – For Brian Srivastava

COIS 2020H S61 – For Brian Srivastava
Questions 1 and 3 are programming questions and you should have a source file as well as testing documentation.
Assignments are to be done individually.
1. a) Write a program (including timing measurements) for the following scenario. Generate 20 million random numbers, one at a time, and insert them into an array that doubles every time it runs out of space (starting size of 2), into an array that can hold 20 million elements from creation, and a linked list that can hold 20 million elements. You should do this both for integers and floating point numbers. (The numbers should be regular integers or floats). Compare the time required for each of the six scenarios, and explain the differences. You will need to write your own way to double an array size (it’s up to you how to do this), don’t use an ArrayList.
b) Do a brute force in order search through each of these to find the largest number. Again, compare the timings for all 6 scenarios.
2. You do not need to implement this, just describe the algorithm.
a) Assume you have a robot with a light sensor and you want it to follow a trace (i.e. line) on the ground drawn with a thick marker. Design 2 different algorithms to follow this line and compare their efficiency. (The problem is a search one – if the line bends you need to find it again). Describe/draw/illustrate some worst, or at least bad cases and best case scenarios for your algorithms.
b) Consider the same problem but in 3 dimensions, e.g. a radar array (which produces something like a cone) searching through a sphere around an aircraft looking for incoming missiles or other aircraft.
3. Attached to this assignment is a file titled “A1BoyNames.txt” it is 536 lines long, but some lines have two names separated by a comma. Read in each name into a container structure of your choosing.
a. Using a binary search, and a hash function of some sort attempt to find the names Brian, Bryan, Iain, Ian, and Stefan.
b. Modify your program to search for partial matches (e.g. Bryant would match Bryan and Brian would match Ian).
This list was taken from http://www.world-english.org/boys_names_list.htm. You can manipulate the source data however you want to make it easier to read in.
Questions 1 and 3 are programming questions and you should have a source file as well as testing documentation.
Assignments are to be done individually.
1.    a)  Write a program (including timing measurements) for the following scenario.  Generate 20 million random numbers, one at a time, and insert them into an array that doubles every time it runs out of space (starting size of 2), into an array that can hold 20 million elements from creation, and a linked list that can hold 20 million elements.  You should do this both for integers and floating point numbers.  (The numbers should be regular integers or floats).  Compare the time required for each of the six scenarios, and explain the differences.  You will need to write your own way to double an array size (it’s up to you how to do this), don’t use an ArrayList.
b) Do a brute force in order search through each of these to find the largest number.  Again, compare the timings for all 6 scenarios.
2.     You do not need to implement this, just describe the algorithm.
a)    Assume you have a robot with a light sensor and you want it to follow a trace (i.e. line) on the ground drawn with a thick marker.  Design 2 different algorithms to follow this line and compare their efficiency.  (The problem is a search one – if the line bends you need to find it again).  Describe/draw/illustrate some worst, or at least bad cases and best case scenarios for your algorithms.
b)    Consider the same problem but in 3 dimensions, e.g. a radar array (which produces something like a cone) searching through a sphere around an aircraft looking for incoming missiles or other aircraft.
3.    Attached to this assignment is a file titled “A1BoyNames.txt” it is 536 lines long, but some lines have two names separated by a comma.  Read in each name into a container structure of your choosing.
a.    Using a binary search, and a hash function of some sort attempt to find the names Brian, Bryan, Iain, Ian, and Stefan.
b.    Modify your program to search for partial matches (e.g. Bryant would match Bryan and Brian would match Ian).
This list was taken from http://www.world-english.org/boys_names_list.htm.  You can manipulate the source data however you want to make it easier to read in.

# Our Service Charter

1. ### Excellent Quality / 100% Plagiarism-Free

We employ a number of measures to ensure top quality essays. The papers go through a system of quality control prior to delivery. We run plagiarism checks on each paper to ensure that they will be 100% plagiarism-free. So, only clean copies hit customers’ emails. We also never resell the papers completed by our writers. So, once it is checked using a plagiarism checker, the paper will be unique. Speaking of the academic writing standards, we will stick to the assignment brief given by the customer and assign the perfect writer. By saying “the perfect writer” we mean the one having an academic degree in the customer’s study field and positive feedback from other customers.
2. ### Free Revisions

We keep the quality bar of all papers high. But in case you need some extra brilliance to the paper, here’s what to do. First of all, you can choose a top writer. It means that we will assign an expert with a degree in your subject. And secondly, you can rely on our editing services. Our editors will revise your papers, checking whether or not they comply with high standards of academic writing. In addition, editing entails adjusting content if it’s off the topic, adding more sources, refining the language style, and making sure the referencing style is followed.
3. ### Confidentiality / 100% No Disclosure

We make sure that clients’ personal data remains confidential and is not exploited for any purposes beyond those related to our services. We only ask you to provide us with the information that is required to produce the paper according to your writing needs. Please note that the payment info is protected as well. Feel free to refer to the support team for more information about our payment methods. The fact that you used our service is kept secret due to the advanced security standards. So, you can be sure that no one will find out that you got a paper from our writing service.
4. ### Money Back Guarantee

If the writer doesn’t address all the questions on your assignment brief or the delivered paper appears to be off the topic, you can ask for a refund. Or, if it is applicable, you can opt in for free revision within 14-30 days, depending on your paper’s length. The revision or refund request should be sent within 14 days after delivery. The customer gets 100% money-back in case they haven't downloaded the paper. All approved refunds will be returned to the customer’s credit card or Bonus Balance in a form of store credit. Take a note that we will send an extra compensation if the customers goes with a store credit.

We have a support team working 24/7 ready to give your issue concerning the order their immediate attention. If you have any questions about the ordering process, communication with the writer, payment options, feel free to join live chat. Be sure to get a fast response. They can also give you the exact price quote, taking into account the timing, desired academic level of the paper, and the number of pages.

Excellent Quality
Zero Plagiarism
Expert Writers

or

Instant Quote