Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

A cycle menu contains
1. menu rotated at definite interval.
2. a seven days' menu.
3. set menu
4. menu of the day
User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads. Which of the following statements is/are true ? (a) (i) The Many - to - one model maps many user threads to one kernel thread (ii) The one - to - one model maps one user thread to one kernel thread (iii) The many - to - many model maps many user threads to smaller or equal kernel threads (b) (i) Many - to - one model maps many kernel threads to one user thread (ii) One - to - one model maps one kernel thread to one user thread (iii) Many - to- many model maps many kernel threads to smaller or equal user threads
Cost price of item A is Rs. 300 less than that of item B for a shopkeeper. He marks item A and B above 80% and 40% respectively their cost prices and sold them at 20% and 40% discount respectively. If selling price of item, A is Rs. 18 more than that of item B, then what is the ratio of cost price of item A to that of item B?
The price of item A increases by 50 paise every year while the price of item B increases by 25 paise every year. If in 2008, the price of item A was Rs. 3.20 and that of B was Rs. 5.30, in which year item A will cost 40 paise more than the item B?
The sumof the pre-tax costs of items A ans item B is Tk. 300. In dhaka, each item would be charged a flat 7% tax. In Rangpur item A is subject to 5% tax and item b is subject to 10% tax. If the tax in Rangpur on the purchase of both items is exactly Tk 3 more than it is in Dhaka, than what is the pre - tax price of item A?
X sells an item to Y at a profit of 28% on his cost and Y sells the same item to Z at a loss of 25% on his cost. If X thus sold the item to Z a Tk. 2 less than the item to X, then what is the cost of the item to X?
X sells an item to Y at a profit of 28% on his cost and sells the same item to Z at a loss of 25% on his cost. If Y thus sold the item to Z a Tk. 2 less than the item to X, then what is the cost of the item to X?
A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)
Which of the following among item A and item B are correct?
The right of private defence extends, subject to Section 99, to the causing of death of the assailant or aggressor in the following circumstances:
Item A: For defence of body:
1. Against an act which reasonably causes the apprehension of an assault to outrage the modesty
2. Against an act which reasonably causes the apprehension that the assailant will kill his children living in another city
3. Against an act which reasonably causes the apprehension that grievous hurt would otherwise be the consequence
Item B: For defence of property:
1. While the trespasser is engaged in house breaking during day time.
2. Against a thief who reasonably causes the defender to believe that he would lose his property
3. Against a person who commits mischief under such circumstances as may reasonably cause apprehension that grievous Hurt would be a consequence
Select the correct answer:
A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing addFront and addRear? (Assume ‘m’ to be the size of the stack and ‘n’ to be the number of elements)