Web development and programming

3. Algorithm Tracing. If the Sort algorithm is applied to the input list (7, 6,

3. Algorithm Tracing. If the Sort algorithm is applied to the input list (7, 6, 3, 4, 1, 2) how many exchanges are performed between elements in this input list? List each swap in…

3. Alice is sending a DES encrypted message to Bob. She does the encryption corr

3. Alice is sending a DES encrypted message to Bob. She does the encryption correctly obtaining a ciphertext of length 50 x 64 bits = 3200 bits. During transmission the 65th bit i…

3. Allow the user to enter a date. For now your user input will be three differe

3. Allow the user to enter a date. For now your user input will be three different values since we haven't seen strings yet. Display whether the date was entered is valid or not. …

3. Although disks, CDs, and DVDs will hold data for an indefinite length of time

3. Although disks, CDs, and DVDs will hold data for an indefinite length of time, retrieval of the data on these media requires functioning players. As an analogy past generations…

3. An Unsorted Type ADT is to be extended by the addition of function SplitLists

3. An Unsorted Type ADT is to be extended by the addition of function SplitLists, which has the following specifications: SplitLists(UnsortedType list, ItemType item, UnsortedType…

3. An n-bit Gray code is a sequence of n-bit strings constructed according to ce

3. An n-bit Gray code is a sequence of n-bit strings constructed according to certain rules. For example, n = 1: C(1) = ['0','1']. n = 2: C(2) = ['00','01','11','10']. n = 3: C(3)…

3. An optimal cache replacement policy makes its replacement decisions using per

3. An optimal cache replacement policy makes its replacement decisions using perfect knowledge of the re-reference (or reuse) pattern of each cache block and replaces the block th…

3. Answer the following questions by using the sensitivity analysis results (tha

3. Answer the following questions by using the sensitivity analysis results (that is, the ranging results) from Question 2. Do NOT solve the problem again by using any computer so…

3. Answer the following questions using the awk utility. Use the file named hw1_

3. Answer the following questions using the awk utility. Use the file named hw1_q3data.txt for all the following questions. a. Give the full awk command to print the full informat…

3. Array Meets Pointers (20 Points) The goal of this problem is to perform opera

3. Array Meets Pointers (20 Points) The goal of this problem is to perform operations on an array, without using the "subscript operator", but only with pointers. Step 1: Inside t…

3. As a digital forensics expert, you are asked to help survey the scene of a ch

3. As a digital forensics expert, you are asked to help survey the scene of a child pornography bust. The lead detective wants to know what equipment is important and what is not …

3. Assemble the following assembly-language code by writing out the correspondin

3. Assemble the following assembly-language code by writing out the corresponding machine language instructions. The hex address of each instruction is given to the left of each i…

3. Assignment 3 (CSS) (Due Friday 11:59pm (9-8-17) A. Create an HTML page i. Wit

3. Assignment 3 (CSS) (Due Friday 11:59pm (9-8-17) A. Create an HTML page i. With a List of 5 attributes about yourself i. Your name or campus ID in the title ili. Should have a h…

3. Assume that the node of a linked list is in the usual info-link form with the

3. Assume that the node of a linked list is in the usual info-link form with the info of type int. The following data, as described in parts (a) to (d), is to be inserted into an …

3. Assume that you are given a minimization LP that has an optimal solution. a)

3. Assume that you are given a minimization LP that has an optimal solution. a) The original LP model is modified by changing an equality constraint in the problem to a less-than-…

3. Assume that you are given responsibility to create a new alarm clock app and

3. Assume that you are given responsibility to create a new alarm clock app and you are limited to requesting only three permissions. A few such permissions are shown in Table 16.…

3. Assume the definitions and initializations (8 points): char c = \'T\', d = \'

3. Assume the definitions and initializations (8 points): char c = 'T', d = 'S'; char *p1 = &c; char *p2 = &d; char *p3; Assume further that the address of c is 6000, the …

3. Assume the following JavaScript program was interpreted using static-scoping

3. Assume the following JavaScript program was interpreted using static-scoping rules. What value of x is displayed in function sub1? [20 pts] var x; function sub1){ document.writ…

3. Assume we need to build a binary max-on-top heap from keys 10, 12, 1, 14, 6,

3. Assume we need to build a binary max-on-top heap from keys 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, 2. a) Show the result of building this heap by inserting the above ke…

3. Assume you have about 10K training examples. Which would you expect to take l

3. Assume you have about 10K training examples. Which would you expect to take longer to train: a) a kNN classifier, or b) a logistic regression classifier? 4. (Yes/No) In fitting…

