ack structure. - and pop func =mory structure attributes if it e

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Note: Code implementation in C. Please provide it digitally, not on paper :)
1) Design a Stack structure.
2) Define push and pop functions for your Stack implementation.
3) Create a Memory structure owns number of block, block size, and stack attributes. You
can add more attributes if it eases your implementations.
Stack attribute represents memory blocks. Number of block attribute represents the length of
the stack. Block size represents the maximum value that each element in the stack can get.
4) Write an allocate function that takes a size parameter. If the given size is bigger than block
size of the Memory, the allocation will be distributed to the different blocks in the stack
attribute.
For example, calling allocate(27) updates the stack as
allocate(27) = [10, 10, 7, 0, 0]
for a Memory with number of block = 5, block size = 10. The remaining
of the elements which don't have maximum value can be sealed until the
element is ushed. Therefore, the next allocation can start from next element position after 7
given above.
5) Write an deallocate function that ushes the last used block.
Transcribed Image Text:Note: Code implementation in C. Please provide it digitally, not on paper :) 1) Design a Stack structure. 2) Define push and pop functions for your Stack implementation. 3) Create a Memory structure owns number of block, block size, and stack attributes. You can add more attributes if it eases your implementations. Stack attribute represents memory blocks. Number of block attribute represents the length of the stack. Block size represents the maximum value that each element in the stack can get. 4) Write an allocate function that takes a size parameter. If the given size is bigger than block size of the Memory, the allocation will be distributed to the different blocks in the stack attribute. For example, calling allocate(27) updates the stack as allocate(27) = [10, 10, 7, 0, 0] for a Memory with number of block = 5, block size = 10. The remaining of the elements which don't have maximum value can be sealed until the element is ushed. Therefore, the next allocation can start from next element position after 7 given above. 5) Write an deallocate function that ushes the last used block.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY