quiz5 - (d) Daemon threads cannot cause deadlocks or race...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Quiz 5 CS 2110 April 28 Name: NetId: 1. Given a graph G = (V,E) whose MST weight(the sum of the weight of its edges) is w , how will w be affected if we remove an edge from G? (a) w will stay the same. (b) w will stay the same or decrease. (c) w will stay the same or increase. (d) It is impossible to say without knowing which edge is being removed. 2. What is the difference between a daemon thread and a normal thread? (a) There is no difference. (b) An application will halt when all normal threads have terminated even if there are daemon threads still running. (c) Daemon threads are evil whereas normal threads are good
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (d) Daemon threads cannot cause deadlocks or race conditions as oppossed to normal threads. 3. Select the tightest statement for the recurrence T (0) = 0, T ( n ) = T ( n-1) + n (a) T ( n ) is O (2 n ) (b) T ( n ) is O ( n 2 ) (c) T ( n ) is O ( n ) (d) T ( n ) is O (1) 4. Select the statement that is true. (a) One base case is enough when doing a proof by Weak Induction. (b) Strong Induction is more powerful than Weak Induction. (c) Weak Induction is more powerful than Strong Induction. (d) The correctness of MergeSort cannot be proved using an Induction. 1...
View Full Document

Ask a homework question - tutors are online