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: 2 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 7 self.parent = [-1]*self.size b. Line 16 c. Line 15 def str (self) -> str: return f"parent: {self.parent}" 10 d. Line 26 11 e. Line 20 def get_root(self, p: int) -> int: ""Find the root of p""" idx = p while self.parent[idx] >= 0: idx = self.parent[idx] 12 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""" rl = self.get_root(p1) r2 = self.get_root(p2) self.parent[rl] = r2 22 23 24 25 26

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Multiple choice .....   ...

Choose letter of best answer

 

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.)
4
size: number of elements to initialize
6.
self.size = size
a. None of the above
7
self.parent = [-1]*self.size
b. Line 16
8.
c. Line 15
str_(self) -> str:
return f"parent: {self.parent}"
9.
def
10
d. Line 26
11
def get_root(self, p: int) -> int:
""Find the root of p"""
12
e. Line 20
13
f. Line 7
14
idx = p
while self. parent[idx] >= 0:
idx = self.parent[idx]
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"" "
rl = self.get_root(p1)
r2 = self.get_root(p2)
self.parent[rl] = r2
22
23
24
25
26
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.) 4 size: number of elements to initialize 6. self.size = size a. None of the above 7 self.parent = [-1]*self.size b. Line 16 8. c. Line 15 str_(self) -> str: return f"parent: {self.parent}" 9. def 10 d. Line 26 11 def get_root(self, p: int) -> int: ""Find the root of p""" 12 e. Line 20 13 f. Line 7 14 idx = p while self. parent[idx] >= 0: idx = self.parent[idx] 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"" " rl = self.get_root(p1) r2 = self.get_root(p2) self.parent[rl] = r2 22 23 24 25 26
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY