INFORMATION TECHNOLOGY MCQs
INFORMATION TECHNOLOGY MCQs
Q.1 A binary operation ⊕ on a set
of integers is defined as 22 +=⊕ yxyx .
Which one of the following statements is TRUE about ⊕?
(A) Commutative but not associative
(B) Both commutative and associative
(C) Associative but not commutative
(D) Neither commutative nor associative
Q.2 Suppose p is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than 3 cars during any given minute in this interval?
(A) 8/(2e3 )
(B) 9/(2e3 )
(C) 17/(2e3 )
(D) 26/(2e3 )
Q.3 Which one of the following does NOT equal 2 2 2 1 1 1 zz yy x x ?
(A) ( ) ( ) ( ) 111 111 111 ++ ++ + + zzz yyy xxx
(B) 111 111 111 2 2 2 ++ ++ ++ zz yy xx
(C) 2 1 0 0 22 22 zz zyzy yxyx −− −−
(D) 2 22 22 1 2 2 zz zyzy yxyx ++ ++
Q.4 The smallest integer that can be represented by an 8-bit number in 2’s complement form is
(A) -256
(B) -128
(C) -127
(D) 0
Q.5 In the following truth table, V = 1 if and only if the input is valid. Inputs Outputs D0 D1 D2 D3 X0 X1 V 0 0 0 0 x x 0 1 0 0 0 0 0 1 x 1 0 0 0 1 1 x x 1 0 1 0 1 x x x 1 1 1 1 What function does the truth table represent?
(A) Priority encoder
(B) Decoder
(C) Multiplexer
(D) Demultiplexer
Q.6 Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
(A) O(log n)
(B) O(n)
(C) O(n log n)
(D) O(n 2 )
Q.7 Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)
Q.8 Consider the languages L1 =Φ and 2 ={aL }. Which one of the following represents L L L 1 2 1 ∗ ∗ U ?
(A) {Ñ”}
(B) Φ
(C) a*
(D) {Ñ”, a}
Q.9 What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → Ñ” and A → a) to parse a string with n tokens?
(A) n/2
(B) n-1
(C) 2n-1
(D) 2n
Q.10 A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
(A) This algorithm is equivalent to the first-come-first-serve algorithm.
(B) This algorithm is equivalent to the round-robin algorithm.
(C) This algorithm is equivalent to the shortest-job-first algorithm.
(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm.
Q.11 Match the problem domains in GROUP I with the solution technologies in GROUP II. GROUP I GROUP II (P) Service oriented computing (1) Interoperability (Q) Heterogeneous communicating systems (2) BPMN (R) Information representation (3) Publish-find-bind (S) Process description (4) XML
(A) P-1, Q-2, R-3, S-4
(B) P-3, Q-4, R-2, S-1
(C) P-3, Q-1, R-4, S-2
(D) P-4, Q-3, R-2, S-1
Q.12 The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
(A) TCP, UDP, UDP and TCP
(B) UDP, TCP, TCP and UDP
(C) UDP, TCP, UDP and TCP
(D) TCP, UDP, TCP and UDP
Q.13 Using public key cryptography, X adds a digital signature σ to message M, encrypts, and sends it to Y, where it is
decrypted. Which one of the following sequences of keys is used for the
operations?
(A) Encryption: X’s private key followed by Y’s private key; Decryption:
X’s public key followed by Y’s public key
(B) Encryption: X’s private key
followed by Y’s public key; Decryption: X’s public key followed by Y’s private
key
(C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s
public key followed by X’s private key
(D) Encryption: X’s private key followed
by Y’s public key; Decryption: Y’s private key followed by X’s public key
(A) Commutative but not associative
(B) Both commutative and associative
(C) Associative but not commutative
(D) Neither commutative nor associative
Q.2 Suppose p is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than 3 cars during any given minute in this interval?
(A) 8/(2e3 )
(B) 9/(2e3 )
(C) 17/(2e3 )
(D) 26/(2e3 )
Q.3 Which one of the following does NOT equal 2 2 2 1 1 1 zz yy x x ?
(A) ( ) ( ) ( ) 111 111 111 ++ ++ + + zzz yyy xxx
(B) 111 111 111 2 2 2 ++ ++ ++ zz yy xx
(C) 2 1 0 0 22 22 zz zyzy yxyx −− −−
(D) 2 22 22 1 2 2 zz zyzy yxyx ++ ++
Q.4 The smallest integer that can be represented by an 8-bit number in 2’s complement form is
(A) -256
(B) -128
(C) -127
(D) 0
Q.5 In the following truth table, V = 1 if and only if the input is valid. Inputs Outputs D0 D1 D2 D3 X0 X1 V 0 0 0 0 x x 0 1 0 0 0 0 0 1 x 1 0 0 0 1 1 x x 1 0 1 0 1 x x x 1 1 1 1 What function does the truth table represent?
(A) Priority encoder
(B) Decoder
(C) Multiplexer
(D) Demultiplexer
Q.6 Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
(A) O(log n)
(B) O(n)
(C) O(n log n)
(D) O(n 2 )
Q.7 Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)
Q.8 Consider the languages L1 =Φ and 2 ={aL }. Which one of the following represents L L L 1 2 1 ∗ ∗ U ?
(A) {Ñ”}
(B) Φ
(C) a*
(D) {Ñ”, a}
Q.9 What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → Ñ” and A → a) to parse a string with n tokens?
(A) n/2
(B) n-1
(C) 2n-1
(D) 2n
Q.10 A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
(A) This algorithm is equivalent to the first-come-first-serve algorithm.
(B) This algorithm is equivalent to the round-robin algorithm.
(C) This algorithm is equivalent to the shortest-job-first algorithm.
(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm.
Q.11 Match the problem domains in GROUP I with the solution technologies in GROUP II. GROUP I GROUP II (P) Service oriented computing (1) Interoperability (Q) Heterogeneous communicating systems (2) BPMN (R) Information representation (3) Publish-find-bind (S) Process description (4) XML
(A) P-1, Q-2, R-3, S-4
(B) P-3, Q-4, R-2, S-1
(C) P-3, Q-1, R-4, S-2
(D) P-4, Q-3, R-2, S-1
Q.12 The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
(A) TCP, UDP, UDP and TCP
(B) UDP, TCP, TCP and UDP
(C) UDP, TCP, UDP and TCP
(D) TCP, UDP, TCP and UDP
Q.13 Using public key cryptography, X adds a digital signature σ to message M, encrypts
No comments