LawMint Sign in

Telangana SET (TG SET) System Software and Operating System Previous Year Questions

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

Telangana SET (TG SET) practice pack

The practice pack for Telangana SET (TG SET) is coming soon to LawMint.

Question 1

Which of the following statements is true about Working-set model?

Select one answer

Question 2

Consider the following statements about virtualization:
I. Runs directly on physical hardware.
II. Runs on top of a host operating system.
III. Provides better performance.
IV. Incurs performance overhead due to the host operating system.
V. Is relatively more complex to set up.
VI. Is relatively easier to set up.
Which of the following correctly identifies the characteristics of bare-metal (Type-1) virtualization and hosted (Type-2) virtualization, respectively?

Select one answer

Question 3

Which of the following components of program state are shared across threads in a multithreaded process?

Select one answer

Question 4

Consider a system with three processes P0, P1 and P2 , and two resource types R1 and R2. The maximum resource requirements and the current allocations are given below.

ProcessMaximum NeedCurrent Allocation
R1R2R1R2
P01710107
P11218712
P291257
Assume that the system has 27 instances of resource R1 and 30 instances of resource R2.
Using the Banker's Algorithm, determine the state of the system.

Select one answer

Question 5

Consider the constructs listed in List I and their corresponding classifications listed in List II.

List–I (Construct)List–II (Classification)
a. cati. System Call
b. printf()ii. Unix/Linux Internal Command
c. read()iii. Unix/Linux External Command
d. cdiv. Library Function
Which one of the following gives the correct matching?

Select one answer

Question 6

A paged memory system has a main memory access time of 200 ns and a Translation Lookaside Buffer (TLB) access time of 20 ns. The TLB hit ratio is 90%. Assume that the TLB is accessed before every memory reference and that it stores a subset of the page table entries. What is the effective memory access time of the system?

Select one answer

Question 7

Consider the Page Replacement Algorithms listed in List I and their corresponding major limitations listed in List II.

List I(Page Replacement Algorithm)List II (Major Limitation)
a. FIFOi. May degenerate to FIFO when all reference bits are set
b. LRUii. High hardware overhead for tracking page usage
c. Clock (Second Chance)iii. May suffer from Belady's anomaly
d. Optimal (OPT)iv. Requires future knowledge of page references.
Which one of the following gives the correct matching?

Select one answer

Question 8

Consider a memory management system that uses variable-size partitioning. The free-partition list (in the order in which the partitions appear in memory) is as follows:
20 KB, 45 KB, 76 KB, 78 KB, 95 KB, 100 KB, 121 KB, 150 KB. A process requests 77 KB of memory. Which of the following correctly identifies the partitions that would be allocated by the First-Fit, Best-Fit, and Worst-Fit allocation algorithms, respectively?

Select one answer

Question 9

Let s be a counting semaphore initialized to k. Which of the following invariants always holds? Where W(s) is the total number of wait(s) operations executed and S(s) is the total number of signal(s) operations executed.

Select one answer

Question 10

Consider the following set of processes to be executed on a single-processor system.

ProcessCPU Burst Time
P4
Q1
R8
S1
T2
All processes arrive simultaneously at time 0 in the order P, Q, R, S, T. The CPU is scheduled using the Round Robin scheduling algorithm with a time quantum of 1 time unit. What is the completion time (departure time) of process P?

Select one answer

Continue practising

The practice pack for Telangana SET (TG SET) is coming soon to LawMint.

Telangana SET (TG SET) practice pack

The practice pack for Telangana SET (TG SET) is coming soon to LawMint.