Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

can someone help me to answer this question to make sure my answers please Mark the followinga as Trwe/False: [5. Marks] 1. A characteristic of

can someone help me to answer this question to make sure my answers please image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
Mark the followinga as Trwe/False: [5. Marks] 1. A characteristic of Bioy ie that it in volat he. 2. RAM thugt be provided with a conatant porer supply. 3. A number of chlpsi can be groupnd together zo form a. mamory bank. 4. BRhM ts much costlifer than spau4. 5. Magnetic diaki are the foundation of extornal memory on Victually all computor nyatem. 6. The head nust generate or senie an electionagretic tie1d of tufleient inagnittude to write and read properry. 7. A diradyantage ot mempry-mapped I/O in that valuable menory addresn space Ia used up. 8. When larqe volumen of data are to be moved, a more effichent technique ig direct nemory access [DVA] - 9. A Thunderbole compat ible peripheral interface is no more Conplex than that of a simple d5e desice. 10. Sehedu 11 rig and mhenory manayement are the two os functions that aro most relevant to the gtudy of eomputer erganization and architecture. MCQ8 : [5 Maxks] 1. Th a _ binaty values areistorod usinf traditional flip-tiop logic-9ate codifgurations. . : B. SRAK [C. DHAM D. RAM 2. A contalns a permanent pattern of data that: carnot: te changed, is nosvolatile, and cannot. have neu data written into it, R. RAM. B. SRAM C. MOM D. flash tnemoxy. 3. Greater ability to wthscand shock and damage, improvenent in the uniformity of the magnet flin surface to increase disk raliability, and a significant reduetion in cverall surface detects to help reduce read-urdte errors, are all benefita of 2). magnetic Fead and Write mechanisins B. platters C. the glass substrate P. a solid state drive 4. i.s the stamoiardized scheme for multiplendisk ditabase design. A. RAID B. Civ 5. The ifo functloh theludes a moordinato the thoi or traftio between interetial rement to A. eyelo C. concrol and timing 6. to suspend oporation temporarily. 8. statun reporting. Di data A. Interrupt c. Cyele stealing B. Thunderbolt 7. The D. Look down A. long-torm C. short-termi scheduler is: alao known as the dispatcher. 8. A A. logCal addreas an actual location in rain menory. C. bose addiess partition address: B. medium-temin D. 1/0 C. bese adiress B. partition address 9. is whon the processor apends most of its time? A. Swapping C. Paging B. Thrashing 10. The os maintains a the Frame location for each page of the process, D. NuItitasking A. kornol C. TLB B. page table D. logical addreis Short Answer Questions: [20 Marks] 1. Consider a 6-drive, 600 GB-per-drive RAID array, What ls the available data storage capacity for each of the RATD tracks per werfare, 100 a ecterin per ceacx, 7 anifleraianed a) Ifou nany rocorda fit onto n track? 1) Now nainy bloeka ite rogulted to store the deording to the 'next block concept' j on diak, hoy many. rithders are treedeat? 3. Consiaer a dynamie fAM. that mist be given a refiesh aycle 64 timen pet trm. Fach refreoh operation requires 150 nsiz a menory. eycle requireg. 250ng. What pereentage of the memory g total operating bime mast be.given to tefreshes? 4. what is the puypore of asacpingt How thie mechaniam heliou chen os in muenory nanayannnt? 5. Consider the following set of jobs to be scheduled on a single cPU sygtem, draw a Gante chart showing [3 Marks] a) Firdt Conte Eirnt Serve Scheduling Algorithr b) Shortest Job Filrat Soheduling Algorithm 6. Ansirer the following, thou the detafla of your work. t2. Karkn] A.(In1)01105)z=(F.Ih b.{11001}=0T1n e. {21000001110100}==(2)18 d. (21003)16=( ? 110 7. What will be the I?h blnary coide for the tirat khrne 8. Differentiate betwen piegrimmed driven and inter upt: Difteremtiate betweten programand in each caste. (2. Marka) Tabler & Fornutand BPA Tabini bit posianon N - number of date disket proportional to log N Gonversiop Fable

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Machine Learning And Knowledge Discovery In Databases European Conference Ecml Pkdd 2010 Barcelona Spain September 2010 Proceedings Part 2 Lnai 6322

Authors: Jose L. Balcazar ,Francesco Bonchi ,Aristides Gionis ,Michele Sebag

2010th Edition

364215882X, 978-3642158827

More Books

Students also viewed these Databases questions