LawMint Sign in

UGC NET Computer Science and Applications System Software and Operating System Previous Year Questions

Try the preview and open any solution for a worked explanation.

UGC NET Computer Science and Applications practice pack

The practice pack for UGC NET Computer Science and Applications is coming soon to LawMint.

Question 1

Match the LIST-I with LIST-II

LIST-ILIST-II
A. Disk SchedulingI. Round Robin
B. Batch ProcessingII. SCAN
C. Time SharingIII. LIFO
D. Interrupt ProcessingIV. FIFO
Select one answer

Question 2

Which of the following is not a data-transferring interprocess communication mechanism in UNIX (serving instead as a synchronization primitive)?

Select one answer

Question 3

In disk scheduling example, suppose the disk tracks are numbered from 0 to 49. Head is presently positioned at track 15 and requests for tracks 4, 40, 11, 35, 7 and 14 have arrived(in that order). It takes 1 ms to travel from one track to the next adjacent track. Following disk scheduling algorithms are to be executed and total time traversed is to be recorded in ms in ascending order(assume arm-movement toward high numbered request first, wherever needed)

  • A. FCFS
  • B. LOOK
  • C. SSTF
  • D. SCAN
Select one answer

Question 4

Following is not the feature/characteristics of Linked-List allocation of Files in a File system:

Select one answer

Question 5

What is a superblock object represents in virtual file system of Linux OS

Select one answer

Question 6

Consider the following set of processes assumed to have arrived at time 0 in order P₁, P₂, P₃, P₄ and P₅ with the length of CPU burst given in Milliseconds.

ProcessBurst TimePriority
P₁103
P₂11
P₃24
P₄15
P₅52

What is the average waiting time (in milliseconds) using priority scheduling.

Select one answer

Question 7

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R Assertion A: Thrashing occurs when a process spends more time on paging than executing. Reason R: It happens when the degree of multiprogramming is too low and frames are insufficient.

Select one answer

Question 8

Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. If the disk head is initially at cylinder 53. Using SSTF scheduling, Arrange the following movement of head position in order of transversal. A. 67 B. 37 C. 65 D. 98 E. 14 Choose the correct answer from the options given below:

Select one answer

Question 9

Match the LIST-I with LIST-II

LIST-ILIST-II
A. System CallI. A process requests a function that is located in a different computer system
B. PreemptionII. A request that a program makes to the operating system.
C. Real time applicationIII. The forced deallocation of the CPU from a process.
D. Remote procedure callIV. A program that responds to activities in an external within a maximum time determined by the external system.
Select one answer

Question 10

Consider the following table about processes, their burst time and arrival time

ProcessBurst TimeArrival Time
P1090
P2300
P3040
P4082
P5116

Now which of the process shall finish second last as per the respective GANTT charts for the non-preemptive SJF and Round Robin(time quantum=10)scheduling methods.

Select one answer

Continue practising

The practice pack for UGC NET Computer Science and Applications is coming soon to LawMint.

UGC NET Computer Science and Applications practice pack

The practice pack for UGC NET Computer Science and Applications is coming soon to LawMint.