Web development and programming

4. (10 points) Fill in the blanks (A through Tin the following program. The foll

4. (10 points) Fill in the blanks (A through Tin the following program. The following program will the user to enter 3 numbers and display the lowest, highest and average ask numb…

4. (10 points) Fill in the blanks below with complexity results stated in terms

4. (10 points) Fill in the blanks below with complexity results stated in terms of n Assume print produces one line of output (a) Fragmernt for i-n downto 1 print(n + " bottles of…

4. (10 points) For standard five-stage pipeline datapath a) Explain the stall-on

4. (10 points) For standard five-stage pipeline datapath a) Explain the stall-on-branch strategy for implementing the ‘beq’ instruction. Explain this strategy for the two approach…

4. (10 points) Greedy Algorithms You were planning to study real hard this quart

4. (10 points) Greedy Algorithms You were planning to study real hard this quarter so you took out n books on algorithms. However you had better planning than execution and you ha…

4. (10 points) Write a function with the header ly] mysub (L, b) which solves Ly

4. (10 points) Write a function with the header ly] mysub (L, b) which solves Ly b for y given an nxn lower triangular matrix L and an nx1 vector b. Use nested for loops, do not u…

4. (10 points) Your machine provides atomic exchange (xchg) instruction as its m

4. (10 points) Your machine provides atomic exchange (xchg) instruction as its multiprocessor atomic primitive. The semantic and definition of the xchg instruction is shown below …

4. (10 pt) Shown on the right are instruction execution cycle of the Sequential

4. (10 pt) Shown on the right are instruction execution cycle of the Sequential CPU.For the 'popl rA' instruction with the instruction format of specify operations to be performed…

4. (10 pts) Design a grammar for Modula-2 if-statements. In Modula-2, all keywor

