Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Related questions
Concept explainers
Question
How many traces does figure 2 have?
![Recall the "coffee with a friend" situation, involving the two (concurrent) processes depicted in Figure 1
start
drink coffee
0
start (0,0)
think
(0, 1)
Figure 1: Two concurrent processes that are happening while having coffee with a friend
talk
start
The composition of these two processes would be as given in Figure 2 The composition is somehow
the "product" of these processes, and is a complete representation of this concurrent system. Its nodes
represent the possible states that the system can be in, e.g., (1, 1) represents that I already drank my
coffee, while I have thought about what to say, but have not said it yet. The edges give the possible
transitions between these (composite) states, and so each path from the initial state (0, 0) to the final
state (1,2) represents a possible trace of this system, e.g., think→ drink coffee → talk.
drink coffee
start
drink coffee
drink coffee
(0, 2)
0
think
(1,2)
eat cookie
0
talk
talk
(1, 1)
2
think
Figure 2: The composition of the two concurrent processes of Figure 1
(1,0)
One could imagine yet a third process happening concurrently to the first two, as depicted in Figure 3.
while having coffee with a friend. Again, one cannot eat a cookie while drinking coffee, thinking or talking
(or should not?), but any of these can happen in any order, with the exception that one must think before
talking, as constrained by the second process depicted in Figure [1]
Figure 3: Another possible (concurrent) process among those of Figure 1](https://content.bartleby.com/qna-images/question/7dca2a94-c2be-4ffd-9389-8089ba7a0942/c34cf80d-902f-4991-81d2-f706a9320f5e/g0979m8_processed.jpeg)
Transcribed Image Text:Recall the "coffee with a friend" situation, involving the two (concurrent) processes depicted in Figure 1
start
drink coffee
0
start (0,0)
think
(0, 1)
Figure 1: Two concurrent processes that are happening while having coffee with a friend
talk
start
The composition of these two processes would be as given in Figure 2 The composition is somehow
the "product" of these processes, and is a complete representation of this concurrent system. Its nodes
represent the possible states that the system can be in, e.g., (1, 1) represents that I already drank my
coffee, while I have thought about what to say, but have not said it yet. The edges give the possible
transitions between these (composite) states, and so each path from the initial state (0, 0) to the final
state (1,2) represents a possible trace of this system, e.g., think→ drink coffee → talk.
drink coffee
start
drink coffee
drink coffee
(0, 2)
0
think
(1,2)
eat cookie
0
talk
talk
(1, 1)
2
think
Figure 2: The composition of the two concurrent processes of Figure 1
(1,0)
One could imagine yet a third process happening concurrently to the first two, as depicted in Figure 3.
while having coffee with a friend. Again, one cannot eat a cookie while drinking coffee, thinking or talking
(or should not?), but any of these can happen in any order, with the exception that one must think before
talking, as constrained by the second process depicted in Figure [1]
Figure 3: Another possible (concurrent) process among those of Figure 1
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 2 steps with 1 images
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
- What is minimum and maximum expansion of the following truth table? NO. A в F 1 1 2 3 1 1 4 1 1 1 6 1 7 1 1arrow_forwardConvert a to base b, giving full details of your analysis, when: (a): 11 10102, b= 10, (b) I 120110, b = 7, (c) x = 2BAD 16, b = 10, (d) x = 1010 0101 0011 10112, b = 16. Iarrow_forwardHow challenging is it to generate a complete jackknife estimate of accuracy and variance for an unpruned nearest-neighbor classifier (Chap.??)?arrow_forward
- can you expplain further how to get to that solution? my understanding is if we have 2^24, the row decoder will be 2^12 and column decoder will be 2^12. what happens if the N number is odd? My understanding is that we divide the N bits by 2 but what happens if it's oddarrow_forwardIs there a way or a mnemonic to remember the truth table for "If P, then Q"?arrow_forwardHow difficult is it to generate a complete jackknife estimate of accuracy and variance for an unpruned nearest-neighbor classifier (Chap.??)?arrow_forward
- Explain BFS algorithm colour coding. Summarise each colour.arrow_forwardHow difficult is it to generate a complete jackknife estimate of accuracy and variance for an unpruned nearest-neighbor classifier (Chap.??)?arrow_forwardWhat is the Entropy reduction for this split? Show all calculationsarrow_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 Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON 
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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