Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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?
Which of the following sorting algorithms is the fastest for sorting small arrays?
Cryptographic algorithms are based on mathematical algorithms where these algorithms use ___________ for a secure transformation of data.
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 
Which of the following statements are true ? (A) A sentence α entails another sentence β  if β is true in few worlds where α is true. (B) Forward chaining and backward chaining are very natural reasoning algorithms for knowledge bases in Horn form. (C) Sound inference algorithms derive all sentences that are entailed. (D) Propositional logic does not scale to environments of unbounded size. Choose the correct answer from the options given below:
Which of the following algorithms has better computational complexity than standard division algorithms?
Consider the following sorting algorithms. I. Quicksort Il. Heapsort Ill. Mergesort Which of them perform in least time in the worst case?
Which of the following sorting algorithms users recursion ? 
Which of the following algorithms use recursion for sorting an array of integers?
Which one of the following in-place sorting algorithms needs the minimum number of swaps?