What will be the output of the following logic diagram?
(A) x OR y (B) x AND y (C) x NOR y (D) x XNOR y
Description : Which of the following logic operations is performed by the following given combinational circuit ? (A) EXCLUSIVE-OR (B) EXCLUSIVE-NOR (C) NAND (D) NOR
Last Answer : (A) EXCLUSIVE-OR
Description : If f(x, y) is a digital image, then x, y and amplitude values of f are (A) Finite (B) Infinite (C) Neither finite nor infinite (D) None of the above
Last Answer : (A) Finite
Description : List & explain the timer instruction of PLC. Draw the ladder diagram to verify (i) OR gate& (ii) NOR gate logic
Last Answer : Depending on the time delay and operation, there are two types of timers * PLC timer- (i) ON delay timer (ii) OFF delay timer Description (i) ON delay timer 1) This instruction counts time interval when ... a) OR gate ladder diagram y = A + B b)NOR gate ladder diagram
Description : In a logic circuit the NOR and NAND gate functions ____________. A. must be accomplished with a common base transistor arrangement B. are available in diode form C. are exact opposites with the ... . have output conditions that are exact opposites to the output condition for OR and AND, respectively
Last Answer : Answer: D
Description : In what state must the inputs to a NOR gate be in order to produce a logic 1 output?
Last Answer : All inputs must be low.
Description : The output of a logic gate is 1 when all its inputs are at logic 0. the gate is either (A) a NAND or an EX-OR (B) an OR or an EX-NOR (C) an AND or an EX-OR (D) a NOR or an EX-NOR
Last Answer : (D) a NOR or an EX-NOR
Description : Consider a full-adder with the following input values: (a) x=1, y=0 and Ci(carry input) = 0 (b) x=0, y=1 and Ci = 1 Compute the values of S(sum) and C0 (carry output) for the above input values. (A) S=1 , C0= 0 and ... C0= 1 (C) S=1 , C0= 1 and S=0 , C0= 0 (D) S=0 , C0= 1 and S=1 , C0= 0
Last Answer : (A) S=1 , C0= 0 and S=0 , C0= 1
Description : Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty ... (H(x) - H(x|y))] p(x) (D) max H(x|y) p(x)
Last Answer : (D) max H(x|y) p(x)
Description : If the inputs to the diagram shown in the illustration were J=1, K=0, H=0, L=1, M=1, what logic levels would be indicated at points 'X' and 'Y' respectively? EL-0089 A. 0,0 B. 0,1 C. 1,0 D. 1,1
Description : If the inputs to the diagram shown in the illustration were J=1, K=1, H=0, L=1, M=1, what logic levels would be indicated at points 'X' and 'Y' respectively? EL-0089 A. 0,0 B. 0,1 C. 1,0 D. 1,1
Description : If the inputs to the diagram shown in the illustration were J=0, K=0, H=1, L=0, M=1, what logic levels would be indicated at points 'X' and 'Y' respectively? EL-0089 A. 0,0 B. 0,1 C. 1,0 D. 1,1
Last Answer : Answer: C
Description : If the inputs to the diagram shown in the illustration were J=1, K=0, H=1, L=1, M=0, what logic levels would be indicated at points 'X' and 'Y' respectively? EL-0089 A. 0,0 B. 0,1 C. 1,0 D. 1,1
Last Answer : Answer: A
Description : The symmetric difference of two sets S1 and S2 is defined as S1ΘS2 = {x|xϵS1 or xϵS2, but x is not in both S1 and S2} The nor of two languages is defined as nor (L1,L2) = ... symmetric difference and nor. (D) The family of regular languages are not closed under both symmetric difference and nor.
Last Answer : (C) The family of regular languages are closed under both symmetric difference and nor.
Description : The agency that sits between the user and the UNIX system is called the A. logic B. profile C. shell D. erxc E. None of the above
Last Answer : C. shell
Description : …………… programs can be used to accomplish functions indirectly that an unauthorized user could not accomplish directly. A) Zombie B) Worm C) Trojan Horses D) Logic Bomb
Last Answer : C) Trojan Horses
Description : The …………….. is code embedded in some legitimate program that is set to “explode” when certain conditions are met. A) Trap doors B) Trojan horse C) Logic Bomb
Last Answer : C) Logic Bomb
Description : The ……….. is code that recognizes some special sequence of input or is triggered by being run from a certain user ID of by unlikely sequence of events. A) Trap doors B) Trojan horse C) Logic Bomb D) Virus
Last Answer : A) Trap doors
Description : ……………… is a tabular method for describing the logic of the decisions to be taken. A) Decision tables B) Decision tree C) Decision Method D) Decision Data
Last Answer : A) Decision tables
Description : In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)
Last Answer : (B) (~P∨Q)∧(~Q∨P)
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 : Language model used in LISP is ................. (A) Functional programming (B) Logic programming (C) Object oriented programming (D) All of the above
Last Answer : (A) Functional programming
Description : In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q
Last Answer : (B) Q
Description : Which of the following statements is not correct? (A) HTML is not screen precise formatting language. (B) HTML does not specify a logic. (C) DHTML is used for developing highly interactive web pages. (D) HTML is a programming language.
Last Answer : (D) HTML is a programming language.
Description : Which of the following logic expressions is incorrect? (A) 1 ⊕ 0 = 1 (B) 1 ⊕ 1 ⊕ 1 = 1 (C) 1 ⊕ 1 ⊕ 0 = 1 (D) 1 ⊕ 1 = 1
Last Answer : (C) 1 ⊕ 1 ⊕ 0 = 1
Description : The first order logic (FOL) statement ((RᴠQ)˄(Pᴠ¬Q)) is equivalent to which of the following? (1) ((Rᴠ¬Q)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) (2) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) (3) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(Rᴠ¬P)) (4) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(¬RᴠP))
Last Answer : ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP))
Description : ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ............... (1) Race condition (2) Saturation (3) Delay (4) High impedance
Last Answer : Answer: 2 Explanation: Emitter-coupled logic (ECL) is the fastest of all logic families and therefore is used in applications where very high speed is essential. High speeds have become ... configuration, in which they are never driven into saturation and thereby the storage time is eliminated.
Description : In a certain electronic circuit the output is positive if input 1 is positive and input 2 is zero. If both inputs are positive the output is zero. This is: w) an AND circuit x) a NOR circuit y) an OR circuit z) a high-pass filter
Last Answer : ANSWER: Y -- AN OR CIRCUIT
Description : The output Y of a 2-bit comparator is logic 1 whenever the 2-bit input A is greater than the 2-bit input B. The number of combinations for which the output is logic 1, is (A) 4 (B) 6 (C) 8 (D) 10
Last Answer : The output Y of a 2-bit comparator is logic 1 whenever the 2-bit input A is greater than the 2-bit input B. The number of combinations for which the output is logic 1, is 6
Description : What is the output when following statement is executed ? >>> print(‘x\97\x98’) a) Error b) 97 98 c) x\97 d) \x97\x98
Last Answer : c) x\97
Description : What is the output of the following? x = 123 for i in x: print(i) a) 1 2 3 b) 123 c) error d) none of the mentioned
Last Answer : c) error
Description : What is the output of the following? x = 'abcd' for i in range(len(x)): print(x) x = 'a' a) a b) abcd abcd abcd abcd c) a a a a d) none of the mentioned
Last Answer : d) none of the mentioned
Description : What is the output of the following? x = 'abcd' for i in range(len(x)): x = 'a' print(x) Page No 17 a) a b) abcd abcd abcd c) a a a a d) none of the mentioned
Last Answer : c) a a a a
Description : What is the output of the following? x = 'abcd' for i in range(len(x)): i.upper() print (x) a) a b c d b) 0 1 2 3 c) error d) none of the mentioned
Description : What is the output of the following? x = 'abcd' for i in x: print(i.upper()) a) a b c d b) A B C D c) a B C D d) error
Last Answer : b) A B C D
Description : What is the output of the following? x = "abcdef" i = "i" while i in x: print(i, end=" ") a) no output b) i i i i i i … c) a b c d e f
Last Answer : a) no output
Description : What is the output of the following? x = "abcdef" while i in x: print(i, end=" ") a) a b c d e f b) abcdef c) i i i i i i … d) error
Last Answer : d) error
Description : What is the output of the following? x = ['ab', 'cd'] for i in x: x.append(i.upper()) print(x) a) [‘AB’, ‘CD’]. b) [‘ab’, ‘cd’, ‘AB’, ‘CD’]. c) [‘ab’, ‘cd’]. d) none of the mentioned
Description : What is the output of the following? x = ['ab', 'cd'] for i in x: i.upper() print(x) a) [‘ab’, ‘cd’]. b) [‘AB’, ‘CD’]. c) [None, None]. d) none of the mentioned
Last Answer : a) [‘ab’, ‘cd’].
Description : What will be the output of the following ‘C’ code ? main ( ) { int x = 128; printf (“\n%d”, 1 + x++); } (A) 128 (B) 129 (C) 130 (D) 131
Last Answer : (B) 129
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 : State True or False i) A destructor never takes any argument nor does it return any value. ii) It releases memory space for future use. A) True, True B) True, False C) False, True D) False, False
Last Answer : A) True, True
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 : A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one ... ) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2
Last Answer : (C) both s1 and s2
Description : Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student ... ) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2
Last Answer : (B) Q.2 Explanation: First query gives stuid of students whose marks are greater than all students taking course 5. Second query gives stuid of students whose marks are greater than any student taking ... comparison is between maximum of marks by any student in course 5. So the answer is option D.
Description : Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock : I. 2-phase locking II. Time phase ordering (A) Both I & II (B) II only (C) I only (D) Neither I nor II
Last Answer : (B) II only
Description : Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock ? (a) 2-phase Locking (b) Time stamp - ordering (A) Both (a) and (b) (B) (a) only (C) (b) only (D) Neither (a) nor (b)
Last Answer : (C) (b) only
Description : Which of the following is/are correct with reference to Abstract class and interface ? (a) A class can inherit only one Abstract class but may inherit several interfaces. (b) An Abstract class can provide complete and default ... true (C) Both (a) and (b) are true (D) Neither (a) nor (b) is true
Description : Which of the following are facts about a top-down software testing approach? I. Top-down testing typically requires the tester to build method stubs. II. Top-down testing typically requires the tester to build test drivers. (1) only I (2) Only II (3) Both I and II (4) Neither I nor II
Last Answer : (1) only I
Description : Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a ... (1) only I (2) only II (3) both I and II (4) neither I nor II