3. Background: The linux linker is called 1d. By default, the cc command finishe

3. Background: The linux linker is called 1d. By default, the cc command finishes the job of compiling by using 1d to link the compiled program with the C standard library. The er…

3. Barrier – 35% a) Implement a barrier for pthreads in C++ using pthread condit

3. Barrier – 35% a) Implement a barrier for pthreads in C++ using pthread condition variables and mutexes. Consider a process with N running threads. During their execution, all t…

3. Barrier-35% a) Implement a barrier for pthreads in C++ using pthread conditio

3. Barrier-35% a) Implement a barrier for pthreads in C++ using pthread condition variables and mutexes. Consider a process with N running threads. During their execution, all thr…

3. Below are four faulty programs. Each includes a test case that results in fai

3. Below are four faulty programs. Each includes a test case that results in fail- ure. Answer the following questions about each program public static int lastzero (int[] x f pub…

3. Below is the sequence of HEX word address accesses made to a 256x8 DRAM by a

3. Below is the sequence of HEX word address accesses made to a 256x8 DRAM by a CPU with a direct mapped 2 word block, 4-block cache: 88, 8c, 87, 82, 8c, 82, 85, 87, 86, 84, a3, a…

3. Binary Tree Traversals. (10 pts) Consider the following tree. 10 F?II in each

3. Binary Tree Traversals. (10 pts) Consider the following tree. 10 F?II in each of the traversals below : Preorder traversal: Inorder traversal: Postorder traversal: For each tra…

3. Binary Tree Traversals. (10 pts) Consider the following tree. ??--+ 611 | 10

3. Binary Tree Traversals. (10 pts) Consider the following tree. ??--+ 611 | 10 Fill in each of the traversals below: Preorder traversal: Inorder traversal: Postorder traversal: F…

3. Brainerd, Chapter 2, Question 4, Page 76 (modified from original) An integer

3. Brainerd, Chapter 2, Question 4, Page 76 (modified from original) An integer is a perfect square if it is the square of another integer. For example 25 is a perfect square beca…

3. CHALLENGE: Consider an 8x8 checkerboard that has a dollar amount printed on e

3. CHALLENGE: Consider an 8x8 checkerboard that has a dollar amount printed on each of its squares: Imagine you can place a checker on the board anywhere you want and then move it…

3. Calculate the total time required to transfer a 1000-KB (KB: Kilo-Byte) file

3. Calculate the total time required to transfer a 1000-KB (KB: Kilo-Byte) file in the following cases, assuming a Round Trip Time (RTT) of 50ms, a packet size of 1KB, and an init…

3. Calculate the total time required to transfer a 1000-KB file in the following

3. Calculate the total time required to transfer a 1000-KB file in the following cases, assuming an RTT of 50 ms, a packet size of 1 KB data, and an initial 2 × RTT of “handshakin…

3. Calculate, and display on the screen, the velocity of the object, in meters/s

3. Calculate, and display on the screen, the velocity of the object, in meters/second after falling the distance d An object is allowed to free iall under constant gravity. The ob…

3. Carpet Calculator The Westfield Carpet Company has asked you to write an appl

3. Carpet Calculator The Westfield Carpet Company has asked you to write an application that calculates the price of carpeting for rectangular rooms. To calculate the price, you m…

3. Choose one method from the MonetaryCoin class and give one paragraph of descr

3. Choose one method from the MonetaryCoin class and give one paragraph of description in the space below. You can focus on one or two of the following areas: 1) functional perspe…

3. Class X defines method M1( ) as abstract. Class Y inherits from Class X and i

3. Class X defines method M1( ) as abstract. Class Y inherits from Class X and implements the method M1( ). Given the following code, explain why a reference to the abstract class…

3. Class X defines method M1( ) as abstract. Class Y inherits from Class X and i

3. Class X defines method M1( ) as abstract. Class Y inherits from Class X and implements the method M1( ). Given the following code, explain why a reference to the abstract class…

3. Classes (40 points). 20 points for correctness, 20 for following the coding g

3. Classes (40 points). 20 points for correctness, 20 for following the coding guidelines. Design and implement a class called Die (for a die in a pair of dice). Include a constru…

3. Classify each of the following as either data or information. Explain your an

3. Classify each of the following as either data or information. Explain your answer . a. Financial statements of a publicly traded company b. Consultant’ s report on the adequacy…

3. Classify the following specifications by quality attribute. Choose from the a

3. Classify the following specifications by quality attribute. Choose from the attributes maintainability, reusability, performance, availability, reliability, and security. (a) T…

3. Combinatorial Testing [14 points] (a) You have an iOS app that is \"universal

3. Combinatorial Testing [14 points] (a) You have an iOS app that is "universal," meaning that it should run on the iPhone 8, iPhone X, and iPad. The app works differently whether…

3. Comment on following designs (whether the primary keys are appropriate). Hint

3. Comment on following designs (whether the primary keys are appropriate). Hint: The answer may not be simply yes or no. (10 points) 1 (a) PURCHASE(ItemName, PurchasePrice, Purch…

3. Comment on following designs (whether the primary keys are appropriate). Hint

3. Comment on following designs (whether the primary keys are appropriate). Hint: The answer may not be simply yes or no. (10 points) 1 (a) PURCHASE(ItemName, PurchasePrice, Purch…

3. Compare the number of operations and time taken to compute Fibonacci numbers

3. Compare the number of operations and time taken to compute Fibonacci numbers recursively versus that needed to compute them iteratively. 4. Use the above functions to write a C…

3. Compile and run the program below. Complete the missing information in the di

3. Compile and run the program below. Complete the missing information in the diagram given after the code. Identify the parent process for P1. Identify the parent process for P2.…

3. Complete the implementation of the copy constructor, destructor and operator=

3. Complete the implementation of the copy constructor, destructor and operator= for the clas8 time24. Do not modify the main program. You must write the big three methods of the …

3. Concurrency : Readers and Writers access a shared resource. There is mutual e

3. Concurrency: Readers and Writers access a shared resource. There is mutual exclusion, except that multiple Readers can access the resource simultaneously, but not when a Writer…

3. Consider ? 3 processor multiprocessor connected with a scalable network that

3. Consider ? 3 processor multiprocessor connected with a scalable network that has the follo ng proper t es: distributed memory o gar za ri drectory ase cache cher ence protocol …

3. Consider ADDI instruction from LEGv8 ADDI X2, X 1, #8 // Add 8 to XI and stor

3. Consider ADDI instruction from LEGv8 ADDI X2, X 1, #8 // Add 8 to XI and store result in X2 The binary representation of this instruction is shown below Rn 5 bits opcodeimmedia…

3. Consider a 32-bit hexadecimal number stored in memory as follows: If the mach

3. Consider a 32-bit hexadecimal number stored in memory as follows: If the machine is big endian and uses 2's complement representation for integers, write the 32-bit integer num…

3. Consider a context-free grammar G generating language L and a set D of leftmo

3. Consider a context-free grammar G generating language L and a set D of leftmost derivations of strings r from L. Observe that a grammar G' generating the set D can be derived f…