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))

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))
by

1 Answer

Answer :

(D) θ(f(n) + g(n)) = max(f(n), g(n))
by

Related questions

Let R and S be two fuzzy relations defined as: Image Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

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

Which of the following is asymptotically smaller? (A) lg(lg*n) (B) lg*(lg n) (C) lg(n!) (D) lg*(n!)

Description : Which of the following is asymptotically smaller? (A) lg(lg*n) (B) lg*(lg n) (C) lg(n!) (D) lg*(n!)

Last Answer : (A) lg(lg*n) 

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

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

Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Description : Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Last Answer : (A) 6x + 7, 6x + 11 Explanation: fog(x)=f(g(x))=f(3x+2)=2(3x+2)+3=6x+7 gof(x)=g(f(x))=g(2x+3)=3(2x+3)+2=6x+11

................ 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

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

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)

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

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

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 node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

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

Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be: (1) (1+x) is factor of G(x) (2) (1-x) is factor of G(x) (3) (1+x2) is factor of G(x) (4) x is factor of G(x)

Description : Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be: (1) (1+x) is factor of G(x) (2) (1-x) is factor of G(x) (3) (1+x2) is factor of G(x) (4) x is factor of G(x)

Last Answer : (1+x) is factor of G(x)

If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to (A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r) (C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)

Description : If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to (A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r) (C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)

Last Answer : (A) P(n,r)(n+1) / (n+1-r)  Explanation: p(n, r) = n!/(n-r)! p( n+1, r) = (n+1)!/(n+1-r)! = (n+1) n! /(n+1-r) (n-r)! = P(n, r)(n+1)/(n+1-r)

Mark the correct option a) A RD account can be opened with min deposit of Rs 10/- and multiple of Rs 5/- b) No max deposit will be prescribed in RD account c) Rebate will be paid on 6 advance deposit or more as per prescribed and default will be recovered if a depositor fails to deposit his/her monthly deposit up to last working day of a calendar month, d) All the above

Description : Mark the correct option a) A RD account can be opened with min deposit of Rs 10/- and multiple of Rs 5/- b) No max deposit will be prescribed in RD account c) Rebate will be paid on 6 advance ... fails to deposit his/her monthly deposit up to last working day of a calendar month, d) All the above

Last Answer : d) All the above

Let `f : R ->R` defined by `f(x) = min(|x|, 1-|x|)`, then which of the following hold(s) good ?

Description : Let `f : R ->R` defined by `f(x) = min(|x|, 1-|x|)`, then which of the following hold(s) good ?

Last Answer : Let `f : R ->R` defined by `f(x) = min(|x|, 1-|x|)`, then which of the following ... neither even nor odd. D. f is neither injective nor surjective.

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

Which algorithm is a divided and conquer algorithm that is asymptotically faster: a. Simple algorithm b. Specific algorithm c. Strassen algorithm d. Addition algorithm

Description : Which algorithm is a divided and conquer algorithm that is asymptotically faster: a. Simple algorithm b. Specific algorithm c. Strassen algorithm d. Addition algorithm

Last Answer : c. Strassen algorithm

