Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 398 Weeks Ago, 2 Days Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 14 Sep 2017 My Price 7.00

disjoint-set forests

Implement the disjoint-set data structure using disjoint-set forests (rooted trees). i. Without ranked union and without path compression ii. Without ranked union and with path compression iii. With ranked union and without path compression CS2094 – Data Structures Laboratory Page 7/7 iv. With ranked union and with path compression Your program must support the following functions: · makeset(x) – creates a set of one element whose data is specified by x. · find(x) – finds the set (representative) to which the data specified by x belongs. · union(x, y) – merges the sets containing the data specified by x and y together, into a single set. After this operation, x and y (as well as the other data that were also contained in the sets which contained x and y) will belong to the same set. Input - Output Format The input consists of multiple lines, each one containing either one or two integers. The first integer in the line can be 0, 1, 2 or 3, and each one has its own meaning: · The integer 0 means stop the program. · The integer 1 stands for the makeset operation. The data for makeset will be the next integer from the input. · The integer 2 stands for the find operation. Output the representative of the set, which contains the next integer from the input. (You are guaranteed that the input data will be contained in some set). · The integer 3 stands for the union operation. Merge the sets containing each of the next two input integers into a single set. Sample Input Sample Output (with ranked union and path compression) 1 25 1 35 1 45 1 55 2 35 35 2 45 45 3 35 45 2 35 35 2 45 35 2 25 25 3 25 45 2 25 35 3 45 25 2 25 35 2 45 35

Answers

Maurice Tutor
(5)
Status NEW Posted 14 Sep 2017 08:09 AM My Price 7.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)