Kindly answer the following with notes on how you solved it. Problem I.Shown below is a MARIE code that implements the pseudo-code given in the blue box. Studythis implementation and implement it in MARIE and test your code. Assume that this programstarts in memory location 10816.Example: If-else statementsInstructionLoadXSubt YSkipcond 400Jump elseLoadAddif,then,else,XXStore XJumpLoadSubtX,Y,Storeendif, HaltDecDecendifYXY1220Answer the following questions:a. What are the contentsPC=_if X-Y:X:- x x 2else:Y: Y - XComments/Load the first value/Subtract value of Y and store result in AC/If AC = 0, skip the next instruction/Jump to the else partif AC is not equal to 0/Reload X so it can be doubled/Double X/Store the new value/Skip over Else part to end of If/Start the Else part by loading Y/Subtract X from Y/Subtract Y = X in Y/Terminate Program (it doesn't do much)of PC and MAR after executing the first LOAD X?MAR =b. What is the effective memory address for X and Y?c. What is the contents of memory corresponding to the MARIE instructionSkipcond 400?d. What is the value of AC after the first execution of SUBT Y?__

Here is the solution for the above one. Answer a) Answer: PC = 109 hex , MAR = 108 hex…

Shown below is a MARIE code that implements the pseudo-code given in the blue box. Study this implementation and implement it in MARIE and test your code. Assume that this program starts in memory location 10816. If X=Y-

Shown below is a MARIE code that implements the pseudo-code given in the blue box. Study this implementation and implement it in MARIE and test your code. Assume that this program starts in memory location 10816. If X=Y-

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

We can solve memory leaks with using a tombstone or lock and keys approach to the dangling pointer problem using a tombstone or mark-sweep approach to the dangling pointer problem some form of garbage collection such as mark-sweep or reference counters some form of garbage collection such as tombstones or lock-and-keys
2. Implement the frame replacement algorithm for virtual memory In Java For this task, you need to perform the simulation of page replacement algorithms. Create a Java program which allows the user to specify: • the total of frames currently exist in memory (F), the total of page requests (N) to be processed, • the list or sequence of N page requests involved, For example, if N is 10, user must input a list of 10 values (ranging between 0 to TP-1) as the request sequence. Optionally you may also get additional input, the total of pages (TP) This input is optional for your program/work. It only be used to verify that each of the page number given in the request list is valid or invalid. Valid page number should be within the range 0, .. , TP-1. Page number outside the range is invalid. Then use the input data to calculate the number of page faults produced by each of the following page replacement algorithms: • First-in-first-out (FIFO) - the candidate that is the first one that entered…
Please convert Mutual Recursion to Java. See attached image. Thank you.
There are many algorithms presented in this text that would lend themselves to beincluded as subprograms in the utils.asm file. Implement some or all of the followinginto the utils.asm file, properly documenting them, and include programs to test them.a. NOR subprogram - take two input parameters, and return the NOR operation onthose two parameter.b. NAND- take two input parameters, and return the NAND operation on those twoparameter.c. NOT- take one input parameters, and return the NOT operation on that parameter.d. Mult4 - take an input parameter, and return that parameter multiplied by 4using only shift and add operations.e. Mult10 - take an input parameter, and return that parameter multiplied by 10using only shift and add operations.f. Swap- take two input parameters, swap them using only the XOR operation.g. RightCircularShift - take an input parameter, and return two values. The firstis the value that has been shifted 1 bit using a right circular shift, and the second isthe…
bubblesort.h is in second picture This is bublesort.c int compare(Entry a, Entry b) {// IMPLEMENT}/*TEST: ./mergesort < test.inOUTPUT:1 lsdfjl2 ghijk3 ksdljf5 abc6 def*/int main(void) {// IMPLEMENT} this is test.in 55 abc6 def2 ghijk3 ksdljf1 lsdfjl
For a map reduce job that does word count. Which of the following statements is correct? Select one: a. The mapper can only output one key value pair for each unique word. O b. The mapper first groups the data by word before emitting the data. The aggregation can be done in both the mapper and reducer. d. The reducer always performs all the aggregation.
Implement in C programming language Question 1 Write a program in c to detect if the system will face any deadlock in the future. If a deadlock is detected then print “Deadlock Ahead” otherwise print “Safe here”. The situation is given below. (Allowed to use Banker’s Algorithm). Note: The code can be implemented in several different ways, but make sure the parameter remains the same as shown below. n = 5; // Number of processes m = 4; // Number of resources int alloc[5][4] = { { 0, 1, 0, 3 }, // P0 // Allocation Matrix { 2, 0, 0, 0 }, // P1 { 3, 0, 2, 0 }, // P2 { 2, 1, 1, 5 }, // P3 { 0, 0, 2, 2 } }; // P4 int max[5][4] = { { 6, 4, 3, 4 }, // P0 // MAX Matrix { 3, 2, 2, 1 }, // P1 { 9, 1, 2, 6 }, // P2 { 2, 2, 2, 8 }, // P3 { 4, 3, 3, 7 } }; // P4 int avail[4] = { 3,…
The GMP library, using C or C++ The prefered solution is to use the Sage library. 2 Fermat test 1. Implement the Fermat test of primality with small integers. 2. Write a function to generate random k-bit prime numbers. 3 RSA 1. Write the key-generation function function of RSA. The function should generate two random primes p and q of size k/2 bits. 2. Implement the RSA encryption function 3. Implement the RSA decryption function 4. Check that decryption works
Please answer in c++. please make sure output pops up same as in the image
please answer question #33. please use (Algorithm 5.7) for the Backtracking Algorithm for the 0-1 Knapsack Problem requirement- - use QueueADT class to store intermediate data. - use some data class to store input data or use text file with option to read it. - use multiple classes as components of your application (like test class, algorithm class, data class) run various inputs and compare run time, etc. please use java language for coding java file - should start java file with YOUR Last Name, Like SmithClubApp, PetrowskiTravelLogApp, for your class short paragraph should include- please answer these questions in the correct order -description of the java file -what it does? -what is the input data? expected output, samples of both
The following are the operations that you can do using a single linked list. Choose only one operation then create the algorithm and simulate. The attached Rubric will be used in evaluating the activity. 1. Delete a particular node in a single linked list 2. Delete the first node of a single linked list 3. Insertion after a given node of a single linked list 4. Insertion at a given position in a single linked list 5. Insertion before a given node in a single linked list 6. Reverse a single linked list EX: Delete the last node of a single linked list Problem" Deletion of the last node in a single linked list Algorithm" Step 1: if HEAD = NULL Write UNDERFLOW Go to Step 8 Step 2: SET PTR = HEAD Step 3: Repeat Steps 4 and while PTR à NEXT = NULL Step 4: SET PREPPTR = PTR Step 5: SET PTR =PTR à NEXT [End of loop] Step 6: SET PREPTR à NEXT = NULL Step 7: FREE PTR Step 8: EXIT…
Question