4. (10 pts) Design a grammar for Modula-2 if-statements. In Modula-2, all keywords are written in uppercase characters. If-statements use the keyword THEN instead of parentheses (…

4. (10 pts) Explain what the following Scheme code is doing (define (make-stream

4. (10 pts) Explain what the following Scheme code is doing (define (make-stream n f) (define (next m) (next n)) (define head car) (define (tail stream) ((cdr stream))) (define (n…

4. (10 pts) Explain what the following Scheme code is doing (define (make-stream

4. (10 pts) Explain what the following Scheme code is doing (define (make-stream n f) (define (next m) (next n)) (define head car) (define (tail stream) (cdr stream)) ) (define (n…

4. (10 pts) Using the following grammar where is the start symbol:

4. (10 pts)  Using the following grammar where <assign> is the start symbol:<?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:office" /> 1.   <assig…

4. (10 pts) What is wrong with the following program and how should it be fixed?

4. (10 pts) What is wrong with the following program and how should it be fixed? 1 public class MyClassE 2 public static void main (String args ) 3 MyClassF m = new MyclassF (23);…

4. (10\')02.58) A data segment is to be located from address A000016 to AFFFF16.

4. (10')02.58) A data segment is to be located from address A000016 to AFFFF16. what value must be loaded into DS? 5. (10 Q2.59) If the data segment register contains the value fo…

4. (10pt) Suppose we store student IDS and their names in a single linked list.

4. (10pt) Suppose we store student IDS and their names in a single linked list. In addition to ID. name and next fields, each cell in this list contains a pointer (say courses) to…

4. (12 points): Analyze the following function in terms of time complexity: long

4. (12 points): Analyze the following function in terms of time complexity: long int Fibonacci(int N) (N0)) if ((N 1) return 1; return (Fibonacci(N-1) + Fibonacci(N-2)) 4(a) (6 po…

4. (13 points) Dynamic Programming You are part of a team building a west-east h

4. (13 points) Dynamic Programming You are part of a team building a west-east highway that runs through an ecological preserve that cannot be avoided. You want to build the highw…

4. (14) The routine \"3N+1* follows these rules: If a given N is odd, multiply i

4. (14) The routine "3N+1* follows these rules: If a given N is odd, multiply it by 3 and add 1. If the given N is even, divide it by 2. Repeat this rule on the new value until yo…

4. (15 pts) There is an algorithm called array doubling that is used to increase

4. (15 pts) There is an algorithm called array doubling that is used to increase the size of an array to accommodate new data when an array fills up. In the algorithm, when an arr…

4. (16 points) Write the code for a function called com computeChange that will

4. (16 points) Write the code for a function called com computeChange that will determi and nickels will be returned to the customer for the purchase of a Vendltem in Question 3. …

4. (20 Points) Provide best-case and worst-case running time and space complexit

4. (20 Points) Provide best-case and worst-case running time and space complexity analysis in Big-Oh notation for the following pow 2 method. For each case, provide an example inp…

4. (20 Points) Provide best-case and worst-case running time and space complexit

4. (20 Points) Provide best-case and worst-case running time and space complexity analysis in Big-Oh notation forthe following pow 2 method. Foreach case, provide an example input…

4. (20 points) A programmer was asked to write a Pep/9 assembly code program tha

4. (20 points) A programmer was asked to write a Pep/9 assembly code program that inputs a speed (S) and outputs one of three messages for a roadside display If S70 "Woah! Slow do…

4. (20 points) Backup The backup scheme in the text is based on files and direct

4. (20 points) Backup The backup scheme in the text is based on files and directories. Another scheme would be to create an image backup- that is an entire partition is saved bloc…

4. (20 points) Bucket Sort and Radix Sort Algorithm Algorithm Bucket Sorting (A,

4. (20 points) Bucket Sort and Radix Sort Algorithm Algorithm Bucket Sorting (A, n, E) E represents a digit Input: Array A of n integers with value. place using the power of 10. F…

4. (20 points) Consider the following sample document collection: D1 = (2, 4, 1,

4. (20 points) Consider the following sample document collection: D1 = (2, 4, 1, 9, 2, 0) D2 = (1, 1, 2, 1, 0,4) D3 = (7, 2, 5, 0, 1, 0) D4 = (0, 1, 2, 6, 1, 2) D5 =(3, 0, 1, 4, 2…

4. (20 points) Let An = { ai, a, , an } be a finite set of distinct coin types (

4. (20 points) Let An = { ai, a, , an } be a finite set of distinct coin types (e.g., a,-50 cents, a?25 cents, a,- 10 cents etc.). We assume each a is an integer and that a>a2&…

4. (20 points) Recall that we investigated in studio the asymptotic complexity o

4. (20 points) Recall that we investigated in studio the asymptotic complexity of im plementing a list using an array. When the array became full, we tried at least the following …

4. (20 points) Single-Source Shortest Path. It\'s Christmas vacation. Your favor

4. (20 points) Single-Source Shortest Path. It's Christmas vacation. Your favorite aunt surprises you with a nice big check. With the extra money, you plan to visit Granny in New …

4. (20 pts) In an operating system processes can run concurrently. Sometimes we

4. (20 pts) In an operating system processes can run concurrently. Sometimes we need to impose a specific order in execution of a set of processes. We represent the execution orde…

4. (25 points) Write a subroutine Design and write an MSP430 assembly language s

4. (25 points) Write a subroutine Design and write an MSP430 assembly language subroutine 12a_s(char *a, int myl) that converts a 16-bit integer, myi, into a character array with …

4. (3) Assume a double vector named v has been declared and filled with values.

4.         (3) Assume a double vector named v has been declared and filled with values. Assume an iterator to a double vector named iter has been declared. Which code segment corr…

4. (30 points) Create a class to model a power drill, like the one in the pictur

4. (30 points) Create a class to model a power drill, like the one in the picture (https://openelipart.org/detail/216781/electric-screwdriver). The drill has a rechargeable batter…

4. (30 points) Please write a stored function named fHW2 4 XXXX based on the Gue

4. (30 points) Please write a stored function named fHW2 4 XXXX based on the Guest table. Your program should take one argument city and it should meet the following 3 test cases.…

4. (4 points) a) A client computer opens an FTP client program and starts downlo

4. (4 points) a) A client computer opens an FTP client program and starts downloading certain files from an FTP server. While the download is in progress, the user opens his web b…

4. (4) Find the flaw with the following \"proof\" that every postage of three ce

4. (4) Find the flaw with the following "proof" that every postage of three cents or more can be formed using a combination of three-cent and four-cent stamps. Basis Step: We can …

4. (4) Given an 8-bit grayscale bitmap that is 256 x 512, how many bytes will be

4. (4) Given an 8-bit grayscale bitmap that is 256 x 512, how many bytes will be required to hold the image data only? If it is an 8-bit color bitmap? If it is a 24-bit bitmap? 5.…

4. (40 points] Consider a shared variable x, initialized to zero, is operated on

4. (40 points] Consider a shared variable x, initialized to zero, is operated on by four processes A,B, C, and D. Processes A and B increment x by one while processes C and D decr…

4. (40 pts.) Let R be a relation on the set of natural numbers de_ned by R = { (

4. (40 pts.) Let R be a relation on the set of natural numbers de_ned by R = {(x, y) | y = x + 2} (a) (5 pts.) List five ordered pairs from R. (b) (5 pts.) List five ordered pairs…

4. (5 points, With 1 or more errors you get 0 points. Otherwise full point.) Con

4. (5 points, With 1 or more errors you get 0 points. Otherwise full point.) Consider a three level memory: L1 and L2 are for cache memory and the third level is for the main memo…

4. (50 points) write a program that reads a minimum of three command line argume

4. (50 points) write a program that reads a minimum of three command line arguments and displays the program's results. Use functions to implement the tasks outlined below. a. Com…

4. (6 + 18 points) The following parts (a) and (b) are independent, but both ref

4. (6 + 18 points) The following parts (a) and (b) are independent, but both refer to inversion in a sequence. (a) Suppose we exchange elements a[i] and a[j] ( j > i) which wer…

4. (6 + 18 points) The following parts (a) and (b) are independent, but both ref

4. (6 + 18 points) The following parts (a) and (b) are independent, but both refer to inversion in a sequence. (a) Suppose we exchange elements a[i] and a[j] (j>i) which were o…

4. (6 marks) Tagging (a) (2 marks) Part of speech tagging is a sequence labellin

4. (6 marks) Tagging (a) (2 marks) Part of speech tagging is a sequence labelling task. Explain what the key differences are between sequence labelling and classification (b) (2 m…

4. (6 points) Comparing Growth Equations Growth models are frequently used to st

4. (6 points) Comparing Growth Equations Growth models are frequently used to study biological topics. Three classic models are given below: Exponential growth: Von Bertalanffy gr…

4. (6 points) You are modeling a computer system which has three error flags: th

4. (6 points) You are modeling a computer system which has three error flags: the COM flag is set to on when the computer is out of memory; the DEO flag is set to on when a disk e…

4. (6 points) You are modeling a computer system which has three error flags: th

4. (6 points) You are modeling a computer system which has three error flags: the COM flag is set to on when the computer is out of memory; the DEO flag is set to on when a disk e…

4. (6 pts) State the inverse, converse and contrapositve of the following implic

4. (6 pts) State the inverse, converse and contrapositve of the following implication: If I debug the code or someone tests the program then the program does not have problems. In…

4. (60 points) a. (20 points) Solve the following case for Knapsack problem: the

4. (60 points) a. (20 points) Solve the following case for Knapsack problem: the capacity K = 7, 5 items with weights w1 = 2 ;w2 = 8 ;w3 = 6 ;w4 = 1 ;w5 = 1, and profits p1 = 10; …

4. (8 points) Assume that we have a computer that uses virtual memory. It has a

4. (8 points) Assume that we have a computer that uses virtual memory. It has a TLB, a cache, and a page table. Furthermore, we can assume the following: · A TLB hit requires 5 ns…

4. (8 pts) Write a function named multi compare, that takes three open files as

4. (8 pts) Write a function named multi compare, that takes three open files as arguments: the first file contains some number of regular expression patterns, the second and third…