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 : 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 : 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 : A problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible. Heuristic A. Algebraic B. Hyroglyphics C. Hypertext
Last Answer : C. Hypertext
Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above
Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.
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 : Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) ... used to find the components of a graph. (1) A (2) B (3) C (4) D
Last Answer : Answer: 2
Description : Which one of the following is a nonprobability sampling method ? (A) Simple Random Sampling (B) Stratified Sampling (C) Cluster Sampling (D) Quota Sampling
Last Answer : (D) Quota Sampling
Description : Which of the following sampling method is appropriate to study the prevalence of AIDS amongst male and female in India in 1976, 1986, 1996 and 2006 ? (A) Cluster sampling (B) Systematic sampling (C) Quota sampling (D) Stratified random sampling
Last Answer : (B) Systematic sampling
Description : Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function ... S1 and S2 (B) S1 and S3 (B) S2 and S3 (D) S1, S2 and S2
Last Answer : (D) S1, S2 and S2
Description : At which of the following stage(s), the degeneracy do not occur in transportation problem? (m, n represents number of sources and destinations respectively) (a) While the values of dual variables ui and vj cannot be computed. (b) While ... and (d) (3) (a) and (d) (4) (a), (b), (c) and (d)
Last Answer : (3) (a) and (d)
Description : At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution
Last Answer : (C) Alternative solution
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
Last Answer : A. Heuristic
Description : ______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical
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 : Which of the following search strategy uses a problem specific knowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search
Last Answer : C : Heuristic Search
Description : Which of the following search strategy uses a problem specificknowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search
Description : A ____ is a rule of thumb, strategy, trick, simplification, or any other kind of device which drastically limits search for solutions in large problem spaces. A. Heuristic B. Critical C. Value based D. Analytical
Description : Greg Beck of Quality Market Research tells placement student John to go out and select for personal interview ten men and ten women. Greg is using __________sampling for this phase of the research: A)random B)stratified C)quota D)area
Last Answer : C)quota
Description : Merge sort uses a) Divide-and-conquer b) Backtracking c) Heuristic approach d) Greedy approach
Last Answer : a) Divide-and-conquer
Description : In Artificial Intelligence (AI), what is present in the planning graph? (1) Sequence of levels (2) Literals (3) Variables (4) Heuristic estimates
Last Answer : Sequence of levels
Description : When a research problem is related to heterogeneous population, the most suitable sampling method is: (A) Cluster Sampling (B) Stratified Sampling (C) Convenient Sampling (D) Lottery Method
Last Answer : (B) Stratified Sampling
Description : Determining the sample interval (represented by k), randomly selecting a number between 1 and k, and including each kth element in your sample are the steps for which form of sampling? a. Simple Random Sampling b. Stratified Random Sampling c. Systematic Sampling d. Cluster sampling
Last Answer : c. Systematic Sampling
Description : Which of the following would generally require the largest sample size? a. Cluster sampling b. Simple random sampling c. Systematic sampling d. Proportional stratified sampling
Last Answer : a. Cluster sampling
Description : Which of the following is not true about stratified random sampling? a. It involves a random selection process from identified subgroups b. Proportions of groups in the sample must ... subgroup comparisons are to be done d. Proportional stratified random sampling yields a representative sample
Last Answer : D. Make the sample as large as possible
Description : When a population is divided into distinct groups based on some particular characteristic and a probability sample is taken from each group, this exemplifies: A)area sampling B)quota sampling C)stratified sampling D)cluster sampling E)simple random sampling
Last Answer : D)cluster sampling
Description : Which sampling design gives every member of the population an equal chance of appearing in the sample? A)area sampling B)random sampling C)quota sampling D)stratified sampling E)total population sampling
Last Answer : B)random sampling
Description : In what type of sampling design is the final choice of respondents left up to the interviewer? A)stratified sampling B)random sampling C)cluster sampling D)area sampling E)quota sampling
Last Answer : E)quota sampling
Description : Select the order of sampling schemes from best to worst. a. simple random, stratified, convenience b. simple random, convenience, stratified c. stratified, simple random, convenience d. stratified, convenience, simple random
Last Answer : a. simple random, stratified, convenience
Description : Which one of the following is a non probability sampling? (A) Simple Random (B) Purposive (C) Systematic (D) Stratified
Last Answer : (B) Purposive
Description : Which of the following sampling methods is not based on probability? (A) Simple Random Sampling (B) Stratified Sampling (C) Quota Sampling (D) Cluster Sampling
Last Answer : (C) Quota Sampling
Description : Which one is called non-probability sampling? (A) Cluster sampling (B) Quota sampling (C) Systematic sampling (D) Stratified random sampling
Last Answer : Explanation: No n-probability sampling is a sampling technique where the samples are gathered in a process that does not give all the individuals in the population equal chances of being selected. ... po pulation with respect to known characteristics, traits or focused ph enomenon. Answer: B
Description : Probability sampling implies: (A) Stratified Random Sampling (B) Systematic Random Sampling (C) Simple Random Sampling (D) All of the above
Last Answer : (D) All of the above
Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search
Last Answer : a) Depth-First Search
Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Optimal search d) Linear Search
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 : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6
Last Answer : (B) 10 and 7
Description : Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map ... (b) only (C) (a) and (b) (D) (a), (b) and (c)
Last Answer : (D) (a), (b) and (c)
Description : Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40
Last Answer : (2) 10
Description : Beam-penetration and shadow-mask are the two basic techniques for producing color displays with a CRT. Which of the following is not true ? I. The beam-penetration is used with random scan monitors. II. Shadow-mask is used ... -penetration method. (A) I and II (B) II and III (C) III only (D) IV only
Last Answer : (C) III only
Description : You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort
Last Answer : (D) Insertion sort
Description : ................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search
Last Answer : (C) Alpha-beta pruning procedure
Description : The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search
Last Answer : (B) Constraint satisfaction
Description : In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1
Last Answer : D) [log2n]+1
Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these
Last Answer : c. VAM
Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned
Last Answer : d) All of the mentioned