Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

What is the time complexity of the recursive implementation used to find the nth fibonacci term?
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?
Match List I with List II List I List II (A) Greedy Best-First Search (I) Space complexity is O(d) where d = depth of the deepest optimal solution (B) A* (II) Incomplete even if the search space is finite. (C) Recursive Best-First Search (III) Optimal if optimal solution is reachable: otherwise, returns the best reachable optimal solution. (D) SMA* (IV) Computation and space complexity is too high.   Choose the correct answer from the options given below:
Read the following passage carefully and then choose the right word to complete the sentence that follows. Rockets are very expensive as it can be used only once. Appled scientists have therefore develped a reusable space craft called a space shuttle which takes off like a rocket; however, does no get destroyed as it returns to earth. It can also be used to lunch satellired into space, retrieve them from space if any repairing os required and allow around 8 scientists to crryout experiments in space. The space shuttle does not get.
Series: 45, 135, 255, 405, 585, 795 A = nth term and B = (n + 1)th term Based on the above logic which of the following option is true? I: Difference between the second term and first term is 30 less than the difference between the third term and second term. II: Difference between the terms is multiple of 3. III: B = 2A
For any two languages L1 and L2 such that L1 is context-free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true? I. L̅1 (complement of L1) is recursive II. L̅2 (complement of L2) is recursive III. L̅1 is context-free IV. L̅1 ∪ L2 is recursively enumerable
Assume statements S1 and S2 defined as: S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable. Which of the following is true?
Which of the following recurrence relations can be used to find the nth fibonacci number?
What data structure would you mostly likely see in non recursive implementation of a recursive algorithm?
What data structure would you most likely see in non recursive implementation of a recursive algorithm?