option
My Daypo

COP 4640 - Homework 1

COMMENTS STADISTICS RECORDS
TAKE THE TEST
Title of test:
COP 4640 - Homework 1

Description:
Overview of Chapters 1-4

Author:
Gerardo Ornelas
(Other tests from this author)

Creation Date:
25/09/2010

Category:
Others

Number of questions: 33
Share the Test:
Facebook
Twitter
Whatsapp
Share the Test:
Facebook
Twitter
Whatsapp
Last comments
No comments about this test.
Content:
Use the best fit algorithm to indicate which memory blocks are allocated to each of the three arriving jobs: Job Number ----- Memory Requested ----- Memory Block ----- Memory Block Size Job 1 ------------- 690 K ------------------------ Block 1----------------900 K (low order) Job 2---------------275 K------------------------Block 2------------------910 K Job 3---------------760 K------------------------Block 3---------------300 K (high order) Job 1 to Block 1, Job 2 to Block 3, Job 3 to Block 2 Job 1 to Block 2, Job 2 to Block 3, Job 3 to Block 1 Job 1 to Block 3, Job 2 to Block 2, Job 3 to Block 1.
Use the first-fit algorithm to indicate which memory blocks are allocated to each of the three arriving jobs: Job Number-----Memory Requested-----Memory Block-----Memory Block Size Job 1---------------690 K------------------------Block 1---------------900 K (low order) Job 2---------------275 K------------------------Block 2---------------910 K Job 3---------------760 K------------------------Block 3---------------300 K (high order) Job 1 to Block 1, Job 2 to Block 2, Job 3 to 3 Job 1 to Block 2, Job 2 to Block 3, Job 3 to queue Job 1 to Block 1, Job 2 to Block 2, Job 3 queue.
Use the next-fit algorithm to indicate which memory blocks are allocated to each of the three arriving jobs: Job Number-----Memory Requested-----Memory Block-----Memory Block Size Job 1---------------690 K------------------------Block 1---------------900 K (low order) Job 2---------------275 K------------------------Block 2---------------910 K Job 3---------------760 K------------------------Block 3---------------300 K (high order) Job 1 to Block 1, Job 2 to Block 2, Job 3 queue Job 1 to Block 1, Job 2 to Block 3, Job 3 to Block 2 Job 1 to Block 1, Job 2 to Block 3, Job 3 to queue.
These systems allow multiple users to run their programs at the same time and share use of the system resouces such as memory, processor, file, devices, and network access. This successful sharing often includes some interrupt capability so one job deos not monopolize one system resource. Interactive systems Batch systems Real-time systems Embedded systems.
This system allows programs to be run and run in their entirety, one after the other, without interruption by any other program. Interactive system Batch system Real-time system Embedded system.
These systems are used in time critical environments such as vehicle control or patient monitoring where failures n a system could lead to loss of life or major destruction of property. Interactive system Batch system Real-time system Embedded system.
These systems are those that are dedicated to a single use and are often located in the device they operate. They include computers in cars, aircraft, electronic toys, etc. Interactive system Batch system Real-time system Embedded system.
Given that main memory is composed of three page frames for public use and that a program request pages in the following order: a,d,b,a,f,b,e,c,g,f,b,g Using the FIFO page removal algorithm, choose the correct page trace analysis: ____a__d___b___a___f___b__e___c___g___f___b___g page frame 1-----a-----a-----a-----a----f-----f-------f-----f------g-----g----g-----g page frame 2-----x-----d-----d-----d-----d-----d-----e-----e-----e-----f-----f------f page frame 3-----x-----x------b-----b-----b-----b-----b----c------c-----c----b-----b ____a__d___b___a___f___b__e___c___g___f___b___g page frame 1-----a-----a-----a-----a----a-----a----e-----e------e-----f----f-------g page frame 2-----x-----d-----d-----d-----f-----f------f-----c-----c------c----b------b page frame 3-----x-----x------b-----b-----b-----b----b----b------g-----g----g-----g.
Given that main memory is composed of three page frames for public use and that a program request pages in the following order: a,d,b,a,f,b,e,c,g,f,b,g Using the LRU page removal algorithm, choose the correct page trace analysis: ____a__d___b___a___f___b__e___c___g___f___b___g page frame 1-----a-----a-----a-----a----f-----f-------f-----f------g-----g----g-----g page frame 2-----x-----d-----d-----d-----d-----d-----e-----e-----e-----f-----f------f page frame 3-----x-----x------b-----b-----b-----b-----b----c------c-----c----b-----b ____a__d___b___a___f___b__e___c___g___f___b___g page frame 1-----a-----a-----a-----a----a-----a----e-----e------e-----f----f------f page frame 2-----x-----d-----d-----d-----f-----f------f-----c-----c------c----b------b page frame 3-----x-----x------b-----b-----b-----b----b----b------g-----g----g-----g.
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 Pick the correct time line for FCFS: 0----------10----------------22-----25----26-------------------------------41 A B C D E 0-----------10--11----14------------------26--------------------------------41 A D C B E 0---3---6--7-----------14------------------26--------------------------------41 A C D A B E 0-----5-----10----13--14-------19-----24---------29------34--36-------41 A B C D E A B E B E.
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 Pick the correct time line for SJN: 0----------10----------------22-----25----26-------------------------------41 A B C D E 0-----------10--11----14------------------26--------------------------------41 A D C B E 0---3---6--7-----------14------------------26--------------------------------41 A C D A B E 0-----5-----10----13--14-------19-----24---------29------34--36-------41 A B C D E A B E B E.
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 Pick the correct time line for SRT: 0----------10----------------22-----25----26-------------------------------41 A B C D E 0-----------10--11----14------------------26--------------------------------41 A D C B E 0---3---6--7-----------14------------------26--------------------------------41 A C D A B E 0-----5-----10----13--14-------19-----24---------29------34--36-------41 A B C D E A B E B E.
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 Pick the correct time line for Round Robin: 0----------10----------------22-----25----26-------------------------------41 A B C D E 0-----------10--11----14------------------26--------------------------------41 A D C B E 0---3---6--7-----------14------------------26--------------------------------41 A C D A B E 0-----5-----10----13--14-------19-----24---------29------34--36-------41 A B C D E A B E B E.
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0----------10----------------22-----25----26-------------------------------41 A B C D E What is the Turnaround time and Total Waiting time for A? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0----------10----------------22-----25----26-------------------------------41 A B C D E What is the Turnaround time and Total Waiting time for B? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0----------10----------------22-----25----26-------------------------------41 A B C D E What is the Turnaround time and Total Waiting time for C? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0----------10----------------22-----25----26-------------------------------41 A B C D E What is the Turnaround time and Total Waiting time for D? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0----------10----------------22-----25----26-------------------------------41 A B C D E What is the Turnaround time and Total Waiting time for E? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----------10--11----14------------------26--------------------------------41 A D C B E What is the Turnaround time and Total Waiting time for A? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----------10--11----14------------------26--------------------------------41 A D C B E What is the Turnaround time and Total Waiting time for B? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----------10--11----14------------------26--------------------------------41 A D C B E What is the Turnaround time and Total Waiting time for C? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----------10--11----14------------------26--------------------------------41 A D C B E What is the Turnaround time and Total Waiting time for D? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----------10--11----14------------------26--------------------------------41 A D C B E What is the Turnaround time and Total Waiting time for E? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0---3---6--7-----------14------------------26--------------------------------41 A C D A B E What is the Turnaround time and Total Waiting time for A? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0---3---6--7-----------14------------------26--------------------------------41 A C D A B E What is the Turnaround time and Total Waiting time for B? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0---3---6--7-----------14------------------26--------------------------------41 A C D A B E What is the Turnaround time and Total Waiting time for C? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0---3---6--7-----------14------------------26--------------------------------41 A C D A B E What is the Turnaround time and Total Waiting time for D? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0---3---6--7-----------14------------------26--------------------------------41 A C D A B E What is the Turnaround time and Total Waiting time for E? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----5-----10----13--14-------19-----24---------29------34--36-------41 A B C D E A B E B E What is the Turnaround time and Total Waiting time for A? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----5-----10----13--14-------19-----24---------29------34--36-------41 A B C D E A B E B E What is the Turnaround time and Total Waiting time for B? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----5-----10----13--14-------19-----24---------29------34--36-------41 A B C D E A B E B E What is the Turnaround time and Total Waiting time for C? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----5-----10----13--14-------19-----24---------29------34--36-------41 A B C D E A B E B E What is the Turnaround time and Total Waiting time for D? (seperate the times with a coma and space: ie 12, 2).
Given the following information: Job===Arrival Time===CPU Cycle A 0 10 B 2 12 C 3 3 D 6 1 E 9 15 And this timeline: 0-----5-----10----13--14-------19-----24---------29------34--36-------41 A B C D E A B E B E What is the Turnaround time and Total Waiting time for E? (seperate the times with a coma and space: ie 12, 2).
Report abuse Terms of use
HOME
CREATE TEST
COMMENTS
STADISTICS
RECORDS
Author's Tests