Let P(m,n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) (c) ∀m ∀n P(m,n) (A) (a)-True; (b)-True; (c)-False (B) (a)-True; (b)-False; (c)-False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Description : Let P(m,n) be the statement m divides n where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) ( ... -False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Last Answer : Answer: A

Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to represent M, N, R1 and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Description : Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to ... and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Last Answer : Answer: 4

If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Description : If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Last Answer : (C) Skolemization

The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Description : The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Last Answer : (A) A B + C * D + EF + G + /

Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Description : Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Last Answer : (A + B^ D) / (E – F) + G

Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Description : Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Last Answer : (C) 76/30

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp. Image It shows which of the following depth first forest? (A) {a,b,e} {c,d,f,g,h} (B) {a,b,e} {c,d,h} {f,g} (C) {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Description : In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.  It shows which of the following depth first forest? (A ... {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Last Answer : Answer: A

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Description : A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Last Answer : Answer: D

Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U and wants S & T process E holds T and wants V process F holds W and wants S process G holds V and wants U Is the system deadlocked ? If yes, ............. processes are deadlocked. (A) No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Description : Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U ... No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Last Answer : (C) Yes, D, E, G

The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ................... (1) A (2) B (3) F (4) G

Description : The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed ... The popped item is ................... (1) A (2) B (3) F (4) G

Last Answer : Answer: 2

Maximum fluctuation of energy = 1. Max KE – Min KE 2. Max KE + Min KE 3. Max KE > Min KE 4. Max KE < Min KE

Description : Maximum fluctuation of energy = 1. Max KE – Min KE 2. Max KE + Min KE 3. Max KE > Min KE 4. Max KE < Min KE

Last Answer : 1. Max KE – Min KE

Maximum fluctuation of energy = (A) Max. KE – Min. KE (B) Max. KE + Min. KE (C) (Max. KE – Min. KE)/2 (D) (Max. KE + Min. KE)/2

Description : Maximum fluctuation of energy = (A) Max. KE – Min. KE (B) Max. KE + Min. KE (C) (Max. KE – Min. KE)/2 (D) (Max. KE + Min. KE)/2

Last Answer : (A) Max. KE – Min. KE

Which of the following conditions is true for repeated stress? 1. σ m = 0 2. σ m = σ max / 2 3. σ m = σ a 4. σ min = 0 5. σ min = – σ max 6. σ a = σ max / 2 where σ m = mean stress and σ a = stress amplitude a. condition 2 and 3 b. condition 1, 3 and 5 c. condition 2, 4, and 6 d. condition 3,4, 5 and 6

Description : Which of the following conditions is true for repeated stress? 1. σ m = 0 2. σ m = σ max / 2 3. σ m = σ a 4. σ min = 0 5. σ min = - σ max 6. σ a = σ max / 2 where σ m = mean ... amplitude a. condition 2 and 3 b. condition 1, 3 and 5 c. condition 2, 4, and 6 d. condition 3,4, 5 and 6

Last Answer : c. condition 2, 4, and 6

The latest finish time for an activity: A. Equals the min. of LFT − t for al immediate successors B. Equals the max. of LFT − t for al immediate predecessors. C. Equals the max. of EST + t for all immediate predecessors. D. Equals the min. of EST + t for all immediate successors

Description : The latest finish time for an activity: A. Equals the min. of LFT − t for al immediate successors B. Equals the max. of LFT − t for al immediate predecessors. C. Equals the max. of EST + t for all immediate predecessors. D. Equals the min. of EST + t for all immediate successors

Last Answer : A. Equals the min. of LFT − t for al immediate successors

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

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

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

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

When will Hill-Climbing algorithm terminate? a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) All of the mentioned

Description : When will Hill-Climbing algorithm terminate? a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) All of the mentioned

Last Answer : c) No neighbor has higher value

When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Description : When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Last Answer : C : No neighbour has higher value

Min and Max cash balance for each SO will be fixed by a) Head post master b) Inspector/ ASP of the Sub division c) PMG d) Divisional Supdt.

Description : Min and Max cash balance for each SO will be fixed by a) Head post master b) Inspector/ ASP of the Sub division c) PMG d) Divisional Supdt.

Last Answer : d) Divisional Supdt.

The min and max dimension of a foreign parcel prescribed is a) 100 X 140 & 1mtr X 2 mtr b) 90 X 140 & 1.5mtr X 2 mtr c) 90 X 140 & 1mtr X 2 mtr d) None of the above

Description : The min and max dimension of a foreign parcel prescribed is a) 100 X 140 & 1mtr X 2 mtr b) 90 X 140 & 1.5mtr X 2 mtr c) 90 X 140 & 1mtr X 2 mtr d) None of the above

Last Answer : c) 90 X 140 & 1mtr X 2 mtr

Insured boxes dimensions and weight limit is a) Max 200X200X100, min as per letter & 2 Kg a) Max 300X200X100, min as per letter & 1 Kg a) Max 100X200X100, min as per letter & 4 Kg a) None of the above

Description : Insured boxes dimensions and weight limit is a) Max 200X200X100, min as per letter & 2 Kg a) Max 300X200X100, min as per letter & 1 Kg a) Max 100X200X100, min as per letter & 4 Kg a) None of the above

Last Answer : a) Max 300X200X100, min as per letter & 1 Kg

The min and max size permissible for folded aerogramme is a) 100 X 140 & 120 X 120 b) 90 X 140 & 110 X 120 c) 80 X 140 & 100 X 120 d) None of the above

Description : The min and max size permissible for folded aerogramme is a) 100 X 140 & 120 X 120 b) 90 X 140 & 110 X 120 c) 80 X 140 & 100 X 120 d) None of the above

Last Answer : b) 90 X 140 & 110 X 120

Dimensions of Postcards is a) Max 100 X 150 mm & min 80 X 140 mm b) Max 105 X 149 mm & min 90 X 140 mm c) Max 150 X 200 mm & min 70X 140 mm d) None of these

Description : Dimensions of Postcards is a) Max 100 X 150 mm & min 80 X 140 mm b) Max 105 X 149 mm & min 90 X 140 mm c) Max 150 X 200 mm & min 70X 140 mm d) None of these

