Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

The following sequence is a fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,….. Which technique can be used to get the nth fibonacci term?
In a survey of 100 students, it was found that 25 students have enrolled for Navy AA test series, 26 students have enrolled for NDA test series, 26 students have enrolled for Airforce group X test series, 9 students have enrolled for both Navy AA and Airforce group X test series, 11 students have enrolled for both Navy AA and NDA test series, 8 students have enrolled for both NDA and Airforce group X test series whereas 3 students have enrolled in all three test series. Find the number of students who has not enrolled in any of the test series.
In a survey of 100 students, it was found that 25 students have enrolled for Navy AA test series, 26 students have enrolled for NDA test series, 26 students have enrolled for Airforce group X test series, 9 students have enrolled for both Navy AA and Airforce group X test series, 11 students have enrolled for both Navy AA and NDA test series, 8 students have enrolled for both NDA and Airforce group X test series whereas 3 students have enrolled in all three test series. Find the number of students who have enrolled exactly in any two test series.
In a survey of 100 students, it was found that 25 students have enrolled for Navy AA test series, 26 students have enrolled for NDA test series, 26 students have enrolled for Airforce group X test series, 9 students have enrolled for both Navy AA and Airforce group X test series, 11 students have enrolled for both Navy AA and NDA test series, 8 students have enrolled for both NDA and Airforce group X test series whereas 3 students have enrolled in all three test series. Find the number of students who have enrolled in exactly one test series.
Choose the option with function having same complexity for a fibonacci heap.
What is the time complexity of Fibonacci Search?
What is the time complexity of the recursive implementation used to find the nth fibonacci term?
What is the space complexity of the recursive implementation used to find the nth fibonacci term?
These are two set of series : Series 1: It contains four consecutive odd numbers, whose average is 28. Series 2: It contains three consecutive even numbers. The sum of the second and third number of series 1 is equal to the largest number of series 2. Find the sum of all the numbers of series 2.
Choose the recursive formula for the Fibonacci series.(n>=1)