Share
Explore BrainMass

Algorithms

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?

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")

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

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

Rows in a Query

If you had two tables, each with 3 items: Table_Mike: ITEM: Bread Milk Eggs Table_Kristy: ITEM: Cereal Butter Eggs And performed a UNION, how many rows would the resulting query have?

Few questions related to packet loss, different fixed playout delays and jitter.

Answer the following questions based on the enclosed figure. [a] Explain why the packets received curve (step line) looks different from the packets-generated curve. [b] Suppose that packets are played right away as they are received, identify the points where jitter is most obvious. [c] What would happen to the point ind

Disk Tracks Traversed Using Algorithms

Calculate and compare the number of disk tracks traversed using FCFS, SSTF, SCAN, and LOOK algorithms for the series of disk track service requests given below. At the time the first request arrives in the disk request queue, the read/write head is at track 50, moving toward the outer (lower-numbered) tracks. (Hint: Each track o

Probabilities

Probabilities 1.) A taxicab was involved in a fatal hit-and-run accident at night. Two cab companies, The Green and The Blue, operate in the city. You are told that: ? 85% of the cabs in the city are Green and 15% are Blue ? A witness identified the cab as Blue The court tested the reliability of the witness under the same c

Dijkstra?s Shortest Path Algorithm

Consider the following network. a) With the indicated link costs, use Dijkstra?s shortest path algorithm to compute the shortest path from E to all network nodes. Show how the algorithm works by computing a table. b) Eliminate node A, and redo the problem starting from node B. Please refer to the attachment to view the

Automata and Computability

Describe the error in the following fallacious "proof" that P  NP. Consider an algorithm for SAT: "On input , try all possible assignments to the variables. Accept if any satisfy ." This algorithm clearly requires exponential time. Thus SAT has exponential time complexity. Therefore SAT is not in P.

Create an expense report for a company's sales force

Create an expense report for a company's sales force, then save it. To view these instructions while you work in Excel, do either of the following: Print this page of instructions or move back and forth between this page and Excel by clicking each application's button on the Windows taskbar Retrieve Expense Report, save it o

Payroll Swing Applet - CalcPay

Create a payroll Swing applet named CalcPay that allows the user to enter two double values?hours worked, and an hourly rate. When the user clicks a JButton, gross pay is calculated. There is another JButton for clicking so that federal withholding tax is subtracted from gross pay based on the following table: Income $

Asymptotically tight bounds on lg(n!)

Obtain asymptotically tight bounds (Big-Oh and Big-Omega) on lg(n!) without using Stirling's approximation. Instead, evaluate these using the expansion of lg(n!) as a summation.

Relative Speed of Ripple Carry Adders

Calculate the relative speed of a 64-bit adder using ripple carry only, a ripple carry of 4-bit groups that use carry lookahead, and a ripple carry of 16-bit groups that use carry lookahead. Use the simulator located at the following url: http://www.ecs.umass.edu/ece/koren/arith/simulator/ Also explain, what is relative spee

Output for values

4. Consider the following program in Pascal with static scope: program main (input, output); var i, j, k, m: integer; procedure Q (var i: integer; m: integer); begin i := j + 1; m := k + 1; writeln (i, j, k, m); end procedure P(var i: integer; j: integer); var k: integer; procedure S(i: integer) begin i := k + 3; m

Bitwise sum

Write a C program that prompts user for two integers and then prints the sum of the wo numbers. Please dont use any arthemetic opoerators anywhere. just bitwise-and, bitwise-or bitwise-xor, <<(left shift) and >>(right shift)