SlideShare a Scribd company logo
1 of 8
1
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.
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
2
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 & 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
3
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
4
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 Answer: A
Where n1 is the number of requirements for which all reviewers have identical interpretations, n2 is number of requirements in
a specification.
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
july2016
How many different equivalence relations with exactly three different equivalence classes are there on a set with five
elements?
(A) 10 (B) 15 (C) 25 (D) 30 Answer: C
2. The number of different spanning trees in complete graph, K4 and bipartite graph K2,2 have .......... and .....….
respectively.
(A) 14, 14 (B) 16, 14 (C) 16, 4 (D) 14, 4 Answer: C
3. Suppose that R1 and R2 are reflexive relations on a set A.
Which of the following statements is correct?
(A) R1∩R2 is reflexive and R1UR2 is irreflexive. (B) R1∩R2 is irreflexive and R1UR2 is reflexive.
(C) Both R1∩R2 and R1UR2 are reflexive. (D) Both R1∩R2 and R1UR2 are irreflexive. Answer: C
4. There are three cards in a box. Both sides of one card are black, both sides of one card are red, and the third card has
one black side and one red side. We pick a card at random and observe only one side.
What is the probability that the opposite side is the same colour as the one side we observed?
(A) 3/4 (B) 2/3 (C) 1/2 (D) 1/3 Answer: B
5. A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How
many cliques are there in the graph shown below?
(A) 2 (B) 4 (C) 5 (D) 6 Answer: C
5
6. 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
Answer: C
7. The IEEE-754 double-precision format to represent floating point numbers, has a length of ........... bits.
(A) 16 (B) 32 (C) 48 (D) 64
Answer: D
8. Simplified Boolean equation for the following truth table is:
x y z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0
(A) F = yz’ + y’z (B) F = xy’ + x’y (C) F = x’z + xz’ (D) F = x’z + xz’ + xyz
Answer: C
9. The simplified form of a Boolean equation (AB’+AB’C+AC)(A’C’+B’) is :
(A) AB’ (B) AB’C (C) A’B (D) ABC Answer: A
10. In a positive-edge-triggered JK flip-flop, if J and K both are high then the output will be ............. on the rising edge of the
clock.
(A) No change (B) Set (C) Reset (D) Toggle Answer: D
11. Given i=0, j=1, k=-1
x=0.5, y=0.0
What is the output of the following expression in C language?
x * y < i + j || k
(A) -1 (B) 0 (C) 1 (D) 2 Answer: C
12. The following statement in ‘C’
int(*f())[];
declares
(A) a function returning a pointer to an array of integers. (B) a function returning an array of pointers to integers.
(C) array of functions returning pointers to integers. (D) an illegal statement. Answer: A
13. Which one of the following is correct, when a class grants friend status to another class?
(A) The member functions of the class generating friendship can access the members of the friend class.
(B) All member functions of the class granted friendship have unrestricted access to the members of the class granting the
friendship.
(C) Class friendship is reciprocal to each other
(D) There is no such concept. Answer: B
14. When a method in a subclass has the same name and type signatures as a method in the superclass, then the method
in the subclass .................. the method in the superclass.
(A) Overloads (B) Friendships (C) Inherits (D) Overrides Answer: D
15. 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 Answer: A
16. In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as:
(A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency Answer: C
17. Which of the following statement(s) is/are FALSE in the context of Relational DBMS ?
I. Views in a database system are important because they help with access control by allowing users to see only a part icular
subset of the data in the database.
II. E-R diagrams are useful to logically model concepts.
III. An update anomaly is when it is not possible to store information unless some other, unrelated information is stored as
well.
IV. SQL is a procedural language.
(A) I and IV only (B) III and IV only (C) I, II and III only (D) II, III and IV only Answer: B
18. In a relational database model, NULL values can be used for all but which one of the following?
(A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.
(B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string
columns.
(C) To leave columns in a tuple marked as “unknown” when the actual value is unknown.
(D) To fill a column in a tuple when that column does not really “exist” for that particular tuple. Answer: A
19. Consider the following two commands C1 and C2 on the relation R from an SQL database:
C1: drop table R;
C2: delete from R;
6
Which of the following statements is TRUE?
I. Both C1 and C2 delete the schema for R.
II. C2 retains relation R, but deletes all tuples in R.
III. C1 deletes not only all tuples of R, but also the schema for R.
(A) I only (B) I and II only (C) II and III only (D) I, II and III Answer: C
20. Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II,
III and IV) for this table:
A B C D
a1 b1 c1 d1
a2 b3 c3 d1
a1 b2 c1 d2
I: {B} II: {B, C} III: {A, D} IV: {C, D}
If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could
not be the candidate key for the database table?
(A) I and III only (B) III and IV only (C) II only (D) I only Answer: *
21. Consider the following binary search tree:
If we remove the root node, which of the node from the left subtree will be the new root?
(A) 11 (B) 12 (C) 13 (D) 16 Answer: D
22. Consider the following operations performed on a stack of size 5:
Push(a); Pop(); Push(b); Push(c); Pop();
Push(d); Pop(); Pop(); Push(e);
Which of the following statements is correct?
(A) Underflow occurs (B) Stack operations are performed smoothly (C) Overflow occurs (D) None of the above
Answer: B
23. Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The
maximum height of the tree will be
(A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2 Answer: C
24. 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
Answer: C
25. 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 Answer: B
26. A multiplexer combines four 100-Kbps channels using a time slot of 2 bits. What is the bit rate?
(A) 100 Kbps (B) 200 Kbps (C) 400 kbps (D) 1000 Kbps Answer: C
27. In a fully-connected mesh network with 10 computers, total .............. number of cables are required and ................
number of ports are required for each device.
(A) 40, 9 (B) 45, 10 (C) 45, 9 (D) 50, 10 Answer: C
28. In TCP/IP Reference model, the job of ............... layer is to permit hosts to inject packets into any network and travel
them independently to the destination.
(A) Physical (B) Transport (C) Application (D) Host-to-network Answer: D
29. If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of
secret keys required will be:
(A) N (B) (N-1) (C) N(N-1)/2 (D) N(N+1)/2 Answer: C
30. Optical fiber uses reflection to guide light through a channel, in which angle of incidence is ................. the critical angle.
(A) equal to (B) less than (C) greater than (D) less than or equal to Answer: C
31. 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 Answer: D]
32. The content of the accumulator after the execution of the following 8085 assembly language program, is:
MVI A, 42H
MVI B, 05H
UGC: ADD B
7
DCR B
JNZ UGC
ADI 25H
HLT
(A) 82 H (B) 78 H (C) 76 H (D) 47 H Answer: C
33. In .............., the bodies of the two loops are merged together to form a single loop provided that they do not make any
references to each other.
(A) Loop unrolling (B) Strength reduction (C) Loop concatenation (D) Loop jamming Answer: D
34. Which of the following is not typically a benefit of dynamic linking?
I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory.
III. Reduction in overall space consumption on disk. IV. Reduction in the cost of software updates.
(A) I and IV (B) I only (C) II and III (D) IV only Answer: B
35. Which of the following is FALSE ?
(A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous.
(B) SLR is powerful than LALR.
(C) An LL(1) parser is a top-down parser.
(D) YACC tool is an LALR(1) parser generator. Answer: B
36. Consider the reference string
0 1 2 3 0 1 4 0 1 2 3 4
If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are
.......... and ........... respectively.
(A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10 Answer: D
37. Suppose there are four processes in execution with 12 instances of a Resource R in a system.
The maximum need of each process and current allocation are given below:
Process Max. Need Current Allocation
P1 8 3
P2 9 4
P3 5 2
P4 3 1
With reference to current allocation, is system safe? If so, what is the safe sequence?
(A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4 Answer: C
38. If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if
the disk queue of I/O blocks requests are:
98, 37, 14, 124, 65, 67
(A) 320 (B) 322 (C) 321 (D) 319 Answer: C
39. In UNIX, ............ creates three subdirectories: 'PIS' and two subdirectories 'progs' and ‘data’ from just created
subdirectory 'PIS'.
(A) mdkir PIS/progs PIS/data PIS (B) mkdir PIS progs data
(C) mkdir PIS PIS/progs PIS/data (D) mkdir PIS/progs data Answer: C
40. A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority
zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be
scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements ............criteria.
(A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS Answer: B
41. If S1 is total number of modules defined in the program architecture, S3 is the number of modules whose correct
function depends on prior processing then the number of modules not dependent on prior processing is:
(A) 1 + S3/S1 (B) 1 - S3/S1 (C) 1 + S1/S3 (D) 1 - S1/S3 Answer: B
42. The ................ model is preferred for software development when the requirements are not clear.
(A) Rapid Application Development (B) Rational Unified Process (C) Evolutionary Model (D) Waterfall Model Answer: C
43. Which of the following is not included in waterfall model ?
(A) Requirement analysis (B) Risk analysis (C) Design (D) Coding Answer: B
44. The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is:
(A) P + 1 (B) P – 1 (C) P - 2 (D) P + 2 Answer: A
Where P is number of predicate nodes in flow graph V(G).
45. The extent to which a software tolerates the unexpected problems, is termed as:
(A) Accuracy (B) Reliability (C) Correctness (D) Robustness Answer: D
46. An attacker sits between customer and Banker, and captures the information from the customer and retransmits to the
banker by altering the information. This attack is called as ..............
(A) Masquerade Attack (B) Replay Attack C) Passive Attack (D) Denial of Service Attack Answer: B
47. Consider the following two statements:
(a) Business intelligence and Data warehousing is used for forecasting and Data mining.
(b) Business intelligence and Data warehousing is used for analysis of large volumes of sales data.
Which one of the following options is correct?
(A) (a) is true, (b) is false (B) Both (a) and (b) are true (C) (a) is false, (b) is true (D) Both (a) and (b) are false
Answer: B
8
48. Pipelining improves performance by:
(A) decreasing instruction latency (B) eliminating data hazards
(C) exploiting instruction level parallelism (D) decreasing the cache miss rate Answer: C
49. Consider the following two statements :
(a) Data scrubling is a process to upgrade the quality of data, before it is moved into Data warehouse.
(b) Data scrubling is a process of rejecting data from data warehouse to create indexes.
Which one of the following options is correct ?
(A) (a) is true, (b) is false (B) (a) is false, (b) is true (C) Both (a) and (b) are false (D) Both (a) and (b) are true
Answer: A
50. 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
Answer: D
Read more: http://www.netcomputerscience.com/2016/07/cbse-ugc-net-computer-science-paper-ii-solved-july-2016-
p5.html#ixzz4OBlXfPxU

More Related Content

What's hot

2015 16combinepdf
2015 16combinepdf2015 16combinepdf
2015 16combinepdfmadhesi
 
Ugcnet4 u
Ugcnet4 uUgcnet4 u
Ugcnet4 usadhi
 
Gate Previous Years Papers
Gate Previous Years PapersGate Previous Years Papers
Gate Previous Years PapersRahul Jain
 
Gate Previous Years Papers
Gate Previous Years PapersGate Previous Years Papers
Gate Previous Years PapersRahul Jain
 
FPGA based BCH Decoder
FPGA based BCH DecoderFPGA based BCH Decoder
FPGA based BCH Decoderijsrd.com
 
Digital logic design1
Digital logic design1Digital logic design1
Digital logic design1jntuworld
 
Ds qb 2021 rma
Ds qb 2021 rmaDs qb 2021 rma
Ds qb 2021 rmaARAVINDRM2
 
An ElGamal Encryption Scheme of Adjacency Matrix and Finite Machines
An ElGamal Encryption Scheme of Adjacency Matrix and Finite MachinesAn ElGamal Encryption Scheme of Adjacency Matrix and Finite Machines
An ElGamal Encryption Scheme of Adjacency Matrix and Finite MachinesComputer Science Journals
 
Boolean algebra simplification and combination circuits
Boolean algebra simplification and combination circuitsBoolean algebra simplification and combination circuits
Boolean algebra simplification and combination circuitsJaipal Dhobale
 
Bca1040 imc1040 digital logic
Bca1040 imc1040  digital logicBca1040 imc1040  digital logic
Bca1040 imc1040 digital logicsmumbahelp
 
Bt0064, logic design
Bt0064, logic designBt0064, logic design
Bt0064, logic designsmumbahelp
 
Technical aptitude questions_e_book1
Technical aptitude questions_e_book1Technical aptitude questions_e_book1
Technical aptitude questions_e_book1Sateesh Allu
 

What's hot (20)

Gate-Cs 2009
Gate-Cs 2009Gate-Cs 2009
Gate-Cs 2009
 
DS Q&A
DS Q&ADS Q&A
DS Q&A
 
2015 16combinepdf
2015 16combinepdf2015 16combinepdf
2015 16combinepdf
 
Ugcnet4 u
Ugcnet4 uUgcnet4 u
Ugcnet4 u
 
Gate-Cs 1996
Gate-Cs 1996Gate-Cs 1996
Gate-Cs 1996
 
Gate Previous Years Papers
Gate Previous Years PapersGate Previous Years Papers
Gate Previous Years Papers
 
Gate Previous Years Papers
Gate Previous Years PapersGate Previous Years Papers
Gate Previous Years Papers
 
PECCS 2014
PECCS 2014PECCS 2014
PECCS 2014
 
FPGA based BCH Decoder
FPGA based BCH DecoderFPGA based BCH Decoder
FPGA based BCH Decoder
 
Digital logic design1
Digital logic design1Digital logic design1
Digital logic design1
 
Cs 2002
Cs 2002Cs 2002
Cs 2002
 
Ds qb 2021 rma
Ds qb 2021 rmaDs qb 2021 rma
Ds qb 2021 rma
 
ARIC Team Seminar
ARIC Team SeminarARIC Team Seminar
ARIC Team Seminar
 
An ElGamal Encryption Scheme of Adjacency Matrix and Finite Machines
An ElGamal Encryption Scheme of Adjacency Matrix and Finite MachinesAn ElGamal Encryption Scheme of Adjacency Matrix and Finite Machines
An ElGamal Encryption Scheme of Adjacency Matrix and Finite Machines
 
Boolean algebra simplification and combination circuits
Boolean algebra simplification and combination circuitsBoolean algebra simplification and combination circuits
Boolean algebra simplification and combination circuits
 
Soln dc05
Soln dc05Soln dc05
Soln dc05
 
Bca1040 imc1040 digital logic
Bca1040 imc1040  digital logicBca1040 imc1040  digital logic
Bca1040 imc1040 digital logic
 
Bt0064, logic design
Bt0064, logic designBt0064, logic design
Bt0064, logic design
 
Technical aptitude questions_e_book1
Technical aptitude questions_e_book1Technical aptitude questions_e_book1
Technical aptitude questions_e_book1
 
Gate-Cs 1994
Gate-Cs 1994Gate-Cs 1994
Gate-Cs 1994
 

Similar to NET_Solved ans

AP PGECET Computer Science 2016 question paper
AP PGECET Computer Science 2016 question paperAP PGECET Computer Science 2016 question paper
AP PGECET Computer Science 2016 question paperEneutron
 
important C questions and_answers praveensomesh
important C questions and_answers praveensomeshimportant C questions and_answers praveensomesh
important C questions and_answers praveensomeshpraveensomesh
 
AC14 AT11 Database Management Systems OBJECTIVE TYPE QUESTIONS
AC14 AT11 Database Management Systems OBJECTIVE TYPE QUESTIONSAC14 AT11 Database Management Systems OBJECTIVE TYPE QUESTIONS
AC14 AT11 Database Management Systems OBJECTIVE TYPE QUESTIONSCourtney Esco
 
(Www.entrance exam.net)-tcs placement sample paper 2
(Www.entrance exam.net)-tcs placement sample paper 2(Www.entrance exam.net)-tcs placement sample paper 2
(Www.entrance exam.net)-tcs placement sample paper 2Pamidimukkala Sivani
 
this pdf very much useful for embedded c programming students
this pdf very much useful for embedded c programming studentsthis pdf very much useful for embedded c programming students
this pdf very much useful for embedded c programming studentspavan81088
 
Computer programming mcqs
Computer programming mcqsComputer programming mcqs
Computer programming mcqssaadkhan672
 
CAPE Computer Science Unit 1 Paper 1 - Practice Paper
CAPE Computer Science Unit 1 Paper 1 - Practice PaperCAPE Computer Science Unit 1 Paper 1 - Practice Paper
CAPE Computer Science Unit 1 Paper 1 - Practice PaperAlex Stewart
 
Technical aptitude test 2 CSE
Technical aptitude test 2 CSETechnical aptitude test 2 CSE
Technical aptitude test 2 CSESujata Regoti
 
DS MCQS.pptx
DS MCQS.pptxDS MCQS.pptx
DS MCQS.pptxBoomijaIT
 
Data structure - mcqs
Data structure - mcqsData structure - mcqs
Data structure - mcqssuthi
 

Similar to NET_Solved ans (20)

AP PGECET Computer Science 2016 question paper
AP PGECET Computer Science 2016 question paperAP PGECET Computer Science 2016 question paper
AP PGECET Computer Science 2016 question paper
 
important C questions and_answers praveensomesh
important C questions and_answers praveensomeshimportant C questions and_answers praveensomesh
important C questions and_answers praveensomesh
 
Data structure part 2
Data structure part  2Data structure part  2
Data structure part 2
 
AC14 AT11 Database Management Systems OBJECTIVE TYPE QUESTIONS
AC14 AT11 Database Management Systems OBJECTIVE TYPE QUESTIONSAC14 AT11 Database Management Systems OBJECTIVE TYPE QUESTIONS
AC14 AT11 Database Management Systems OBJECTIVE TYPE QUESTIONS
 
Gate-Cs 2010
Gate-Cs 2010Gate-Cs 2010
Gate-Cs 2010
 
1
11
1
 
(Www.entrance exam.net)-tcs placement sample paper 2
(Www.entrance exam.net)-tcs placement sample paper 2(Www.entrance exam.net)-tcs placement sample paper 2
(Www.entrance exam.net)-tcs placement sample paper 2
 
Data structure part 1
Data structure part  1Data structure part  1
Data structure part 1
 
this pdf very much useful for embedded c programming students
this pdf very much useful for embedded c programming studentsthis pdf very much useful for embedded c programming students
this pdf very much useful for embedded c programming students
 
C MCQ
C MCQC MCQ
C MCQ
 
Sql
SqlSql
Sql
 
Gate-Cs 2008
Gate-Cs 2008Gate-Cs 2008
Gate-Cs 2008
 
Cs 2008(1)
Cs 2008(1)Cs 2008(1)
Cs 2008(1)
 
Computer programming mcqs
Computer programming mcqsComputer programming mcqs
Computer programming mcqs
 
CAPE Computer Science Unit 1 Paper 1 - Practice Paper
CAPE Computer Science Unit 1 Paper 1 - Practice PaperCAPE Computer Science Unit 1 Paper 1 - Practice Paper
CAPE Computer Science Unit 1 Paper 1 - Practice Paper
 
Technical aptitude test 2 CSE
Technical aptitude test 2 CSETechnical aptitude test 2 CSE
Technical aptitude test 2 CSE
 
DS MCQS.pptx
DS MCQS.pptxDS MCQS.pptx
DS MCQS.pptx
 
Data structure - mcqs
Data structure - mcqsData structure - mcqs
Data structure - mcqs
 
Gate-Cs 1998
Gate-Cs 1998Gate-Cs 1998
Gate-Cs 1998
 
Technical questions
Technical questionsTechnical questions
Technical questions
 

Recently uploaded

Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsPresiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsanshu789521
 
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfSumit Tiwari
 
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...Krashi Coaching
 
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxPOINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxSayali Powar
 
URLs and Routing in the Odoo 17 Website App
URLs and Routing in the Odoo 17 Website AppURLs and Routing in the Odoo 17 Website App
URLs and Routing in the Odoo 17 Website AppCeline George
 
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxheathfieldcps1
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactdawncurless
 
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
_Math 4-Q4 Week 5.pptx Steps in Collecting Data_Math 4-Q4 Week 5.pptx Steps in Collecting Data
_Math 4-Q4 Week 5.pptx Steps in Collecting DataJhengPantaleon
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityGeoBlogs
 
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media ComponentAlper Gobel In Media Res Media Component
Alper Gobel In Media Res Media ComponentInMediaRes1
 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxOH TEIK BIN
 
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon ACrayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon AUnboundStockton
 
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK  LOOKBOOK(1) (1).pdfBASLIQ CURRENT LOOKBOOK  LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdfSoniaTolstoy
 
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111Sapana Sha
 
Sanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdfSanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdfsanyamsingh5019
 
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptxVS Mahajan Coaching Centre
 
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...EduSkills OECD
 

Recently uploaded (20)

Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsPresiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
 
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
 
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
 
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxPOINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
 
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
 
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini  Delhi NCR9953330565 Low Rate Call Girls In Rohini  Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
 
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
 
URLs and Routing in the Odoo 17 Website App
URLs and Routing in the Odoo 17 Website AppURLs and Routing in the Odoo 17 Website App
URLs and Routing in the Odoo 17 Website App
 
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
 
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
_Math 4-Q4 Week 5.pptx Steps in Collecting Data_Math 4-Q4 Week 5.pptx Steps in Collecting Data
_Math 4-Q4 Week 5.pptx Steps in Collecting Data
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
 
Alper Gobel In Media Res Media Component
Alper Gobel In Media Res Media ComponentAlper Gobel In Media Res Media Component
Alper Gobel In Media Res Media Component
 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptx
 
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon ACrayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon A
 
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK  LOOKBOOK(1) (1).pdfBASLIQ CURRENT LOOKBOOK  LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
 
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111Call Girls in Dwarka Mor Delhi Contact Us 9654467111
Call Girls in Dwarka Mor Delhi Contact Us 9654467111
 
Sanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdfSanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdf
 
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
 
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
Presentation by Andreas Schleicher Tackling the School Absenteeism Crisis 30 ...
 

NET_Solved ans

  • 1. 1 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. 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
  • 2. 2 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 & 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
  • 3. 3 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
  • 4. 4 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 Answer: A Where n1 is the number of requirements for which all reviewers have identical interpretations, n2 is number of requirements in a specification. 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 july2016 How many different equivalence relations with exactly three different equivalence classes are there on a set with five elements? (A) 10 (B) 15 (C) 25 (D) 30 Answer: C 2. The number of different spanning trees in complete graph, K4 and bipartite graph K2,2 have .......... and .....…. respectively. (A) 14, 14 (B) 16, 14 (C) 16, 4 (D) 14, 4 Answer: C 3. Suppose that R1 and R2 are reflexive relations on a set A. Which of the following statements is correct? (A) R1∩R2 is reflexive and R1UR2 is irreflexive. (B) R1∩R2 is irreflexive and R1UR2 is reflexive. (C) Both R1∩R2 and R1UR2 are reflexive. (D) Both R1∩R2 and R1UR2 are irreflexive. Answer: C 4. There are three cards in a box. Both sides of one card are black, both sides of one card are red, and the third card has one black side and one red side. We pick a card at random and observe only one side. What is the probability that the opposite side is the same colour as the one side we observed? (A) 3/4 (B) 2/3 (C) 1/2 (D) 1/3 Answer: B 5. A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below? (A) 2 (B) 4 (C) 5 (D) 6 Answer: C
  • 5. 5 6. 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 Answer: C 7. The IEEE-754 double-precision format to represent floating point numbers, has a length of ........... bits. (A) 16 (B) 32 (C) 48 (D) 64 Answer: D 8. Simplified Boolean equation for the following truth table is: x y z F 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 0 (A) F = yz’ + y’z (B) F = xy’ + x’y (C) F = x’z + xz’ (D) F = x’z + xz’ + xyz Answer: C 9. The simplified form of a Boolean equation (AB’+AB’C+AC)(A’C’+B’) is : (A) AB’ (B) AB’C (C) A’B (D) ABC Answer: A 10. In a positive-edge-triggered JK flip-flop, if J and K both are high then the output will be ............. on the rising edge of the clock. (A) No change (B) Set (C) Reset (D) Toggle Answer: D 11. Given i=0, j=1, k=-1 x=0.5, y=0.0 What is the output of the following expression in C language? x * y < i + j || k (A) -1 (B) 0 (C) 1 (D) 2 Answer: C 12. The following statement in ‘C’ int(*f())[]; declares (A) a function returning a pointer to an array of integers. (B) a function returning an array of pointers to integers. (C) array of functions returning pointers to integers. (D) an illegal statement. Answer: A 13. Which one of the following is correct, when a class grants friend status to another class? (A) The member functions of the class generating friendship can access the members of the friend class. (B) All member functions of the class granted friendship have unrestricted access to the members of the class granting the friendship. (C) Class friendship is reciprocal to each other (D) There is no such concept. Answer: B 14. When a method in a subclass has the same name and type signatures as a method in the superclass, then the method in the subclass .................. the method in the superclass. (A) Overloads (B) Friendships (C) Inherits (D) Overrides Answer: D 15. 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 Answer: A 16. In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency Answer: C 17. Which of the following statement(s) is/are FALSE in the context of Relational DBMS ? I. Views in a database system are important because they help with access control by allowing users to see only a part icular subset of the data in the database. II. E-R diagrams are useful to logically model concepts. III. An update anomaly is when it is not possible to store information unless some other, unrelated information is stored as well. IV. SQL is a procedural language. (A) I and IV only (B) III and IV only (C) I, II and III only (D) II, III and IV only Answer: B 18. In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string columns. (C) To leave columns in a tuple marked as “unknown” when the actual value is unknown. (D) To fill a column in a tuple when that column does not really “exist” for that particular tuple. Answer: A 19. Consider the following two commands C1 and C2 on the relation R from an SQL database: C1: drop table R; C2: delete from R;
  • 6. 6 Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 retains relation R, but deletes all tuples in R. III. C1 deletes not only all tuples of R, but also the schema for R. (A) I only (B) I and II only (C) II and III only (D) I, II and III Answer: C 20. Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: A B C D a1 b1 c1 d1 a2 b3 c3 d1 a1 b2 c1 d2 I: {B} II: {B, C} III: {A, D} IV: {C, D} If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table? (A) I and III only (B) III and IV only (C) II only (D) I only Answer: * 21. Consider the following binary search tree: If we remove the root node, which of the node from the left subtree will be the new root? (A) 11 (B) 12 (C) 13 (D) 16 Answer: D 22. Consider the following operations performed on a stack of size 5: Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e); Which of the following statements is correct? (A) Underflow occurs (B) Stack operations are performed smoothly (C) Overflow occurs (D) None of the above Answer: B 23. Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2 Answer: C 24. 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 Answer: C 25. 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 Answer: B 26. A multiplexer combines four 100-Kbps channels using a time slot of 2 bits. What is the bit rate? (A) 100 Kbps (B) 200 Kbps (C) 400 kbps (D) 1000 Kbps Answer: C 27. In a fully-connected mesh network with 10 computers, total .............. number of cables are required and ................ number of ports are required for each device. (A) 40, 9 (B) 45, 10 (C) 45, 9 (D) 50, 10 Answer: C 28. In TCP/IP Reference model, the job of ............... layer is to permit hosts to inject packets into any network and travel them independently to the destination. (A) Physical (B) Transport (C) Application (D) Host-to-network Answer: D 29. If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be: (A) N (B) (N-1) (C) N(N-1)/2 (D) N(N+1)/2 Answer: C 30. Optical fiber uses reflection to guide light through a channel, in which angle of incidence is ................. the critical angle. (A) equal to (B) less than (C) greater than (D) less than or equal to Answer: C 31. 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 Answer: D] 32. The content of the accumulator after the execution of the following 8085 assembly language program, is: MVI A, 42H MVI B, 05H UGC: ADD B
  • 7. 7 DCR B JNZ UGC ADI 25H HLT (A) 82 H (B) 78 H (C) 76 H (D) 47 H Answer: C 33. In .............., the bodies of the two loops are merged together to form a single loop provided that they do not make any references to each other. (A) Loop unrolling (B) Strength reduction (C) Loop concatenation (D) Loop jamming Answer: D 34. Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. Reduction in the cost of software updates. (A) I and IV (B) I only (C) II and III (D) IV only Answer: B 35. Which of the following is FALSE ? (A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. (B) SLR is powerful than LALR. (C) An LL(1) parser is a top-down parser. (D) YACC tool is an LALR(1) parser generator. Answer: B 36. Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10 Answer: D 37. Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: Process Max. Need Current Allocation P1 8 3 P2 9 4 P3 5 2 P4 3 1 With reference to current allocation, is system safe? If so, what is the safe sequence? (A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4 Answer: C 38. If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319 Answer: C 39. In UNIX, ............ creates three subdirectories: 'PIS' and two subdirectories 'progs' and ‘data’ from just created subdirectory 'PIS'. (A) mdkir PIS/progs PIS/data PIS (B) mkdir PIS progs data (C) mkdir PIS PIS/progs PIS/data (D) mkdir PIS/progs data Answer: C 40. A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements ............criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS Answer: B 41. If S1 is total number of modules defined in the program architecture, S3 is the number of modules whose correct function depends on prior processing then the number of modules not dependent on prior processing is: (A) 1 + S3/S1 (B) 1 - S3/S1 (C) 1 + S1/S3 (D) 1 - S1/S3 Answer: B 42. The ................ model is preferred for software development when the requirements are not clear. (A) Rapid Application Development (B) Rational Unified Process (C) Evolutionary Model (D) Waterfall Model Answer: C 43. Which of the following is not included in waterfall model ? (A) Requirement analysis (B) Risk analysis (C) Design (D) Coding Answer: B 44. The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: (A) P + 1 (B) P – 1 (C) P - 2 (D) P + 2 Answer: A Where P is number of predicate nodes in flow graph V(G). 45. The extent to which a software tolerates the unexpected problems, is termed as: (A) Accuracy (B) Reliability (C) Correctness (D) Robustness Answer: D 46. An attacker sits between customer and Banker, and captures the information from the customer and retransmits to the banker by altering the information. This attack is called as .............. (A) Masquerade Attack (B) Replay Attack C) Passive Attack (D) Denial of Service Attack Answer: B 47. Consider the following two statements: (a) Business intelligence and Data warehousing is used for forecasting and Data mining. (b) Business intelligence and Data warehousing is used for analysis of large volumes of sales data. Which one of the following options is correct? (A) (a) is true, (b) is false (B) Both (a) and (b) are true (C) (a) is false, (b) is true (D) Both (a) and (b) are false Answer: B
  • 8. 8 48. Pipelining improves performance by: (A) decreasing instruction latency (B) eliminating data hazards (C) exploiting instruction level parallelism (D) decreasing the cache miss rate Answer: C 49. Consider the following two statements : (a) Data scrubling is a process to upgrade the quality of data, before it is moved into Data warehouse. (b) Data scrubling is a process of rejecting data from data warehouse to create indexes. Which one of the following options is correct ? (A) (a) is true, (b) is false (B) (a) is false, (b) is true (C) Both (a) and (b) are false (D) Both (a) and (b) are true Answer: A 50. 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 Answer: D Read more: http://www.netcomputerscience.com/2016/07/cbse-ugc-net-computer-science-paper-ii-solved-july-2016- p5.html#ixzz4OBlXfPxU