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 | WHICH OF THE FOLLOWING ALLOWS THE CPU TO OVERLAP THE INPUT OF ONE JOB WITH THE COMPUTATION AND OUTPUT OF OTHER JOBS |
| | A) | SPOOLING |
| B) | BATCH SYSTEMS | | C) | MULTIPROGRAMMING | | D) | NONE OF THE ABOVE | | | | | Q. 2 | ALLOCATE THE FIRST HOLE THAT IS BIG ENOUGH IS |
| | A) | FIRST FIT |
| B) | BEST FIT | | C) | WORST FIT | | D) | NONE OF THE ABOVE | | | | | Q. 3 | EACH PROCESS IS REPRESENTED IN THE OPERATING SYSTEM BY A PROCESS CONTROL BLOCK ALSO CALLED |
| | A) | TASK CONTROL BLOCK |
| B) | CONTROL BLOCK | | C) | TASK BLOCK | | D) | NONE OF THE ABOVE | | | | | Q. 4 | 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. 5 | THE PROCESS WILL RESIDE IN MEMORY, THEN ABSOLUTE CODE CAN BE GENERATED IT IS KNOWN AT |
| | A) | COMPILE TIME |
| B) | LOAD TIME | | C) | EXECUTION TIME | | D) | NONE OF THE ABOVE | | | | | Q. 6 | WHICH DIRECTORY ALLOWS USER TO CREATE SUBDIRECTORIES TO ORGANISE THEIR FILES |
| | A) | ACYLIC GRAPH |
| B) | TREE STRUCTURED | | C) | CYLIC GRAPH | | D) | B-TREE STRUCTURED | | | | | Q. 7 | “REPLACE THE PAGE THAT WILL NOT BE USED FOR THE LONGEST PERIOD OF TIME” IS DONE IN WHICH OF THE FOLLOWING ALGORITHM |
| | A) | FIFO ALGORITHM |
| B) | OPTIMAL ALGORITHM | | C) | LRU ALGORITHM | | D) | NONE OF THE ABOVE | | | | | Q. 8 | HOW MANY METHODS ARE USED FOR ALLOCATING DISK SPACE |
| | A) | TWO |
| B) | THREE | | C) | FOUR | | D) | NONE OF THE ABOVE | | | | | Q. 9 | WHICH SCHEDULING IS THE SIMPLEST SCHEDULING ALGORITHM BUT IT CAN CAUSE SHOTE PROCESSES TO WAIT FOR VERY LONG PROCESSES |
| | A) | FCFS |
| B) | SJF | | C) | RR | | D) | PRIORITY | | | | | Q. 10 | UNDER THE NORMAL MODE OF OPERATION, A PROCESS MAY UTILIZE A RESOURCE IN ONLY THE FOLLOWING SEQUENCE |
| | A) | REQUEST-USE-RELEASE |
| B) | REQUEST-RELEASE-USE | | C) | USE-RELEASE-REQUEST | | D) | NONE OF THE ABOVE | | | |
Click here to get
Operating Systems with Unix (MC0070)
New Question
Home > Download > SMU - Question Paper
> MCA > MC0070