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 + /
Description : In how many ways can the string A ∩ B - A ∩ B - A be fully parenthesized to yield an infix expression? (A) 15 (B) 14 (C) 13 (D) 12
Last Answer : (B) 14
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
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
Description : Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and .......... ... ~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔
Last Answer : (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔
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
Description : Convert the octal number 0.4051 into its equivalent decimal number. (1) 0.5100098 (2) 0.2096 (3) 0.52 (4) 0.4192
Last Answer : Answer: 1 Explanation: (0.4051)8 = 4x8-1+0x8-2+5x8-3+1x8-4 = 0.5100098
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
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
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
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
Description : In ΔABC and ΔDEF, AB = DE, AB || DE, BC = EF and BC || EF. Vertices A, B and C are joined to vertices D, E and F respectively (see Fig. 8.22). Show that (i) quadrilateral ABED is a parallelogram ( ... CF and AD = CF (iv) quadrilateral ACFD is a parallelogram (v) AC = DF (vi) ΔABC ≅ ΔDEF. -Maths 9th
Last Answer : . Solution: (i) AB = DE and AB || DE (Given) Two opposite sides of a quadrilateral are equal and parallel to each other. Thus, quadrilateral ABED is a parallelogram (ii) Again BC = EF and BC || EF ... (Given) BC = EF (Given) AC = DF (Opposite sides of a parallelogram) , ΔABC ≅ ΔDEF [SSS congruency]
Description : ABCD is a square. E and F are respectively the mid - points of BC and CD. If R is the mid point of EF. -Maths 9th
Last Answer : Since R is the mid point of EF . ∴ AR is the median in △AEF. As, a median of a triangle divides it into two triangles of equal area . ∴ ar(△AER) = ar(△AFR)
Description : E and F are respectively the mid-points of the non-parallel sides AD and BC of a trapezium ABCD. Prove that EF||AB and EF = 1/2 (AB +CD). -Maths 9th
Last Answer : Solution :-
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
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 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 : I'm looking for a refurbished Canon EF 50mm f/1.4 USM Lens in Canada. Where can I get one?
Last Answer : Ebay or BestBuy.
Description : How many two-input AND and OR gates are required to realize Y=CD+EF+G (A) 2,2. (B) 2,3. (C) 3,3. (D) none of these.
Last Answer : Ans: A Y=CD+EF+G Number of two input AND gates=2 Number of two input OR gates = 2 One OR gate to OR CD and EF and next to OR of G & output of first OR gate.
Description : How many AND gates are required to realize Y = CD+EF+G (A) 4 (B) 5 (C) 3 (D) 2
Last Answer : 2
Description : "lf my computations are correct and I pay the electric bill, then I will run out of money. If I don't pay the electric bill, the power will be turned off. Therefore, if I don't run out of money and the power is still on ... r and ¬p → ¬b, then (¬r∨p)→¬c (D) if (c∨b) → r and ¬b → ¬p, then (¬r∧p)→¬c
Last Answer : (A) if (c∧b) → r and ¬b → ¬p, then (¬r∧p)→¬c
Description : The ....................... looks only for a match between the value of the expression and one of its case constants. A) if B) match C) switch D) None of the above
Last Answer : C) switch
Description : abcd is a rectangle and bd is one of its diagonals if area of triangle abd is 8cm^2 find are of triangle bcd -Maths 9th
Last Answer : This answer was deleted by our moderators...
Description : Which of the following control expressions are valid for an if statement? A) An integer expression B) A Boolean expression C) Either A or B D) Neither A nor B
Last Answer : B) A Boolean expression
Description : By using ................... you can force immediate termination of a loop, by passing the conditional expression and any remaining code in the body of the loop. A) Break B) Continue C) Terminate D) Loop Close
Last Answer : A) Break
Description : In java, ............. can only test for equality, where as ............ can evaluate any type of the Boolean expression. A) switch, if B) if, switch C) if, break D) continue, if
Last Answer : A) switch, if
Description : When the operators are having the same priority, they are evaluated from ................. ............. in the order they appear in the expression. A) right to left B) left to right C) any of the order D) depends on compiler
Last Answer : B) left to right
Description : Which of the following control expressions are valid for an if statement? A) an integer expression B) a Boolean expression C) either A or B D) Neither A nor B
Last Answer : B) a Boolean expression
Description : If m and n are int type variables, what will be the result of the expression m% n when m=5 and n=2 ? A) 0 B) 1 C) 2 D) None of the above
Last Answer : B) 1
Description : The expression x=4+2 % -8 evaluates to A) -6 B) 6 C) 4 D) None of the above
Last Answer : B) 6
Description : Which of the following is a legal expression in SQL? (A) SELECT NULL FROM EMPLOYEE; (B) SELECT NAME FROM EMPLOYEE; (C) SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL; (D) None of the above
Last Answer : B) SELECT NAME FROM EMPLOYEE;
Description : Suppose d = { john :40, peter :45}, what happens when we try to retrieve a value using the expression d[ susan ]? a) Since susan is not a value in the set, Python raises a KeyError ... Python raises a KeyError exception d) Since susan is not a key in the set, Python raises a syntax error
Last Answer : c) Since “susan” is not a key in the set, Python raises a KeyError exception
Description : A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true
Last Answer : (B) Always true
Description : The value of postfix expression: 8 3 4 + - 3 8 2 / + * 2 $ 3+ is (A) 17 (B) 131 (C) 64 (D) 52
Last Answer : (D) 52
Description : Given L1 = L(a*baa*) and L2 = L(ab*) The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by (A) a*b (B) a*baa* (C) a*ba* (D) None of the above
Last Answer : (C) a*ba*
Description : What is the result of the expression (1&2)+(3/4) ? (A) 1 (B) 2 (C) 3 (D) 0
Last Answer : (D) 0
Description : The dual of a Boolean expression is obtained by interchanging (A) Boolean sums and Boolean products (B) Boolean sums and Boolean products or interchanging 0's and 1's (C) Boolean sums and Boolean products and interchanging 0's & 1's (D) Interchanging 0's and 1's
Last Answer : (C) Boolean sums and Boolean products and interchanging 0's & 1's
Description : What is the value of the postfix expression ? a b c d + - * (where a = 8, b = 4, c = 2 and d = 5) (A) -3/8 (B) -8/3 (C) 24 (D) -24
Last Answer : (D) -24
Description : What does the following expression means ? char *(*(* a[N]) ( )) ( ); (A) a pointer to a function returning array of n pointers to function returning character pointers. (B) a ... to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters.
Last Answer : Answer: A,B,C,D
Description : The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01
Last Answer : (C) (1 + 01)* (1 + 01)
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 : A horn clause is ...................... (A) A clause in which no variables occur in the expression (B) A clause that has at least one negative literal (C) A disjunction of a number of literals (D) A clause that has at most one positive literal
Last Answer : (D) A clause that has at most one positive literal
Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6
Last Answer : (D) 6
Description : The regular expression for the complement of the language L = {anbm|n≥4, m≤3} is: (A) (λ + a + aa + aaa)b* + a*bbbb* + (a + b)*ba(a + b)* (B) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ab(a + b)* (C) (λ + a ... *bbbbb* + (a + b)*ab(a + b)* (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*
Last Answer : (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*
Description : The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12
Last Answer : (D) 12
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 : The number of strings of length 4 that are generated by the regular expression (0+1 +|2+3 + )*, where | is an alternation character and {+, *} are quantification characters, is: (A) 08 (B) 09 (C) 10 (D) 12
Last Answer : (C) 10
Description : Given the following prefix expression: * + 3 + 3 ↑ 3 + 3 3 3 What is the value of the prefix expression? (A) 2178 (B) 2199 (C) 2205 (D) 2232
Last Answer : (C) 2205