Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Consider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources Which of the above policies can be used for preventing deadlock?
Read the following passage carefully and then choose the right word to complete the sentence that follows. Rockets are very expensive as it can be used only once. Appled scientists have therefore develped a reusable space craft called a space shuttle which takes off like a rocket; however, does no get destroyed as it returns to earth. It can also be used to lunch satellired into space, retrieve them from space if any repairing os required and allow around 8 scientists to crryout experiments in space. The space shuttle does not get.
A certain computation generates two arrays a and b such that a[i]=f(i) for 0 ≤ i < n and b[i] = g (a[i] ) for 0 ≤ i < n. Suppose this computation is decomposed into two concurrent processes X and Y such that X computes the array a and Y computes the array b. The processes employ two binary semaphores R and S, both initialized to zero. The array a is shared by the two processes. The structures of the processes are shown below. Process X: private i; for (i=0; i
Two processes X and Y need to access a critical section. Consider the following synchronization construct used by both the processes Process ? /* other code for process ? */ while(true) { varP = true; while(varQ == true) { /* Critical Section */ varP = false; } } /* other code for process ?? */   Process ? /* other code for process ? */ while(true) { varQ = true; while(varP == true) { /* Critical Section */ varQ = false; } } /* other code for process ? */   Here, varP and varQ are shared variables and both are initialized to false. Which one of the following statements is true?
Which of the following statements is/are correct? 1. An address generated by the CPU is commonly referred to as a physical address. 2. An address seen by the memory unit is commonly referred to as a logical address. 3. The run-time mapping from virtual to physical address is done by the memory management unit (MMU). Select the correct answer using the code given below.
Which two statements describe the IP address 10.16.3.65/23?
1. The subnet address is 10.16.3.0 255.255.254.0.
2. The lowest host address in the subnet is 10.16.2.1 255.255.254.0.
3. The last valid host address in the subnet is 10.16.2.254 255.255.254.0.
4. The broadcast address of the subnet is 10.16.3.255 255.255.254.0.
An organization requires a range of IP addresses to assign one to each of its 1500 computers. The organization has approached on Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space 202.61.0.0/17. The ISP wants to assign an address space to the organization which will minimize the number of routing entries in the ISP’s router using route aggregation. Which of the following address spaces are potential candidates from which the ISP can allot any one to the organization? I. 202.61.84.0/21 II. 202.61.104.0/21 III. 202.61.64.0/21 IV. 202.61.144.0/21
A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?
The question given below consists of a statement, followed by three arguments I, II and III. You have to decide which of the arguments is/are ‘strong’ arguments is/are ‘weak’ arguments and accordingly choose your answer from the alternatives given below each question. Statement: Chat bots and other interfaces are saving employees and HR heads time for more productive activities by providing information and replies to diverse queries or concerns. A few years ago, business communication was driven by multiple faxes in a day and emails were the only quick mode of exchanging information. This information went through the organisation's who's who, while the others were mostly engaged in the daily rut of redundant activities, preventing them from directing their capabilities towards more productive areas. Which of the following arguments brig out the idea that introduction of chat bots and other interfaces is not helping in boosting up the processes? Arguments: I. Using these conversational interfaces, HR departments are successfully aligning themselves with the swiftly-changing organisational processes. These platforms represent people friendly technologies that keep employee experience at the centre, continuously evolving with them.  II. HR technologies are increasingly using advanced machine learning for measuring and analysing workforce engagement. Sentiment analysis is a unique way of gauging an employee's disposition towards the organisation, providing valuable insights essential for improving productivity and predicting attrition rates.  III. The seamless experience chat bots provide makes employees focus on activities that require critical abilities and strategic thinking. Besides enabling HR processes such as generating leave applications and reimbursement forms, the use of chatbots provides quick and smooth access to data from anywhere, anytime. 
Consider the following snapshot of a system running n concurrent processes. Process i is holding Xi instances of a resource R, 1 ≤ i ≤ n. Assume that all instances of R are currently in use. Further, for all i, process i can place a request for at most Yi additional instances of R while holding the Xi instances it already has. Of the n processes, there are exactly two processes p and q such that Yp = Yq = 0. Which one of the following conditions guarantees that no other process apart from p and q can complete execution?