Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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:
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?
Let Xij =I { zi is compared to zj in quick sort algorithm} is an indicator variable, and zi is the ith smallest number. Which of the following sequence of the numbers give the X2,5 = 1? Note: Assume that there is a divide and conquer quick sort algorithm and in partition algorithm the first element of the lists is taken as pivot-element.
Algorithm design technique used in quicksort algorithm is?
Recall that Belady’s anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: S1: Random page replacement algorithm (where a page chosen at random is replaced) Suffers from Belady’s anomaly S2: LRU page replacement algorithm suffers from Belady’s anomaly Which of the following is CORRECT?
The running time of an algorithm is given by T(n) = T(n-1) + T(n-2) - T(n-3), if n > 3  = n, otherwise Then what should be the relation between T(1), T(2) and T(3), so that the order of the algorithm is constant ?
Which one of the following properties of an algorithm ensures that each step of the algorithm is properly defined and the actions to be performed are clearly specified?
Which of the following statements are true? (A) Minimax search is breadth-first: it processes all the nodes at a level before moving to a node in next level. (B) The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined. (C) The alpha-beta search algorithm computes the same optimal moves as minimax algorithm. (D) Optimal play in games of imperfact information does not require reasoning about the current and future belief states of each player. Choose the correct answer from the options given below:
Given below are two statements, one is labelled as Assertion A and the other is labelled as Reason R Assertion A: Machine Learning requires good quality and sufficient data to train and test the algorithm Reason R: For correct classification, good quality data which is free from noise, and sufficient data is required for training and testing of the algorithm. In light of the above statements, choose the most appropriate answer from the options given below