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 : 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
Description : The rate expression for a heterogeneous catalytic reaction is given by, - rA = K.KA PA(1 + KA.PA + KR.PR), where K is surface reaction rate constant and KA and KR are absorption equilibrium constants of A and R respectively. If KR PR ... R and A) (A) E (B) E + ΔHA (C) E + ΔHA - ΔHR ) (D) ΔHA + ΔHR
Last Answer : (C) E + ΔHA - ΔHR )
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 : 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 : 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
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 : Match the following. i) Mutual exclusion a) A process may hold allocated resources while waiting assignment. ii) Hold and wait b) No resource can be forcibly removed from a process holding it. iii) No preemption c) Only one process may use ... , ii-c, iii-b C) i-b, ii-c, iii-a D) i-c, ii-a, iii-b
Last Answer : D) i-c, ii-a, iii-b
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
Description : What is the difference between if and switch?
Last Answer : A: (a) if can compare conditions for all data types whereas, switch can only check integers and characters. (b) all kinds of relations can be checked using if whereas only equality relation can be checked using switch.
Description : Some of the situations where inline expansion may not work are: A) For functions returning values, if a loop, a switch or goto exists. B) If functions contain static variables and they are re-cursive. C) For functions not returning values, if return statement exist. D) All of the above.
Last Answer : D) All of the above.
Description : …………… are very effective because a mode switch is not required to switch from one thread to another. A) Kernel-level threads B) User-level threads C) Alterable threads D) Application level threads
Last Answer : B) User-level threads
Description : Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct? (A) T1 < T2 (B) T1 > T2 (C) T1 = T2 (D) Nothing can be said about the relation between T1 and T2.
Last Answer : (A) T1 < T2
Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5
Last Answer : (A) 3
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 : 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 : 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 : 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 : 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 : 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 : 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 : 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 : 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 : Absolute entitiesare_ Ss whom value signify storage locations that are independent of resulting machine code: a. Numeric constants b. String constants c. Fixed addresses d. Operation codes e. Allofthese
Last Answer : e. Allofthese
Description : At a given value of E/R (ratio of activation energy and gas constant), the ratio of the rate constants at 500°K and 400°K is 2, if Arrhenius law is used. What will be this ratio, if transition state theory is used with the same value of ‘E/R’? (A) 1.6 (B) 2 (C) 2.24 (D) 2.5
Last Answer : (D) 2.5
Description : Which symbol will be used with grep command to match the pattern pat at the beginning of a line? A. ^pat B. $pat C. pat$ D. pat^ E. None of the above
Last Answer : A. ^pat
Description : Match the following HTTP status code to their respective definitions. i) 400 a) OK ii) 500 b) Not found iii) 200 c) Continue iv) 100 d) Internal server error A) i-b, ii-d, iii-a, iv-c B) i-a, ii-b, iii-c, iv-d C) i-b, ii-c, iii-a, iv-d D) i-b, ii-a, iii-c, iv-d
Last Answer : A) i-b, ii-d, iii-a, iv-c
Description : Match the following. a) Java 1) is a tool for debugging java program b) Javah 2) is a tool for creating C-like header files c) Javap 3) runs java bytecode d) jdb 4) prints java code representation A) a-3, b-2,c-1 B) a-3, b-1, c-4, d-2 C) a-1, b-2, c-3, d-4 D) a-2, b-1, c-3, d-4
Last Answer : B) a-3, b-1, c-4, d-2
Description : Match the following a) : : i) Pointer to member declarator b) : :* ii) Pointer to member operator c) ->* iii) Scope resolution operator A) a-ii, b-iii, c-i B) a-iii, b-i, c-ii C) a-i b-ii, c-iii D) a-iii, b-ii, c-i
Last Answer : B) a-iii, b-i, c-ii
Description : Match the following mechanisms for interrupting the execution of a process and their uses. i) Interrupt a) Call to an operating system function ii) Trap b) Reaction to an asynchronous external event iii) Supervisor Call c) Handling of a error ... -a, iii-b C) i-b, ii-c, iii-a D) i-a, ii-c, iii-b
Last Answer : C) i-b, ii-c, iii-a
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 : Match the following IEEE No to their corresponding Name for IEEE 802 standards for LANs. i) 802.3 a) WiFi ii) 802.11 b) WiMa iii) 802.15.1 c) Ethernet iv) 802.16 d) Bluetooth A) i-b, ii-c, iii-d, iv-a B) i-c, ii-d, iii-a, iv-b C) i-c, ii-a, iii-d, iv-b D) i-b, ii-d, iii-c, iv-a
Last Answer : C) i-c, ii-a, iii-d, iv-b
Description : The objective of .................. procedure is to discover at least one ............... that causes two literals to match. (A) unification, validation (B) unification, substitution (C) substitution, unification (D) minimax, maximum
Last Answer : (B) unification, substitution
Description : Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) ... to a queue (D) This algorithm can be configured to match a specific system under design
Last Answer : (C) Processes are permanently assigned to a queue