Computer Science



Item Name

"Martial Arts R Us" (MARU) needs a database. MARU is

"Martial Arts R Us" (MARU) needs a database. MARU is a martial arts school with hundreds of students. It is necessary to keep track of all the different classes that are being offered, who is assigned to teach each class, and which students attend each class. Also, it is important to track the progress of each student as they advance. Create a complete Crow's Foot ERD for these requirements:...

“Communication overhead” can occur when multiple people work on a

“Communication overhead” can occur when multiple people work on a software project. The time spent communicating with others reduces individual productively (LOC/month), and the result can be less productivity for the team. Illustrate (quantitatively) how engineers who are well versed in good software engineering practices and use technical reviews can increase the production rate of a team...

“Unreasonable” deadlines are a fact of life in the software

“Unreasonable” deadlines are a fact of life in the software business. How should you proceed if you’re faced with one?

(a) Devise an algorithm to sort three numbers. It should

(a) Devise an algorithm to sort three numbers. It should make as few comparisons as possible. How many comparisons and swaps are required in the best, worst, and average cases? (b) Devise an algorithm to sort five numbers. It should make as few comparisons as possible. How many comparisons and swaps are required in the best, worst, and average cases? (c) Devise an algorithm to sort eight numbers....

(a) Draw the adjacency matrix representation for the graph of

(a) Draw the adjacency matrix representation for the graph of Figure 11.26. (b) Draw the adjacency list representation for the same graph. (c) If a pointer requires four bytes, a vertex label requires two bytes, and an edge weight requires two bytes, which representation requires more space for this graph? (d) If a pointer requires four bytes, a vertex label requires one byte, and an edge weight...

(a) Explain why computing the factorial of n by multiplying

(a) Explain why computing the factorial of n by multiplying all values from 1 to n together is an exponential time algorithm. (b) Explain why computing an approximation to the factorial of n by making use of Stirling’s formula (see Section 2.2) is a polynomial time algorithm.

(a) Find a growth rate that squares the run time

(a) Find a growth rate that squares the run time when we double the input size. That is, if T(n) = X, then T(2n) = x2 (b) Find a growth rate that cubes the run time when we double the input size. That is, if T(n) = X, then T(2n) = x3

(a) Give the index values of all the odd numbers

(a) Give the index values of all the odd numbers in the following list representation, assuming zero-based indexing. (b) How many elements would be looked at when the list is traversed (from top to bottom) until the value 19 was found?

(a) Is 2n = Θ(3n)? Explain why or why not.

(a) Is 2n = Θ(3n)? Explain why or why not. (b) Is 2n = Θ (3n)? Explain why or why not

(a) Modify the preorder traversal of Section 5.2 to perform

(a) Modify the preorder traversal of Section 5.2 to perform an inorder traversal of a binary tree. (b) Modify the preorder traversal of Section 5.2 to perform a postorder traversal of a binary tree.