APPSC2016DLCS
Question 1 
The minimum number of edges of a graph containing n vertices and c connected components is
nc  
c  
c(n1)  
n/c 
Question 1 Explanation:
We have to find a minimum no. of edges. So for c connected components let's assume c1 independent vertices which are also c1 components and remaining 1 component will contain n(c1) vertices or nc+1 vertices. So for minimum no. of edges will be no. of vertices in the single component (which contains nc+1 vertices) 1, which is
(nc+1)1 = nc
Question 2 
In first order predicate logic, ∼∀x P(x) is equivalent to
Options:
∼∃x P(x)  
∃x ∼P(x)  
∀x ∼P(x)  
the given expression is not a well formed 
Question 2 Explanation:
∼∀x P(x) = ∃x ∼P(x)
Question 3 
How many different 6member committees can be formed from 6 men and 4 women with a restriction that each committee should include an equal number of men and women
120  
80  
420  
6045 
Question 3 Explanation:
Given data,
Committee members=6,
Mens=6
Women=4
Equal numbers of men and women are= ?
3 men out of 6, 3 women out of 4
⇒ ^{6}C_{3} * ^{4}C_{3} ways
⇒ 20 * 4
⇒ 80
Note: There are 3 possibilities to consider an equal number of men and women.
Choose 4 men and 4 women then we get ^{6}C^{4} * ^{4}C_{4} ways = 15
Choose 2 men and 2 women then we get ^{6}C_{2} * ^{4}C^{2 ways = 90 Choose 3 men and 3 women then we get 6C3 * 4C3 ways = 80}
Committee members=6,
Mens=6
Women=4
Equal numbers of men and women are= ?
3 men out of 6, 3 women out of 4
⇒ ^{6}C_{3} * ^{4}C_{3} ways
⇒ 20 * 4
⇒ 80
Note: There are 3 possibilities to consider an equal number of men and women.
Choose 4 men and 4 women then we get ^{6}C^{4} * ^{4}C_{4} ways = 15
Choose 2 men and 2 women then we get ^{6}C_{2} * ^{4}C^{2 ways = 90 Choose 3 men and 3 women then we get 6C3 * 4C3 ways = 80}
Question 4 
Consider 4character long codes generated by using an alphabet consisting of 8characters with no restriction on the number of repetitions of a character in a code. How many codes at least one character repeated?
2416  
6720  
1680  
4096 
Question 5 
How many distinct Boolean functions can be formed from ‘n’ Boolean variables?
n^{2}  
2n^{2}  
2n  
2 to the power of 2^{n} 
Question 5 Explanation:
Each “boolean” variable has two possible values i.e 0 and 1.
Number of variables= n
Number of input combinations is 2^{n}.
Each “boolean” function has two possible outputs i.e 0 and 1.
Number of boolean functions possible is 2^{2^n}.
Formula: The number of mary functions possible with n kary variables is m^{k^n}.
Number of variables= n
Number of input combinations is 2^{n}.
Each “boolean” function has two possible outputs i.e 0 and 1.
Number of boolean functions possible is 2^{2^n}.
Formula: The number of mary functions possible with n kary variables is m^{k^n}.
Question 6 
In order for a function to be invertible, it should be _______
oneone  
onto  
both oneone and onto  
into 
Question 6 Explanation:
A function is invertible if and only if it is both oneone and onto.
Question 7 
What is the maximum value of the function f(x)=x^{2}3x+5 in the internal [0,5]?
15  
5  
3  
9 
Question 7 Explanation:
Question 8 
In an IT company, given that the probability of finding an employee with programming skills is 0.7, documentation skills is 0.6, and if the probability of finding an employee with either of the skills is 0.9, then what is the probability of finding an employee with both the skills?
0.42  
0.5  
0.4  
0.8 
Question 8 Explanation:
Let A = probability of finding an employee with programming skills
Let B = probability of finding an employee with documentation skill
So A=0.7
B=0.6
AUB=0.9
Hence ,A∩B = A + B  (AUB)
= 0.7+0.60.9
= 0.4
Let B = probability of finding an employee with documentation skill
So A=0.7
B=0.6
AUB=0.9
Hence ,A∩B = A + B  (AUB)
= 0.7+0.60.9
= 0.4
Question 9 
Let A, B and C are finite sets. Which of the following options is TRUE,
if X=((A∩B)(B∩C)) and Y=(A(A∩C))(AB)?
X⊂Y  
X⊃Y  
X=Y  
XY≠φ and YX≠φ 
Question 9 Explanation:
Now,
x=((AB)(BC))
=(b,c)(e,f))
=b
y=(A(AC))(AB)
=((a,b,d,e)(d,e))(a,d)
=(a,b)(a,d)
=b
Hence, x=y
Question 10 
Which of the following options is TRUE with regard to a relation R defined on ordered pairs of integers as given below: (x,y) R (low,up) if x>low and y<up?
R is totally ordered  
R is partially ordered but not totally ordered
 
R is an equivalence relation  
R is neither partially ordered nor an equivalence relation 
Question 10 Explanation:
If a relation is equivalence then it must be
i) Symmetric
ii) Reflexive
iii) Transitive
If a relation is a partial order relation then it must be
i) Reflexive
ii) Antisymmetric
iii) Transitive
If a relation is total order relation then it must be
i) Reflexive
ii) Symmetric
iii) Transitive
iv) Comparability
Given ordered pairs are (x,y)R(low,up) if (x,up).
Here < , > are using while using these symbols between (x,y) and (y,up) then they are not satisfy the reflexive relation. If they use (x< =low) and (y >=low) then reflexive relation can satisfies.
So, given relation cannot be an Equivalence. Total order relation or partial order relation.
i) Symmetric
ii) Reflexive
iii) Transitive
If a relation is a partial order relation then it must be
i) Reflexive
ii) Antisymmetric
iii) Transitive
If a relation is total order relation then it must be
i) Reflexive
ii) Symmetric
iii) Transitive
iv) Comparability
Given ordered pairs are (x,y)R(low,up) if (x,up).
Here < , > are using while using these symbols between (x,y) and (y,up) then they are not satisfy the reflexive relation. If they use (x< =low) and (y >=low) then reflexive relation can satisfies.
So, given relation cannot be an Equivalence. Total order relation or partial order relation.
Question 11 
The Hasse diagram representing a lattice, P when turned upsidedown represents the poset, Q. Poset Q is a ______
dual of P  
Greatest Upper Bound of P  
Lattice  
dual of P and Lattice 
Question 11 Explanation:
The Hasse diagram representing a lattice, P when turned upsidedown represents the poset Q which is dual of P and lattice.
Question 12 
A pair of dice is tossed twice. What is the probability of scoring 9 at least in one of the two times?
16/81  
17/81  
1/36  
64/81 
Question 12 Explanation:
We will use binomial distribution here.
Total possible outcomes will be 6*6=36
Lets first calculate probability of getting sum as 9. We will get sum as 9 when first dice and second dice will have number (3,6) ,(4,5) ,(5,4) ,(6,3). So total 4 possibility are there out of 36.
So Let probability of getting sum as 9 = P(A) = 4/36 = 1/9
Now
Probability of scoring 9 at least in one of the two times
= Probability of scoring 9 exactly one time + Probability of scoring 9 exactly two times
Total possible outcomes will be 6*6=36
Lets first calculate probability of getting sum as 9. We will get sum as 9 when first dice and second dice will have number (3,6) ,(4,5) ,(5,4) ,(6,3). So total 4 possibility are there out of 36.
So Let probability of getting sum as 9 = P(A) = 4/36 = 1/9
Now
Probability of scoring 9 at least in one of the two times
= Probability of scoring 9 exactly one time + Probability of scoring 9 exactly two times
Question 13 
Which of the following probability distributions is applicable to consider the problem of estimating the probability of exactly two defective items manufactured in an industry in a batch of 20 items, if the probability of manufacture defect is 0.1?
Poisson distribution  
Binomial distribution  
Uniform distribution  
Gaussian distribution 
Question 13 Explanation:
Binomial distribution will be used.
And will be calculated as
^{20}C_{2} = (0.1)^{2} (0.9)^{18}
Question 14 
The propositional expression [(∼P∨Q)→(Q→P)] is
a tautology  
not a tautology  
contradiction  
not a wellformed formula 
Question 14 Explanation:
Question 15 
The maximum number of nonzero elements of a n×n matrix whose [i,j]th element is equal to 0 for all i<j is
n(n1)/2  
n(n+1)/2  
n^{2}  
n 
Question 15 Explanation:
From given description we can conclude that all the elements above the diagonal are 0. So we can say that,
1st row will have 1 nonzero element,
2nd row will have 2 non zero elements,
3rd row will have 3 nonzero elements ,
:
:
:
nth row will contain n nonzero elements.
Therefore total no. of nonzero elements are,
1+2+3+...........+n = n(n+1)/2
1st row will have 1 nonzero element,
2nd row will have 2 non zero elements,
3rd row will have 3 nonzero elements ,
:
:
:
nth row will contain n nonzero elements.
Therefore total no. of nonzero elements are,
1+2+3+...........+n = n(n+1)/2
Question 16 
At a given moment a queue contains stored in it. If the capacity of the queue is 6 then which of the following sequence of operations results in a modified queue contents?
delete a, b; and insert e,a,f;  
insert e,a,f and delete a,b  
insert e, delete b and insert f
 
insert e,f, move a to place it between e and f, then delete b

Question 17 
The value of the postfix expression abc*de+/ where a=20, b=3, c=4, d=1 and e=5 is
134  
22  
48  
18 
Question 17 Explanation:
Here we will start traversing the expression from left to right and if an operand is encountered then it will be pushed on the top of stack and if an operator is encountered then top two elements will be popped off from the top of stack and current operator is applied on those two operands and then in the end the result of operation will be pushed back on the top of stack. This procedure continues till the whole expression is traversed.
Step: 7
Hence option 4 is the correct answer.
Step: 7
Hence option 4 is the correct answer.
Question 18 
Consider optimal implementation of two stacks growing in opposite directions in a single array A[n]. If t1 and t2 denote the stack pointers, which of the following, checks for stack full condition?
t2=(n1) or t1=(n1)  
t1=n/2 or t2=(n1)  
t1=0 and t2=(n1)  
t2=t1+1 
Question 18 Explanation:
Question 19 
Which of the following types of the linked list is fastest to delete a node pointed by ‘p’ from a large collection of nodes constituting the list?
doubly linked list  
singly linked list  
singly linked circular list  
singly linked list with header node 
Question 19 Explanation:
Worst case of deleting a node from a linked list is when we are on the last node of the list and we want to delete (n1)th node from the list. In this case above lists will have the following time complexity:
Doubly linked list: Since it is doubly linked list so last node will have pointer to its previous node(i.e “n1” ) node. So (n1)th node can be deleted in O(1) time. Single Linked List: Since in this no node have a pointer to its previous node so even if we have a pointer on last node of the list we have to traverse (n1) nodes of the given linked list in order to delete (n1)th node. Hence its time complexity will be O(n). singly linked circular list: For above scenario since the list is unidirect so we have to traverse (n1) elements in best case in order to delete (n1)th node even after having a pointer to nth node.
singly linked list with header node is nothing but Single linked list only. So its time complexity will also be O(n).
Hence Doubly linked list is giving best time complexity to delete a node pointed by ‘p’ from a large collection of nodes constituting the list.
Doubly linked list: Since it is doubly linked list so last node will have pointer to its previous node(i.e “n1” ) node. So (n1)th node can be deleted in O(1) time. Single Linked List: Since in this no node have a pointer to its previous node so even if we have a pointer on last node of the list we have to traverse (n1) nodes of the given linked list in order to delete (n1)th node. Hence its time complexity will be O(n). singly linked circular list: For above scenario since the list is unidirect so we have to traverse (n1) elements in best case in order to delete (n1)th node even after having a pointer to nth node.
singly linked list with header node is nothing but Single linked list only. So its time complexity will also be O(n).
Hence Doubly linked list is giving best time complexity to delete a node pointed by ‘p’ from a large collection of nodes constituting the list.
Question 20 
Singly linked circular list with header pointing to the last node is the data structure preferred in the context of
insertion of a node at a position ‘p’  
deletion of a node pointed by ‘p’  
reversing the order of the nodes in the list
 
concatenating two lists into one list 
Question 20 Explanation:
Singly linked circular list with header pointing to the last node is the data structure preferred in the context of concatenating two lists into one list, because it can be done in O(1) time.
Question 21 
If the inorder and preorder sequence of nodes of a binary tree are CABDFEHG and DCBAGEFH respectively, then the post order sequence is
ABCDEFGH  
HFEGABCD  
ABCFHEGD  
AFHBECGD 
Question 21 Explanation:
Inorder: CABDFEHG
Preorder: DCBAGEFH
Hence, Postorder of above tree will be: ABCFHEGD. Hence, Postorder of above tree will be: ABCFHEGD.
Preorder: DCBAGEFH
Hence, Postorder of above tree will be: ABCFHEGD. Hence, Postorder of above tree will be: ABCFHEGD.
Question 22 
Construct a Maxheap dynamically to accomodate a stream of eight integers, 48,34,68,32,19,25,61,53 as a descending priority queue. The leaf node that is farthest from the root is ______
19  
68  
48  
32 
Question 22 Explanation:
Question 23 
Which of the following algorithms is fastest to find shortest path from a source node to a destination node in an unweighted connected graph?
Warshall’s algorithm  
Floyd’s algorithm  
Breadth First Traversal  
Depth First Traversal 
Question 23 Explanation:
warshall algorithm will take O(n^3) time.
Floyd’s algorithm will take O(n^3) time.
Breadth First traversal will take O(m+n) time.
Depth first traversal will work only if the graph is tree.
Hence among the given options Breadth first traversal is best.
Floyd’s algorithm will take O(n^3) time.
Breadth First traversal will take O(m+n) time.
Depth first traversal will work only if the graph is tree.
Hence among the given options Breadth first traversal is best.
Question 24 
Which of the following algorithms doesn’t require Priority queue for its implementation?
Kruskal’s algorithm  
Prim’s algorithm  
Huffman code generation algorithm
 
