Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

If for an algorithm time complexity is given by O(log2n) then complexity will be ___________
If for an algorithm time complexity is given by O(n) then the complexity of it is ___________
If for an algorithm time complexity is given by O((3⁄2)n) then complexity will be ___________
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:
If for an algorithm time complexity is given by O(1) then the complexity of it is ____________
Reversal algorithm and juggling algorithm for array rotation have the same time complexity.
Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
In a class text, to the question, find out 23% of 200, two students answered in following ways:  Student A: 23% of 200 = 23% of (100 + 100) = 23 + 23 = (20 + 20) + (3 + 3) = 46  Student B: 23% of 200 = 200 × \(\frac{23}{100}\) = 2 × 23 = 46 Which of the following statements is the most appropriate in the given context? 1. Since student B has used the standard algorithm, teacher gives full marks to student B and zero to student A 2. Teacher gives full marks to both the students as they have attempted the question using their own algorithms. Both formal and informal algorithms are integral to solving problems in mathematics. 3. Teacher gives zero marks to student A and directs him to redo the question using the algorithm taught in the Class 4. Teacher accepts both the responses but directed student A to refrain from using informal algorithm 
Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?