Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?
In a circular running track of diameter 126 m, Rahul start running on running track with speed 8 km/hour. What time he will take to complete one round of running track?
In the following question, two statements are numbered as A and B. On solving these statements we get quantities A and B respectively. Solve for the both quantities and chose the correct option. Quantity A: A train is running from Jaipur to Jammu at 8:00 am at the speed of 40 km/hr and another train is running from Jammu to Jaipur at 9:00 am at the speed of 60 km/hr. If the distance between Jaipur and Jammu is 640 km then find the distance from Jaipur when they meet? Quantity B: Shatabdi Express is running from Delhi to Kanpur at 7:00 am at the speed of 80 km/hr and Rajdhani Express is running after 2 hours of shatabdi express at the speed of 120 km/hr. Find out the distance from Delhi when they meet?
In the question three statements are given, followed by three conclusions, I, II and III. You have to consider the statements to be true even if it seems to be at variance from commonly known facts. You have to decide which of the given conclusions, if any, follows from the given statements. Statement I: All race is running. Statement II: Some running is sports. Statement III: Some race is athletics. Conclusion I: Some running are athletics. Conclusion II: All athletics are sports. Conclusion III: Some running are race.
There are three athletes A, B and C at a same point. A starts running from a point at a speed of 50 m/min. After 5 minutes, B starts running towards A with a speed of 60 m/min. Determine at what speed C should start running to cross A and B together, if C starts running 5 minutes after B.
Which of the following statements are true? (A) An algorithm may produce no output (B) An algorithm expressed in a programming language is called a computer program. (C) An algorithm is expressed in a graphical form known as a flowchart (D) An algorithm can have an infinite sequence of instructions. Choose the correct answer from the options given below:
what is the time complexity of Huffman Coding?
A train starts running at a uniform speed of 60 km/h from station P towards station Q. At the same time another train starts running from station Q towards station P. If the distance between the stations P and Q is 275 km and the trains meet in two and a half hours, then what is the speed of the train running towards station P in km/h?
Two trains of equal length, running with the speeds of 60 and 40 kmph, take 50 seconds to cross each other while they are running in the same direction. What time will they take to cross each other if they are running in opposite directions ?
Page and Plant are running on a track AB of length 10 metres. They start running simultaneously from the ends A and B respectively. The moment they reach either of the ends, they turn around and continue running. Page and Plant run with constant speeds of 2m/s and 5m/s respectively. How far from A (in metres) are they, when they meet for the 23rd time?