Warshall’s algorithm 
Question 24 Explanation:
Kruskal’s ,prims , and huffman code generation algorithm require priority queue. But in floyd warshall we use matrix .
Question 25 
Consider a large disk file containing records each of considerable size and an identification key. Which of the following methods is suitable to organize the file for faster access to a record given its key?
Apply Keysorting and maintain an index to the randomly ordered disk file  
Sort the records of the disk file using Merge sort  
Sort the records of the disk file using Quick sort  
Apply keysorting and accordingly sort the records of the disk file 
Question 25 Explanation:
Using Primary key indexing all records can be accessed faster.Primary key indexing is based on a key attribute where all the elements of key attribute are arranged in sorted manner.
Question 26 
Which of the following is preferred to organize very large indexed sequential access disk files for both interactive random access and cosequential batch processing of its records?
Hashing  
BTrees  
Simple Index  
B+ Trees 
Question 26 Explanation:
Btree and B+ Tree are suitable to organize very large indexed sequential access disk files for interactive random access but since in B+ tree each leaf node have a pointer to its next leaf node then it makes the access of cosequential batch processing of its records easier.
Question 27 
Which of the following probability distribution functions is used to predict the number of collisions in terms of packing density of a Hash table?
Gaussian distribution  
Poisson distribution  
Uniform distribution  
Binomial distribution 
Question 28 
The best case time complexity of insertion sort algorithms is ______
O(n)  
O(1)  
O(n^{2})  
O(n log n) 
Question 28 Explanation:
The best case of insertion sort is when all the elements given in array are already sorted. In that case when insertion sort is applied only one comparison is made for each element of the array. Hence if we have nelements the ncomparisons will be made. Hence the time complexity will be O(n)
Question 29 
Which of the following is NOT used for time complexity estimation of an algorithm?
L Hospital Rule
 
Method of Backward Substitution  
Master’s theorem  
Composite Trapezoidal Rule 
Question 29 Explanation:
L hospitals Rule, method of back ward substitution and masters theorem is used for time complexity estimation of an algorithm . But Composite trapezoidal rule gives us a technique to approximate the integral on a given interval [a, b] and not used for time complexity estimation of an algorithm.
Question 30 
Which type of algorithm design strategy is used in Quickhull algorithm to find the smallest convex polygon that contains ‘n’ given points in a plane?
Greedy Approach  
Divide and Conquer approach  
Dynamic programming  
Transform and Conquer approach 
Question 30 Explanation:
The QuickHull algorithm is a Divide and Conquer algorithm similar to QuickSort.
Question 31 
Applying Gaussian Elimination method for solving linear equations isDynamic programming an example of ______
Dynamic programming  
Greedy approach  
Transform and Conquer approach  
Divide and Conquer approach 
Question 31 Explanation:
Gaussian elimination method is transform and conquer approach.This algorithm solves a system of linear equations by first transforming it to another system with a special property that makes finding a solution quite easy.
Question 32 
Time complexity of an algorithm whose recurrence equation is T(n)=4T(n/2)+n^{2} and T(1)=1 is expressed as ______
O(n^{2})  
O(n^{2} log n)  
O(n^{3})  
O(n log n) 
Question 32 Explanation:
Question 33 
Twicearound the spanning tree algorithm for solving the Travelling Salesman Problem with Euclidean distances is a ______
2approximation algorithm  
1.5 approximation algorithm
 
1.25 approximation algorithm  
2.5 approximation algorithm 
Question 34 
Which of the following problems belong to the class of NPComplete problems?
Knapsack Problem  
Hamiltonian Circuit problem  
Eulerian Circuit Problem  
Graph Coloring problem 
Question 34 Explanation:
NP Problem: Each input to the problem should be associated with a set of solutions of polynomial length, whose validity can be tested in polynomial time. The complexity class of problems of this form is called NP, an abbreviation for "nondeterministic polynomial time".
NPHard: A problem is said to be NPhard if everything in NP can be transformed in polynomial time into it.
A problem is NPcomplete if it is both in NP and NPhard. The NPcomplete problems represent the hardest problems in NP.
The list below contains some wellknown problems that are NPcomplete when expressed as decision problems.
Boolean satisfiability problem (SAT)
Knapsack problem
Hamiltonian path problem
Travelling salesman problem (decision version)
Subgraph isomorphism problem
Subset sum problem
Clique problem
Vertex cover problem
Independent set problem
Dominating set problem
Graph coloring problem
NPHard: A problem is said to be NPhard if everything in NP can be transformed in polynomial time into it.
A problem is NPcomplete if it is both in NP and NPhard. The NPcomplete problems represent the hardest problems in NP.
The list below contains some wellknown problems that are NPcomplete when expressed as decision problems.
Boolean satisfiability problem (SAT)
Knapsack problem
Hamiltonian path problem
Travelling salesman problem (decision version)
Subgraph isomorphism problem
Subset sum problem
Clique problem
Vertex cover problem
Independent set problem
Dominating set problem
Graph coloring problem
Question 35 
Which of the following sorting algorithms does inplace sorting with minimal space overhead?
Merge sort  
Radix sort  
Heap sort  
Address Calculation Sort 
Question 35 Explanation:
InPlace sorting algorithm is one which requires only O(1) space in order to sort nelements.
Merge sort has space complexity of O(n). Hence it is not an inplace sorting algorithm.
Merge sort has space complexity of O(n). Hence it is not an inplace sorting algorithm.
Question 36 
The principle of replacing a function irrespective of the context is called ______
Static binding  
referential transparency  
orthogonality  
locality of reference 
Question 37 
Which of the following predicate expressions represent the statement “None of the Students have failed in the test”?
∼∃x(Student(x)∧∼Failed(x))  
∼∀x(∼Student(x)∧∼Failed(x))  
∀x(∼Student(x)∧FAiled(x))  
∼∃x(Student(x)∧Failed(x)) 
Question 38 
The left hand side of an assignment statement should have ______
rvalue  
lvalue  
both rvalue and lvalue  
either rvalue or lvalue 
Question 39 
What will be the final value of variable ‘A’ after executing the following pseudo code fragment?
A=6
B=10
If (A>B) then if(A<0) then A=A*B
Else A=2*A
36  
12  
6  
10 
Question 40 
The high level computer language PROLOG is categorized as ______
Functional language
 
Object oriented language
 
Logic programming Language
 
