The average monthly cell phone bill was reported to be $50.0…
The average monthly cell phone bill was reported to be $50.07 by the U.S. Wireless Industry. Random sampling of a large cell phone company found the following monthly cell phone charges (in dollars): 55.83 49.88 62.98 70.42 60.47 52.45 49.20 50.02 58.60 51.29 Use a 0.05 significance level to test the claim that the average phone bill has increased. Claim: opposite: Null: Alternative: Find the test statistic: Find the p-value: State the decision based on your p-value: State the conclusion. This statement must address the original claim.
Read DetailsConsider a language which defines types according to the fol…
Consider a language which defines types according to the following grammar: –> int16 | int32 | int64 | struct { } –> ; | ε –> ID : A struct is a collection of fields. The type of a field could, in turn, be a struct that is defined inline. Here is an example of a type definition according to the grammar above: struct { A : int32; B : struct { X : int16; Y : int16; }; C : int64;} The alignment of a type is the largest power of 2 that is required to divide the memory addresses at which all instances of the type are placed. (For example, a type with 2-byte alignment must be placed at an even-numbered memory address, in bytes). int16, int32, and int64 are 16-bit, 32-bit, and 64-bit integers, respectively. In this language, integers require alignment equal to their size and the alignment of a struct is the maximum of the alignments of its fields. Construct an attribute grammar to compute the alignment of a . Define attributes and state if each attribute is synthetic or inherited. Write propagation rules for the attributes. Use the format: -> ==> .attribute1 = .attribute2 State how the parse tree should be traversed to evaluate the attributes. Using the example declarations for a and b above, show the derivations and how attributes are propagated through the parse tree. Use the format: 1. .attribute1 = .attribute2
Read DetailsMany compilers utilize separate compilation; a scheme in whi…
Many compilers utilize separate compilation; a scheme in which the compiler or assembler emits object files where memory addresses are specified as offsets relative to a section whose location is not fixed, and such object files may be linked with other objects to produce the final executable. State an optimization that would be illegal for a compiler using separate compilation to perform, but would be permissible for a link-time optimizer to perform when producing the final executable. Describe why this optimization cannot be performed during compilation but can be performed at link time.
Read DetailsConsider an architecture which provides an addc (“add with c…
Consider an architecture which provides an addc (“add with carry”) instruction. addc rA, rB, rC adds the values of registers rB, rC, and a 1-bit carry register, and writes the result to rA. If the addition overflows, the carry register is set to 1; otherwise it is set to 0. State the Def and Use sets for addc.
Read Details