Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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:
One of the Scheduling method is also known as Shortest-­next­-CPU­-burst algorithm, because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. Which of the following scheduling method is being discussed here?
Which scheduling algorithm is an optimal scheduling policy for mono-processor system?
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:
In this figure, 3 types of scheduling using preemptive scheduling policies is shown. Which of the following options is correctly referring to each of these scheduling types?
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:
Which algorithm is dynamic scheduling algorithm?
A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.
Which of the following statements are true? I. Shortest remaining time first scheduling may cause starvation II. Preemptive scheduling may cause starvation III. Round robin is better than FCFS in terms of response time
Which of the following scheduling test can be used to show that no scheduling exist?