Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 8, Problem 54CRP
Program Plan Intro
Bit pattern:
A bit pattern is the sequence of bits in a memory which are used to contrast bit patterns with some higher level interpretation of bits.
Machine instruction:
The machine instruction is a sequence of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Suppose a malloc implementation returns 8-byte aligned addresses and uses an explicit free list where the next and previous pointers are each 32-bits. Blocks have a 32-bit header and 32-bit footer, where the low-order bit of the header and footer are used to indicate whether the block is allocated (1) or free (0). Furthermore, the block size (which includes the header, payload, footer, and any necessary padding) is rounded up to the nearest multiple of 8, and this size (in bytes) is stored in the header and footer. Assume any padding must be between the payload and the footer.
a)If we call malloc(1), what block size will be allocated, in bytes?
b)Using the same condition, assuming we've already called malloc(1), if the heap used by malloc starts at address 0x4000 (16384 in decimal), what address would be returned if we then called malloc(32)?
For a data segment there are 2 lists in the following memory demonstration(from 0007 offset address) with 5 elements called LIST1(list type:byte) and another list with 4 elements called LIST2(list type: Word), respectively.
a) write how registers change when the following code is executed.
MOV DI,2 DI =
LEA BX, LIST2 BX =
MOV DX, [BX][DI]+1 DX =
MOV BX, OFFSET LIST1 BX =
INC DI DI =
SUB BX, DI BX =
MOV CL, LIST1[BX] CL =
b) Write code that copies 1 byte sized data that is in 0014 address, from 000DH address.
c) Write code that copies 3rd element of LIST2 to 0th element of LIST2.
Program binaries in many systems are typically structured as follows.
Code is stored starting with a small fixed virtual address such as 0. The
code segment is followed by the data segment that is used for storing
the program variables. When the program starts executing, the stack is
allocated at the other end of the virtual address space and is allowed to
grow towards lower virtual addresses. What is the significance of the
above structure on the following schemes:
a. contiguous-memory allocation
b. pure
segmentation
c. pure paging
Chapter 8 Solutions
Computer Science: An Overview (12th Edition)
Ch. 8.1 - Give examples (outside of computer science) of...Ch. 8.1 - Prob. 2QECh. 8.1 - Prob. 3QECh. 8.1 - Prob. 4QECh. 8.1 - Prob. 5QECh. 8.2 - In what sense are data structures such as arrays,...Ch. 8.2 - Prob. 2QECh. 8.2 - Prob. 3QECh. 8.3 - Prob. 1QECh. 8.3 - Prob. 2QE
Ch. 8.3 - Prob. 3QECh. 8.3 - Prob. 4QECh. 8.3 - Modify the function in Figure 8.19 so that it...Ch. 8.3 - Prob. 7QECh. 8.3 - Prob. 8QECh. 8.3 - Draw a diagram representing how the tree below...Ch. 8.4 - Prob. 1QECh. 8.4 - Prob. 2QECh. 8.4 - Prob. 3QECh. 8.4 - Prob. 4QECh. 8.5 - Prob. 1QECh. 8.5 - Prob. 3QECh. 8.5 - Prob. 4QECh. 8.6 - In what ways are abstract data types and classes...Ch. 8.6 - What is the difference between a class and an...Ch. 8.6 - Prob. 3QECh. 8.7 - Suppose the Vole machine language (Appendix C) has...Ch. 8.7 - Prob. 2QECh. 8.7 - Using the extensions described at the end of this...Ch. 8.7 - In the chapter, we introduced a machine...Ch. 8 - Prob. 1CRPCh. 8 - Prob. 2CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 4CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 6CRPCh. 8 - Prob. 7CRPCh. 8 - Prob. 8CRPCh. 8 - Prob. 9CRPCh. 8 - Prob. 10CRPCh. 8 - Prob. 11CRPCh. 8 - Prob. 12CRPCh. 8 - Prob. 13CRPCh. 8 - Prob. 14CRPCh. 8 - Prob. 15CRPCh. 8 - Prob. 16CRPCh. 8 - Prob. 17CRPCh. 8 - Prob. 18CRPCh. 8 - Design a function to compare the contents of two...Ch. 8 - (Asterisked problems are associated with optional...Ch. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 22CRPCh. 8 - Prob. 23CRPCh. 8 - Prob. 24CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 26CRPCh. 8 - Prob. 27CRPCh. 8 - Prob. 28CRPCh. 8 - Prob. 29CRPCh. 8 - Prob. 30CRPCh. 8 - Design a nonrecursive algorithm to replace the...Ch. 8 - Prob. 32CRPCh. 8 - Prob. 33CRPCh. 8 - Prob. 34CRPCh. 8 - Draw a diagram showing how the binary tree below...Ch. 8 - Prob. 36CRPCh. 8 - Prob. 37CRPCh. 8 - Prob. 38CRPCh. 8 - Prob. 39CRPCh. 8 - Prob. 40CRPCh. 8 - Modify the function in Figure 8.24 print the list...Ch. 8 - Prob. 42CRPCh. 8 - Prob. 43CRPCh. 8 - Prob. 44CRPCh. 8 - Prob. 45CRPCh. 8 - Prob. 46CRPCh. 8 - Using pseudocode similar to the Java class syntax...Ch. 8 - Prob. 48CRPCh. 8 - Identify the data structures and procedures that...Ch. 8 - Prob. 51CRPCh. 8 - In what way is a class more general than a...Ch. 8 - Prob. 53CRPCh. 8 - Prob. 54CRPCh. 8 - Prob. 55CRPCh. 8 - Prob. 1SICh. 8 - Prob. 2SICh. 8 - In many application programs, the size to which a...Ch. 8 - Prob. 4SICh. 8 - Prob. 5SICh. 8 - Prob. 6SICh. 8 - Prob. 7SICh. 8 - Prob. 8SI
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Write a subroutine SUBMIN that determines the smallest number of a list (note: numbers in the list are found at consecutive addresses). The address of the first element in the list and the size of the list are passed to the subroutine by using stack. The address of the smallest number in the list should be returned by using stack. The value of the registers should be preserved.arrow_forwardSuppose a malloc implementation returns 8-byte aligned addresses and uses an implicit free list. Blocks have a 32-bit header, where the low-order bit of the header is used to indicate whether the block is allocated (1) or free (0). Furthermore, the block size (which includes the header, payload, and any necessary padding) is rounded up to the nearest multiple of 8, and this size (in bytes) is stored in the header. Assume any padding must be at the end of the block. If we call to malloc(1), what block size will be allocated, in bytes?arrow_forwardCreate a program in C++ which simulates a direct cache. The memory array that contains the data to becached is byte addressable and can contain 256 single byte entries or lines. The cache has only 8 entriesor lines. The Data field in each line of the cache is 8 bits. Since the data stored in each line of the cache isonly 8 bits, there is no need for a line field. Only a tag field is needed which is log2(256) = 8 bits.The memory array can be filled with any values of your choice. The program should work by taking userinput of a memory address (index). This input represents the memory data that should be cached.Check the cache to see if the item is already cached. If it is not, your program should counta cache miss, and then replace the item currently in the cache with the data from the inputted address.Allow the user to input addresses (in a loop), until they so choose to end the program. The program should output the number of cache misses upon ending.arrow_forward
- Let us assume that, the stack pointer ($sp) has value Y, just before the procedure starts. Give the value, of the stack pointer, with respect to Y, after the procedure saves the appropriate registers on stack. Give the value and explain why. Give the value, of the stack pointer, with respect to Y, after the procedure restores the saved registers from stack. Give the value and explain why.arrow_forwardWrite a MIPS Assembly Language program to read an array of 5 integers and print them. Read a key element to search in the array. Display how many times that key element occurs in the array and the positions(index) of all the occurrences of that key element.arrow_forwardComputer Science Write a subroutine SUBMIN that determines the smallest number of a list (note: numbers in the list are found at consecutive addresses). The address of the first element in the list and the size of the list are passed to the subroutine by using stack. The address of the smallest number in the list should be returned by using stack. The value of the registers should be preserved.arrow_forward
- 1. Suppose an array with six rows and eight columns is stored in a row major order starting at address 20 (base 10). If each entry in the array requires only one memory cell, what is the address on the entry in the third row and fourth columns? What if each entry requires two memory cells?arrow_forwardPart 1: Preliminary Summarize the difference between binary machine language, assembly language, and high-level source files like C. Contrast the difference between a compiler, assembler, and linker What is the difference between the data segment and the text segment of in an assembly language program? What register is used as the stack pointer? What is a ebreak instruction in the sample program? How would you define a constant named 'BLUE' and assign it to the value OX00F in assembly language? Describe how to implement the psuedo-instruction li t1, e using a native instruction.arrow_forward4. Suppose we want to create a stack of names that vary in length. Why is it advantageous to store the names in separate areas of memory and then build the stack out of pointers to these names rather than allowing the stack to contain the names themselves?arrow_forward
- The memory location at address of 0X003FB01 contains 1-byte memory variable J (0010_0001), and the memory location at the address of 0X003FB02 contains 1-byte memory variable K (0001 0010), see figure below. There is a 2-byte variable M which hold binary information M (1110 0101 0000 1i11). What is the address in hexadecimal format for 2-byte memory variable M, following little Endian computer? 7 Address in Data in Hex. Format Hex. Format 0X003FBF04 1110 0101 M OX003FBF03 0000 1111 0X003FBF02 0001 0010 0X003FBF01 0010 0001 J Its address in hexadecimal is 0X003FBF02. а. Its address in hexadecimal is 0×003FBF03. O b. Its address in hexadecimal is 0X003FBF04. Its address in hexadecimal is 0×003FBF01. d.arrow_forwardFor this assignment, you are to write a MIPS assembly language program using the MARS IDE and assume a system has 31-bit virtual memory address (so no worry about negative numbers) with a 4-KB page size (4096 bytes). Write a MIPS program that accepts an integer input that represents a virtual address and outputs the page number and offset for the given address in decimal. The output should look like: The address 19986 is in: Page number = 4 Offset = 3602 Check to make certain your program works. You can use the output from 19986 given above as a test, but I will use other numbers to test it. Submit the MIPS assembly language code and a screenshot showing a test run.arrow_forwardMemory address Data According to the memory view given below, if RO = Ox20008002 then LDRSB r1, [r0, #-4] is executed as a result of r1 = ?(data overlay big endian)? Øx20008002 ØXA1 Øx20008001 ØXB2 Øx20008000 Øx73 ØX20007FFE ØXD4 ØX20007FFE Lütfen birini seçin: O A. R1 = 0X7F O B. R1 = Oxffffffd4 O C. R1 = Oxffffff7F O D. R1=0XD4000000 O E. R1 = 0XD4arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education