Home > Download > SMU - Question Paper
> MCA > MC0070
Operating Systems with Unix
This is the collection of
Sikkim Manipal University (SMU) question and answers for Operating Systems with Unix. It will help
to prepare your examination. All question paper are
classified as per semester, subject code and question type of Part A, Part B and Part C with
multiple
choice options
as same as actual examination. SMU question papers includes
year 2024, 2023, 2022 Sem I, II, III, IV, V, VI examinations
of all subjects.
SMU question test set of old,
last and previous year are updated
regularly and it is absolutely free to use. Question paper includes Visual basic 6, VB.Net, C#, ASP.Net,
Web, Oracle, Database, SQL, Software Engineering, C, C++, OOPS, MBA, MCA, BSC IT I have requested
you kindly send me the question paper of Operating Systems with Unix, SMU - Master of Computer Application.
Course Name
MCA (Master of Computer Application)
Subject Code MC0070 (Operating Systems with Unix)
Get Questions
PART - A
PART - B
PART - C
Subject : Operating Systems with Unix
MC0070 : PART - A
| Q. 1 | IN BUFFERING HOW MANY WAYS ARE THERE IN QUEUE IMPLEMENTION |
| | A) | TWO |
| B) | THREE | | C) | FOUR | | D) | NONE OF THE ABOVE | | | | | Q. 2 | HOW MANY CONDITIONS DOES DEADLOCK SITUATION CAN ARISE SIMULTANEOUSLY IN A SYSTEM |
| | A) | TWO |
| B) | THREE | | C) | FOUR | | D) | FIVE | | | | | Q. 3 | WHEN TWO OR MORE PROCESSES ARE WAITING INDEFINITELY FOR AN EVENT THAT CAN ONLY BE CAUSED BY ONE OF THE WAITING PROCESSES THEN WHICH STATE OCCURS |
| | A) | DEADLOCK STATE |
| B) | WAITING STATE | | C) | BLOCKED STATE | | D) | NONE OF THE ABOVE | | | | | Q. 4 | PATH NAMES CAN BE CLASSIFIED AS |
| | A) | ABSOLUTE PATH NAMES |
| B) | RELATIVE PATH NAMES | | C) | BOTH A AND B | | D) | NONE OF THE ABOVE | | | | | Q. 5 | HOW MANY COMMON STRATRGIES IS USED TO SELECT A FREE HOLE FROM THE SET OF AVAILABLE HOLES |
| | A) | TWO |
| B) | THREE | | C) | FOUR | | D) | NONE OF THE ABOVE | | | | | Q. 6 | ALLOCATE THE FIRST HOLE THAT IS BIG ENOUGH IS |
| | A) | FIRST FIT |
| B) | BEST FIT | | C) | WORST FIT | | D) | NONE OF THE ABOVE | | | | | Q. 7 | WHICH OF THE FOLLOWING INCLUDES THE AMOUNT OF CPU AND REAL TIME USED, TIME LIMITS, ACCOUNT NUMBERS, JOB OR PROCESS NUMBERS, AND SO ON |
| | A) | CPU REGISTERS |
| B) | CPU SCHEDULING INFORMATION | | C) | ACCOUNTING INFORMATION | | D) | NONE OF THE ABOVE | | | | | Q. 8 | THE BINDING OF INSTRUCTIONS AND DATA TO MEMORY ADDRESSES CAN BE DONE AT ANY STEP ALONG WHICH OF THE FOLLOWING WAYS |
| | A) | COMPILE TIME |
| B) | LOAD TIME | | C) | EXECUTION TIME | | D) | ALL OF THE ABOVE | | | | | Q. 9 | SWITCHING THE CPU TO ANOTHER PROCESS REQUIRES SAVING THE STATE OF THE OLD PROCESS LOADING THE SAVED STATE FOR THE NEW PROCESS. THIS TASK IS KNOWN AS |
| | A) | CONTEXT SWITCH |
| B) | PROCESS CREATION | | C) | MEDIUM TERM SCHEDULING | | D) | NONE OF THE ABOVE | | | | | Q. 10 | WHICH OF THE FOLLOWING METHOD REQUIRES EACH FILE TO OCCUPY A SET OF CONTIGUOUS BLOCKS ON THE DISK |
| | A) | CONTIGUOUS ALLOCATION |
| B) | LINKED ALLOCATION | | C) | INDEXED ALLOCATION | | D) | NONE OF THE ABOVE | | | |
Click here to get
Operating Systems with Unix (MC0070)
New Question
Home > Download > SMU - Question Paper
> MCA > MC0070