4. The quicksort algorithm scales like O(n log n). If sorting 10 numbers takes about 2 sec, which of the following is a good estimate for how long it takes to sort 10° numbers? O 2 sec O 23 sec O 65 sec O 230 sec

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter2: Basic Linear Algebra
Section2.5: The Inverse Of A Matrix
Problem 11P
icon
Related questions
Question

Computer Science

please i need answers for all :( 
3. A genetic model of recombination is solved using a computational algorithm that scales like O(8), where L is the
number of loci modeled. If it takes 10 sec to compute recombination when L 7, which of the following is a good
estimate for how long it takes to compute recombination when L = 8?
O 14 sec
O 21 sec
O 80 sec
O 240 sec
4. The quicksort algorithm scales like O(n log n). If sorting 10 numbers takes about 2 sec, which of the following is a
good estimate for how long it takes to sort 10° numbers?
O 2 sec
O 23 sec
O 65 sec
O 230 sec
5. The summation given by
E(2- 3k + 3k?)
k=1
is equal to
O 2n
O n(n? + 1)
O n°(n + 1)
O n(3n? – 1)
Transcribed Image Text:3. A genetic model of recombination is solved using a computational algorithm that scales like O(8), where L is the number of loci modeled. If it takes 10 sec to compute recombination when L 7, which of the following is a good estimate for how long it takes to compute recombination when L = 8? O 14 sec O 21 sec O 80 sec O 240 sec 4. The quicksort algorithm scales like O(n log n). If sorting 10 numbers takes about 2 sec, which of the following is a good estimate for how long it takes to sort 10° numbers? O 2 sec O 23 sec O 65 sec O 230 sec 5. The summation given by E(2- 3k + 3k?) k=1 is equal to O 2n O n(n? + 1) O n°(n + 1) O n(3n? – 1)
1. How many partial pivots are required when performing Gaussian elimination on the following matrix:
(3 5 2
A =2 3 4?
6 6 6
O 2
O 3
2. Let
3 5 2
2 3 4
6 6 6
A =
The (PL)U decompostion of A is given by
5.
8/3
-30
3.
A = | 2/3
-1/3
12 1
(1/2
A = | 1/3 1/2 1
6 6
0 2
00 5/2,
1
-1
1
0.
(3/2 -1/6 1'
A =
(2
4.
1
0.
-3 -6
1
0.
-5
(1/2 2 1
A = | 1/3 10
00
6.
1
1
-5
Transcribed Image Text:1. How many partial pivots are required when performing Gaussian elimination on the following matrix: (3 5 2 A =2 3 4? 6 6 6 O 2 O 3 2. Let 3 5 2 2 3 4 6 6 6 A = The (PL)U decompostion of A is given by 5. 8/3 -30 3. A = | 2/3 -1/3 12 1 (1/2 A = | 1/3 1/2 1 6 6 0 2 00 5/2, 1 -1 1 0. (3/2 -1/6 1' A = (2 4. 1 0. -3 -6 1 0. -5 (1/2 2 1 A = | 1/3 10 00 6. 1 1 -5
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Computational Systems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole