 AVA = A is called:
(A) Identity law (B) De Morgan’s law
(C) Idempotent law (D) Complement law
Answer: C
Explanation
1. Commutative Laws:
For any two finite sets A and B;
(i) A U B = B U A
(ii) A ∩ B = B ∩ A
2. Associative Laws:
For any three finite sets A, B and C;
(i) (A U B) U C = A U (B U C)
(ii) (A ∩ B) ∩ C = A ∩ (B ∩ C)
Thus, union and intersection are associative.
3. Idempotent Laws:
For any finite set A;
(i) A U A = A
(ii) A ∩ A = A
4. Distributive Laws:
For any three finite sets A, B and C;
(i) A U (B ∩ C) = (A U B) ∩ (A U C)
(ii) A ∩ (B U C) = (A ∩ B) U (A ∩ C)
Thus, union and intersection are distributive over intersection and union respectively.
5. De Morgan’s Laws:
For any two finite sets A and B;
(i) A – (B U C) = (A – B) ∩ (A – C)
(ii) A – (B ∩ C) = (A – B) U (A – C)
De Morgan’s Laws can also we written as:
(i) (A U B)’ = A’ ∩ B’
(ii) (A ∩ B)’ = A’ U B’
More laws of algebra of sets:
6. For any two finite sets A and B;
(i) A – B = A ∩ B’
(ii) B – A = B ∩ A’
(iii) A – B = A ⇔ A ∩ B = ∅
 If f(x) =x+1 and g(x)=x+3 then fofofof is:
(A) g (B) g+1
(C) g^{4} (D) None of the above
Answer: B
Explanation:
If f(x)=x+1 and g(x)=x+3, then fog(x)=x+4 and gof(x)=x+4
fof(x)=x+2, fofof(x)=x+3 and fofofof(x)=x+4.=x+3+1=g+1
 The contextfree languages are closed for:
(i) Intersection (ii) Union
(iii) Complementation (iv) Kleene Star
then
(A) (i) and (iv) (B) (i) and (iii)
(C) (ii) and (iv) (D) (ii) and (iii)
Answer: C
Explanation:
Contextfree languages are closed under the following operations. That is, if L and P are contextfree languages, the following languages are contextfree as well:
 the union {\displaystyle L\cup P} of L and P
 the reversal of L
 the concatenation {\displaystyle L\cdot P} of L and P
 the Kleene star {\displaystyle L^{*}} of L
 the image {\displaystyle \varphi (L)} of L under a homomorphism {\displaystyle \varphi }
 the image {\displaystyle \varphi ^{1}(L)} of L under an inverse homomorphism {\displaystyle \varphi ^{1}}
 the cyclic shift of L (the language {\displaystyle \{vu:uv\in L\}})
Contextfree languages are not closed under complement, intersection, or difference. However, if L is a contextfree language and D is a regular language then both their intersection {\displaystyle L\cap D} and their difference {\displaystyle L\setminus D} are contextfree languages.
ref: https://en.wikipedia.org/wiki/Contextfree_language
 The following lists are the degrees of all the vertices of a graph:
(i) 1, 2, 3, 4, 5 (ii) 3, 4, 5, 6, 7
(iii) 1, 4, 5, 8, 6 (iv) 3, 4, 5, 6
then, which of the above sequences are graphic?
(A) (i) and (ii)
(B) (iii) and (iv)
(C) (iii) and (ii)
(D) (ii) and (iv)
Answer: B
Explanation:
Rest can’t be graphs as the number of vertices with odd degree in a graph should be even.
In list (i), number of vertices with odd degree is 3.
In list (ii), number of vertices with odd degree is 3.
In list (iii), number of vertices with odd degree is 2.
In list (iv), number of vertices with odd degree is 2.
 If I_{m} denotes the set of integers modulo m, then the following are fields with respect to the operations of addition modulo m and multiplication modulo m:
(i) Z_{23} (ii) Z_{29}
(iii) Z_{31} (iv) Z_{33}
Then
(A) (i) only
(B) (i) and (ii) only
(C) (i), (ii) and (iii) only
(D) (i), (ii), (iii) and (iv)
Answer: C
Explanation:
Basically, a field is a thing where you can add, subtract, multiply and divide. It is a bit tricky to see that the first three examples (Z23, Z29, Z31) are indeed fields. In fact, ZpZp happens to be a field always when pp is prime, and this result follows from Fermat’s little theorem.
But let us look at the fourth example. Assume you can divide the elements by 11, then you have
a contradiction. (The latter equality holds because 33=033=0 modulo 3333.) A similar argument shows you that ZqZq cannot be a field if qq is any composite number.
 An example of a binary number which is equal to its 2’s complement is:
(A) 1100 (B) 1001
(C) 1000 (D) 1111
Answer: C
Explanation:
Option a : 1100 and 1s compliment 0011 +1 = 0100
and apply to all only c is the option which gives answer.
 When a tristate logic device is in the third state, then:
(A) it draws low current
(B) it does not draw any current
(C) it draws very high current
(D) it presents a low impedance
Answer: D
Explanation:
Tristate means that the pin is used: to output a high state (1) or output a low state (2) AND it can be directed to enter a highz/high impedance state (3). The last state, high impedance, is designed to prevent other active devices from driving this line simultaneously–never connect two active outputs together. Things that are not tristated would be a dedicated input or output lines. Any bidirectional lines (both input and output) are always tristated: example data bus.
 An example of a connective which is not associative is:
(A) AND (B) OR
(C) EXOR (D) NAND
Answer: D
check in detail: https://en.wikipedia.org/wiki/Logical_connective
 Essential hazards may occur in:
(A) Combinational logic circuits
(B) Synchronous sequential logic circuits
(C) Asynchronous sequential logic circuits working in the fundamental mode
(D) Asynchronous sequential logic circuits working in the pulse mode
Answer: C
check answer on https://masherz.wordpress.com/2010/08/15/hazardsfaults/
 The characteristic equation of a T flipflop is:
(A) Q_{n+1}=TQ’_{n} + T’ Q_{n}
(B) Q_{n+1}=T+Q_{n}
(C) Q_{n+1}=TQ_{n}
(D) Q_{n+1}= T’Q’_{n}
The symbols used have the usual meaning.
Answer: A
FLIPFLOP NAME  FLIPFLOP SYMBOL  CHARACTERISTIC TABLE  CHARACTERISTIC EQUATION  EXCITATION TABLE  
SR 

Q(next) = S + R’QSR = 0 


JK 

Q(next) = JQ’ + K’Q 


D 

Q(next) = D 


T 

Q(next) = TQ’ + T’Q 

 Suppose x and y are two Integer Variables having values 0x5AB6 and 0x61CD respectively. The result (in hex) of applying bitwise operator AND to x and y will be:
(A) 0x5089 (B) 0x4084
(C) 0x78A4 (D) 0x3AD1
Answer: B
Explanation:
0x5AB6=0101 1010 1011 0110
0x61CD=0110 0001 1100 1101
—————————————
AND =0100 0000 1000 0100
= 0x4084
 Consider the following statements,
int i=4, j=3, k=0;
k=++i – –j + i++ – –j +j++;
What will be the values of i, j and k after the statement.
(A) 7, 2, 8 (B) 5, 2, 10
(C) 6, 2, 8 (D) 4, 2, 8
Answer: C
 What is the value of the arithmetic expression (Written in C)
2*3/43/4* 2
(A) 0 (B) 1
(C) 1.5 (D) None of the above
Answer: B
Explanation:
6/4 – 0 = 1
 A function object:
(A) is an instance of a class for which operator () is a member function.
(B) is an instance of a class for which operator → is a member function.
(C) is a pointer to any function
(D) is a member function of a class
Answer: A
 Polymorphism means:
(A) A template function
(B) Runtime type identification within a class hierarchy
(C) Another name for operator overloading
(D) Virtual inheritance
Answer: B
 The ER model is expressed in terms of:
(i) Entities
(ii) The relationship among entities
(iii) The attributes of the entities
Then
(A) (i) and (iii)
(B) (i), (ii) and (iii)
(C) (ii) and (iii)
(D) None of the above
Answer: B
 Specialization is a …………… process.
(A) Top – down (B) Bottom Up
(C) Both (A) and (B) (D) None of the above
Answer: A
 The completeness constraint has rules:
(A) Supertype, Subtype
(B) Total specialization, Partial specialization
(C) Specialization, Generalization
(D) All of the above
Answer: B
 The entity type on which the …………….. type depends is called the identifying owner.
(A) Strong entity (B) Relationship
(C) Weak entity (D) E – R
Answer: C
 Match the following:
(i) 5 NF (a) Transitive dependencies eliminated
(ii) 2 NF (b) Multivalued attribute removed
(iii) 3 NF (c) Contains no partial functional dependencies
(iv) 4 NF (d) Contains no join dependency
(A) ia, iic, iiib, ivd
(B) id, iic, iiia, ivb
(C) id, iic, iiib, iva
(D) ia, iib, iiic, ivd
Answer: B
 What item is at the root after the following sequence of insertions into an empty splay tree:
1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2 ?
(A) 1 (B) 2
(C) 4 (D) 8
Answer: B
Explanation:
 Suppose we are implementing quadratic probing with a Hash function, Hash (y)=X mode 100. If an element with key 4594 is inserted and the first three locations attempted are already occupied, then the next cell that will be tried is:
(A) 2 (B) 3
(C) 9 (D) 97
Answer: D
Explanation:
because Hash(y)= 4594 mod 100=94.
But first 3 location are attempted are already occupy i.e 94,95,96 So 97 is answer.
 Weighted graph:
(A) Is a bidirectional graph
(B) Is directed graph
(C) Is graph in which number associated with arc
(D) Eliminates table method
Answer: C
 What operation is supported in constant time by the doubly linked list, but not by the singly linked list?
(A) Advance (B) Backup
(C) First (D) Retrieve
Answer: B
 How much extra space is used by heap sort?
(A) O(1) (B) O(Log n)
(C) O(n) (D) O(n^{2})
Answer: A
Explanation:
Answer is O(1) and Bubble sort is an “in place” algorithm. Other than a temporary “switch” variable, no extra space is required.
 Error control is needed at the transport layer because of potential error occurring …………..
(A) from transmission line noise
(B) in router
(C) from out of sequence delivery
(D) from packet losses
Answer: B
 Making sure that all the data packets of a message are delivered to the destination is ……………. control.
(A) Error (B) Loss
(C) Sequence (D) Duplication
Answer: A
 Which transport class should be used with a perfect network layer?
(A) TP0 and TP2 (B) TP1 and TP3
(C) TP0, TP1, TP3 (D) TP0, TP1, TP2, TP3, TP4
Answer: A
 Which transport class should be used with residualerror network layer?
(A) TP0, TP2 (B) TP1, TP3
(C) TP1, TP3, TP4 (D) TP0, TP1, TP2, TP3, TP4
Answer: B
 Virtual circuit is associated with a ………………… service.
(A) Connectionless (B) Errorfree
(C) Segmentation (D) Connectionoriented
Answer: D
 Which activity is not included in the first pass of two pass assemblers?
(A) Build the symbol table
(B) Construct the intermediate code
(C) Separate mnemonic opcode and operand fields
(D) None of the above
Answer: D
 Which of the following is not collision resolution technique?
(A) Hash addressing (B) Chaining
(C) Both (A) and (B) (D) Indexing
Answer: D
Explanation:
click below for detail in techniques
 Code optimization is responsibility of:
(A) Application programmer
(B) System programmer
(C) Operating system
(D) All of the above
Answer: B
 Which activity is included in the first pass of two pass assemblers?
(A) Build the symbol table
(B) Construct the intermediate code
(C) Separate mnemonic opcode and operand fields
(D) None of these
Answer: A,B,C
In the first pass of a twopass assembler, it will “prepare” for the second pass, ie. it’ll build the symbol table which is later used in the second pass to generate code.
 In two pass assembler the symbol table is used to store:
(A) Label and value (B) Only value
(C) Mnemonic (D) Memory Location
Answer: D
 Semaphores are used to:
(A) Synchronise critical resources to prevent deadlock
(B) Synchronise critical resources to prevent contention
(C) Do I/o
(D) Facilitate memory management
Answer: A
 In which of the following storage replacement strategies, is a program placed in the largest available hole in the memory?
(A) Best fit (B) First fit
(C) Worst fit (D) Buddy
Answer: C
 Remote computing system involves the use of timesharing systems and:
(A) Real time processing (B) Batch processing
(C) Multiprocessing (D) All of the above
Answer: B
 Non modifiable procedures are called
(A) Serially useable procedures
(B) Concurrent procedures
(C) Reentrant procedures
(D) Topdown procedures
Answer: C
 Match the following
(a) Disk scheduling (1) Round robin
(b) Batch processing (2) Scan
(c) Time sharing (3) LIFO
(d) Interrupt processing (4) FIFO
(A) a3, b4, c2, d1
(B) a4, b3, c2, d1
(C) a2, b4, c1, d3
(D) a3, b4, c1, d2
Answer: C
 The main objective of designing various modules of a software system is:
(A) To decrease the cohesion and to increase the coupling
(B) To increase the cohesion and to decrease the coupling
(C) To increase the coupling only
(D) To increase the cohesion only
Answer: B
 Three essential components of a software project plan are:
(A) Team structure, Quality assurance plans, Cost estimation
(B) Cost estimation, Time estimation, Quality assurance plan
(C) Cost estimation, Time estimation, Personnel estimation
(D) Cost estimation, Personnel estimation, Team structure
Answer: B
 Reliability of software is dependent on:
(A) Number of errors present in software
(B) Documentation
(C) Testing suties
(D) Development Processes
Answer: A
 In transform analysis, input portion is called:
(A) Afferent branch (B) Efferent branch
(C) Central Transform (D) None of the above
Answer: A
 The Function Point (FP) metric is:
(A) Calculated from user requirements
(B) Calculated from Lines of code
(C) Calculated from software’s complexity assessment
(D) None of the above
Answer: C
 Data Mining can be used as …………….. Tool.
(A) Software (B) Hardware
(C) Research (D) Process
Answer: C
 The processing speeds of pipeline segments are usually:
(A) Equal (B) Unequal
(C) Greater (D) None of these
Answer: B
 The cost of a parallel processing is primarily determined by:
(A) Time complexity
(B) Switching complexity
(C) Circuit complexity
(D) None of the above
Answer: B
 A data warehouse is always ………………..
(A) Subject oriented (B) Object oriented
(C) Program oriented (D) Compiler oriented
Answer: A
 The term ‘hacker’ was originally associated with:
(A) A computer program
(B) Virus
(C) Computer professionals who solved complex computer problems.
(D) All of the above
Answer: C