Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 8, Problem 16CRP
Program Plan Intro
Pop operation:
In this operation, the item is removed from the stack. The contents are reversed when they are getting popped.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
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.
The STACK is a dynamic data structure. The 80x86 computer controls its stack via stack pointer ESP. Whenever you
PUSH data onto the stack segment memory using PUSH EBX, the 80x86 will transfer data by:
Decreasing the stack pointer ESP by 4.
O b. Incrcasing the stack pointer ESP by 2.
Decreasing the stack pointer ESP by 2.
Increasing the stack pointer ESP by 4.
The STACK is a dynamic data structure. The 80x86 computer controls
its stack via stack pointer ESP. Whenever you POP data out of the
stack segment memory using POP BX, the 80x86 will transfer data by:
Oa.
a. Increasing the stack pointer ESP by 4.
Ob. Decreasing the stack pointer ESP by 2.
Oc.
c. Decreasing the stack pointer ESP by 4.
Od. Increasing the stack pointer ESP by 2.
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
Similar questions
- MIPS Programming... Data segment!arrow_forwardThe STACK is a dynamic data structure. The 80x86 computer controls its stack via stack pointer ESP. Whenever you PUSH data onto the stack segment memory using PUSH EBX, the 80x86 will transfer data by: Oa. Da. Decreasing the stack pointer ESP by 4. Ob. Increasing the stack pointer ESP by 2. Oc. Increasing the stack pointer ESP by 4. Od. Decreasing the stack pointer ESP by 2.arrow_forwardThe STACK is a dynamic data structure. The 80x86 computer controls its stack via stack pointer ESP. Whenever you PUSH data onto the stack segment memory using PUSH EBX, the 80x86 will transfer data by: a. Decreasing the stack pointer ESP by 4. Ob. Ob. Increasing the stack pointer ESP by 2. Oc. c. Increasing the stack pointer ESP by 4. Od. Decreasing the stack pointer ESP by 2.arrow_forward
- 61. If the current values in the stack segment register and stack pointer are C00016 and FF0016, respectively, what is the address of the current top of the stack?arrow_forwardRegister Name Register Contents Memory Address Memory Contents EAX 13 12A2h EBX 11 38 ECX 21 184 B004h EDX 95 8004h seeah ESParrow_forward62. For the base and offset addresses in problem 61, how many words of data are cur- rently held in the stack?arrow_forward
- 15. The current value of the SP (stack pointer) is $10FF and the instruction RCALL LABEL is executed. What is the value of SP after the RCALL executes? 16. Directly after the RCALL is executed in problem 15 the following instructions are executed: POP R16 POP R18 Where in data memory will the information contained in R18 be stored? What is the value of SP after these instructions are executed?arrow_forwardAbout the best case, worst case, and average case, which one of the following is NOT true? In practice, we normally focus on the worst case performance. The best case incurs the minimum basic operations. The average case is the average of the best case and the worst case. The worst case incurs the maximum basic operations.arrow_forward2. Read the following program and answer the questions given below. Line No. Mnemonics LXI SP,0400H LXI B,2055H 1 LXI H,22FFH LXI D,2090H 4 PUSH H 6. PUSH B MOV A,L 20 POP H a. What is stored in the stack pointer register after the execution of line 1? PROGRAMMING THE 8085 b. What is the memory location of the stack where the first data byte will be stored? c. What is stored in memory location 03FEH when line 5 (PUSH H) is executed? d. After the execution of line 6 (PUSH B), what is the address in the stack pointer register, and what is stored in stack memory location 03FDH? e. Specify the contents of register pair HL after the execution of line 20 (POP H).arrow_forward
- The class I'm taking is assembly programming. I am completely stuck. I have attached the problem. Please view attachment before answering. Thank you so much for your help! Any help is greatly appreciated.arrow_forwardQ-6: A main program consists of two procedures begins at memory address 7000H. Procedure-1 begins at begins at 6000H and Procedure-2 begins at 8000H respectively. Procedure-1 is called within Procedure-2 at memory address 8050H. In the main program Procedure-1 is called at 7040H and Procedure-2 is called twice: first at 7060H and then at 70AOH. Please note that Stack is used to save return addresses at the instants of procedure calls. Show the state of Stack while the program runs.arrow_forwardQ1arrow_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