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
- Spring '07
- Race condition, daemon threads