Scripting language 
Question 40 Explanation:
Prolog is a logic programming language associated with artificial intelligence and computational linguistics. Prolog has its roots in firstorder logic, a formal logic. Prolog is wellsuited for specific tasks that benefit from rulebased logical queries such as searching databases, voice control systems, and filling templates.
Question 41 
Consider a language with following operations for string manipulation:
car(s) returns the first character of string ‘s’.
cdr(s) returns the suffix of ‘s’ excluding the first character.
concat(s1,s2) returns the concatenation of s1 and s1.
Which of the following is the output of concat(car(s), car(cdr(s)))) if string s = “PQRS”?
PR  
PRS  
RSP  
PQ 
Question 41 Explanation:
concat(car(s), car(cdr(s)))
car(PQRS) = P
cdr(PQRS) = QRS
car(cdr(s)) = car(QRS) = Q
concat(P,Q) = PQ
car(PQRS) = P
cdr(PQRS) = QRS
car(cdr(s)) = car(QRS) = Q
concat(P,Q) = PQ
Question 42 
What is printed by the following C program segment?
int a=40, b=25;
printf(“%d”, a=b);
25  
40  
0  
Error message 
Question 42 Explanation:
At first the a=b assignment will be done, due to which the value of ‘a’ will become 25 . and then value of ‘a’ will be printed which is 25.
Question 43 
Which combination of the integer variables a, b and c makes the nested conditional expression ((a>b)?((a>c)?a:c):((b>c)?b:c)) evaluated to a value 10?
a=6, b=12, c=10  
a=12, b=10, c=6  
a=6, b=10, c=8  
a=12, b=8, c=6 
Question 43 Explanation:
Option A: ((6>12)?((6>10)?6:10):((12>10)?12:10)) Outputs 12.
Option B: ((12>10)?((12>6)?12:6):((10>6)?10:6)) outputs 12.
Option C: ((6>10)?((6>8)?6:8):((10>8)?10:8)) outputs 10
Option D: ((12>8)?((12>6)?12:6):((8>6)?8:6)) outputs 12.
Note: Highlighted statements are executed for that particular option.
Option B: ((12>10)?((12>6)?12:6):((10>6)?10:6)) outputs 12.
Option C: ((6>10)?((6>8)?6:8):((10>8)?10:8)) outputs 10
Option D: ((12>8)?((12>6)?12:6):((8>6)?8:6)) outputs 12.
Note: Highlighted statements are executed for that particular option.
Question 44 
Consider the following declaration statement followed by the two assignment statement in ‘C’. What will be printed by this code segment?
int a, *b=&a, **c=&b;
a=14;
**c=20;
printf (“%d”, a);
prints 14  
prints 20  
prints the address of b  
34 
Question 44 Explanation:
where 100 is address of ‘a’ and 200 is address of ‘b’.
**c makes the value of a as “20”.
Hence “Printf” statement prints “20”.
Question 45 
Which of the following is NOT a type of constructor
Copy constructor  
Friend constructor  
Default constructor  
Parameterized constructor 
Question 45 Explanation:
Parameterized constructors: Constructors that can take at least one argument are termed as parameterized constructors. When an object is declared in a parameterized constructor, the initial values have to be passed as arguments to the constructor function.
Default constructors: If the programmer does not supply a constructor for an instantiable class, Java/C++ compiler inserts a default constructor into your code on your behalf. This constructor is known as default constructor.
Copy Constructor: Copy constructors define the actions performed by the compiler when copying class objects. A Copy constructor has one formal parameter that is the type of the class (the parameter may be a reference to an object). It is used to create a copy of an existing object of the same class. Even though both classes are the same, it counts as a conversion constructor.
Default constructors: If the programmer does not supply a constructor for an instantiable class, Java/C++ compiler inserts a default constructor into your code on your behalf. This constructor is known as default constructor.
Copy Constructor: Copy constructors define the actions performed by the compiler when copying class objects. A Copy constructor has one formal parameter that is the type of the class (the parameter may be a reference to an object). It is used to create a copy of an existing object of the same class. Even though both classes are the same, it counts as a conversion constructor.
Question 46 
Which one of the following CAN NOT be a friend
function  
class  
object  
operator function 
Question 46 Explanation:
The function is not in the scope of the class to which it has been declared as a friend. It cannot be called using the object as it is not in the scope of that class. It can be invoked like a normal function without using the object.
Question 47 
What should be the name of the constructor
same as object
 
same as member  
same as class  
same as function 
Question 47 Explanation:
Constructor: a constructor (abbreviation: ctor) is a special type of subroutine called to create an object. A constructor resembles an instance method, but it differs from a method in that it has no explicit return type, it is not implicitly inherited and it usually has different rules for scope modifiers. Constructors often have the same name as the declaring class. They have the task of initializing the object's data members
Question 48 
What is the output of the following program:
#include
class sample
{
private int a,b’
public: void test ( )
{
a = 100;
b = 200;
}
friend int compute (sample e1);
};
int compute (sample e1)
{
return int (e1.a + e1.b)  5;
}
Main ( )
{
Sample e;
e.test( );
Cout < < compute(e);
}
205  
300  
295  
error 
Question 49 
Which of the following approach is generally adopted by C++ programming.
Topdown  
Bottomup  
Rightleft  
Leftright 
Question 49 Explanation:
Structure/procedure oriented programming languages like C programming language follows top down approach. Whereas object oriented programming languages like C++ and Java programming language follows bottom up approach.
Question 50 
Which among the following is the correct way of declaring object of a class
Classname objectname;
 
Class classname obj objectname;  
Class classname obj objectname;  
Classname obj objectname 
Question 50 Explanation:
The correct way of declaring object of a class is
Classname objectname;
For example ,let there be some class of name Area. So we can declare object of Area class like,
Area A1;
For example ,let there be some class of name Area. So we can declare object of Area class like,
Area A1;
Question 51 
How many objects can be created in a single class?
1  
2  
3  
as many as required 
Question 51 Explanation:
An object is nothing but an instance of a class. A class can have as many instances as required. There is no restriction on the number of objects a class can have.
Question 52 
Which of this process occur automatically by JAVA run time system?
Serialization  
Garbage collection  
File Filtering  
All the given options 
Question 52 Explanation:
Serialization and deserialization occur automatically by java runtime system, Garbage collection also occur automatically but is done by CPU or the operating system not by the java runtime system
Question 53 
The ‘new’ operator in JAVA
Returns a pointer to a variable
 
Creates a variable called new  
Obtains memory for a new variable  
Tells how much memory is available 
Question 53 Explanation:
“new” operator in java is used to create a new object. And an object is nothing but an instance of a class. Some memory is allocated to each object for its execution. Hence option(C) is the correct answer.
Question 54 
“this” keyword in JAVA is used to
Refer to current class object  
Refer to static method of the class
 
Refer to parent class object  
Refer to static variable of the class 
Question 54 Explanation:
“this” is a reference variable that refers to the current object of the class.
Question 55 
Which of the following digital components are used for ‘odd’ parity bit generation and checking in the process of transmission error detection?
Gates required for parity generation differ from those required for parity checking  
ExclusiveOR gates  
RSflipflop  
Counters 
Question 55 Explanation:
ExOR gates generate the output as ‘1’ when there are odd numbers of ‘1’ applied in input. Hence if we want to check odd parity then ExOR gates can be used.
Question 56 
How many ‘1’s are there in the result produced by 8bit 2’s complement addition of 29 and –46?
2  
7  
3  
5 
Question 56 Explanation:
Question 57 
The microoperation that performs division of a signed binary integer by 2 is 
Logical shift right  
Logical shift left  
Arithmetic shift right  
Arithmetic shift left 
Question 57 Explanation:
Division of signed binary integer by 2 is nothing but arithmetic shift right. Similarly ,multiplication of signed binary integer by 2 is nothing but arithmetic shift left.
Question 58 
The number of full and half adders required to add 16 – bit number is
8 half addres, 8 full adders  
1 half adder, 15 full adders
 
16 half adders, 0 full adders  
4 half adders, 12 fulladders 
Question 58 Explanation:
Question 59 
The simplified SOP(Sum of Products) form of the boolean expression (P+Q’+R’) (P+Q’+R) (P+Q+R’) is
(P’ Q + R)  
(P + Q’. R’)  
(P’.Q + R)  
(P. Q + R) 
Question 59 Explanation:
Question 60 
Consider the implementation of a Boolean function of ‘n’ variables using only one multiplexer and one inverter. The minimum specification of size of multiplexer required is ____________
2^{n} –input & I output  
1 –output & 2^{n} output  
2^{n1} input & 1 output  
2^{n+1} input & 1 output 
Question 60 Explanation:
The minimum specification of size of multiplexer required is 2^(n1) input & 1 output in which n1 variables will be given to n1 select lines and remaining one variable will be given to input lines.
Question 61 
How many 64Kx1RAM chips are required to provide a memory of size 256K bytes?
8  
4  
32  
64 
Question 61 Explanation:
Question 62 
Consider a hard disk containing 1000cylinders, 10 platters each with 2 recording surfaces and 63 sectors per track. What is the position of the sector whose 3D disk address is 2000,15,55> representing cylinder, surface, sector numbers respectively.
3520  
253000  
50600  
250600 
Question 62 Explanation:
Here each cylinder has 2 recording surfaces and each surface has 63 sectors. Now 2000 cylinders means required sector have (2000*2*63) sectors + 15 surface means in addition to previous sectors required sector have (15* 63) sectors +55 sectors before itself.
Hence, Position of sector < 2000, 15, 55>
(2000263)+(1563)+55
=252000+945+55
=253000
Hence, Position of sector < 2000, 15, 55>
(2000263)+(1563)+55
=252000+945+55
=253000
Question 63 
When a cache memory is 30 times faster than main memory/RAM and cache hit ratio is 90% the speed up gained using the cache is approximately 
10 times
 
