In this video we are going to discuss another question which was asked in the exam of ISRO Let R1 and R2 be regular sets defined over the alphabet, then (A) R1 ∩ R2 is not regular (B) R1 ∪ R2is not …
In this video we are going to discuss another question which was asked in the exam of ISRO If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: 20, 47, 15, 8, 9, 4, …
In this video we are going to discuss another question which was asked in the exam of ISRO The number of spanning tree for a complete graph with seven vertices are: (A) 25 (B) 75 (C) 35 (D) 22×5
In this video we are going to discuss another question which was asked in the exam of ISRO The time complexity of the following C function is (assume n > 0) int recursive (int n) { if(n == 1) return …
In this video we are going to discuss another question which was asked in the exam of ISRO Suppose two jobs, each of which needs 10 minutes of CPU time, start simultaneously. Assume 50% I/O wait time. How long will …
In this video we are going to discuss another question which was asked in the exam of ISRO Consider the following program. main() { fork(); fork(); fork(); } How many new processes will be created? (A) 8 (B) 6 (C) 7 (D) 5
In this video we are going to discuss another question which was asked in the exam of ISRO Increasing the RAM of a computer typically improves performance because: (A) Virtual Memory increases (B) Larger RAMs are faster (C) Fewer page faults occur (D) Fewer …
In this video we are going to discuss another question which was asked in the exam of ISRO At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and 15 V operations …
In this video we are going to discuss another question which was asked in the exam of ISRO A hard disk system has the following parameters : Number of tracks = 500 Number of sectors/track = 100 Number of bytes …
In this video we are going to discuss another question which was asked in the exam of ISRO In a lottery scheduler with 40 tickets, how we will distribute the tickets among 4 processes and such that each process gets …
In this video we are going to discuss another question which was asked in the exam of ISRO Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited …
In this video we are going to discuss another question which was asked in the exam of ISRO If there are 32 segments, each size 1 k bytes, then the logical address should have (A) 13 bits (B) 14 bits (C) 15 bits …
