Explore BrainMass
Share

Algorithms

Network, IP

1. Summarize the following address with the most specific mask (e.g 3.3.3.0 /24, 3.3.4.0 /24 3.3.5.0 /24 Summary address = 3.3.0.0 255.255.248.0 or 3.3.0.0/21) a) 172.16.60.0 /24 172.16.61.0 /24 172.16.62.0 /24 2. Given 192.164.10.33 255.255.255.224 determine the subnet and broadcast address. 3. For r

binary

Find the 8-bit two's complement representation of -24

San Juan Sailboat Charters: Entities, Identifying Primary and Foreign Keys

San Juan Sailboat Charters is an agent that leases sailboats to customers for a fee. San Juan does not own any sailboats; it leases boats on behalf of the owners who wish to earn income when they are not using their boats. San Juan charges a fee for its service. San Juan specializes in boats that can be used for multi-day or wee

Changing the Structure for an Ebook: Example Problem

Add a second DTD to the XML program attached that provides a different structure for the ebook. I have attached the 2 XML programs already created. Basically add a second DTD to ebook2.zip and change the structure of the ebook. Do not incorporate an attribute declaration.

Algorithm Verification

Answer the following questions about the information in Appendix J: o What will be printed if the input is 0? o What will be printed if the input is 100? o What will be printed if the input is 51? o What will be printed if the user enters "Wingding"? o Is this design robust? If so, explain why. If not, explain what you can

Circuit Minimization using Karnaugh Maps

For the attached circuit, determine the equation it implements. Then minimize the equation using a Karnaugh map, and draw a new circuit that implements the minimized equation?

Cryptography: substitution-permutation network

Consider the following 2x2 s-box x | S(x) ---|------- 0 | 3 1 | 1 2 | 0 3 | 2 Consider 2-round SPN (substitution-permutation network) with a block length of 4 bits. If the key mixing is done using a mod-4 addition operation before each round and after the last round, determine the ciphertext corres

VLookup and Excel

Use the VLOOKUP function in the formula to determine gallons per hour based on the type of plane, then multiply the result by the number of flying hours to compute the amout of fuel for each flight. The table for VLOOKUP function extends over three columns. Use the fuel required from part (a) to compute the additonal requirem

(ref2) Integer Range for one byte word in various representation.

A given microprocessor has words of one byte. What is the smallest and largest integer that can be represented in the following representations? a. Unsigned b. Sign-magnitude c. Ones complement d. Twos complement e Unsigned packed decimal f. Signed packed decimal

Top Down, Stepwise refinement

Using top-down, stepwise refinement, create an algorithm for making toast, frying eggs, baking a cake, or ordering pizza. How might algorithms be beneficial in your future profession?

(ref7) Binary Sign Magnitude

A. Convert +512 into sign/magnitude. b. Convert -29 into sign/magnitude. c. Convert +512 into two's complement. d. Convert -29 into two's complement.

Bit representation

5. Extra Points: How many bits are needed to represent a number that is 100 decimal digits long? How many decimal digits are needed to represent a number that is 1000 bits long? How many decimal digits are needed to represent a number that is 100 decimal digits long?

CLS on heads or tails program

I also need to fill in the missing part of the code In MS-DOS, the command to clear the screen is cls; in UNIX, it is clear. Try the command so that you understand its effect. Modify the heads_or_tails program so that the screen is cleared at the beginning of the program. Use the function call system ("cls") or system ("clear")

ERD

Please help me performing a quick ERD diagram design from this employee tracking model.

ERD Design

For this customer sales order systems, perform an ERD design for this(fully-attribued, key_based ERD up to 3rd NF)--from the attached file.

Algorithms - Design and Analysis Fundamentals

A. Design a recursive algorithm whose input is a decimal integer and whose output is the binary representation of the input. b. Design a recursive algorithm that computes the reverse of the result in (a) - that is, converts a binary integer to its decimal equivalent.

Algorithms

Trace the action of the algorithm NaiveGCD for the following input pairs. a. (24,108) b. (23,108) c. (89,144) d. (1953,1937) Exercise 1.8: Repeat Exercise 1.7 for the algorithm EuclidGCD.

Algorithms

Trace the action of the algorithm BabylonianSQRT for the following input values of a and error = 0.001: a. a = 6 b. a = 23 c. a = 16

Algorithms

Show that computing x15 by either the right-to-left binary method or the left-to-right binary method requires six multiplications, and demonstrate that it can be done using only five multiplications.

Algorithms

For a general positive integer n, show that the left-to-right binary method for computing requires between log2n and 2log2n multiplications. Textbook: Algorithms: Sequential, Parallel, and Distributed