Question 1

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the most eﬃcient way to multiply the matrices A₁, A₂, A₃ of sizes 10 × 50, 50 × 10, 10 × 40?

Accepted Answer

The answer of assume that the number of multiplications of...

Question 2

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $$1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-The best-case analysis of a linear search of a list of size n (counting the number of comparisons)

Accepted Answer

The answer of ﬁnd the "best" big-O notation to describe...

Question 3

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $$1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-An iterative algorithm to compute n!, (counting the number of multiplications)

Accepted Answer

The answer of ﬁnd the "best" big-O notation to describe...

Question 4

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $$1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-An algorithm that ﬁnds the average of n numbers by adding them and dividing by n

Accepted Answer

The answer of ﬁnd the "best" big-O notation to describe...

Question 5

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $$1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-The number of print statements in the following:

Accepted Answer

The answer of ﬁnd the "best" big-O notation to describe...

Question 6

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the most eﬃcient way to multiply the matrices A₁, A₂, A₃ of sizes 20 × 5, 5 × 50, 50 × 5?

Accepted Answer

The answer of assume that the number of multiplications of...

Question 7

Give a big-O estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm:

Accepted Answer

The answer of Give a big-O estimate for the number...

Question 8

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $$1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-The worst-case analysis of a linear search of a list of size n (counting the number of comparisons)

Accepted Answer

The answer of ﬁnd the "best" big-O notation to describe...

Question 9

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $$1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-An algorithm that prints all bit strings of length n.

Accepted Answer

The answer of ﬁnd the "best" big-O notation to describe...

Question 10

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr.
-What is the best order to form the product ABC if A, B and C are matrices with dimensions 8 × 3, 3 × 6 and 6 × 12, respectively?

Accepted Answer

The answer of assume that the number of multiplications of...

Question 11

Give a big-O estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm:

Accepted Answer

The answer of Give a big-O estimate for the number...

Question 12

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $$1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-An algorithm that prints all subsets of size three of the set {1, 2, 3, . . . , n}

Accepted Answer

The answer of ﬁnd the "best" big-O notation to describe...

Question 13

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr.
-What is the best order to form the product ABC if A, B and C are matrices with dimensions 2 × 5, 5 × 7 and 7 × 3, respectively?

Accepted Answer

The answer of assume that the number of multiplications of...

Question 14

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $$1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-The number of print statements in the following:

Accepted Answer

The answer of ﬁnd the "best" big-O notation to describe...

Quiz 3: A: Algorithms

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the most eﬃcient way to multiply the matrices A₁, A₂, A₃ of sizes 10 × 50, 50 × 10, 10 × 40?

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$ -An iterative algorithm to compute n!, (counting the number of multiplications)

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$ -An algorithm that ﬁnds the average of n numbers by adding them and dividing by n

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the most eﬃcient way to multiply the matrices A₁, A₂, A₃ of sizes 20 × 5, 5 × 50, 50 × 5?

Give a big-O estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm:

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$ -An algorithm that prints all bit strings of length n.

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the best order to form the product ABC if A, B and C are matrices with dimensions 8 × 3, 3 × 6 and 6 × 12, respectively?

Give a big-O estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm:

ﬁnd the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$ -An algorithm that prints all subsets of size three of the set {1, 2, 3, . . . , n}

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the best order to form the product ABC if A, B and C are matrices with dimensions 2 × 5, 5 × 7 and 7 × 3, respectively?

Quiz 3: A: Algorithms

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the most eﬃcient way to multiply the matrices A1, A2, A3 of sizes 10 × 50, 50 × 10, 10 × 40?

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the most eﬃcient way to multiply the matrices A1, A2, A3 of sizes 20 × 5, 5 × 50, 50 × 5?

Give a big-O estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm:

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the best order to form the product ABC if A, B and C are matrices with dimensions 8 × 3, 3 × 6 and 6 × 12, respectively?

Give a big-O estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm:

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the best order to form the product ABC if A, B and C are matrices with dimensions 2 × 5, 5 × 7 and 7 × 3, respectively?

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the most eﬃcient way to multiply the matrices A₁, A₂, A₃ of sizes 10 × 50, 50 × 10, 10 × 40?

assume that the number of multiplications of entries used to multiply a p × q and a q × r matrix is pqr. -What is the most eﬃcient way to multiply the matrices A₁, A₂, A₃ of sizes 20 × 5, 5 × 50, 50 × 5?