7.7 times  
2.7 times  
27 times 
Question 63 Explanation:
Question 64 
The addressing modes used in the machine instruction ADD X, Y is
Direct  
Indirect  
Immediate  
Implied addressing 
Question 64 Explanation:
in immediate addressing mode in operand part directly operand is given.But in the given machine instruction it is not the case.
More over in indirect addresing mode @X should have been given which is a notation for indirect addressing mode.
In implied addressing mode operand is appended in the opcode itself which is not in the above instruction.
Hence the given instruction is direct addressing mode. In direct addressing mode the address of operand is present in the operand part of instruction.
More over in indirect addresing mode @X should have been given which is a notation for indirect addressing mode.
In implied addressing mode operand is appended in the opcode itself which is not in the above instruction.
Hence the given instruction is direct addressing mode. In direct addressing mode the address of operand is present in the operand part of instruction.
Question 65 
Which of the following is NOT a method used for data transfer between peripherals and memory?
Programmed I / O
 
Interrupt initiated I / O  
Direct Memory Access  
Pipelining 
Question 65 Explanation:
Programmed I / O, Interrupt initiated I / O, Direct Memory Access are the methods used for data transfer between peripherals and memory but Pipelining is a method to achieve speedup during the execution of instructions.
Question 66 
In asynchronous serial transfer of characters, which of the following ordered pair of bits represents the used as delimiters for every character.
0,1 >  
(00,01>
 
1,0>  
01,00> 
Question 67 
Which of the following options needs to be entered in order to add a value 20 to the shell variable, x?
$x=$x+20  
let x =$x+20  
let $x=$x+20  
$x+=20 
Question 67 Explanation:
Option 2 is the correct notation for the addition of 20 in shell variable x,
Also if we want to add some values which is not constant literals then we will enter it as
x=$x + $y
where y is variable holding some value.
Also if we want to add some values which is not constant literals then we will enter it as
x=$x + $y
where y is variable holding some value.
Question 68 
Consider the file named ‘file 1’. In order to remove write permission to the owner and grant execute permission to others, which of the following UNIX commands in appropriate?
chmod u–w,o+x file 1  
chmod uw,ow file 1  
cheperum uw, o+e file 1  
chmod uw,o+e file 1 
Question 69 
The effect of executing the UNIX command ‘sort –t / +1 file 1’ is 
sorts the lines of the file 1 in ascending order and place  as delimiter  
sorts the lines of the file 1 in descending order and place  as delimiter  
sorts the lines of the file 1 in ascending order after skipping content upto  in each line  
sorts the lines of the file 1 in descending order after skipping content upto  in each line 
Question 70 
UNIX command used to compare the successive lines of file 1 with the corresponding lines if file 2 and output a 3columnar report on lines unique to file 1, file 2 and common to both is 
cmp file 1 file 2  
comm. File 1 file 2  
diff file 1 file 2  
comp file 1 file 2 
Question 71 
UNIX command used to compare the successive lines of file 1 with the corresponding lines if file 2 and output a 3columnar report on lines unique to file 1, file 2 and common to both is 
cmp file 1 file 2  
comm. File 1 file 2  
diff file 1 file 2  
comp file 1 file 2 
Question 72 
Which of the following features is the best to support JAVA application development distributed across a network of Java Virtual machines?
Remove Method Invocation (RMI)  
Remote Procedure Calls (RPC)  
Multicast sockets  
Remote Method Invocation (RMI) or Remote Procedure Calls (RPC) 
Question 73 
Usage of semaphores for solving critical section problem sometimes result in busy waiting. Which of the following offers an effective remedy to avoid wastage of CPU cycles?
spinlock  
block and wakeup(p)  
atomic operator to get and set  
atomic operator toswap the contents of two words 
Question 73 Explanation:
Whenever some process does not able to enter critical section due to mutual exclusion then it is put into blocked state ,due to which CPU time is not wasted and busy wait can be avoided. And if the process comes out of critical section then that process wakes up one of the process from blocked state.
Question 74 
Which of the following strategy is adopted to deal with deadlocks that have occurred in operating system?
prevention  
avoidance  
detection and recovery  
ignore the problem 
Question 74 Explanation:
Deadlock avoidance and prevention are the techniques used to deal with deadlock before it actually happens But deadlock detection and recovery is a technique used to deal with deadlocks that have already occured in the system.
Ignoring the problem is not a way to deal the deadlocks that have occurred
Ignoring the problem is not a way to deal the deadlocks that have occurred
Question 75 
Which of the following methods is used to control thrashing in demand paging systems?
estimating processwise demand for frames using working set model and limiting the total demand
 
controlling the page fault frequency within safe range by adjusting degree of multiprogramming  
Banker’s Algorithm  
estimating processwise demand for frames using working set model and limiting the total demand and controlling the page fault frequency within safe range by adjusting degree of multiprogramming but not Banker’s Algorithm 
Question 75 Explanation:
Bankers algorithm is a deadlock avoidance scheme and is not used for thrashing.
Now thrashing is the situation where more pagefaults occur. So to avoid more pagefaults we should estimate process wise demand for frames using working set model and control the pagefault frequency within safe state range by adjusting degree of multiprogramming.
Question 76 
Which of the file directory structures support effective sharing of files?
Twolevel directories  
Threestructured directories  
acyclic graph directories  
single –level directories 
Question 77 
Which of the following is solution for external fragmentation of disk space during contiguous file allocation?
Dynamic storage allocation  
Disk space compaction  
File Allocation Table  
garbage collection 
Question 77 Explanation:
solution of external fragmentation is disk space compaction. In compaction method we combine all the small holes at different places to make a big hole.
Question 78 
The above table depicts the CPU burst times required for the processes P1, P2, P3 and P4 which are in ready queue at a given moment. What is the average waiting time resulted with priority scheduling of CPU giving highest priority to level1?
Process ID  Priority level  CPU Burst time 
P1  2  10 
P2  3  8 
P3  1  12 
P4  4  5 
16  
24.75  
18  
25 
Question 78 Explanation:
Question 79 
Which of the following can be used to prevent improper authentication due to password exposure?
Trapdoor  
OneTime Password  
Trojan Horse  
Antivirus software 
Question 80 
Which of the following page replacement algorithms results in minimum page fault frequency for a given number of frames?
LRU page replacement  
FIFO page replacement  
Optimal page replacement  
Enhanced second chance algorithm 
Question 80 Explanation:
Optimal page replacement algorithm results in minimum page fault frequency because in this algorithm, OS replaces the page that will not be used for the longest period of time in future.
Question 81 
The network topology with highest reliability is 
Mesh  
Bus  
Star  
Ring 
Question 81 Explanation:
The topology with highest reliability is mesh topology. ... It is a topology commonly used for wireless network. Mesh topology can handle high amounts of traffic, because multiple devices can transmit data simultaneously. A failure of one device does not cause a break in the network or transmission of data.
Question 82 
In sliding window flow control for network traffic if window size is 31 then the range of sequence numbers is 
1 to 32  
0 to 31  
1 to 31  
0 to 30 
Question 82 Explanation:
Sender window size given is 31 which requires 31 sequence no.s and also 1 more sequence no. is required for receiver side. Hence in total 32 sequence no. are required.
Sequence no. starts with 0. Hence sequence no. range is 031.
Question 83 
Repeaters are used in 
Data link layer  
Physical layer  
Network layer  
Session layer 
Question 83 Explanation:
Repeaters are used in physical layer because it is just used in the cable to regenerate or replicate a signal.
Question 84 
End to end connectivity is provided from host to host in the 
Network layer
 
Transport layer  
Session layer  
Data link layer 
Question 84 Explanation:
Network layer provides host to host connectivity.
Transport layer provide end to end connectivity.
Data link layer provides hop to hop connectivity.
Transport layer provide end to end connectivity.
Data link layer provides hop to hop connectivity.
Question 85 
Encryption and decryption of data is performed in 
Presentation layer  
Physical layer  
Data link layer  
Session layer 
Question 85 Explanation:
Encryption and Decryption of data is performed in presentation layer.
Question 86 
Which of the following uses UDP as the transport protocol?
HTTP  
SMTP  
DNS  
Telnet 
Question 86 Explanation:
DNS uses UDP as the transport layer protocol because it of type 1 request and 1 reply, in which domain names is translated to IP address.
Question 87 
How many ASCII characters can be transmitted per second over a 2400bps line if the transfer is asynchronous with start and stop bits in addition to parity bit with each character?
300  
240  
340  
2400  
None of the Above 
Question 87 Explanation:
To transfer 1 character of 8 bit we need
8 bit + 1 start bit + 1 stop bit + 1 parity bit = 11 bit.
Hence no. of characters that can be transmitted per second is = 2400/11 = 218
8 bit + 1 start bit + 1 stop bit + 1 parity bit = 11 bit.
Hence no. of characters that can be transmitted per second is = 2400/11 = 218
Question 88 
Which of the following refers to the feature of TCP that upon receiving a packet the receiver hooks the ACK to the next outgoing packet instead of sending ACK as a new packet?
piggybacking  
multiplexing  
bits niffing  
dialogue control 
Question 88 Explanation:
The feature of TCP that upon receiving a packet the receiver hooks the ACK to the next outgoing packet instead of sending ACK as a new packet is piggybacking.
Question 89 
In the slow start phase of the TCP congestion control algorithm, the size of the congestion window 
doesn’t increase significantly  
increases linearly  
increases quadratically  
increases exponentially 
Question 89 Explanation:
In slow start phase of TCP congestion control algorithm , the size of the congestion window increases exponentially.
Question 90 
Which of the following is NOT a client server application?
ping  
Internet chat  
web browsing
 
email 
Question 90 Explanation:
A client/server application is a piece of software that runs on a client computer and makes requests to a remote server. Ping is not a client server application. Ping is a computer network administration utility used to test the reachability of a host on an Internet Protocol (IP). In ping, there is no server that provides a service.
Question 91 
Consider the probabilistic random routing for a packet switching network. Which of the following is its advantage over the other nonadaptive routing algorithms?
It finds the minimum hop route to destination  
It provides good traffic distribution along the links  
efficiently responds to traffic congestion and diverts the traffic accordingly  
high robust and is used to send emergency messages 
Question 92 
Match the following
P) Waterfall  a) Specifications can be developed Incrementally 
Q) Evolutionary model  b) Requirements compromises are inevitable 
R) Component based model  c) Explicitly addressing the problem of Risk during development 
S) Spiral  d) Inflexible partitioning of the Project into stages 
Pa, Qb, Rc, Sd  
Pd, Qa, Rb, Sc  
Pd, Qc, Ra, Sb  
Pc, Qa, Rb, Sd 
Question 93 
Consider module M, which is a serial integration of two submodules, A and B, having cyclomatic complexities of 10 and 8 respectively. What is the cyclomatic complexity of the integrated module M?
19  
17  
20  
22 
Question 94 
Which of the following approaches is generally applied for module design phase while developing new software?
Topdown approach  
Bottomup approach  
centre fringing  
depends on the size of software 
Question 95 
Let various levels of cohesion of software modules be denoted by C,T,S, and F as given below:
C: Coincidental F: Functional S: Sequential T: Temporal
Which of the following ordered tuples represents correct ordering from weakest to strongest level of cohesion?
< T,S,C,F >  
< C,T,S,F >  
< C,T,F,S >  
< C,S,F,T > 
Question 96 
Let various levels of cohesion of software modules be denoted by C,T,S, and F as given below:
C: Coincidental F: Functional S: Sequential T: Temporal
Which of the following ordered tuples represents correct ordering from weakest to strongest level of cohesion?
< T,S,C,F >  
< C,T,S,F >  
< C,T,F,S >  
< C,S,F,T > 
Question 97 
In the context of Object oriented software design, which of the following consequences of use of inheritance is disadvantageous?
Increased coupling between classes  
Reusable code development
 