Last Answer : b) Max 105 X 149 mm & min 90 X 140 mm

Min copies and max size to be accepted in direct post is a) 5000 & A4 Size b) 1000 & A3 size c) 500 & Postcard size d) None of these

Description : Min copies and max size to be accepted in direct post is a) 5000 & A4 Size b) 1000 & A3 size c) 500 & Postcard size d) None of these

Last Answer : b) 1000 & A3 size

Size limit of book packet roll and other than roll is a) Min 10X17 cm & max 80X100, 10X7 cm & 60X30X30 cm b) Max 15 cm x 10.5 Cm min 10X7 cm c) Min11X22cm & max 60X40cm, min 20X17cm &max 90X100cm d) None of these

Description : Size limit of book packet roll and other than roll is a) Min 10X17 cm & max 80X100, 10X7 cm & 60X30X30 cm b) Max 15 cm x 10.5 Cm min 10X7 cm c) Min11X22cm & max 60X40cm, min 20X17cm &max 90X100cm d) None of these

Last Answer : a) Min 10X17 cm & max 80X100, 10X7 cm & 60X30X30 cm

Post card of private manufacture size limit is a) Min10X7cm & max 50X100cm, min 15X25cm &max 80X100cm b) Max 15 cm x 10.5 Cm min 10X7 cm c) Min11X22cm & max 60X40cm, min 20X17cm &max 90X100cm d) None of these

Description : Post card of private manufacture size limit is a) Min10X7cm & max 50X100cm, min 15X25cm &max 80X100cm b) Max 15 cm x 10.5 Cm min 10X7 cm c) Min11X22cm & max 60X40cm, min 20X17cm &max 90X100cm d) None of these

Last Answer : b) Max 15 cm x 10.5 Cm min 10X7 cm

Size limit of Inland letter card folded and unfolded is a) Min15.2X9cm & max 21X10cm, min 28.2X18.2cm max 30X21cm b) Min10X7cm & max 50X100cm, min 15X25cm &max 80X100cm c) Min11X22cm & max 60X40cm, min 20X17cm &max 90X100cm d) None of these

Description : Size limit of Inland letter card folded and unfolded is a) Min15.2X9cm & max 21X10cm, min 28.2X18.2cm max 30X21cm b) Min10X7cm & max 50X100cm, min 15X25cm &max 80X100cm c) Min11X22cm & max 60X40cm, min 20X17cm &max 90X100cm d) None of these

Last Answer : a) Min15.2X9cm & max 21X10cm, min 28.2X18.2cm max 30X21cm

Size limit of letter and roll is a) Min11X7cm & max 60X90cm, min 10X17cm & max 88X100cm b) Min10X7cm & max 50X100cm, min 15X25cm &max 80X100cm c) Min11X22cm & max 60X40cm, min 20X17cm &max 90X100cm d) None of these

Description : Size limit of letter and roll is a) Min11X7cm & max 60X90cm, min 10X17cm & max 88X100cm b) Min10X7cm & max 50X100cm, min 15X25cm &max 80X100cm c) Min11X22cm & max 60X40cm, min 20X17cm &max 90X100cm d) None of these

Last Answer : a) Min11X7cm & max 60X90cm, min 10X17cm & max 88X100cm

Explain Min-Max method of generating the game tree.

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.

In 8086 microprocessor one of the following statements is not true.a)Coprocessor is interfaced in MAX mode b)Coprocessor is interfaced in MIN mode c)I/O can be interfaced in MAX / MIN moded)Supports pipelining

Description : In 8086 microprocessor one of the following statements is not true.a)Coprocessor is interfaced in MAX mode b)Coprocessor is interfaced in MIN mode c)I/O can be interfaced in MAX / MIN moded)Supports pipelining

Last Answer : b)Coprocessor is interfaced in MIN mode

8088 microprocessor differs with 8086 microprocessor in a) Data width on the output b) Address capability c) Support of coprocessor d) Support of MAX / MIN mode

Description : 8088 microprocessor differs with 8086 microprocessor in a) Data width on the output b) Address capability c) Support of coprocessor d) Support of MAX / MIN mode

Last Answer : a) Data width on the output

In 8086 microprocessor one of the following statements is not true. a) Coprocessor is interfaced in MAX mode b) Coprocessor is interfaced in MIN mode c) I/O can be interfaced in MAX / MIN mode

Description : In 8086 microprocessor one of the following statements is not true. a) Coprocessor is interfaced in MAX mode b) Coprocessor is interfaced in MIN mode c) I/O can be interfaced in MAX / MIN mode

Last Answer : b) Coprocessor is interfaced in MIN mode

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Last Answer : (A) less than 1