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

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
by

1 Answer

Answer :

(C) 2205
by

Related questions

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 ............. respectively. (A) ↔~˄pq˅ ~~pq, pq˄~p~q~˅↔ (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

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~˅↔

The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w} (C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Description : The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v ... (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Last Answer : (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} 

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) Given the prefix and postfix walks of a binary tree, the tree cannot be reconstructed uniquely. (D) Depth-first-search can be used to find the components of a graph. (1) A (2) B (3) C (4) 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

Calculate 4th root of 193 + underroot 2178 -Maths 9th

Description : Calculate 4th root of 193 + underroot 2178 -Maths 9th

Last Answer : This answer was deleted by our moderators...

What are the Prime numbers for the number 2232?

Description : What are the Prime numbers for the number 2232?

Last Answer : The prime factors of 2232 are 2, 3 and 31

28, 42, 84, 210, 630, ? a) 2675 b) 2515 c) 2445 d) 2375 e) 2205

Description : 28, 42, 84, 210, 630, ? a) 2675 b) 2515 c) 2445 d) 2375 e) 2205

Last Answer : Series is × 1.5, ×2, ×2.5, ×3, ×3.5 Answer: e)

Three partners shared the profit in a business in the ratio 7 :8 :9. They had partnered for 16 months, 10 months and 9 months respectively. What was the ratio of their investments? A) 2286:5599:7643 B) 2346:76543:8754 C) 5643;1254 :2345 D) 2205 :4032:5032

Description : Three partners shared the profit in a business in the ratio 7 :8 :9. They had partnered for 16 months, 10 months and 9 months respectively. What was the ratio of their investments? A) 2286:5599:7643 B) 2346:76543:8754 C) 5643;1254 :2345 D) 2205 :4032:5032

Last Answer :  Answer: D) Let their investments be Rs.x for 16 months, y for 10 months , Z for 9 months Then 16x : 10y :9z = 7:8:9 Now 16x / 10y = 7/8 128x = 70y Y=64/35x 16x/9z = 7/9 144x = 63z Z = 144x/63 X:Y:Z = x:64x/35 :144x/63 X:Y:Z = 2205:4032:5032.

What are postfix and prefix operators?

Description : What are postfix and prefix operators?

Last Answer : A: Both postfix and prefix operators change (increase or decrease) the value of a variable by 1. In postfix, the old value of the variable is first used and then the variable is updated to the new ... , the value of the variable is first updated to the new value and then this new value is used.

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

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

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 exception b) It is executed fine and no exception is raised, and it returns None c) Since “susan” is not a key in the set, Python raises a KeyError exception d) Since “susan” is not a key in the set, Python raises a syntax error

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

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

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

The value of postfix expression: 8 3 4 + - 3 8 2 / + * 2 $ 3+ is (A) 17 (B) 131 (C) 64 (D) 52

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

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

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

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

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* 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

The expression x=4+2 % -8 evaluates to A) -6 B) 6 C) 4 D) None of the above

Description : The expression x=4+2 % -8 evaluates to A) -6 B) 6 C) 4 D) None of the above

Last Answer : B) 6

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

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;

What is the result of the expression (1&2)+(3/4) ? (A) 1 (B) 2 (C) 3 (D) 0

Description : What is the result of the expression (1&2)+(3/4) ? (A) 1 (B) 2 (C) 3 (D) 0