Supports building class hierarchy  
Supports development of classes with less number of arguments and methods 
Question 98 
Which of the following software development process is not necessarily useful for developing software for automating an existing manual system for a client?
Prototyping  
Iterative enhancement  
Spiral model  
Waterfall model 
Question 99 
Which of the following is NOT the characteristic of a good Software Requirement Specification?
completeness  
verifiability  
modifiability  
short size of code 
Question 100 
Which of the following is NOT a recognized software project type under COCOMO model?
embedded  
semidetached  
detached  
organic 
Question 101 
In software development, UML, diagrams are used during 
requirements analysis  
system/module design  
system integration  
All the given options 
Question 102 
Which of the following techniques are used for selection of test cases during structural testing?
Data flow based testing  
Equivalence class partitioning  
Causeeffect graphing  
Boundary value analysis 
Question 103 
Which of the following metric represents the expected life time of a software system?
Failure probability
 
Failure density function  
Mean time to failure  
Hazard rate 
Question 104 
Which of the following operations are generally used for transforming plain text to cipher text?
substitution  
transposition  
substitution and transposition  
normalization 
Question 105 
With reference to network security across a packet switching network, which of the following provide the most effective solution?
Endtoend encryption  
Link encryption  
Combination of both link and endtoend encryption  
Either link encryption or endtoend encryption but not both 
Question 105 Explanation:
The implementation of encryption in packetswitched networks must ensure that essential addressing information can be accessed by the relevant network devices such as switches, bridges and routers. Encryption is broadly termed link layer encryption or endtoend encryption depending on whether it is applied and reapplied at each end of each link in a communication path, or whether it is applied over the whole path between end systems.
Question 106 
Consider the sequence of steps involved in the process of using digital signatures for a message in PGP; which of the following steps is WRONGLY presented?
SHA1 is used to generate hash code of message  
The hash code is prepended to the message and sent to the receiver  
The receiver uses RSA with senders public key to decrypt and recovered code  
Receiver generates a new hash code for the message and compares with the recovered code and accept the message as authentic, if only, they match 
Question 106 Explanation:
Point 2 is wrongly presented.
Point 2 should be the hash code is first encrypted and then preoended to the message and sent to the receiver.
Question 107 
Which of the following is a secret – key encryption algorithm?
RSA  
DiffieHellman key exchange  
Advanced Encryption Standard (AES)  
Elliptic Curve Cryptography (ECC) 
Question 107 Explanation:
RSA is a public key encryption algorithm.
DiffieHellman key exchange algorithm is not at all a encryption algorithm ,instead it is a key exchange algorithm.
AES is a secret key encryption algorithm.
DiffieHellman key exchange algorithm is not at all a encryption algorithm ,instead it is a key exchange algorithm.
AES is a secret key encryption algorithm.
Question 108 
Which of the following is NOT a type of firewall for network security?
Circuit level gateways  
Application level gateways  
Packet filters  
Digital Immune System 
Question 108 Explanation:
A circuitlevel gateway is a type of firewall. Circuitlevel gateways work at the session layer of the OSI model, or as a "shimlayer" between the application layer and the transport layer of the TCP/IP stack. They monitor TCP handshaking between packets to determine whether a requested session is legitimate.
Application level gateways is also a type of firewall. Packet filtering is a firewall technique used to control network access by monitoring outgoing and incoming packets and allowing them to pass or halt based on the source and destination Internet Protocol (IP) addresses, protocols and ports.
The Digital Immune system is a comprehensive approach to virus protection, and is not a type of firewall.
Application level gateways is also a type of firewall. Packet filtering is a firewall technique used to control network access by monitoring outgoing and incoming packets and allowing them to pass or halt based on the source and destination Internet Protocol (IP) addresses, protocols and ports.
The Digital Immune system is a comprehensive approach to virus protection, and is not a type of firewall.
Question 109 
Which of the following CFG’s can’t be simulated by a Finte State Machine?
S  < Sa  b  
S  > aSb  ab  
S  < abX, X > cY, Y  > d  aX  
None of the given options 
Question 109 Explanation:
The language generated by the grammar in option 2 is {a^n b^n  n>=1}, which is not regular language ,hence cannot be simulated by a finite state machine.
Also we can see that grammar in option 2 is neither left linear grammar nor right linear grammar due to production S >aSb , hence can’t be simulated by a finite state machine.
Question 110 
Consider the grammar with nonterminals N = {S,C,S1}, terminals T = {a,b,i,t,e}, with S as the start symbol, and the following set of rules:
S  > iCtSS1a
S1  > eS  •
C  > b
The grammar is NOT LL(1) because:
It is left recursive  
It is right recursive  
It is ambiguous  
It is not contextfree 
Question 110 Explanation:
Question 111 
Which of the following is true for the language {a^{p}] p is a prime]
It is not accepted by a Turing Machine  
It is regular but not contextfree  
It is contextfree but not regular  
It is neither regular nor contextfree, bt accepted by Turing machine 
Question 111 Explanation:
The sequence of p is not in arithmetice progression form due to which it not context and not regular but can be accepted by turing machine.
Question 112 
The language L={0^{i}21^{i } i≥0 } over the alphabet {0.1, 2} is:
Not recursive  
Is recursive and is a deterministic CFL  
Is a regular language  
Is not a deterministic CFL but a CFL 
Question 112 Explanation:
The given language is DCFL and hence recursive. First we will push 0’s in the stack and when we will see 2 then just read it and then pop 0’s corresponding to one 1.
Question 113 
For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1, E2, and E3. If the empty strinp, $indicates end of input, and,  separates alternate right hand sides of productions
S>aAbBbAaBε
A>S
B>S
a  b  $  
S  E1  E2  S>ε 
A  A>S  A>S  error 
B  B>S  B>S  E3 
FIST(A)=(a,b,$)
FIRST(A)={A,B} FIRST(B) = {a,b,ε}
FOLLOW(A)={A,B} FOLLOW(A) = {A,b}
FOLLOW(B)={A,b,$) FOLLOW(B) = {$}
FIRST(B) = {a,b,ε}
FOLLOW(A) = {A,b}
 
