Which of the following information is typically NOT stored in a PCB? Process ID Program counter File descriptors Memory allocation information
Added by Ernest C.
Close
Step 1
The question asks which of the given options is typically NOT stored in a Process Control Block (PCB). A PCB is a data structure in an operating system that contains information about a process. Show more…
Show all steps
Your feedback will help us improve your experience
Adam Conner and 68 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
What is the use of the process table in program execution?
Akash M.
Description Version 1 of the process creation hierarchy uses linked lists to keep track of child processes as described in section "The process control block", subsection "The PCB data structure". For the purposes of performance evaluation, the PCBs are simplified as follows: All PCBs are implemented as an array of size n. Each process is referred to by the PCB index, 0 through n-1. Each PCB is a structure consisting of only the two fields: - parent: a PCB index corresponding to the process's creator - children: a pointer to a linked list, where each list element contains the PCB index of one child process The necessary functions are simplified as follows: create(p) represents the create function executed by process PCB[p]. The function creates a new child process PCB[q] of process PCB[p] by performing the following tasks: - allocate a free PCB[q] - record the parent's index, p, in PCB[q] - initialize the list of children of PCB[q] as empty - create a new link containing the child's index q and appends the link to the linked list of PCB[p] destroy(p) represents the destroy function executed by process PCB[p]. The function recursively destroys all descendant processes (child, grandchild, etc.) of process PCB[p] by performing the following tasks: - for each element q on the linked list of children of PCB[p] - destroy(q) /* recursively destroy all progenies */ - free PCB[q] - deallocate the element q from the linked list Version 2 of the same process creation hierarchy uses no linked lists. Instead, each PCB contains the 4 integer fields parent, first_child, younger_sibling, and older_sibling, as described in the subsection "Avoiding linked lists". Assignment cr[0] /* creates 1st child of PCB[0] at PCB[1] */ cr[0] /* creates 2nd child of PCB[0] at PCB[2] */ cr[2] /* creates 1st child of PCB[2] at PCB[3] */ cr[0] /* creates 3rd child of PCB[0] at PCB[4] */ de[0] /* destroys all descendents of PCB[0], which includes processes PCB[1] through PCB[4] */ 1. Implement the two versions of the process creation hierarchy. 2. Assume that PCB[0] is the only currently existing process and write a test program that performs a series of process creations and destructions. Ex: 3. Run the test program repeatedly in a long loop using both versions and compare the running times to see how much time is saved in version 2, which avoids dynamic memory management.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD