AWS account (https://aws.amazon.com/free/). You need to log into the AWS management console with your account and then access keys (Access Key ID and Secret Access Key). You can learn how to access keys at http://docs.aws.amazon.com/general/latest/gr/managing-aws-access-keys.html. You need to configure your AWS CLI with your own access keys. I have set up my access key under the root account of your VM. You can replace my access key with your access key. You can learn how to configure AWS CLI at https://awscli.amazonaws.com/v2/documentation/api/latest/reference/configure/index.html. Also, please read section 12.2.1 of the textbook (page 500-503). You need to use the AWS CLI commands to AWS resources.

The static web page you need for this project is as follows:

In this project, you will measure and compare the performance of a static web page hosted in S3 with a web page hosted on an EC2 instance. In Lab 1, you have learned AWS CLI and EC instances. Also, you have learned how to host a web site on an EC2 instance. In Lab 2, you have learned S3 and how to host a web page (a static web site) in S3. In Lab 4, you have learned an Apache HTTP server benchmarking tool, ab. You will use all you have learned to complete the project.

TLBs and caches are examples of content-addressable memories (CAMs). (a) What is the principal difference between a CAM and a RAM? [4 marks] (b) What is the difference between fully associative, set associative and direct mapped lookup? [6 marks] (c) Why are TLBs always much smaller than caches? [4 marks] (d) Which of the lookup mechanisms in part (b) is usually used for a TLB and why aren't the other mechanisms usually used? [6 marks] 2 ECAD Consider the following mysterious Verilog module. module mystery(c,r,a,s); input c,r,a; output [2:0] s; reg [2:0] s; always @(posedge c or posedge r) if(r) s<=0; else begin if(a && (s<7)) s<=s+1; else if(!a && (s>0)) s<=s-1; end endmodule (a) How many flip-flops will be required to implement the mystery module, and how will signals c and r be connected to these flip-flops? [5 marks] (b) What is the state transition diagram for this mystery module? [5 marks] (c) If this module were synthesised to the minimum sum of products form, what would the equations be for next state bits s[0], s[1] and s[2]? [10 marks] 2 CST.2004.3.3 3 Data Structures and Algorithms (a) Describe how the Lempel Ziv text compression algorithm works, illustrating your answer by deriving the sequence of numbers and corresponding bit patterns it would generate when applied to a string starting with the following 24 characters: ABCDABCDABCDABCDABCDABCD ... You may assume that the initial table is of size 256 (containing bytes 0 to 255) and that the codes for "A", "B", "C" and "D" are 65, 66, 67 and 68, respectively. [12 marks] (b) Estimate how many bits the algorithm would use to encode a string consisting of 1000 repetitions of the character "A". [8 marks] 4 Comparative Programming Languages (a) Discuss to what extent a programmer can expect a program that conforms to a standard to generate identical results when run under different conforming compilers on different machines. [6 marks] (b) ALGOL 60 provided call by value and call by name, Pascal provided call by value and call by reference, and ALGOL-W provided a variety of calling methods including call by result and call by value-result. Briefly describe the calling mechanisms just mentioned and discuss why most modern programming languages provide only call by value. [8 marks] (c) Discuss the reasons why languages such as Fortran, Algol and PL/I designed in 1950s and 1960s are less widely used than languages designed in the last 20 years. [6 marks] 3 [TURN OVER CST.2004.3.4 5 Operating Systems II (a) What problem do real-time scheduling algorithms try to solve? [2 marks] (b) Describe one static priority and one dynamic priority real-time scheduling algorithm. You should discuss the issue of admission control, and comment on the data structures that an implementation would need to maintain and on how these would be used to make scheduling decisions.are a data structure protected by a mutual exclusion lock. (i) What scheduling problem could arise here? [2 marks] (ii) How could this problem be overcome? [2 marks] (d) The designer also wishes the real-time system to use demand paged virtual memory for efficiency. (c) List the terminal images and non-terminal images, and count the creation rules both in the first syntax and in the sentence structure in your response to part (b). Demonstrate the beginning image in the two sentence structures. [2 marks] (d) Define a sort or types (in C, Java, or ML) appropriate for holding a theoretical linguistic structure tree coming about because of your solution to part (b). (e) Give a brief and rudimentary clarification of the standards of how the language coming about because of part (b) may be utilized to a sentence structure analyser taking a token stream as information (by means of calls to work lex()) and giving as result an theoretical language structure tree relating to part (d). Notice both transcribed also, consequently created grammar analysers. (c) List the terminal images and non-terminal images, and count the creation rules both in the first syntax and in the sentence structure in your response to part (b). Demonstrate the beginning image in the two sentence structures. [2 marks] (d) Define a sort or types (in C, Java, or ML) appropriate for holding a theoretical