Description : Which value is assigned to alpha and beta in the alpha-beta pruning? a) Alpha = max b) Beta = min c) Beta = max d) Both Alpha = max & Beta = min
Last Answer : d) Both Alpha = max & Beta = min
Description : In alpha-beta pruning, ............... is used to cut off the search at maximizing level only and ................. is used to cut off the search at minimizing level only. (A) alpha, beta (B) beta, alpha (C) alpha, alpha (D) beta, beta
Last Answer : (B) beta, alpha
Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned
Last Answer : c) Alpha-beta pruning
Description : The mean-end analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference ... (A) backward planning (B) goal stack planning (C) operator subgoaling (D) operator overloading
Last Answer : (C) operator subgoaling
Description : Which function is used to calculate the feasibility of whole game tree? a) Evaluation function b) Transposition c) Alpha-beta pruning d) All of the mentioned
Last Answer : a) Evaluation function
Description : Discuss Game playing. Explain Alpha-beta pruning.
Last Answer : Ans. Game playing Games are well-defined problems that are generally interpreted as requiring intelligence to play well. Introduces uncertainty since opponents moves can not be ... such as utility values distributed randomly across leaves and therefore experimental results are necessary.
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 : How the effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) All of the mentioned d) None of the mentioned
Last Answer : a) Depends on the nodes
Description : To which depth does the alpha-beta pruning can be applied? a) 10 states b) 8 States c) 6 States d) Any depth
Last Answer : d) Any depth
Description : Define Alpha beta pruning.
Last Answer : Alpha beta pruning eliminates away branches that cannot possibly influence the final decision
Description : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1
Last Answer : (D) m + n – 1
Description : Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning? (A) I (B) HI (C) CHI (D) GHI
Last Answer : (B) HI
Description : Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct? (A) θ(f(n) * g(n)) = min(f(n), g(n)) (B) θ(f(n) * g(n)) = max(f(n), g(n)) (C) θ(f(n) + g(n)) = min(f(n), g(n)) (D) θ(f(n) + g(n)) = max(f(n), g(n))
Last Answer : (D) θ(f(n) + g(n)) = max(f(n), g(n))
Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by
Last Answer : Answer: C
Description : Testing of software with actual data and in actual environment is called (A) Alpha testing (B) Beta testing (C) Regression testing (D) None of the above
Last Answer : (B) Beta testing
Description : Explain Min-Max method of generating the game tree.
Last Answer : Ans. The Minmax search procedure is a depth-first, depth-limited procedure. The ideas is to start at the current position & use the plausible-move generator to generate the set of possible successor ... its child values - 4. When value reaches the root: choose max value and the corresponding move.
Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)
Last Answer : (2) O(log n)
Description : Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, ... in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
Last Answer : (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
Description : Will a cedar tree regrow lower branches after severe pruning?
Last Answer : Need Answer
Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm
Last Answer : (C) Greedy best first search algorithm
Description : Let `alpha,beta`, are two real solution of equation `(log_(10)x)^2 + log_(10)x^2 = (log_(10))^2 -1,` then ` sqrt1/(alpha beta)`equal to `(i) 20 (ii) 3
Last Answer : Let `alpha,beta`, are two real solution of equation `(log_(10)x)^2 + log_(10)x^2 = (log_(10))^2 -1,` then ` ... 1` A. `20` B. `3` C. `10` D. `1`
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 : Which of the following statement(s) is/are true with respect to software architecture? S1: Coupling is a measure of how well the things grouped together in a module belong together logically. S2: Cohesion is a measure of the ... ) Only S1 and S2 (2) Only S3 (3) All of S1, S2 and S3 (4) Only S1
Last Answer : Answer: 2
Description : Pruning dead lilac branches
Description : Two basic types of pruning are heading-back and thinning-out. Which of the following is true about these pruning methods? a. Thinning cuts leave behind a good portion of the stem and many axillary buds. ... leave no buds. d. Heading cuts remove a portion of the stem and only terminal buds are lef
Last Answer : Thinning cuts are made close to a main branch or ground and few axillary buds are left
Description : Which is/are the application(s) of stack A) Function calls B) Large number Arithmetic C) Evaluation of arithmetic expressions D) All of the above
Last Answer : D) All of the above
Description : Mark the incorrect option relating to Inspector Post office examination a) A candidate must fulfill the conditions of min service limit and max age limit as on 1st Jul preceding the date fixed for the examination ... be given two months time to learn if after he has been selected. d) None of these
Last Answer : d) None of these
Description : Match the following. a) Completeness i) How long does it take to find a solution b) Time Complexity ii) How much memory need to perform the search. c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in ... , b-ii, c-iii C) a-iii, b-i, c-ii D) a-i, b-iii, c-ii
Last Answer : C) a-iii, b-i, c-ii
Description : The primary goal of planning for disasters is to reduce – (1) Death (2) Damage (3) Risk (4) Vulnerability
Last Answer : (4) Vulnerability Explanation: Disaster planning is the creation of plans through which communities reduce vulnerability to hazards and cope with disasters. It does not avert or eliminate the threats; instead it focuses on creating plans to decrease the impact of disasters.
Description : The primary goal of planning for disasters is to reduce (1) Death (2) Damage (3) Risk (4) Vulnerability
Last Answer : Vulnerability
Description : Consider the following ORACLE relations: R(A,B,C) = {, , , , ,< 3,1,4>} S(B,C,D) = {, , , , } Consider the following two SQL queries SQ1 and SQ2: SQ1: SELECT R.B, AVG(S.B) FROM R, S WHERE R.A = S.C AND S.D ... tuples returned by SQ2 then (A) M=4, N=2 (B) M=5, N=3 (C) M=2, N=2 (D) M=3, N=3
Last Answer : (A) M=4, N=2
Description : Stack is also called as A) Last in first out B) First in last out C) Last in last out D) First in first out
Last Answer : A) Last in first out
Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False
Last Answer : a) True
Description : The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)
Last Answer : Answer: D
Description : Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, ... 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364
Last Answer : (C) 926, 203, 912, 241, 913, 246, 364
Description : The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65
Last Answer : Answer: All
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 : What is a stack? State it’s application.
Last Answer : A: It is a linear data structure which follows the LIFO (Last In First out) pattern. Stack memory is used in recursion. Application: It can be used for reversing strings, for evaluating postfix expressions.
Description : The typical elements of process image are ..................... i) User data ii) System Data iii) User program iv) System stack A) i, iii and iv only B) i, ii, and iv only C) ii, iii, and iv only D) All i, ii, iii, and iv
Last Answer : A) i, iii and iv only
Description : What will be the value of top, if there is a size of stack STACK_SIZE is 5 A) 5 B) 6 C) 4 D) None
Last Answer : C) 4
Description : ………… is very useful in situation when data have to stored and then retrieved in reverse order. A) Stack B) Queue C) List D) Link list
Last Answer : A) Stack
Description : ……………. Is a pile in which items are added at one end and removed from the other. A) Stack B) Queue C) List D) None of the above
Last Answer : B) Queue
Description : Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation. A) push, pop B) pop, push
Last Answer : A) push, pop
Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.
Last Answer : (B) OS maintains only CPU registers for each thread.
Description : A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K
Last Answer : (B) 335 K
Description : The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack
Last Answer : (C) Scheduling parameters
Description : In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack
Last Answer : (C) Shared memory segments
Description : Match the following types of variables with the corresponding programming languages: (a) Static variables (i) Local variables in Pascal (b) Stack dynamic (ii) All variables in APL (c) Explicit heap dynamic (iii) Fortran 77 (d) Implicit ... (ii) (C) (iii) (i) (iv) (ii) (D) (ii) (i) (iii) (iv)
Last Answer : (C) (iii) (i) (iv) (ii)
Description : Which of the following is not an inherent application of stack? (A) Implementation of Stack (B) Evaluation of a postfix expression (C) Job Scheduling (D) Reverse a string
Last Answer : (C) Job Scheduling
Description : Consider the following operations performed on a stack of size 5: Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e); Which of the following statements is correct? (A) Underflow occurs (B) Stack operations are performed smoothly (C) Overflow occurs (D) None of the above
Last Answer : (B) Stack operations are performed smoothly