Web development and programming

(2-dimensional array) Write a C program that will compute the flow rate in a set

(2-dimensional array) Write a C program that will compute the flow rate in a set of pipes using the following formula: Flow rate is given by q=(PI*d^squared/4)*v. Where q is the f…

(2. 20pts) Given the following arammar in BNF: -> * factor> 1 factor> > (expr) I

(2. 20pts) Given the following arammar in BNF: -> * factor> 1 factor> > (expr) I to be right associative (a) Rewrito the e grammar to give + precedence over and force …

(2. Suppose there are two implementations of the same instruction set architectu

(2. Suppose there are two implementations of the same instruction set architecture. Computer X has a clock cycle time of 125 ps and a CPI of 2.0, and computer Y has a clock cycle …

(20 Points) Jim plans to test out a new idea using a very low-cost wireless stat

(20 Points) Jim plans to test out a new idea using a very low-cost wireless station that he can install outside his dorm room window: users can upload or download their MP3-encode…

(20 Points) Write a class Bug that models a bug that moves along a 1D line. The

(20 Points) Write a class Bug that models a bug that moves along a 1D line. The bug moves either to the right or left. Initially, the bug moves to the right, but it can turn to ch…

(20 Pts) An integer is 32 bits in length, what are the largest positive integer

(20 Pts) An integer is 32 bits in length, what are the largest positive integer and the smallest negative integer that can be represented by a signed 32-bit integer in decimal (ba…

(20 Pts) Choose the function below which accepts an int value, adds 9 to it and

(20 Pts) Choose the function below which accepts an int value, adds 9 to it and multiplies it by a random number between 1 and 10. If the result is even, the function should retur…

(20 points (5 x 4 points) For each of the following arguments, indicate what rul

(20 points (5 x 4 points) For each of the following arguments, indicate what rule Denying the consequent (DC), Affirming the antecedent (AA), or Disjunctive syllogism (DS)) can be…

(20 points Read case study 1 on page 167 and answer the following questions. a.

(20 points Read case study 1 on page 167 and answer the following questions. a. How does Sybase BI sohution can help Medihelp make better decisions? b. What competitive advantages…

(20 points Read case study 1 on page 167 and answer the following questions. a.

(20 points Read case study 1 on page 167 and answer the following questions. a. How does Sybase BI sohution can help Medihelp make better decisions? b. What competitive advantages…

(20 points) A system with a data rate (bandwidth) of 1 Mbps uses stop-and-wait p

(20 points) A system with a data rate (bandwidth) of 1 Mbps uses stop-and-wait protocol. If each packet carries 1000 bits of data, how long does it take to send 1 million bits of …

(20 points) Below is part of the code for completing Ashrqsted code.: when displ

(20 points) Below is part of the code for completing Ashrqsted code.: when displaged ting it in the box whose indentation matches the s Be writ validates the item selection and up…

(20 points) Complete the code for the day_of_week function in Chrono.cpp and wri

(20 points) Complete the code for the day_of_week function in Chrono.cpp and write hw6pr1.cpp to repeatedly ask for a date and print out the day of the week, like this: Date (year…

(20 points) Consider a list of n airports, and a list of m flights. The informat

(20 points) Consider a list of n airports, and a list of m flights. The information of the k-th flight is given to us as a quadruple (ak, bk, tk, dk), where ak is the name of the …

(20 points) Consider the following undirected weighted graph. 34 36 24 35 25 39

(20 points) Consider the following undirected weighted graph. 34 36 24 35 25 39 19 23 12 21 33 30 (a) Give the list of edges in the minimum spanning tree in the order that Kruskal…

(20 points) Merge sort involves recursively splitting the array into 2 parts, so

(20 points) Merge sort involves recursively splitting the array into 2 parts, sorting and finally merging them. A variant of merge sort is called 3-way merge sort where instead of…

(20 points) State which of the following languages are (1) not context-free (2)

(20 points) State which of the following languages are (1) not context-free (2) context-free but not regular or (3) regular and context-free. If a language is not context-free the…

(20 points) Suppose that a black stone is placed on a vertex s and a white stone

(20 points) Suppose that a black stone is placed on a vertex s and a white stone is placed on a different node t of an undirected graph G, where there is no edge between s and t. …

(20 points) Write a MATLAB Function my)fun that takes as its only inp vals (of l

(20 points) Write a MATLAB Function my)fun that takes as its only inp vals (of length 5) and then sets its output variable to (returns) a number the following criteria: 1: if all …

(20 points)Write your own square root function named double my_sqrt_1(double n)

(20 points)Write your own square root function named double my_sqrt_1(double n) using the following pseudocode: x = 1 repeat 10 times: x = (x + n / x) / 2 return x and then write …

(20 points; 4 points each) Choose the signature for methods that solve the follo

(20 points; 4 points each) Choose the signature for methods that solve the following problems, or state that it is impossible to do so,_You do not need to write the body of these …

(20 points; 4 points each) Choose the signature for methods that solve the follo

(20 points; 4 points each) Choose the signature for methods that solve the following problems, or state that it is impossible to do so,_You do not need to write the body of these …

(20 pt) Recall the Sudoku puzzle that you studied in Assignment l.In this work o

(20 pt) Recall the Sudoku puzzle that you studied in Assignment l.In this work on a similar number placement puzzle known as Magic Square us uestion you will (MS). from the webl A…

(20 pts extra credit) Recall that the MergeSort algorithm (Chapter 2.3 of CLRS)

(20 pts extra credit) Recall that the MergeSort algorithm (Chapter 2.3 of CLRS) is a sorting algorithm that takes ?(n log n) time and ?(n) space. In this problem, you will impleme…

(20 pts) Assume two cows are the same if they have the same name. Write class Co

(20 pts) Assume two cows are the same if they have the same name. Write class Cow and the necessary methods to make main this work, and put a print statement inside each method. T…

(20 pts) For each of the following machine learning scenarios, several possible

(20 pts) For each of the following machine learning scenarios, several possible input variables are listed. For each variable, briefly justify (~1 sentence) whether you think it w…

(20 pts) Write a C++ program that creates a 2-dimensional array of 10x5 elements

(20 pts) Write a C++ program that creates a 2-dimensional array of 10x5 elements that are populated by random numbers between 0 and 49 (hint: use he rand() function and re-use cod…

(20%) Consider the production and semantic rules for incremental translation (Ta

(20%) Consider the production and semantic rules for incremental translation (Table 1). P is the start symbol. Function Temp0 returns a new name for each call. S ? ?d» E ; { gen( …

(20%) Logical and Branch Instructions. 1. Suppose the register $tO contains a (h

(20%) Logical and Branch Instructions. 1. Suppose the register $tO contains a (hexadecimal) value xo0000040, what is the (hexadecimal or decimal) value of st2 after the following …

(20%) Write a complete program that shall prompt the user to enter one floating-

(20%) Write a complete program that shall prompt the user to enter one floating-point number and print negative (less the quotes) if the number negative, positive (less the quotes…

(20) Let A[1…n] be an array of n distinct numbers. If i < j and A[i] > A[j], the

(20) Let A[1…n] be an array of n distinct numbers. If i &lt; j and A[i] &gt; A[j], then the pair (i, j) is called an inversion of A. (2) List the five inversions of the array A = …

(20) Question 2: Using a stack abstract data type Assume that you\'ve been given

(20) Question 2: Using a stack abstract data type Assume that you've been given an absiract data type for a stuck. It has the following operations ld push.on.stackrant tAckti t th…

(20pt) This question uses almost the same file format as in Quiz 6 that we solve

(20pt) This question uses almost the same file format as in Quiz 6 that we solved in class. But this time, instead of reading and summarizing the data from the input file, we woul…

(20pt) We use the following cell structure to store the IDs and names of some st

(20pt) We use the following cell structure to store the IDs and names of some students in a single linked list data structure typedef struct cell ( int ID; char name [20]; struct …

(20pts) In this question, we consider the problem of finding the largest palindr

(20pts) In this question, we consider the problem of finding the largest palindrome subsequence. A string of characters is said to be a palindrome if the reversal is equal to itse…

(20pts) In this question, we study the Largest Palindrome Subsequence problem di

(20pts) In this question, we study the Largest Palindrome Subsequence problem discussed in Quiz6_7 again. The 2nd question of the quiz developed a dynamic programming algorithm th…

(20pts) Short answer (2 points each) 0.1) Based on the data of the last several

(20pts) Short answer (2 points each) 0.1) Based on the data of the last several years, which one of the following classes of the computers has the highest growth rate in tems of q…

(20pts. .We are given a communication network that is an edge-weighted graph G (

(20pts. .We are given a communication network that is an edge-weighted graph G (V, E). The weight on each edge is at least 0 and at most 1, representing the reliability of the com…

(21 pts: 5 for a, 2 each for b-j) We are using TCP Reno. ssthresh is set to 16.

(21 pts: 5 for a, 2 each for b-j) We are using TCP Reno. ssthresh is set to 16. Assume no errors 3. (5 pts) Starting from a window size of 1, calculate how many packets can be sen…

(22 points) List the locations and hexadecimal code of the Assembly Language pro

(22 points) List the locations and hexadecimal code of the Assembly Language program below. The locations should be in hexadecimal starting with 100 and ending with 10B. Location …

(24 pts) This code is all in one file. In the blanks provided, write what each l

(24 pts) This code is all in one file. In the blanks provided, write what each line would print, or "error" if that line would cause an error. class Cow [ String say"B"; String sp…

(25 Points) Insert the keys 8, 4, 11, 20, 15, 17, 10 in order into a hash table

(25 Points) Insert the keys 8, 4, 11, 20, 15, 17, 10 in order into a hash table that uses open addressing with linear probing with an initial size of 6. The hash function is defin…

(25 points) Analyze assembly program onsider the following code segment. 1 RESET

(25 points) Analyze assembly program onsider the following code segment. 1 RESET: 2 StopWDT: mov.w #WDTPWIWDTHOLD,&amp;WDTCTL 4. 6 gnext: mov.w #-,STACK-END,SP ; Initialize stack …

(25 points) Create your own Java class that represents your favorite musical ins

(25 points) Create your own Java class that represents your favorite musical instrument. Your musical instrument class should have at least 3 constants, 5 private data fields, get…

(25 points) There are 900 people in a town whose population increases by 10 perc

(25 points) There are 900 people in a town whose population increases by 10 percent (a data item) each year. Write a loop that displays the annual population and determines how ma…

(25 points) Write a 68HC11 assembly language program that uses the HC1I ADC (Ana

(25 points) Write a 68HC11 assembly language program that uses the HC1I ADC (Analog-to-Digital Converter) to: Read - continuously- analog inputs from channels 4, 5, 6,7 and Output…

(25 pts) For each of the following code fragments: (a) Compute the worst-case ru

(25 pts) For each of the following code fragments: (a) Compute the worst-case run time as a function of n, i.e give the cxact expression for T(n). If there are any summations, sim…

(25 pts) Implement in Java a concrete class named Tablet that inherits from the

(25 pts) Implement in Java a concrete class named Tablet that inherits from the Computer class and implements the Comparable interface. Here are the other details of Tablet: C. A …

(25 pts) The following are Request matrix Q and Allocation matrix A that define

(25 pts) The following are Request matrix Q and Allocation matrix A that define the state of a system, as might be used to perform deadlock detection, as well as the Resource vect…

(25 pts) This page is all one class import java.util.Iterator; public class MySt

(25 pts) This page is all one class import java.util.Iterator; public class MyStepper implements Iterator int state0; int step; //WRITE A CONSTRUCTOR // THIS MAIN PRINTS: / 5 10 1…