July 31, 2017
1. The Boolean function [~ (~p˄q)˄~(~p˄~q)]˅(p˄r) is equal to the Boolean function:
(A) q (B) p˄r
(C) p˅q (D) p
Answer: D
2. 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˅↔
Answer: B
3. Let A and B be sets in a finite universal set U. Given the following:
|A – B|, |AÅB|, |A|+|B| and |AÈB|
Which of the following is in order of increasing size ?
(A) |A – B| ≤ |AÅB| ≤ |A| + |B| ≤ |AÈB|
(B) |AÅB| ≤ |A – B| ≤ |AÈB| ≤ |A| + |B|
(C) |AÅB| ≤ |A| + |B| ≤ |A – B| ≤ |AÈB|
(D) |A – B| ≤ |AÅB| ≤ |AÈB| ≤ |A| + |B|
Answer: D
4. What is the probability that a randomly selected bit string of length 10 is a palindrome?
(A) 1/64 (B) 1/32
(C) 1/8 (D) ¼
Answer: B
5. Given the following graphs :
Which of the following is correct?
(A) G1 contains Euler circuit and G2 does not contain Euler circuit.
(B) G1 does not contain Euler circuit and G2 contains Euler circuit.
(C) Both G1 and G2 do not contain Euler circuit.
(D) Both G1 and G2 contain Euler circuit.
Answer: C
6. The octal number 326.4 is equivalent to
(A) (214.2)10 and (D6.8)16 (B) (212.5)10 and (D6.8)16
(C) (214.5)10 and (D6.8)16 (D) (214.5)10 and (D6.4)16
Answer: C
7. Which of the following is the most efficient to perform arithmetic operations on the numbers?
(A) Sign-magnitude (B) 1’s complement
(C) 2’s complement (D) 9’s complement
Answer: C
8. The Karnaugh map for a Boolean function is given as
The simplified Boolean equation for the above Karnaugh Map is
(A) AB + CD + AB’ + AD (B) AB + AC + AD + BCD
(C) AB + AD + BC + ACD (D) AB + AC + BC + BCD
Answer: B
9. Which of the following logic operations is performed by the following given combinational circuit ?
(A) EXCLUSIVE-OR (B) EXCLUSIVE-NOR
(C) NAND (D) NOR
Answer: A
10. Match the following:
List – I List – II
a. Controlled Inverter i. a circuit that can add 3 bits
b. Full adder ii. a circuit that can add two binary numbers
c. Half adder iii. a circuit that transmits a binary word or its
1’s complement
d. Binary adder iv. a logic circuit that adds 2 bits
Codes :
a b c d
(A) iii ii iv i
(B) ii iv i iii
(C) iii iv i ii
(D) iii i iv ii
Answer: D
11. Given i= 0, j = 1, k = – 1
x = 0.5, y = 0.0
What is the output of given ‘C’ expression ?
x * 3 & & 3 || j | k
(A) -1 (B) 0
(C) 1 (D) 2
Answer: C
12. The following ‘C’ statement :
int * f[ ]( );
declares :
(A) A function returning a pointer to an array of integers.
(B) Array of functions returning pointers to integers.
(C) A function returning an array of pointers to integers.
(D) An illegal statement.
Answer: B
13. If a function is friend of a class, which one of the following is wrong ?
(A) A function can only be declared a friend by a class itself.
(B) Friend functions are not members of a class, they are associated with it.
(C) Friend functions are members of a class.
(D) It can have access to all members of the class, even private ones.
Answer: C
14. In C++, polymorphism requires:
(A) Inheritance only
(B) Virtual functions only
(C) References only
(D) Inheritance, Virtual functions and references
Answer: D
15. A function template in C++ provides ............ level of generalization.
(A) 4 (B) 3
(C) 2 (D) 1
Answer: C
16. DBMS provides the facility of accessing data from a database through
(A) DDL (B) DML
(C) DBA (D) Schema
Answer: B
17. Relational database schema normalization is NOT for:
(A) reducing the number of joins required to satisfy a query.
(B) eliminating uncontrolled redundancy of data stored in the database.
(C) eliminating number of anomalies that could otherwise occur with inserts and deletes.
(D) ensuring that functional dependencies are enforced.
Answer: A
18. Consider the following statements regarding relational database model:
(a) NULL values can be used to opt a tuple out of enforcement of a foreign key.
(b) Suppose that table T has only one candidate key. If Q is in 3NF, then it is also in BCNF.
(c) The difference between the project operator (P) in relational algebra and the SELECT keyword in SQL is that if the resulting table/set has more than one occurrences of the same tuple, then P will return only one of them, while SQL SELECT will return all.
One can determine that:
(A) (a) and (b) are true. (B) (a) and (c) are true.
(C) (b) and (c) are true. (D) (a), (b) and (c) are true.
Answer: D
19. Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram:
If different symbols stand for different values (e.g., t1 is definitely not equal to t2), then which of the above could not be the relationship set for the E-R diagram ?
(A) I only (B) I and II only
(C) II only (D) I, II and III
Answer: A
20. Consider a database table R with attributes A and B. Which of the following SQL queries is illegal ?
(A) SELECT A FROM R;
(B) SELECT A, COUNT(*) FROM R;
(C) SELECT A, COUNT(*) FROM R GROUP BY A;
(D) SELECT A, B, COUNT(*) FROM R GROUP BY A, B;
Answer: B
21. Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ?
(A) Insertion at the front of the linked list.
(B) Insertion at the end of the linked list.
(C) Deletion of the front node of the linked list.
(D) Deletion of the last node of the linked list.
Answer: D
22. Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a – c| ≤ 1 or |b–d| ≤ 1. The number of edges in this graph is
(A) 726 (B) 796
(C) 506 (D) 616
Answer: D
23. The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is
(A) O(lg n) (B) O(n lg n)
(C) O(n) (D) O(n2)
Answer: C
24. Consider the following statements :
S1: A queue can be implemented using two stacks.
S2: A stack can be implemented using two queues.
Which of the following is correct ?
(A) S1 is correct and S2 is not correct.
(B) S1 is not correct and S2 is correct.
(C) Both S1 and S2 are correct.
(D) Both S1 and S2 are not correct.
Answer: C
25. 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
Answer: C
26. Which of the following statements is not true with respect to microwaves?
(A) Electromagnetic waves with frequencies from 300 GHz to 400 THz.
(B) Propagation is line-of-sight.
(C) Very high-frequency waves cannot penetrate walls.
(D) Use of certain portions of the band requires permission from authorities.
Answer: A
27. In a fast Ethernet cabling, 100 Base-TX uses ........... cable and maximum segment size is ............
(A) twisted pair, 100 metres (B) twisted pair, 200 metres
(C) fibre optics, 1000 metres (D) fibre optics, 2000 metres
Answer: A
28. A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network ?
(A) 1 Mbps (B) 2 Mbps
(C) 10 Mbps (D) 12 Mbps
Answer: B
29. Match the following:
List – I List – II
a. Session layer i. Virtual terminal software
b. Application layer ii. Semantics of the information transmitted
c. Presentation layer iii. Flow control
d. Transport layer iv. Manage dialogue control
Codes :
a b c d
(A) iv i ii iii
(B) i iv ii iii
(C) iv i iii ii
(D) iv ii i iii
Answer: A
30. Which of the following protocols is used by email server to maintain a central repository that can be accessed from any machine?
(A) POP3 (B) IMAP
(C) SMTP (D) DMSP
Answer: B
31. 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
Answer: C
32. The content of the accumulator after the execution of the following 8085 assembly language program, is
MVI A, 35H
MOV B, A
STC
CMC
RAR
XRA B
(A) 00H (B) 35H
(C) EFH (D) 2FH
Answer: D
33. In compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction?
(A) Replace P + P by 2 * P or Replace 3 + 4 by 7.
(B) Replace P * 32 by P<<5
(C) Replace P * 0 by 0
(D) Replace (P<<4) – P by P * 15
Answer: B
34. Which of the following are the principles tasks of the linker?
I. Resolve external references among separately compiled program units.
II. Translate assembly language to machine code.
III. Relocate code and data relative to the beginning of the program.
IV. Enforce access-control restrictions on system libraries.
(A) I and II (B) I and III
(C) II and III (D) I and IV
Answer: B
35. Which of the following is FALSE?
(A) The grammar S→aS|aSbS|Î, where S is the only non-terminal symbol, and Î is the null string, is ambiguous.
(B) An unambiguous grammar has same left most and right most derivation.
(C) An ambiguous grammar can never be LR(k) for any k.
(D) Recursive descent parser is a top-down parser.
Answer: B
36. 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 and wants S & T
process E holds T and wants V
process F holds W and wants S
process G holds V and wants U
Is the system deadlocked ? If yes, ............. processes are deadlocked.
(A) No (B) Yes, A, B, C
(C) Yes, D, E, G (D) Yes, A, B, F
Answer: C
37. Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string.
0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1
(A) 11 (B) 12
(C) 10 (D) 9
Answer: A
38. Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur?
(A) 70 (B) 14
(C) 13 (D) 7
Answer: B
39. Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < x < 5.
(A) B, A, D, E, C (B) C, E, D, B, A
(C) E, D, C, B, A (D) C, B, A, E, D
Answer: B
40. 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 (pre-emptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted).
(A) 3 (B) 2
(C) 4 (D) 5
Answer: A
41. Which of the following is used to determine the specificity of requirements ?
(A) n1/n2 (B) n2/n1
(C) n1+n2 (D) n1–n2
Where n1 is the number of requirements for which all reviewers have identical interpretations, n2 is number of requirements in a specification.
Answer: A
42. The major shortcoming of waterfall model is
(A) the difficulty in accommodating changes after requirement analysis.
(B) the difficult in accommodating changes after feasibility analysis.
(C) the system testing.
(D) the maintenance of system.
Answer: A
43. The quick design of a software that is visible to end users leads to ............
(A) iterative model (B) prototype model
(C) spiral model (D) waterfall model
Answer: B
44. For a program of k variables, boundary value analysis yields .............. test cases.
(A) 4k – 1 (B) 4k
(C) 4k + 1 (D) 2k – 1
Answer: C
45. The extent to which a software performs its intended functions without failures, is termed as
(A) Robustness (B) Correctness
(C) Reliability (D) Accuracy
Answer: C
46. An attacker sits between the sender and receiver and captures the information and retransmits to the receiver after some time without altering the information. This attack is called as ..............
(A) Denial of service attack (B) Masquarade attack
(C) Simple attack (D) Complex attack
Answer: A
47. ................. is subject oriented, integrated, time variant, non-volatile collection of data in support of management decisions.
(A) Data mining (B) Web mining
(C) Data warehouse (D) Database Management System
Answer: C
48. In Data mining, classification rules are extracted from ..............
(A) Data (B) Information
(C) Decision Tree (D) Database
Answer: C
49. Discovery of cross sales opportunities is called as ...............
(A) Association (B) Visualization
(C) Correlation (D) Segmentation
Answer: A
50. In Data mining, .............. is a method of incremental conceptual clustering.
(A) STRING (B) COBWEB
(C) CORBA (D) OLAD
Answer: B
