Programming Language Pragmatics, 4th Edition interface Pingable {public void ping();1.2.3.4.class Counter implements Pingable {int count =public void ping() {5.0;6.7.++count;8.}9.public int val() {10.return count;11.}12.public class Ping {public static void main(String args []) {Counter c = new Counter();13.14.15.c.ping();c.ping();int v = c.val();System.out.println(v);16.17.18.19.20.21.Figure 10.8 A simple program in Java. 10.21 Consider the Java program shown in Figure 10.8. Assume that this is to be com-piled to native code on a machine with 4-byte addresses.(a) Draw a picture of the layout in memory of the object created at line 15. Showall virtual function tables.(b) Give assembly-level pseudocode for the call to c.val at line 19. You may as-sume that the address of c is in register r1 immediately before the call, andthat this same register should be used to pass the hidden this parameter. Youmay ignore the need to save and restore registers, and don't worry about whereto put the return value.(c) Give assembly-level pseudocode for the call to c.ping at line 17. Again, as-sume that the address of c is in register r1, that this is the same register thatshould be used to pass this, and that you don't need to save or restore anyregisters.(d) Give assembly-level pseudocode for the body of method Counter.ping (againignoring register save/restore).

Hey there, I have read the question carefully and clearly. I am writing the required solution for…

Consider the Java program shown in Figure 10.8. Assume that this is to be com- piled to native code on a machine with 4-byte addresses. (a) Draw a picture of the layout in memory of the object created at line 15. Show all virtual function tables.

Consider the Java program shown in Figure 10.8. Assume that this is to be com- piled to native code on a machine with 4-byte addresses. (a) Draw a picture of the layout in memory of the object created at line 15. Show all virtual function tables.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

1 All of the following data values are examples of unsigned datatypes in HLA EXCEPT a uns32 b uns16 c int8 d uns8 2 How many bits of stack memory are used when passing an int32 variable by-reference to a function? a 32 b 8 c 16 d 64 3 How many bits of stack memory are used when passing an int16 variable by-value to a function? a 32 b 8 c 16 d 64
) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)
Below is a program block written in ARM Assembly. Since initially PC = 0x2000, Stack pointer sp = 0x400 (no data in the stack memory and shown next), what are the LR and SP values when PC = 0x2028 (when the corresponding row is executed)? A. LR = 0x2048,SP = 0x3F0 B. LR = 0x201C,SP = 0x3F4 C. LR = 0x202C,SP = 0x408 D. LR = 0x2008,SP = 0x3F8 E. LR = 0x201C,SP = 0x404
Write a c++ code that implements a program that compares the running time for two loops which access very different number of array elements but which should have roughly the same number of cache misses. Try to estimate the average time for an array access with a cache miss and one without. use the following two loops (in the screenshot provided)
Generate a listing file for AddTwoSum.asm(in 3.4.3 of the text) and write a description of the machine code bytes generated for each instruction. You can write your descriptions directly over the .lst file. You might have to guess at some of the meanings of the byte values. ; AddTwoSum.asm - Chapter 3 example. .386.model flat,stdcall.stack 4096ExitProcess proto,dwExitCode:dword .datasum dword 0 .codemain proc mov eax,5 add eax,6 mov sum,eax invoke ExitProcess,0main endpend main
Consider the call to function swap in object file m.o (Problem 7.6 ).9: e8 00 00 00 00 callq e <main+0xe> swap()with the following relocation entry:r.offset = 0xar.symbol = swapr.type = R_X86_64_PC32r.addend = -4A. Suppose that the linker relocates .text in m.o to address0x4004e0 and swap to address 0x4004f8 . Then what is thevalue of the relocated reference to swap in the callqinstruction?B. Suppose that the linker relocates .text in m.o to address0x4004d0 and swap to address 0x400500 . Then what is thevalue of the relocated reference to swap in the callqinstruction?
Write a Java program that prompts the user for the page size used in a virtual memory system; this will be a power of two between 512 (29) and 16384 (214), inclusive. Your program should check the user input for page size to make sure it is one of the allowable inputs (must be a power of 2 and cannot be smaller than 512 or larger than 16384), and should then prompt the user for a virtual address (assume 32-bit virtual addressing, so your code must be able to accept any input between 0 and 4294967295, which is 232-1). Given this input, the program must output the virtual page number and the offset within the page. Sample output might look like this: Please enter the system page size: 1024 Please enter the virtual address: 10000 This address is in virtual page: 9 At offset: 784
17. a) Consider an application running on a multiprocessor system that takes 600 cycles,(during which processors are stalled), to handle a local cache miss leading to referencing a remote memory. The CPI for all references that hit in cache is 1 cycle. If 0.2% of cache access result in a local miss, how much faster will the system run if it has a perfect cache that never miss.
Write a code in sim8085 for the following problem: The pressure of two boilers is monitored and controlled by a microcomputer works based on microprocessor programming. A set of 6 readings of first boiler, recorded by six pressure sensors, which are stored in the memory location starting from 2050H. A corresponding set of 6 reading from the second boiler is stored at the memory location starting from 2060H. Each reading from the first set is expected to be higher than the corresponding position in the second set of readings. Write an 8085 sequence to check whether the first set of reading is higher than the second one or not. If all the readings of first set is higher than the second set, store 00 in the ‘D’ register. If any one of the readings is lower than the corresponding reading of second set, stop the process and store FF in the register ‘D’. Data (H): First set: 78, 89, 6A, 80, 90, 85 Second Set:71, 78, 65, 89, 56, 75
Suppose a computer using direct mapped cache has 232 byte of byte-addressable main memory, and a cache of 1024 blocks, where each cache block contains 32 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag, block, and offset fields? c) To which cache block will the memory address 0x000063FA map?
Use C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k, i.e. when you invoke your program from the shell, you pass it two parameters, n and k, where n >=16 and k >=8and is in powers of 2 (e.g. 8, 16, 32, etc.). Your main routine shall generate a random page trace of length n, where the page numbers have values ranging from 0 to ? − 1. Develop a subroutine within your program that implements the FIFO page replacement algorithm (as a separate function within your program). The function shall accept a page trace and a parameter f for the number of frames allocated. Your main routine shall then apply the random page trace to the subroutine implementing the page replacement algorithm, multiple times (using only one trace, randomly generated), passing a parameter f (number of page frames used) that ranges from 4 to k. Your main routine shall then record the number of page faults for each run (i.e. for each f).Run your program using a page…
Write a program in HACK assembly, without using symbols, that computes thebitwise exclusive or (XOR) of the values stored in RAM[1] and the value of thememory location with address stored in RAM[2]. The result of the computationshould be stored in RAM[0].You can think of RAM[2] as being a pointer to where the second operand of the XORis stored.