Last Answer : (D) 0

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

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

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

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 function return array of N pointers to functions returning pointers to characters (C) an array of n pointers to function returning pointers to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters.

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

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

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) 

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 and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/ are correct? (A) (a) only (B) (b) only (C) (a) and (b) (D) (a), (b) and (c)

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) 

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

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 

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

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

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 + aa + aaa) + a*bbbbb* + (a + b)*ab(a + b)* (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

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

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

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

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

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

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

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

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

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

Which of the following strings would match the regular expression: p+[3-5]*[xyz]? I. p443y Il. p6y III. 3xyz IV. p35z V. p353535x Vl. ppp5 (1) I, III and Vl only (2) IV, V and VI only (3) II, IV and V only (4) I, IV and V only

Description : Which of the following strings would match the regular expression: p+[3-5]*[xyz]? I. p443y Il. p6y III. 3xyz IV. p35z V. p353535x Vl. ppp5 (1) I, III and Vl only (2) IV, V and VI only (3) II, IV and V only (4) I, IV and V only

Last Answer : Answer: 4

The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table from the maximum value in that table. (C) adding each entry in a column from the maximum value in that column. (D) adding maximum value of the table to each entry in the table.

Description : The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table ... value in that column. (D) adding maximum value of the table to each entry in the table.

Last Answer : (B) subtracting each entry in the table from the maximum value in that table.

Given that x=7.5, j=-1.0, n=1.0, m=2.0 the value of --x+j == x>n>=m is: (A) 0 (B) 1 (C) 2 (D) 3

Description : Given that x=7.5, j=-1.0, n=1.0, m=2.0 the value of --x+j == x>n>=m is: (A) 0 (B) 1 (C) 2 (D) 3

Last Answer : (A) 0 

The end points of a given line are (0, 0) and (6, 18). Compute each value of y as x steps from 0 to 3, by using equation of straight line : (A) For x=0, y=0; x=1, y=3; x=2, y=6; x=3, y=9 (B) For x=0, y=1; x=1, y=3; x=2, y=4; x=3, y=9 (C) For x=0, y=2; x=1, y=3; x=2, y=6; x=3, y=9 (D) For x=0, y=0; x=1, y=3; x=2, y=4; x=3, y=6

Description : The end points of a given line are (0, 0) and (6, 18). Compute each value of y as x steps from 0 to 3, by using equation of straight line : (A) For x=0, y=0; x=1, y=3; x=2, y=6; x=3, y=9 (B) For x=0, y=1; x=1, y=3; x=2, ... x=1, y=3; x=2, y=6; x=3, y=9 (D) For x=0, y=0; x=1, y=3; x=2, y=4; x=3, y=6

Last Answer : Answer: A

Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a particular attribute (e.g. height-230 cm) (C) A thing that we wish to collect data about zero or more, possibly real world examples of it may exist. (D) A template for a group of things with the same set of characteristics that may exist in the real world

Description : Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a ... template for a group of things with the same set of characteristics that may exist in the real world

Last Answer : Answer: D

Given the following statements: (a) Strategic value of data mining is time stamping (b) Information collection is an expensive process in building an expert system. Which of the following options is correct ? (A) Both (a) and (b) are false (B) Both (a) and (b) are true (C) (a) is true, (b) is false (D) (a) is false, (b) is true

Description : Given the following statements: (a) Strategic value of data mining is time stamping (b) Information collection is an expensive process in building an expert system. Which of the following options is correct ? (A) Both (a) and (b) ... true (C) (a) is true, (b) is false (D) (a) is false, (b) is true

Last Answer :  (B) Both (a) and (b) are true

What is the value returned by the function f given below when n = 100 ? int f(int n) { if (n==0) then return n; else return n + f(n-2); } (A) 2550 (B) 2556 (C) 5220 (D) 5520

Description : What is the value returned by the function f given below when n = 100 ? int f(int n)  { if (n==0) then return n;  else return n + f(n-2);  } (A) 2550 (B) 2556 (C) 5220 (D) 5520

Last Answer : (A) 2550

What prefix is the smallest value?

Description : What prefix is the smallest value?

Last Answer : Feel Free to Answer

What is the difference between Call by value and Call by reference?

Description : What is the difference between Call by value and Call by reference?

Last Answer : A: Call By Value : When a function is called by value, then the value of the actual parameter is copied to the formal parameter (i.e. a separate copy is made). Any changes made with the ... with the values at that address of the formal parameter affects (changes) the value of the actual parameter.

Methods can be overloaded with a difference only in the type of the return value .. A) Not supported B) False C) True D) None of the above

Description : Methods can be overloaded with a difference only in the type of the return value .. A) Not supported B) False C) True D) None of the above

Last Answer : B) False

If a variable is declared final, it must include ...................... value. A) integer B) no C) initial D) float

Description : If a variable is declared final, it must include ...................... value. A) integer B) no C) initial D) float

Last Answer : C) initial

Using which keyword we can access value of the instance variables and class variables of that class inside the method of that class itself. A) super B) final C) this D) either super or this

Description : Using which keyword we can access value of the instance variables and class variables of that class inside the method of that class itself. A) super B) final C) this D) either super or this

Last Answer : C) this