题库 第1013页
单选题:Merge Sort Revisit
Recall that in the merge sort, we divide the input list into two groups of equal size, sort them recursively, and merge…
单选题:Solving Recurrence
Consider the following pseudo-code.strange($$a_1, \ldots, a_n$$):$$1.\,\,$$if $$n \leq 2022$$ then return$$2.\,\,$$stran…
单选题:Solving Recurrence
Consider the following pseudo-code.strange($$a_1, \ldots, a_n$$):$$1.\,\,$$if $$n \leq 2022$$ then return$$2.\,\,$$stran…
单选题:Some Statements on Complexity Theory
How many of the following statements are correct?* If some NP-complete problem can be solved in polynomial time, then $…
单选题:After deleting 3 from the given splay tree, which of the followi
After deleting 3 from the given splay tree, which of the following statements about the resulting tree is impossible?![v…
单选题:After deleting 7 from the given splay tree, which of the followi
After deleting 7 from the given splay tree, which of the following statements about the resulting tree is impossible?![v…
单选题:You have 20 identical cores on which you want to schedule some $
You have 20 identical cores on which you want to schedule some $n$ jobs. Each job $j \in \{1,2, \ldots,n\}$ has a proces…
单选题:You have 10 identical cores on which you want to schedule some $
You have 10 identical cores on which you want to schedule some $n$ jobs. Each job $j \in \{1,2, \ldots,n\}$ has a proces…
单选题:A Red-black tree performs Insert or delete in the worst case $a_
A $n$-nodes Red-black tree $T$ performs insertion or deletion in the worst case that costs $a_1 \lg n +b_1$, $a_2 \lg n…
单选题:A $n$-nodes AVL tree $T$ performs insertion or deletion in the w
A $n$-nodes AVL tree $T$ performs insertion or deletion in the worst case that costs $a_0 \lg n + b_0$, $a_1 \lg n + b_1…