DS352 Assignment 3 Questions PDF

College of Computing and Informatics Assignment 3 Deadline: Thursday 28/11/2024 @ 23:59 [Total Mark for this Assignment is 10] Student Details: Name:...

College of Computing and Informatics Assignment 3 Deadline: Thursday 28/11/2024 @ 23:59 [Total Mark for this Assignment is 10] Student Details: Name: ID: CRN: Instructions:  You must submit two separate copies (one Word file and one PDF file) using the Assignment Template on Blackboard via the allocated folder. These files must not be in compressed format.  It is your responsibility to check and make sure that you have uploaded both the correct files.  Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between words, hide characters, use different character sets, convert text into image or languages other than English or any kind of manipulation).  Email submission will not be accepted.  You are advised to make your work clear and well-presented. This includes filling your information on the cover page.  You must use this template, failing which will result in zero mark.  You MUST show all your work, and text must not be converted into an image, unless specified otherwise by the question.  Late submission will result in ZERO mark.  The work should be your own, copying from students or other resources will result in ZERO mark.  Use Times New Roman font for all your answers. Pg. 01 Question One Learning Outcomes: Question One 2 Marks Explain the steps and draw the B-tree obtained after inserting 67 and then 68 in the B- Describe tree in the figure below (Assume that a leaf cannot contain more than three items.) essential algorithms design approaches and their applications. & Apply algorithm design approach in a suitable problem domain. Pg. 02 Question Two Learning Question Two 4 Marks Outcomes: For the input 40, 60, 37, 83, 42, 18 and hash function h(K) = K mod 11 Describe a. Construct both the open and closed hash tables. essential b. Find the largest number of key comparisons in a successful search in both tables. algorithms design approaches and c. Find the average number of key comparisons in a successful search in both tables. their applications. & Apply algorithm design approach in a suitable problem domain. Pg. 03 Question Three Learning Question Three 2 Marks Outcome: Apply Warshall’s algorithm to find the transitive closure of the digraph defined by the following adjacency matrix: Apply algorithm design approach in a suitable problem domain. Pg. 04 Question Four Learning Question Four 2 Marks Outcome: How can one use Prim’s algorithm to find a spanning tree of a connected graph with no weights on its edges? Is it a good algorithm for this problem? What are the other efficient Use efficient alternatives? algorithms in common real application design.