This assignment is meant for you to practice working with hashmaps and graphs. In particular,
you will construct a graph of vertices and edges using a breadth-first or depth-first search. You will
learn more in-depth about graph theory in MATH 240 and COMP 251. You will also implement
one of the O(n log(n)) sorting algorithms that you’ve learned about in class, such as MergeSort or
• Submission instructions
– Late assignments will be accepted up to 2 days late and will be penalized by 10 points per
day. Note that submitting one minute late is the same as submitting 23 hours late. We
will deduct 10 points for any student who has to resubmit after the due date (i.e. late)
irrespective of the reason, be it wrong file submitted, wrong file format was submitted
or any other reason. This policy will hold regardless of whether or not the student can
provide proof that the assignment was indeed “done” on time.
– Don’t worry if you realize that you made a mistake after you submitted : you can submit multiple times. We will grade all your submissions and the best score will be selected. We encourage you to submit a first version a few days before the deadline (computer crashes do happen and myCourses may be overloaded during rush hours).
– Please store all your files in a folder called “Assignment4”, zip the folder and submit it
to myCourses. Inside your zipped folder, there must be the following files.
Get Free Quote!
429 Experts Online