FOLLOW(B) = {$}
 
FIRST(A) = {a,b,ε} = FIRST(B)  
FIRST(A) = {A,B} = FIRST(B)
FOLLOW(A)={a,b} FOLLOW(A)={a,b} 
Question 114 
Which of the following combinations of statements is TRUE?
I. There exist parsing algorithms for some programming languages whose complexities are less than O(n3).
II. A programming language which allows recursion can be implemented with static storage allocation.
III. No Lattributed definition can be evaluated in the framework of bottomup parsing
IV. Code improving transformations can be performed at both source language and intermediate code level.
I and II  
I and IV  
III and IV  
I, III and IV 
Question 114 Explanation:
S1 is true. LR parsers is the example whose worst case time complexity is O(n).
S2 is false, because a programming language which allows recursion needs dynamic memory allocation.
S3 is false because if the definition is Sattributed then it can be evaluated by bottomup parsing. Note that every S attributed definition is Lattributed ,vice versa is not true. S4 is true.
S2 is false, because a programming language which allows recursion needs dynamic memory allocation.
S3 is false because if the definition is Sattributed then it can be evaluated by bottomup parsing. Note that every S attributed definition is Lattributed ,vice versa is not true. S4 is true.
Question 115 
Which one of the following is a topdown parser?
Recursive descent parser.  
Operator precedence parser.  
An LR(k) parser.  
An LALR(k) parser 
Question 115 Explanation:
Out of the given options only recursive decent parser is the top down parser.
Question 116 
In a bottomup evaluation of a syntax directed definition, inherited attributes can
Always be evaluated  
Be evaluated only if the definition is L attributed  
Be evaluated only if the definition has synthesized attributes  
Never be evaluated 
Question 116 Explanation:
S1 is false because bottom up evaluation is possible for synthesized attribute which is not an inherited attributes.
S2 is false, because if in L attribute, Sattribute is present then it cannot be inherited attribute.
S3 is false ,same reason as S1.
S2 is false, because if in L attribute, Sattribute is present then it cannot be inherited attribute.
S3 is false ,same reason as S1.
Question 117 
Which one of the following is True at any valid state in shiftreduce parsing?
Viable preflxes appear only at the bottom of the stack and not inside  
Viable prefixes appear only at the top of the stack and not inside  
The stack contains only a set of viable prefixes  
The stack never contains viable prefixes 
Question 117 Explanation:
In SR parsing the stack contains only viable prefixes.
Question 118 
Emp (eid: integer, ename; string, age; integer, salary; real)
Works (eid; integer, did; integer, pct time; integer)
Dept (did; integer, budget; real, managerid; integer)
CREATE VIEW AvegSalaryByAge (age, avgSalary) AS SELECT E.eid, AVG (E.salary) FROM Emp E GROUP By E age.
The above view cannot be updated automatically.  
The above view on Emp can be updated automatically by updating Emp  
The above view cannot be created automatically.  
None of the given options 
Question 119 
Consider a schedule generated by the execution of several SQL transactions, each of which has READ ONLY accessmode. Which of the following is guaranteed?
Conflictserializable  
Serializable  
Recoverable  
All the given options 
Question 119 Explanation:
Since there is no WRITE operation so no conflicts will be there, hence all the given options are correct.
Question 120 
For a database Relation R (A,B,C,D) where the domains of A,B,C, and D only include atomic values, only the following functional dependency and those that can be inferred from them hold: A → C, B →D. The relation is in:
1NF but not in 2NF  
2 NF but not in 3NF  
3NF but not in BCNF  
BCNF but not in 4NF 
Question 120 Explanation:
Candidate key is AB.
And clearly there is partial functional dependency which is
A → C ,in which non prime attribute C is partially dependent on A
And clearly there is partial functional dependency which is
A → C ,in which non prime attribute C is partially dependent on A
Question 121 
Consider the relation R shown in the below Figure.
List all the functional dependencies that this relation instance satisfies.
X  Y  Z 
X1  Y1  Z1 
X1  Y1  Z2 
X2  Y1  Z1 
X2  Y1  Z3 
R: Z → Y, X → Y, and X → Z  
R: Z →Y, X → Y, and XZ → Y  
R: X →Y, X → Z, and XZ → Y  
R: Z →Y, X → Z, and XZ → Y 
Question 121 Explanation:
option 1 is wrong bacause X → Z does not satisfy, since X1 is mapped to two values Z1 and Z2.
Option 3 is wrong because of X → Z.
Option 4 is wrong because of X → Z
Option 3 is wrong because of X → Z.
Option 4 is wrong because of X → Z
Question 122 
The following example is a 
T1:R(X), T2:R(X), T2:W(X), T1:W(X), T2:Commit, T1:Commit
Serializable schedule and it is strict  
Not serializable schedule and it’s not strict  
Serializable schedule, but it’s not strict  
Not serializable schedule, but it is strict 
Question 122 Explanation:
Question 123 
Extendible hashing allows the size of the directory to increase and decrease depending on the number and variety of inserts and deletes. Once the directory size changes, the hash function applied to the search key value should also change. So there should be some information in the index as to which hash function is to be applied. This information is provided by 
Local depth  
Global depth  
Over flow bucket
 
