4. If we assume uniform hashing, with 100 buckets and 2 keys? ng, what is the pr

Question

4. If we assume uniform hashing, with 100 buckets and 2 keys? ng, what is the probability that a collision wi the (b) 1-10 (c) 1 5. If n initially refers to the head of a non-empty singynositioned at singly-linked list where the last node's next loops leaves n positioned at the last node in the list? reterence is None, which of the following (a) while n.next: ? = ?.next hie ext (b) while n (c) while n.next is not None: (d) while n is not None: n.next n . next n . next. next = nn.next.next 6. Which of the following best describes the behavior of the Stack ADT? (a) first-in, first-out (b) last-in, first-out (c) first-in, second-out (d) last-in, last-out 7. Which of the following best describes the behavior of the Queue ADT? (a) first-in, last-out (b) last-in, first-out (c) first-in, second-out (d) last-in, last-out 8. Which of the following best implements the enqueue operation in a singly-linked que plementation? Assume the queue is not empty (a) self, tail = Queue . Node (val, next-self .tail) (b) self. tail-self. tail .next = Queue . Node(val) (c) self.tail.next - self.tail - Queue.Hode (val, next-self.tail) (d) self.tail.next - self.tail - Queue. Node (val)

Explanation / Answer

4(B) 1 - 2/100

Collison will Occur = (1 - COLLISION Will NOT OCCUR)


5(A) while n.next:
n = n.next

6) B, LIFO

7) D. LILO

8) B : self.tail = self.tail.next = new Queue(val)



THANKS, PLEASE UPVOTE if helpfuL

Related Questions

Navigate

• Browse (All)
• Browse 4
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.