When a program is activated into a process, part of this activation is the allocation and mapping of several memory segments to support the execution of the process. Addresses from which segment are found in the program counter (PC)?
Stack |
Heap |
Initialized data |
Code |
Uninitialized data |
Answer: Stack.
Beacause program counter stores the address next instruction which is going to execute next.
When a program is activated into a process, part of this activation is the allocation and...
Most systems allow a program to allocate more memory to its address space during execution. Allocation of data in the heap segments of programs is and example of such allocated memory. What is required to support dynamic memor allocation in the following schemes? a. Contiguous memory allocation b. Pure segmentation c. Pure paging Explain each of the above schemes and provide sources to back your answers.
Which of the following statements is true regarding the different memory segments for a process and its child process (created using the fork() system call)? 1. Text segment is shared. Data, heap and stack are not shared. 2. Text and data are shared. Heap and stack are not shared. 3. All are shared. 4. None are shared.
When a process creates a new process using the fork() operation, which of the following resources is available for read/write between the parent process and the child process? a) stack b) heap c) shared memory segments. Please explain the answer fully and also explain why the other 2 options are incorrect.
Computer memory is typically organized in a hierarchy with different types of memory providing different size, speed, cost, and volatility trade-offs. Which of the following statements are true: Registers are the fastest memory accessible by machine instructions. Random Access Memory (RAM) is typically divided into regions (segments) dedicated to specific uses by executing programs. Instructions are fetched from Code segments. Temporary values used to support algorithm recursion are stored in Stack Segments. in computer programming, a static variable is a...
Programs written in a language that supports pointers and dynamic memory allocation can suffer from dangling pointers and lost heap-dynamic variables (or garbages). (a) A dangling pointer is a pointer that contains the address of a piece of memory that no longer belongs to the program. Give one scenario that can cause dangling pointers. Support your scenario with sample codes in your favorite language. Poorly implemented languages leave the detection of the dangling pointer problem to the operating system. Suggest...
Memory Consider a process running the following program #include estdlib.h> #include #define const char* int int <stdio.h> TO PRINT toPrintCPtr "Good luck!" TO PRINT; main for (i -0; i < sizeof (TO PRINT)-1; i++) printf("%c %c\n", toPrintCPt r [1], toupper(toPrintCPt r [i])); return(EXIT SUCCESS); Please tell where the following objects are stored in memory. Your choices are a. ROM BIOS b. kernal Memory (the OS) c. shared library memory (the glibc library) d. .text segment e. .rodata segment f. .data...
(2+2+1 5 points) Problem 10.1: simple cpu machine code = The following program has been written for the simple central processing unit introduced in class. The table below shows the initial content of the 16 memory cells. The first column denotes the memory address. Machine Code Assembly Code Description 001 1 0001 0 010 0 1111 1 001 1 0000 3 101 1 0100 110 1 0110 4 111 1 0000 5 6 001 0 001 1 100 1 0001...
i need help with a mips program to to covert roman numerals to
real numbers
Lab 4: Roman Numeral Conversion Part A: Due Sunday, 19 May 2019, 11:59 PM Due Friday, 24 May 2019, 11:59 PM Part B: Minimum Submission Requirements Ensure that your Lab4 folder contains the following files (note the capitalization convention): o Diagram.pdf o Lab4. asm O README.txt Commit and push your repository Lab Objective In this lab, you will develop a more detailed understanding of how...
*Help Please with the code**
CSIT 345 Lab 2 Process Programming Your lab requirement is to write program codes for 3.21 and shared memory program for producer and consumer as shown in the following. You can start with the code provided in the virtual machine in the virtual box you installed. The code can be found in /home/oscreader/osc9e-src/ch3 a. For 3.21, you can start with the newprocposix.c and modify the code to meet your requirement. Then type: gcc neypCOCROSİS.c to...
Complete the following Intel assembly language program which determines whether the byte sized operand stored in memory location 'number' is prime or not. The program will write the value of 0 into the memory location 'answer' if the number is not prime, otherwise the initial value of '1' will be left unmodified (indicating that the number is prime). The program makes use of the DIV instruction to determine the value of quotient and remainder when dividing the number by 2,3,4,......