Please comment if you find any answer wrong or if there is any discrepancy. Thanks! 🙂 Here, we aim to please 😀
[quads id=1]
1) Suppose u and v both denote sets in Python. Under what condition can we guarantee that u - (u - v) == v?
a) The sets u and v should be disjoint.
b) The set u should be a subset of the set v
c) The set v should be a subset of the set u
d) This is true for any u and v.
Answer(s) : c) The set v should be a subset of the set u
[quads id=1]
2) Suppose u and v both denote sets in Python. Under what condition can we guarantee that u|v == u^v?
a) The sets u and v should be disjoint.
b) The set v should be a subset of the set u
c) The set u should be a subset of the set v
d) This is true for any u and v.
Answer(s) : a) The sets u and v should be disjoint
[quads id=1]
3) Suppose we insert 97 into the max heap [98,67,89,38,42,54,89,17,25]. What is the resulting heap?
Answer(s) : [98,97,89,38,67,54,89,17,25,42]
[quads id=1]
4) Suppose we we apply delete_max() twice to the heap [100,97,93,38,67,54,93,17,25,42]. What is the resulting heap?
Answer(s) : [93,67,93,38,42,54,25,17]
[quads id=1]
