Description : A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)
Last Answer : d) Mars Hover (Robot Navigation)
Description : Which best describes Lossless Compression? A. No information is lost but file size is increased B. There is no loss in information at all after compression C. Files which have the exact same data after compression D. Compression that involves an algorithm
Last Answer : B. There is no loss in information at all after compression
Description : Which is the best way to go for Game playing problem? a) Linear approach b) Heuristic approach (Some knowledge is stored) c) Random approach d) An Optimal approach
Last Answer : b) Heuristic approach (Some knowledge is stored)
Description : Which is the best way to go for Game playing problem? (A) Linear approach (B) Heuristic approach (C) Random approach (D) Optimal approach
Last Answer : (B) Heuristic approach
Description : Huffman coding is an encoding algorithm used for A. lossless data compression B. files greater than 1 Mbit C. broadband systems D. lossy data compression
Last Answer : A. lossless data compression
Description : LBG algorithm is used to design a _________. a. Quantizer b. Vector c. Codebook d. Index table
Last Answer : c. Codebook
Description : An ________is encoded and the algorithm attempts to use the next smaller context. a. One length context b. Zero context c. Escape symbol d. None
Last Answer : c. Escape symbol
Description : The basic algorithm initially attempts to use the _________context. a. Small b. Shortest c. Longest d. Zero
Last Answer : c. Longest
Description : Huffman coding is an encoding algorithm used for a. lossless data compression b. files greater than 1 Mbit c. broadband systems d. lossy data compression
Last Answer : a. lossless data compression
Description : An auditor needs not abide by a Philippines Standard on Auditing if the auditor believes that a. The amount is insignificant. b. The requirement of the PSA is impractical to perform. c. The requirement of the PSA is impossible to perform. d. Any of the above three is correct
Last Answer : Any of the above three is correct
Description : Exhaustive testing is a) always possible b) practically possible c) impractical but possible d) impractical and impossible
Last Answer : Ans :c
Description : What is the best method to go for the game playing problem? (1) Optimal Search (2) Random Search (3) Heuristic Search (4) Stratified Search
Last Answer : (3) Heuristic Search
Description : A professional accountant may be associated with a tax return that a. Contains a false or misleading statement. b. Contains statements or information furnished recklessly or without any real ... use is generally acceptable or if it is impractical under the circumstances to obtain exact data
Last Answer : Uses of estimates if such use is generally acceptable or if it is impractical under the circumstances to obtain exact data
Description : What is the term used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Last Answer : a) Heuristic
Description : Which term is used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical
Last Answer : A. Heuristic
Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical E. None of the above
Description : What is an algebraic model used to find the exact solution of a system of equations?
Last Answer : Need answer
Description : In dictionary techniques for data compaction, which approach of building dictionary is used for the prior knowledge of probability of the frequently occurring patterns? a. Static Dictionary b. Adaptive Dictionary c. both a and b d. None of the above
Last Answer : a. Static Dictionary
Description : In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of: (A) rows or columns (B) rows+columns (C) rows+columns-1 (D) rows+columns+1
Last Answer : (A) rows or columns
Description : An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions
Last Answer : b) It is guaranteed to return an optimal solution when one exists
Description : If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these
Last Answer : (C) h* underestimates h
Description : A strategic manager that seeks to reach acceptable profit targets as opposed to making as much profit as possible is making decisions of which type? a) Satisfactory b) Satisficing c) Irrational d) Optimal
Last Answer : Satisficing
Description : A strategic manager that seeks to reach acceptable profit targets as opposed to making as much profit as possible is making decisions of which type? A. Satisfactory B. Satisficing C. Irrational D. Optimal
Last Answer : Satisfactory
Description : Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search
Last Answer : c) Greedy local search
Description : A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
Last Answer : a) True
Description : 2. ______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical
Description : ______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical
Description : What's your weirdest approach to problem solving?
Last Answer : Put in an earbud and figure it out as you go
Description : 7. Who defined Operations Research as scientific approach to problem solving for executive management? a. E.L. Arnoff b. P.M.S. Blackett c. H.M. Wagner d. None of the above
Last Answer : c. H.M. Wagner
Description : An intuitive manager could best be described as one who: A)uses scientific problem solving B)eliminates uncertainty in decision making C)searches out facts and data systematically D)uses an orderly approach to gathering information E)uses personal knowledge and experience to make decisions
Last Answer : E)uses personal knowledge and experience to make decisions
Description : Who defined Operations Research as scientific approach to problem solving for executive management. a. E L Arnoff b. H M Wagner c. Churchman d. None of these
Last Answer : b. H M Wagner
Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned
Last Answer : c) Planning graph algorithm
Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms
Last Answer : d) MIN/MAX Algorithms
Description : Genetic Algorithm are a part of A . Evolutionary Computing B. inspired by Darwin's theory about evolution - "survival of the fittest" C. are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetics D . All of the above
Last Answer : D . All of the above
Description : 20. The influential paper titled Programming a Computer for ____ ____ was published by Claude Shannon in 1950 with the introduction: This paper is concerned with the problem of constructing a ... attacking other problems of a similar nature and of greater significance.' Fill up the blanks
Last Answer : Playing Chess.
Description : In Herbert Simon's theory, a manager who accepts the first satisfactory solution to a problem has made a ______ decision, while a manager who continues to search for the best possible solution is ... ; satisficing ; (b) Minimising; maximizing ; (c) Satisficing; maximising (d) Maximising; minimizing
Last Answer : (b) Minimising; maximizing ;
Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False
Description : A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming
Last Answer : a) Feed-forward neural network
Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)
Last Answer : (D) (a), (b) , (c) and (d)
Description : Estimates from the planning stage will need to be refined as the project progresses, because it is virtually impossible to develop an exact assessment of the project’s schedule before the analysis and design phases are conducted.
Last Answer : Ans: True
Description : Who hypothesized that it would be impossible to know the exact location and exact momentum of a particle at the same time?
Last Answer : ANSWER: HEISENBERG
Description : Who hypothesized that it would be impossible to know the exact location and exact momentum of a particle at the same time? Was it: w) Heisenberg x) De Broglie y) Planck z) Schrodinger
Last Answer : ANSWER: A -- HEISENBERG
Description : What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : c) Path cost from start node to current node + Heuristic cost
Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : a) Heuristic function
Description : What is the evaluation function in greedy approach? A : Heuristic function B : Path cost from start node to current node C : Path cost from start node to current node + Heuristic cost D : Average of Path cost from start node to current node and Heuristic cost
Last Answer : A : Heuristic function
Description : Merge sort uses a) Divide-and-conquer b) Backtracking c) Heuristic approach d) Greedy approach
Last Answer : a) Divide-and-conquer
Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search
Last Answer : b) Hidden markov model