Buddy bucket 
Question 124 
A 3NF table which does not have multiple overlapping candidate keys is said to be in 
1NF  
2NF  
4NF  
BCNF 
Question 124 Explanation:
If in 3NF table there is no multiple overlapping candidate keys then that table is also in BCNF.
Question 125 
Consider the following script:
< html >
< head >< title > JavaScript < title >< / head >
< body >
< script language“JavaScript” >
var a=80
var b=(==80 ? “pass” : “fail”):
document, write(b)
< / script >
< / body >
< / html >
What will be the output of the above script?
pass  
fail  
80  
Error at line 6 
Question 126 
An alternative to Java Script is
VBScript  
ASP, NET  
JSP  
None of the given options 
Question 127 
When destroy 0 method of servlet gets called?
The destroy 0 method is called only once at the end of the life cycle of a servlet.  
The destroy 0 method is called after the servlet has executed service method.  
The destroy 0 method is called only once at the end of the life cycle of a servlet. And destroy 0 method is called after the servlet has executed service method.  
None of the given options

Question 128 
Which of the following way can be used to keep track of previous client request?
Using cookies  
Using hidden form fields  
Using URL rewriting  
All the given options 
Question 129 
FOR XML document to be valid
document need to be wellformed  
document need to be validated against a DTD
 
document need to be wellformed and document need to be validated against a DTD  
document should contain valid data 
Question 130 
Which of the following instruct the browser which style sheet to use
< xmlstylesheet type=”text/xsl” href=”cdxsl” >  
< xmlstylesheet type=”text/xsl” xsl=’cd.xsl” >  
< ’/xmlstylesheet type=”text/dsl” href=”cd.xsl”? >  
< ?xmlstyleshet type=”test/xsl” xsl=”cd.xsl”? >

Question 131 
The value of GET, POST are specified in  of HTTP message
Request line  
Header line  
Status line  
Entity body 
Question 132 
When is the mouseout event fired?
When mouse is no longer over an element  
When mouse is over an element  
When mouse is hovered  
None of the given options 
Question 133 
NFS server is
Stateful server  
Stateless server
 
One whose architecture uses virtual file system(VSF) layer  
Stateless server and One whose architecture uses virtual file system(VFS) layer 
Question 134 
Stateless server means
It keeps state information pertaining to a client request between such requests  
It does not keep state information pertaining to a client request between such requests  
Client binding to server is not required before processing a client request  
None of the given options 
Question 135 
In a distributed system location transparency implies
Physical identity of the resources is not directly embedded into client’s code  
Users can not tell where resources are located  
Users can tell where resources are located  
Physical identity of the resources is not directly embedded into client’s code and Users cannot tell where resources are located 
Question 136 
In group communication involving n members, group addressing uses
n – 1  
One multicast  
One multicast  
May use any one of the given options 
Question 137 
The inherent limitation of Distributed Systems is
Absence of central controller for synchronization  
Absence of shared memory  
Absence of centralized deadlock manager  
Absence of centralized scheduler 
Question 138 
Triple Modular Redundancy(TMR) for fault tolerance is characterized by
Each device is replicated three times  
Each voter is a circuit that has three inputs and one output  
Each device is replicated three times and Each voter is a circuit that has three inputs and one output  
None of the given options 
Question 139 
UNIX semantics for shared file access are characterized by
Every operation on a file is instantly visible to all processes  
No changes are visible to other processes until the file is closed  
These are best suited for centralized systems  
Every operation on a file is instantly visible to all processes and these are best suited for centralized systems 
Question 140 
Which of the following is NOT a characteristic of the data collection maintained in a Data Warehouse?
Integrated  
Subject Oriented  
Volatile  
Timevariant 
Question 141 
Which of the following is an interestingness metric used for data characterization?
Typicality weight  
Recall  
Confidence  
Cohesion 
Question 142 
The Euclidean distance between the pair or data points, X and Y, where X=0.2,0.5,0.6> and Y = 0, 4,0.4,0.1,0.6 > is 
0.09  
0.2  
0.3  
0.5 
Question 143 
Consider a 4dimensional dataset with attributes A,B,C,D described in terms of 10,4,50,20 distinct values respectively. assuming that each cell occupied 2 bytes of memory, when is the total memory space required to materialize all possible 3Dimensional cuboids of the dataset?
32,000 bytes  
33,600 bytes  
16,800 bytes  
14,800 bytes 
Question 144 
Consider an attribute whose value is 48 in a range of 18 to 98. What is its equivalent value in 1 to +1 scale using MinMax normalization?
0.75  
0.25  
0.25  
0.625

Question 145 
Which of the following metrics is used for building decision tree classifiers from the training set of examples?
Euclidean distance  
Support  
Information gain  
Precision 
Question 146 
Which of the following estimates are represented in the Boxplot of an attribute?
Mean, Mode, and Median  
Mean, Mode, Median, Min and Max
 
Min, Max, quartiles Q1, Q2 and Q3  
Only quartiles Q1, Q2 and Q3 
Question 147 
Which of the following clustering algorithms is applicable for grouping nearly 1000 data points into ten mutually exclusive clusters?
Agglomerative clustering  
Divisive clustering  
DBSCAN  
Kmeans clustering 
Question 148 
Which of the following activation functions is applied for hidden and output layer neurons for building a back propagation classifier using neural network?
Sigmoid function  
Radial Basis Function  
Poisson regression  
Gaussian function 
Question 149 
If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam. Then the support of bread and jam is 
2 Percent  
20 Percent  
3 Percent  
30 Percent 
Question 150 
Consider the performance of a binary classifier on a test set containing 1100 positive and 700 negative examples. The components of the confusion matrix in terms of TP, PN, FP and TN are 700,400, 200 and 500 respectively. what is the approximate value of classifier accuracy?
66.6 Percent  
63.3 Percent  
33.3 Percent  
75 Percent 
There are 150 questions to complete.