The Quick Union implementation assumes that the root nodes are assigned a parent ID of “-1". If I wanted to change this and set root nodes to have a parent ID of "0" instead of "-1", which lines in the following code would change? Select all that should change. 1 class QuickUnion: def init_(self, size: int) -> None: CHOICES (Select all that may apply.) size: number of elements to initialize self.size = size a. None of the above self.parent = [-1]*self.size b. Line 16 def str (self) -> str: c. Line 15 10 return f"parent: {self.parent}" d. Line 26 11 def get_root(self, p: int) -> int: """Find the root of p""" idx = p while self.parent[idx] >= 0: idx = self.parent[idx] 12 e. Line 20 13 f. Line 7 14 15 16 17 return idx 18 def is_connected(self, pl: int, p2:int) -> bool: return self.get_root(p1) == self.get_root(p2) 19 20 21 def connect(self, pl: int, p2: int) -> None: ""Connects pl and p2""" 22 23
The Quick Union implementation assumes that the root nodes are assigned a parent ID of “-1". If I wanted to change this and set root nodes to have a parent ID of "0" instead of "-1", which lines in the following code would change? Select all that should change. 1 class QuickUnion: def init_(self, size: int) -> None: CHOICES (Select all that may apply.) size: number of elements to initialize self.size = size a. None of the above self.parent = [-1]*self.size b. Line 16 def str (self) -> str: c. Line 15 10 return f"parent: {self.parent}" d. Line 26 11 def get_root(self, p: int) -> int: """Find the root of p""" idx = p while self.parent[idx] >= 0: idx = self.parent[idx] 12 e. Line 20 13 f. Line 7 14 15 16 17 return idx 18 def is_connected(self, pl: int, p2:int) -> bool: return self.get_root(p1) == self.get_root(p2) 19 20 21 def connect(self, pl: int, p2: int) -> None: ""Connects pl and p2""" 22 23
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
choose letter of correct answer
and explain
![The Quick Union implementation assumes that the root nodes are assigned a parent ID of “-1".
If I wanted to change this and set root nodes to have a parent ID of "0" instead of "-1", which
lines in the following code would change? Select all that should change.
1
class QuickUnion:
def
init_(self, size: int) -> None:
CHOICES (Select all that may apply.)
size: number of elements to initialize
self.size = size
a. None of the above
self.parent = [-1]*self.size
b. Line 16
def
str
(self) -> str:
c. Line 15
10
return f"parent: {self.parent}"
d. Line 26
11
def get_root(self, p: int) -> int:
"""Find the root of p"""
idx = p
while self.parent[idx] >= 0:
idx = self.parent[idx]
12
e. Line 20
13
f. Line 7
14
15
16
17
return idx
18
def is_connected(self, pl: int, p2:int) -> bool:
return self.get_root(pl) == self.get_root(p2)
19
20
21
def connect(self, pl: int, p2: int) -> None:
"" "Connects pl and p2"""
rl = self.get_root(p1)
r2 = self.get_root(p2)
self.parent[rl] = r2
22
23
24
25
26](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F6beb26cd-f7b4-4fb5-8e99-f0010888004d%2F922da577-1b74-4a0a-be60-1f23cffb6bc4%2Ft0yus4_processed.png&w=3840&q=75)
Transcribed Image Text:The Quick Union implementation assumes that the root nodes are assigned a parent ID of “-1".
If I wanted to change this and set root nodes to have a parent ID of "0" instead of "-1", which
lines in the following code would change? Select all that should change.
1
class QuickUnion:
def
init_(self, size: int) -> None:
CHOICES (Select all that may apply.)
size: number of elements to initialize
self.size = size
a. None of the above
self.parent = [-1]*self.size
b. Line 16
def
str
(self) -> str:
c. Line 15
10
return f"parent: {self.parent}"
d. Line 26
11
def get_root(self, p: int) -> int:
"""Find the root of p"""
idx = p
while self.parent[idx] >= 0:
idx = self.parent[idx]
12
e. Line 20
13
f. Line 7
14
15
16
17
return idx
18
def is_connected(self, pl: int, p2:int) -> bool:
return self.get_root(pl) == self.get_root(p2)
19
20
21
def connect(self, pl: int, p2: int) -> None:
"" "Connects pl and p2"""
rl = self.get_root(p1)
r2 = self.get_root(p2)
self.parent[rl] = r2
22
23
24
25
26
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education