Please help me with this Principles of programming language homework question 10.21 Consider the Java program shown in Figure 10.8. Assume that this is to be compiled tonative 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 virtualfunction tables.register(b) Give assembly-level pseudocode for the call to c.val at line 18. You may assume that theaddress of c is in register r1 immediately before the call, and that this same shouldbe used to pass the hidden this parameter. You may ignore the need to save and restoreregisters, and don't worry about where to put the return value.1.2.3.4.5.6.Ó NOIN MISCH9.10.11.12.interface Pingable {14.15.public void ping();}class Counter implements Pingable {int count = 0;public void ping() {++count;}}public int val() {return count;}13. public class Ping {public static void main(String args[]) {Counter c= new Counter();16.17.18.19.20.21. }Figure 10.8 A simple program in Java.c.ping();c.ping();int v= c.val();System.out.println(v);}ID No.

Name: Please help me with this Principles of programming language homework q
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Please help me with this Principles of programming language homework question 10.21 Consider the Java program shown in Figure 10.8. Assume that this is to be compiled tonative code on a machine with 4-byte addresses.(a) Draw a picture of the layout i

In object-oriented programming languages like Java, memory layout and function calls involve the use…

Engineering

Computer Science

10.21 Consider the Java program shown in Figure 10.8. Assume that this is to be compiled 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. (b) Give assembly-level pseudocode for the call to c.val at line 18. You may assume that the address of c is in register r1 immediately before the call, and that this same register should be used to pass the hidden this parameter. You may ignore the need to save and restore registers, and don't worry about where to put the return value. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. interface Pingable { } public void ping(); class Counter implements Pingable { int count = 0; public void ping() { ++count; } } public int val() { return count; public class Ping { public static void main(String args[]) { Counter c= new Counter(); 13. 14. 15. 16. 17. 18. 19. 20. 21. } Figure 10.8 A simple program in Java. } c.ping(); c.ping(); int v= c.val(); System.out.println (v);

10.21 Consider the Java program shown in Figure 10.8. Assume that this is to be compiled 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. (b) Give assembly-level pseudocode for the call to c.val at line 18. You may assume that the address of c is in register r1 immediately before the call, and that this same register should be used to pass the hidden this parameter. You may ignore the need to save and restore registers, and don't worry about where to put the return value. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. interface Pingable { } public void ping(); class Counter implements Pingable { int count = 0; public void ping() { ++count; } } public int val() { return count; public class Ping { public static void main(String args[]) { Counter c= new Counter(); 13. 14. 15. 16. 17. 18. 19. 20. 21. } Figure 10.8 A simple program in Java. } c.ping(); c.ping(); int v= c.val(); System.out.println (v);

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

