Create a C# application that generates a BitArray of five Byte values (1,2,3,4,5) and displays each byte in its correct binary form (attach output snapshot).

SPIM simulator (QtSpim). Simulation: Write a MIPS program that computes the expression; y = A * B + C * D Where A, B, C, and D are integers

in C programing

4. Convert the following infix expression into postfix ones: i. (A + B) * (D / E) ii. (A+B^D)/(D- F) + G iii. A* (B+ D)/ E-F* (G + H/ K)

Write a program (in C programming) cylinder.c that accomplishes the following: Read a list of radii and heights from a file(cylinder_input.data). For each pair of values, calculate the cylinder's volume and surface area. Display the results on the screen and save the results to a file. File: cylinder_input.data 1.5 10.2 2.21 20 3 30.243 55.23 2.2 12.1 45.989 The contents of the output file “cylinder_output.data” 1.500000 10.200000 72.099551 110.269902 2.210000 20.000000 306.877054 308.404496 3.000000 30.243000 855.100680 626.615787 55.230000 2.200000 21082.525775 19929.377237 12.100000 45.989000 21153.127133 4416.305811

An interesting application of a PLA is conversion from the old, obsolete punched cards character codes to ASCII codes. The standard punched cards that were so pop- ular with computers in the past had 12 rows and 80 columns where holes could be punched. Each column corresponded to one character. so each character had a 12-bit code. However, only 96 characters were actually used. Consider an application that reads punched cards and converts the character codes to ASCII. a. Describe a PLA implementation of this application. b. Can this problem be solved with a ROM? Explain.

3. Write a C program multiplication Table.c that outputs the multiplication table as follows: X Multiplication Table 1 2 7 8 9 10 2 7 8 9 10 4 14 16 18 20 6 9 12 15 18 21 24 27 30 8 12 16 20 24 28 32 36 40 35 40 45 50 18 24 30 36 42 48 54 60 42 49 35 42 49 56 63 70 64 72 80 72 81 90 70 80 90 100 3 4 5 6 3 4 5 6 1 1 2 3 3 4 4 5 5 10 15 20 25 30 6 6 12 7 7 14 21 28 35 16 24 32 40 48 8 8 99 18 10 10 20 30 40 50 60 56 27 36 45 54 63

Assembly language (GNU gas at&t syntax) Write a program that subtracts var2 from var1, then put result in var3.Declare all three variables in the data segment as words. Inititalize var1 as 3231H and var2 as 2217H

Programming language: Dr. Racket Write a function encode that consumes a string message. The function produces a string which is encrypted according the following procedure: Only the letters from the original message will be encrypted. Other characters such as spaces, punctuation, numeric digits, etc. are not included in the encrypted message at all. The encrypted message will only contain uppercase letters. Each letter will be replaced by the uppercase letter at the opposite end of the English alphabet.In other words, A or a will become Z, B or b will become Y, C or c will become X, ..., Z or z will become A. The encrypted message will have a single space separating each letter. You may assume that the letters in message are English letters only.   For example:  > (encode "Cat") "X Z G" > (encode "Is this correct?")  "R H G S R H X L I I V X G"

In a letter to the editor of CACM, Rubin (1987) uses the following code segment as evidence that the readability of some code with gotos is better than the equivalent code without gotos. This code finds the first row of an n by n integer matrix named x that has nothing but zero values. for \( (i=1 ; i<=n ; i++)\{ \) for \( (j=1 ; j<=n ; j++) \) if \( (x[i][j] !=0) \) goto reject; println (First all-zero row Show Transcribed Text Rewrite this code without gotos either in C or Java. Compare the readability of your code to that of the example code. No hand written solution and no image