Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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?
Which of the following statements are true?
Statement I Big data refers to no precise quantity, but generally refers to data in the range of Petabytes and Exabyte, i.e. billions to trillions of records, all from various sources. Big data is generated much faster. than traditional data in much larger quantities.
Statement II Big data interests industries because they are able to learn more patterns and curious variances than smaller data sets, with the capability to provide valuable insights into consumer behaviour, weather systems, financial market activity, or other phenomena.
Statement III Various departments and product lines use various applications within most organisations and store data in separate datasets. These separate databases may contain similar data, but data from one data base to another is not always consistent. This is called data silo.
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?
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?
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?
In a public bathroom there are n taps 1,2,3...n. Tap1 and Tap2 take equal time to fill the tank while Tap3 takes half the time taken by Tap2 and Tap4 takes half the time taken by Tap3. Similarly each next number of tap takes half the time taken by previous number of Tap i.e, K-th Tap takes half the time taken by (K-1)th Tap.If the 10th tap takes 2 hours to fill the tank alone then what is the ratio of efficiency of 8th tap and 12th tap, respectively?
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)
An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element? 
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)