Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following processes is known as fettling?

Which of the following processes is known as fettling? Correct Answer Cleaning of castings

The complete process of the cleaning of castings, called fettling, involves the removal of the cores, gates and risers, cleaning of the casting surface and chipping of any of the unnecessary projections on surfaces with the help of either hand tools or pneumatic tools.

Related Questions

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
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
The shaking out of cast iron casting from mould cavity is known as fettling process.
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?
Fettling is the last step of the foundry.
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?
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. 
In a system, there are three types of resources and four processes that execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[ ] is the maximum number of instances of that would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation. Consider a state of the system with the Allocation matrix as shown below, and in which 3 instances of E and 3 instances of F are the only resources available. Allocation   E F G P0 1 0 1 P1 1 1 2 P2 1 0 3 P3 2 0 0   Max   E F G P0 4 3 1 P1 2 1 4 P2 1 3 3 P3 5 4 1   From the perspective of deadlock avoidance, which one of the following is true?
Consider four processes P, Q, R, and S scheduled on a CPU as per round-robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time t = 0. There is exactly one context switch from S to Q, exactly one context switch from R to Q, and exactly two context switches from Q to R. There is no context switch from S to P. Switching to a ready process after the termination of another process is also considered a context switch. Which one of the following is NOT possible as CPU burst time (in time units) of these processes?  
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?