Answer:
Please find the answer in the attached image.
Explanation:
I wrote this program using JavaScript programming language.
// A function to check tickets
function tickets(user_tickets){
var num_tickets;
if (user_tickets < 5) {
num_tickets = 1;
return ('num_tickets: '+ num_tickets);
}
else {
num_tickets = user_tickets;
return('num_tickets: '+ num_tickets);
}
}
// Testing the tickets function
// With user_tickets = 3, 5, 8, and 1
console.log(tickets(3));
console.log(tickets(5));
console.log(tickets(8));
console.log(tickets(1));
Answer:
S and R both are 0
Explanation:
A <em>0</em> at the input of a NAND gate causes its output to be <em>1</em>. There is no other logic between the output NAND gate and the S or R inputs, so both inputs 0 will make both outputs 1.
Answer:
# hide_and_seek function is defined
def hide_and_seek():
# for loop from 1 to 10
# and print each number
for number in range(1, 11):
print(number)
# the last message is displayed on its own line
print("Ready or not, here I come!")
# the function is called
hide_and_seek()
Explanation:
The code is well commented. A sample image of the output when the code is executed is attached.
Answer:
In terms of efficient use of memory: Best-fit is the best (it still have a free memory space of 777KB and all process is completely assigned) followed by First-fit (which have free space of 777KB but available in smaller partition) and then worst-fit (which have free space of 1152KB but a process cannot be assigned). See the detail in the explanation section.
Explanation:
We have six free memory partition: 300KB (F1), 600KB (F2), 350KB (F3), 200KB (F4), 750KB (F5) and 125KB (F6) (in order).
Using First-fit
First-fit means you assign the first available memory that can fit a process to it.
- 115KB will fit into the first partition. So, F1 will have a remaining free space of 185KB (300 - 115).
- 500KB will fit into the second partition. So, F2 will have a remaining free space of 100KB (600 - 500)
- 358KB will fit into the fifth partition. So, F5 will have a remaining free space of 392KB (750 - 358)
- 200KB will fit into the third partition. So, F3 will have a remaining free space of 150KB (350 -200)
- 375KB will fit into the remaining partition of F5. So, F5 will a remaining free space of 17KB (392 - 375)
Using Best-fit
Best-fit means you assign the best memory available that can fit a process to the process.
- 115KB will best fit into the last partition (F6). So, F6 will now have a free remaining space of 10KB (125 - 115)
- 500KB will best fit into second partition. So, F2 will now have a free remaining space of 100KB (600 - 500)
- 358KB will best fit into the fifth partition. So, F5 will now have a free remaining space of 392KB (750 - 358)
- 200KB will best fit into the fourth partition and it will occupy the entire space with no remaining space (200 - 200 = 0)
- 375KB will best fit into the remaining space of the fifth partition. So, F5 will now have a free space of 17KB (392 - 375)
Using Worst-fit
Worst-fit means that you assign the largest available memory space to a process.
- 115KB will be fitted into the fifth partition. So, F5 will now have a free remaining space of 635KB (750 - 115)
- 500KB will be fitted also into the remaining space of the fifth partition. So, F5 will now have a free remaining space of 135KB (635 - 500)
- 358KB will be fitted into the second partition. So, F2 will now have a free remaining space of 242KB (600 - 358)
- 200KB will be fitted into the third partition. So, F3 will now have a free remaining space of 150KB (350 - 200)
- 375KB will not be assigned to any available memory space because none of the available space can contain the 375KB process.