• WRITE THE ASSEMBLY LANGUAGE CODE IN EITHER RISC-V/MIPS SIMULATOR. SUBMIT FILE WITH EXTENSION “S” . • Take the screenshot of result and Registers from the simulator • UPLOAD screenshot and .s file ON BLACKBOARD. 4) Write an Assembly language code that takes in two numbers b and p, and returns the result of below expression. x= ((b+5) * (p-2) * 10) / 4;
IN asmly language please Pretty please with successful build screen shot and output 1.Using the AddTwo program from Section 3.2 as a reference, write a program that calculates the following expression, using registers: A = (A + B) − (C + D). Assign integer values to the EAX, EBX, ECX, and EDX registers. Note: you can hard code integer literal onto the registers, e.g. mov eax,55 ; AddTwo.asm - adds two 32-bit integers.; Chapter 3 example .386.model flat,stdcall.stack 4096ExitProcess proto,dwExitCode:dword .codemain proc mov eax,5 add eax,6 invoke ExitProcess,0main endpend main 2. Listing File for AddTwoSum 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. Submit the .lst file with your description over it.…
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
Write a program in HACK assembly, without using symbols, that sums the consecutive set of memory locations starting from the memory address stored in RAM[1]up to, but not including, the memory address RAM[1] + RAM[2]. The result of thecomputation should be stored in RAM[0]. Note, you need not consider the case ofan overflow.You can think of RAM[1] as being a pointer to an array of numbers, and RAM[2] asbeing the length of the array you are summing over.
Write a C program that does a large number of references to elements of two-dimensioned arrays, using only subscripting. Write a second program that does the same operations but uses pointers and pointer arithmetic for the storage-mapping function to do the array references. Compare the time efficiency of the two programs. Which of the two programs is likely to be more reliable? Why?
Write a short C program that declares and initializes (to any value you like) a double, an int, and a char. Next declare and initialize a pointer to each of the three variables. Your program should then print the address of, and value stored in, and the memory size (in bytes) of each of the six variables.
Write a program in C++ that contains code addressing the following: (New code and with detailed steps!) a. Create an integer array of 100,000 items (static binding – before compiling) b. Create the same large array on the run time stack (in a function) c. Create the same large array from the heap (dynamic memory – dynamic binding). Call each of the subprograms 1,000,000 times and output the time required by each to finish all 1,000,000 calls. Which was the fastest? Here is code for calling time. #include <time.h> //in main() clock_t start = 0, end = 0; //variables start = clock(); //calls time function stores result in start end = clock(); // calls time function stores result in end //display the time by subtracting the start from the end //displays in clock ticks.
In c++ write an assembler in which it will read a program written in HACK assembly language from an external file and ultimatley translate each line of code into the binary equivalent that can be run on the computer I built so based off the following hdl files Computer below others are in the images. CHIP Computer { IN reset; PARTS: //Read-only memory (ROM) for instruction fetch ROM32K(address=PC,out=instruction); //Central Processing Unit (CPU) for instruction executionCPU(instruction=instruction,reset=reset,inM=outMemo,outM=CPUoutM,writeM=wM,addressM=adM,pc=PC); //Memory for data storage and control logic Memory(in=CPUoutM,load=wM,address=adM,out=outMemo); }
Computer organization and assembly language Please help me with this. I have to write line by line what each line of codes does. CODE IS BELOW: .model small .386 .stack 100h .data msg1 db 13, 10, "Enter any number --> ", "$" msg2 db "Enter an operation +,- * or / --> ",13, 10, "$" msg3 db "The Operation is --> ", "$" msg4 db "The result is --> ", "$" By_base dd 21 by_10 dd 10 ; 32 bits variable with initial value = 10 sp_counter db 0 ; 8 bits variable with initial value of zero disp_number dd 0 ; 32 bits variable with initial value = 0 disp_number2 dd 0 disp_number3 dd 0 op_type db 0 last_key dd 0 ; 32 bits variable with initial value of zero remainder db 0 .code main proc mov ax,@data;set up datasegment movds,ax mov dx,offset msg1 call display_message callm_keyin calloperation mov dx,offset msg1 calldisplay_message callm_keyin cmpop_type, "+" jnz short skip_plus callop_plus skiP_plus: cmp op_type, "-" jnz short skip_minus callop_minus…
The following instruction set is supported by a simple processor, which is similar to what we discussed in the class, with a few new instructions added. The format of most instructions is defined as follows. bits 15:14 13:10 9 8:6 5:3 2:0 field unused opcode w srcl src2 dst where the fields are defined as follows. opcode : operation to be performed by the processor write back ALU output to register file (1= yes, 0 = no) address of the first ALU operand in the register file address of the second ALU operand in the register file address in the register file where the output is written w: srcl: src2: dst: For opcodes BEQ, BLEZ and JUMP, the 6 least significant bits (5:0) give an address in the instruction memory, which is byte-addressed. The opcode HALT has all operand bits (9:0) being 0. When an instruction has only two operands, the field for the unused operand is filled with 0-bits. For example, bits (5:3) for SLL are all zero because src2 is not used. The opcode and meaning of these…
Question: Can you please help me with answering the following coding question? If you do write code, can it please either be in C or C++? Thank you Problem: Your task is to create the CPU execution scheduler where the jobs are kept in a priority queue implemented as a binary heap. Make this a round robin type of execution where the jobs are deleted from the heap, executed for 2 time units, and re-inserted with a lower priority into the priority queue. Jobs that have completed execution would not be re-inserted into the heap. New jobs could come in at a priority that might be higher than the aging jobs. . For example, the following tree represents a Maximum binary heap. Each node indicates the priority and the total execution time of each process. This a round robin type of execution where the jobs are deleted from the heap, The system assigns the next CPU time (time slice) which is 2 unit to the highest priority process. Here, the root will be deleted and will be executed for two…
3. We've seen variable types that store characters, integers and floating point numbers. In a very similar fashion, addresses can be are stored. A variable that stores an address value is called a pointer variable, or simply a pointer. Let's take a look at the following example. As you may have noticed, we did not directly assign anything to num, c, count, and salary. Instead, we used the pointers to assign values to where those pointers were pointing. What does this program do? Can you make changes to assign anything to num, c, count, and salary and print them using pointers numptr, cptr, countptr, and salaryptr. #include using namespace std; int main() { int num; char c; int count; float salary; // Declaring bunch of pointers that point to nothing (point to null) // declare a pointer variable to an integer // declare a pointer variable to a character // declare a pointer variable to an integer int char *numptr; *cptr; *countptr; *salaryptr; // declare a pointer variable to a float…