CS 3304 UHV Data and Information Structures Questions

Description

1 attachments

Slide 1 of 1

attachment_1

attachment_1

Unformatted Attachment Preview

CS 3304 ata and Information Structures
Assignment 6
Due: 12/06/2022, 23:59
Submission: Submit your solutions as a single .pdf file through Blackboard. .pdf file will contain
your solutions for all questions. If you scan your handwritten solutions, be sure that your
handwriting is legible.
Q1 (20 pts). 2-3-4 Tree. Given an empty 2-3-4 Tree, insert the following numbers into 2-3-4
Tree in the given order and show the tree after each insertion. Note that when there are 4
values in a node, select the second value as median and move it to upper level.
55, 22, 79, 36, 13, 31, 24, 26, 44, 34, 37
Q2 (10 pts). Red-Black Tree. Given an empty Red-Black Tree, insert the following numbers into
Red-Black Tree in the given order and show the tree after each insertion. Note that, rotation
will not be needed. You will only need recoloring after inserting some of the values.
15, 20, 10, 5, 13, 12
Q3 (10 pts). Adjacency Matrix. Give the adjacency matrix representation of the directed graph
given below:
Q4 (15 pts). Depth-First Search. Given the directed graph below, show the traversal order (e.g.,
1, 2, 3, 4, © when you apply (i) depth-first search starting from 1 and (ii) depth-first search
starting from 2.
Q5 (15 pts). Breadth-First Search. Given the directed graph below, show the traversal order
(e.g., 1, 2, 3, 4, © when you apply (i) breadth-first search starting from 2 and (ii) breadth-first
search starting from 10.
Q6 (20 pts). Shortest Path Algorithm. Given the directed graph below, determine the shortest
path from 1 to 11 using the algorithm given in the textbook (it is also given in the slides).
Therefore, you will firstly compute the shortest path from 1 to all vertices. Then, you will
determine the path using the Step 5 of the algorithm.
An example is given below to compute shortest path from A to G:
Step 5 then determines a sequence of vertices on a path from A to G, for example, p[3] = ‘G’,
p[2] = ‘F’, p[1] = ‘B’, p[0] = ‘A’. Then, the shortest path is A -> B -> F -> G.
Q7 (10 pts). Edge List Representation. Give the edge list representation of the undirected
graph given below:

Purchase answer to see full
attachment

Explanation & Answer:

7 Questions

User generated content is uploaded by users for the purposes of learning and should be used following our honor code & terms of service.



^{Have a similar assignment? "Place an order for your assignment and have exceptional work written by our team of experts, guaranteeing you A results."}

Our Service Charter

1. Professional & Expert Writers: Eminence Papers only hires the best. Our writers are specially selected and recruited, after which they undergo further training to perfect their skills for specialization purposes. Moreover, our writers are holders of masters and Ph.D. degrees. They have impressive academic records, besides being native English speakers.

2. Top Quality Papers: Our customers are always guaranteed of papers that exceed their expectations. All our writers have +5 years of experience. This implies that all papers are written by individuals who are experts in their fields. In addition, the quality team reviews all the papers before sending them to the customers.

3. Plagiarism-Free Papers: All papers provided by Eminence Papers are written from scratch. Appropriate referencing and citation of key information are followed. Plagiarism checkers are used by the Quality assurance team and our editors just to double-check that there are no instances of plagiarism.

4. Timely Delivery: Time wasted is equivalent to a failed dedication and commitment. Eminence Papers are known for the timely delivery of any pending customer orders. Customers are well informed of the progress of their papers to ensure they keep track of what the writer is providing before the final draft is sent for grading.

5. Affordable Prices: Our prices are fairly structured to fit in all groups. Any customer willing to place their assignments with us can do so at very affordable prices. In addition, our customers enjoy regular discounts and bonuses.

6. 24/7 Customer Support: At Eminence Papers, we have put in place a team of experts who answer all customer inquiries promptly. The best part is the ever-availability of the team. Customers can make inquiries anytime.