# Recent activity by Dhillu Thambi

1
2
3
$1)$No of Pages $\times$ Page size= Virtual Address Space or Size No of Pages $\times$ PTE size= Page Table Size Then, if we divide Virtual Address Space with No of Segments then what will we get? __________________________________________________________________________- $2)$ Is every Program is a software interrupt?
4
Assume Counting Semaphore N=8. On performing 10 down() operations by 10 different processes , first 8 will be successful and last two processes will be suspended. Does this mean that the first 8 processes can enter in the CS at the same time? In other words, does counting semaphore can let multiple processes access the CS at the same time?
5
Let G be a connected graph with 7 connected components and each component is a tree. If G has 26 edge then number of vertices in G is?
6
If a 2-regular graph G has a perfect matching then which of the following is/are true? S1: G is a cycle of even length S2: Chromatic number of G is 2 S3: G is connected S4: Every component of G is an even cycle Options- A) S1,S2 B)S2,S4 C)S3,S4 D)S1,S4
7
The minimum number of node in an AVL Tree of height $10$ is ____________
8
Is FCFS always non-preemptive? If an I/O bound process comes, then? It will be preempted or not?
9
10
Which of the following is Regular?
11
Which of the following statements is incorrect? (a)Threads are bound to a single process. (b)It's much easier to communicate between processes than between threads. (c)Process consumes more resources. (d)It's easy for threads to inadvertently disrupt each other since they share the entire address space.
12
Only "Second chance" is mentioned then how can I know whether it is "FIFO 2nd chance" or "LRU 2nd chance" algorithm ?
13
Why option A is wrong ? It is contiguous allocation policy hence suffers fragmentation.
14
Correct answer is A