APPSC2016DLCA
Question 1 
What are you predicting by the logic:
∨x:€y:loyalto(x,y)
Everyone is loyal to someone  
Everyone is loyal to all  
Everyone is not loyal to someone
 
Everyone is loyal 
Question 2 
The field that investigates the mechanics of human intelligence is _______.
Artificial science
 
Cognitive science  
Psychology
 
Sociology 
Question 3 
A1 computing focus on ______ and conventional computing focus on ______ and ______.
data, information, knowledge  
information, data, knowledge
 
knowledge, data, information  
None of the given options 
Question 4 
An inference rule that says, if you know x and you know that if x is true, then y is true, then you can conclude y is
Minmax rule  
Modus Pones rule
 
Chain rule  
None of the given options 
Question 5 
Which one of the following is blind search?
Breadth first search
 
Depth first search
 
Breadth first search and Depth first search  
None of the given options 
Examples of blind search algorithms are:
1. Depth First Search
2. Breadth First Search
3. Uniform Cost Search
Question 6 
The intelligent agents senses through _______ and take actions through _______.
sensors, actuators  
remove, signals  
sensors, actuators and remote, signals
 
None of the given options

Question 7 
Local maximum Plateau, Ridge are the difficulties in which searching algorithms?
Hill climbing search  
Best first search  
Breadth first search  
None of the given options 
Question 8 
A* algorithm uses ___________ heuristic function to search any goal node.
admissible function  
fitness number
 
evaluation function  
None of the given options 
Question 9 
An algorithm, if it is guaranteed to return an optimal solution if it exists, is known as
admissible  
heuristic  
optimistic
 
cognitive 
Question 10 
AO* algorithm is also known as
Admissible optimal algorithm
 
Accurate optimistic algorithm  
And – or algorithm  
None of the given options 
Question 11 
Raster systems display a picture from a definition in a _________
Display file program
 
Frame buffer  
Display controller  
None of the given options 
Question 12 
A bilinear transformation can be simulated by the transformations
Translation, rotation and stretching  
Translation and rotation
 
Rotation, stretching and inversion  
Rotation, stretching, inversion and translation 
Question 13 
Hue of a colour is related to its ___________
Luminance  
Saturation  
Incandescence
 
Wavelength 
Question 14 
If the eccentricity is less than one, then conic is a __________
Circle  
Parabola  
Ellipse  
Hyperbola 
Question 15 
The refresh rate below which a picture flickers is ___________
25  
30  
35  
40 
Question 16 
The physical layer of a network _________
Defines the electrical characteristics of signals passed between the computer and communication devices  
Controls error detection and corrector  
Constructs packets of data and sends them across the network
 
All the given options

Question 17 
Endto End connectivity is provided from hosttohost in _________
Session Layer  
Network Layer  
Data link Layer
 
Transport Layer 
Network layer provides host to host connectivity.
Data link layer provides hop to hop connectivity.
Question 18 
Which layer is not present in TCP/IP Model?
Internet Layer  
Application Layer  
Session Layer  
Transport Layer 
Application layer
Transport layer
Network layer
Data link layer
Physical layer
Question 19 
Nyquist Theorem to calculate maximum data rate is _______
2H log_{2} bits/ses  
H log_{2} V bits/ses  
H log_{2} (1+S/N)  
2H log_{2} (1+S/N)

Question 20 
LANs can be connected by devices called _________ which operate in the data link layer?
Hub
 
Bridges  
HDCL  
Tunnel

Question 21 
Two different networks can be connected by using
Satellite  
Gateway  
Bridges  
None of the given options 
Question 22 
Which of the following is not a Routing Algorithm?
Broadcast  
Link state  
Traffic shaping  
Distance vector

Question 23 
_________ is a device that receives a radio signal, strengthens it, and sends it on.
Repeater  
WiFi
 
Hub  
Microwave 
Question 24 
What is the main reason for developing ISO/OSI model for networks?
Manufactures disliked the TCP/IP protocol suite  
The rate of data transfer was increasing exponentially
 
Standards were needed to allow any two systems to communicate
 
None of the given options

Question 25 
Which layer functions as a liaison between user support layers and network support layers?
Network layer  
Physical layer  
Transport layer  
Session layer 
Question 26 
In the IPv4 addressing format, the number of networks allowed under Class C addresses is
2^{14}  
2^{21}  
2^{7}  
2^{24} 
Question 27 
Which of the following flipflops is free from race around problem?
D flipflop  
T flipflop
 
SR flipflop
 
Masterslave JK flipflop 
During high clock when ever applied input changes the output also changes. But in JK flip flop when j=k=1 , without any change in the input the output changes , this condition is called a race around condition. The circuit accepts input data when the clock signal is “HIGH”, and passes the data to the output on the fallingedge of the clock signal. In other words, the MasterSlave JK Flip flop is a “Synchronous” device as it only passes data with the timing of the clock signal.
Question 28 
The number of full and half adders required to add 16bit numbers are
8 half adders, 8 full adders  
1 half adder, 15 full adders  
16 half adders, 0 full adders  
half adders, 12 full adders

Question 29 
An example of a tautology is
x ∨ y  
x ∨ (¬ y)  
x ∨ (¬ x)  
(x →y) ^ (x ← y)

Question 30 
The idempotent law in the Boolean algebra says that
¬ (¬ x) = x  
x + x = x  
x + xy = x  
x(x + y) = x 
Question 31 
The proposition (p→q) ^ (¬ q ∨ (p ∨ p) is equivalent to
q → p  
p → q
 
(q → p) ∨ (p → q)  
(p → q) ∧ (q → p) 
= (p>q) ^ (q >p) (since ¬ q v p = q>p)
Question 32 
How many flipflops are required mod – 16 counters?
5  
6  
3  
4 
So log_{2} 16=4.
Question 33 
The number of control lines for a 8 to 1 multiplexer is
2  
3  
4  
5 
Question 34 
The gray code for decimal number 6 is equivalent
1100  
1001  
0101  
0110 
The binary value b3, b2, b1, b0 and find the gray code g3, g2, g1, g0 based on the below concept, g3 = b3 = 0
g2 = b3 XOR b2 = 0 xor 1 = 1
g1 = b2 XOR b1 = 1 xor 1 = 0
g0 = b1 XOR b0 = 1 xor 0 = 1
Question 35 
The gates required to build a half adder are
ExOR gate and NOR gate  
ExOR gate and OR gate  
ExOR gate and AND gate  
Four NAND gates 
Question 36 
In order to implement an nvariable switching function, a MUX must have
2^{n} inputs  
2^{n} + inputs  
2^{n1} inputs
 
2^{n} – 1 inputs 
Question 37 
The worst case time complexity of Quick Sort is __________
O(n^{2})  
O(log n)  
O(n)  
O(n logn)

The worst case quicksort happens only 2 times
1. Elements are already in sorted order.
2. All elements having the same weight.
Question 38 
The worst case time complexity of Merge Sort is _______
O(n^{2})  
O(log n)
 
O(n)
 
O(n logn)

The merge sort will not depend on the type of input. It will give the best, average and worst case time complexity is O(nlogn) only.
Question 39 
Which of the following sorting procedures is the slowest?
Quick sort  
Heap sort  
Shell sort  
Bubble sort

Question 40 
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
T(n) = 2T(n2) + 2  
T(n) = 2T(n1) + n  
T(n) = 2T(n/2) + 1  
T(n) = 2T(n1) + 1 
1) Only one disk can be moved at a time.
2) Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
3) No disk may be placed on top of a smaller disk. The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
T(n) = 2T(n1) + 1
This recurrence relation will give O(2^{n}) time complexity.
Question 41 
Which of the following sorting methods would be most suitable for sorting a list which is almost sorted?
Bubble Sort
 
Insertion Sort  
Selection Sort
 
Quick Sort

Question 42 
The running time of insertion sort is
O(n^{2})  
O(n)  
O(log n)
 
O(n log n)

Question 43 
A sort which compares adjacent elements in a list and switches where necessary is _________
Insertion sort
 
Heap sort
 
Quick sort  
Bubble sort 
Question 44 
The correct order of the efficiency of the following sorting algorithms according to their overall running time comparison is
insertion>selection>bubble  
insertion>bubble>selection
 
selection>bubble>insertion
 
bubble >selection>insertion 
Question 45 
A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
insertion sort  
selection sort  
heap sort
 
quick sort

Question 46 
A primary key for an entity is
A candidate  
Any attribute
 
A unique attribute
 
A super key 
Question 47 
Aggregate functions in SQL are
GREATEST, LEAST and ABS
 
SUM, COUNT AND AVG  
UPPER, LOWER AND LENGTH
 
SQRT, POWER AND MOD

Question 48 
If a relation is an 2NF and 3NF forms, then
no nonprime attribute is functionally dependent on other nonprime attributes  
no nonprime attribute is functionally depend on the prime attributes  
all attributes are functionally independent  
prime attribute is functionally independent of all nonprime attributes

Question 49 
Which normal form is considered adequate for relational database design?
2 NF  
3 NF  
4 NF
 
BCNF

Question 50 
The data type created by data abstraction process is called
class  
structure
 
abstract data type  
user defined data type 
Question 51 
A super key for an entity consists of
one attribute only
 
At least two attributes
 
at most two attributes
 
one or more attributes

For example : Consider a relation R(A,B,C,D) where “A” is the candidate key of “R” then Superkeys of “R” will be {A,AB, AC, AD, ABC, ABD, ACD, ABCD}.
Question 52 
Which of the following sets of keywords constitutes a mapping in SQL?
SELECT, FROM, TABLE  
SELECT, FROM, WHERE
 
CONNECT, TABLE, CREATE  
SELECT, TABLE, INSERT

A SELECT statement retrieves zero or more rows from one or more database tables WHERE specifies which rows to retrieve. The SQL From clause is the source of a row set to be operated upon in a Data Manipulation Language (DML) statement.
Exam[le: SELECT *
FROM mytable
WHERE mycol > 100
Question 53 
The complexity of binary search algorithm is
O(n)  
O(log n)  
O(n^{2})  
O(n log n) 
T(n) = T(n/2) + 1
Solving above recurrence relation we will get O(logn).
Question 54 
The operation of processing each element in the list is known as
sorting  
merging  
inserting  
traversal 
Question 55 
The postfix for a string is ABC + D*, the actual string will be
(A(B+C))*D  
((AB)+C)*D  
((A+B)C)*D
 
(A+(BC))*D 
Question 56 
The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of numbers like {1,3,2,5,4,6} is
quick sort
 
bubble sort
 
merge sort
 
selection sort

Best case of Bubble sort is O(n)
Best case of merge sort is O(n logn)
Best case of selection sort is (n^{2})
So the algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of numbers is Bubble sort.
Question 57 
For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is
2n  
(2n1)/2
 
2e  
e2/2 
Question 58 
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE?
I. Quick sort runs in Q(n^{2}) time
II. Bubble sort runs in Q(n^{2}) time
III. Mergesort runs in Q(n^{2}) time
IV. Insertion sort runs in Q(n^{2}) time
I and II only  
I and III only  
II and IV only
 
I and IV only  
None of the above. 
Bubble sort runs in O(n) time if the input is already in sorted order.
Merge sort runs in O(nlogn) time.
Insertion sort runs in O(n) time.
Question 59 
A full binary tree with n leaves contains
n nodes  
log_{2} n nodes  
2n  1 nodes
 
2n nodes 
Question 60 
If (rear == maxsize  1) rear=0; else rear = rear + 1; is required in
circular queue
 
linear queue  
stack  
deque

Question 61 
How much extra space is used by heap sort?
O(1)  
O(log n)  
O(n)  
O(n^{2})

Heap sort uses MaxHeapify function which calls itself but it can be made using a simple while loop and thus making it an iterative function which takes no space.
So, the space complexity of Heap Sort can be reduced to O(1)
> The heapify function does not take O(logn) space, it will take O(logn) time in the worst case. Here we don't do heapify through any recursion call. We will do it through an iterative method and we don't require any auxiliary space in this sorting. We use only the input array.
So, we do heap sort in O(1) space complexity
Question 62 
The data structure required for breadth first traversal on a graph is
queue
 
stack
 
array  
tree

The data structure required for depth first traversal on a graph is Stack.
Question 63 
Data scrubbing is which of the following?
A process to reject data from the data warehouse and to create the necessary indexes  
A process to load the data in the data warehouse and to create the necessary indexes  
A process to upgrade the quality of data after it is moved into a data warehouse
 
A process to upgrade the quality of data before it is moved into a data warehouse

Question 64 
The active data warehouse architecture includes which of the following?
At least one data mart
 
Data that can extracted from numerous internal and external sources
 
Near realtime updates
 
All the given options

Question 65 
A goal of data mining includes which of the following?
To explain some observed event or condition
 
To confirm that data exists
 
To analyze data for expected relationships
 
To create a new data warehouse

Question 66 
A snowflake scheme is which of the following types of tables?
Fact
 
Dimension
 
Helper  
All the given options 
Question 67 
The generic two level data warehouse architecture includes which of the following?
At least one data mart
 
Data that can extracted from numerous internal and external sources
 
Near real time updates
 
All the given options

Question 68 
Fact tables are which of the following?
Completely denormalized  
Partially denormalized  
Completely normalized  
Partially normalized

Question 69 
Data transformation includes which of the following?
A process to change data from a detailed level to a summary level  
A process to change data from a summary level to a detailed level
 
Joining data from one source into various sources of data  
Separating data from one source into various sources of data

Question 70 
A digital signature is
scanned signature
 
signature in binary form
 
encrypting information  
handwritten signature

Question 71 
Which of the following clustering algorithms is applicable for grouping nearly 10000 data points into ten mutually exclusive clusters?
Agglomerative clustering  
Divisive clustering  
DBSCAN
 
Kmeans clustering

Question 72 
An Ebusiness that allows consumers to select their own descriptions for products and services (like Blogs) is following which Ebusiness model?
B2B  
B2C  
C2C  
C2B 
Question 73 
Kerberos is an encryption based system that uses
secret key encryption  
public key encryption  
private key encryption
 
datakey encryption

Question 74 
A firewall is
an established network performance reference point
 
software or hardware used to isolate a private network from a public network
 
a virus that infects macros  
a predefined encryption key used to encrypt and decrypt data transmissions 
Question 75 
LDAP stands for
Light weight Data access protocol
 
Light weight Directory Access protocol  
Large Data Access protocol
 
Large Directory Access protocol 
Question 76 
Amazon.com comes under the following model
B2B  
B2C  
C2C
 
C2B 
Question 77 
Internet access components in Ecommerce infrastructure involves
TCP/IP package  
kiosks  
web browsers
 
All the given options 
Question 78 
Ecommerce infrastructure involves
web servers  
ecatalogs
 
networks  
All the given options

Question 79 
How many 8bit characters can be transmitted per second over a 9600 baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, two stop bits, and one parity bit?
600
 
800  
876  
1200 
So no. of characters that can be transmitted per second is = 9600/12 = 800.
Question 80 
The private key in public key encryption is used for
encryption  
hashing
 
decryption  
decryption and hashing

Question 81 
Public key encryption makes use of
one key  
two keys  
hash function
 
All the given options 
Question 82 
Determine the maximum length of the cable (in Km) for transmitting data at a rate of 700 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/sec.
1.75  
1.428
 
2  
2.152

T_{t} ≥ 2T_{p}
Where T_{t} = Transmission delay
T_{p} = Propagation delay
L/B ≥ 2×d/V
d ≤ L×V/2×B
d ≤ 10000×2×10^{8}/2×700×10^{6} = 1428m = 1.428Km
Question 83 
Which protocol will be used to automate the IP configuration mechanism which includes IP address, subnet mask, default gateway, and DNS information?
SMTP  
DHCP  
ARP  
TCP/IP 
Question 84 
The complete graph Kn has _______ different spanning trees.
n^{n2}  
n×n  
n^{n}  
n^{2} 
Question 85 
Which of the following is not a type of graph?
Euler  
Hamiltonian  
Tree  
Path 
Question 86 
Pigeonhole principle states that if A→B and A>B then _______
f is not onto
 
f is not oneone  
f is neither oneone nor onto
 
f may be oneone 
Question 87 
Two girls have picked 10 roses, 15 sunflowers and 14 daffodils. What is the number of ways they can divide the flowers amongst themselves?
1,638  
2,640  
2,100  
None of the given options 
So for roses = C(10+21,21) = 11
For sunflowers = C(15+21,21) = 16
For daffodils = C(14+21,21) = 15
So final answer is = 11*16*15 = 2640
Question 88 
If G is an undirected planar graph on n vertices with e edges then?
e<=n  
e<=2n  
e<=3n  
None of the given options 
Where r = no. of regions
From these we get e <= 3n  6
Now 2n <= 3n  6 for all vertices n >= 3
So e <= 2n is the answer.
Question 89 
A bag contains 10 white balls and 15 black balls. Two balls are drawn in succession. The probability that one of them is black and the other is white is ______.
4/5  
2/3  
0.5  
1/3 
= 10×15/25×24 + 15×10/25×24
= 1/2
Question 90 
R be a relation in a set A. Then R is an equivalence relation in A if and only if _____
R is reflexive, R is symmetric and R is transitive  
R is anti reflexive, R is symmetric and R is transitive  
R is anti reflexive, R is antisymmetric and R is transitive  
None of the given options 
Question 91 
Which of the following are tautologies?
((PvQ)^Q↔Q  
(Pv(P→Q))→P  
((PvQ)^P)→Q  
((PvQ)^P)→Q 
((P v Q) ^ Q) <> Q
Lets solve LHS,
(P v Q) ^ Q = (P ^ Q) v (Q ^ Q) = (P ^ Q) v Q = PQ + Q = Q(1+P) = Q
So LHS = RHS. Hence tautology.
Similarly check for all other options, none of the other options will get LHS = RHS.
Question 92 
Which of the following will not form an abelian group?
Addition in the set of natural numbers  
Subtraction in the set of integers  
Multiplication over the set of integers  
All the given options

Question 93 
A binary relation S = ϕ(empty set) on set A = {1,2,3} is
neither reflexive nor symmetric
 
symmetric and reflexive  
transitive and reflexive  
transitive and symmetric 
Question 94 
The asymptotic notation for defining the average time complexity is
Equivalence  
Symmetric  
Reflexive
 
Both Symmetric and Reflexive 
Question 95 
The binary relation R={(1,1),(2,1),(2,2),(2,3),(2,4),(3,1),(3,2),(3,3),(3,4)} on the set A = {1,2,3,4} is
reflexive, symmetric and transitive  
neither reflexive nor irreflexive but transitive  
irreflexive and antisymmetric  
irreflexive, symmetric and transitive

Question 96 
Management information systems (MIS)
create and share documents that support daytoday office activities  
process business transactions (e.g., time cards, payments, orders, etc.)  
capture and reproduce the knowledge of an expert problem solver  
use the transaction data to produce information needed by managers to run the business

Question 97 
If a university sets up a webbased information system that faculty could access to record student grades and to advise students, that would be an example of a/an
CRM  
intranet  
ERP  
extranet

Question 98 
A software project involves execution of 5 tasks T1, T2, T3, T4 and T5 of duration 10, 15, 18, 30 and 40 days, respectively. T2 and T4 can only start after T1 completes. T3 can start after T2 completes. T5 can start only after both T3 and T4 complete. What is the slack time of the task T3 in days?
0  
3  
18  
30 
Question 99 
Which of the following enables enterprise interoperability?
DFD  
Information flow diagram  
XML  
Entity relationship diagram 
Question 100 
Banker’s algorithm is used for _______ purpose.
deadlock avoidance  
deadlock removal
 
deadlock prevention
 
deadlock continuations

Question 101 
An example of a memory management system call in UNIX is
fork  
mmap
 
sigaction  
execve

Question 102 
In processor management, roundrobin method essentially uses the preemptive version of
FILO
 
FIFO  
SJF  
longest time first

Question 103 
If the executing program size is greater than the existing RAM of a computer, it is still possible to execute the program, if the OS supports
Synchronization
 
fault tolerance  
paging system  
Scheduling 
Question 104 
Variable partition memory management technique with compaction results in
reduction of fragmentation  
minimal wastage  
segment sharing  
None of the given options 
Question 105 
Moving process from main memory to disk is called
caching  
termination  
swapping  
Interruption 
Question 106 
The principle of locality of reference justifies the use of
virtual memory  
interrupts  
cache memory  
secondary memory 
Locality of reference, also known as the principle of locality, is the tendency of a processor to access the same set of memory locations repetitively over a short period of time. There are two basic types of reference locality – temporal and spatial locality.
Question 107 
Which command is used to display the top of the file?
cat  
head  
more
 
grep 
Question 108 
Which command is used to remove the read permission of the file ‘note’ from both the group and others?
chmodgo+r note
 
chmodgo+rw note  
chmod gox note  
chmod gor, 4x note 
Question 109 
Which of the following is not a communication command?
write
 
mesg  
mail  
grep 
Question 110 
Shell  
Kernel  
Compiler
 
None of the given options 
Question 111 
Which of the following commands can be used to get information about individual terminal?
who am i  
pwd  
i/u  
which

Question 112 
UNIX command used to compare the successive lines of file1 with the corresponding lines of file2 and output a 3columnar report on lines unique to file1, file2 and common to both is ______
cmp file1 file2
 
comm file1 file2  
diff file1 file2
 
comp file1 file2 
Question 113 
We can append to a file instead of overwriting by using the
>>symbols  
>symbols  
< 
Question 114 
Which of the following is not a filter?
cat  
wc  
grep
 
sort 
Question 115 
main( ) { int x; x=3*4%5; printf(“x=%d”,x); }
The output is
x=2  
x=2.3
 
x=5  
x=1.9

Question 116 
The time complexity of the following C function is (assume n>0)
int recursive (int n) { if (n==1) return(1); else return(recursive (n1) + recursive(n1)); }
O(n)  
O(n log n)  
O(n^{2})  
O(2^{n}) 
Note ‘a’ is a constant O(1) cost that the nonrecursive part of the function takes.
Solving the recurrence by Back Substitution:
T(n) = 2T(n1)+a
T(n1) = 2T(n2)+a
T(n2) = 2T(n3)+a
:
:
Thus we can write the equation as follows
T(n) = 2(2T(n2)+a)+a = 4T(n2) + 2a + a
T(n) = 4(2T(n3)+a) + 2a + a = 8T(n3) + 4a + 2a + a
:
:
:
T(n) = 2^{k} T(nk) + (2^{k}  1)a
On substituting limiting condition,
T(1) = 1
=> n  k = 1
=> k = n1
Therefore, our solution becomes
2^{n1} + (2^{n1}  1)a
= O(2^{n})
Question 117 
If a class C is derived from class B which is derived from class A, all though public inheritance, then a class C member function can access
protected and public data in C and B
 
protected and public data only C  
private data in A and B
 
protected data in A and B 
Question 118 
In C++ operator, << operator is called as
an insertion operator or put to operator  
an extraction operator or get from operator
 
an insertion operator or get from operator  
None of the given options 
Question 119 
Function overloading in C++ is
A group function with the same name
 
all have the same numbers and type of arguments
 
functions with same name and same numbers and same type of arguments
 
None of the given options 
Question 120 
How constructor differ from destructor?
Constructors can be overloaded but destructors can’t be overloaded  
Constructors can take arguments but destructor can’t  
Constructors can be overloaded but destructors can’t be overloaded and Constructors can take arguments but destructor can’t
 
None of the given options

Destructors cant be overloaded because your code wouldn't have a clue about which destructor it needs to call when you destroy an object.
Question 121 
Abstract class cannot have
zero instance  
multiple instance
 
Both zero instance and multiple instance
 
None of the given options 
Question 122 
Usually a pure virtual function
has complete function body  
will never be called  
will be called only to delete an object
 
is defined only in derived class

Question 123 
If x=5, y=2, then x^y equals (where, ^ is a bitwise XOR operator)
00000111  
10000010
 
10100000  
11001000 
1 XOR 1 = 0
1 XOR 0 =1
0 XOR 0 = 0
0 XOR 1 = 1
So 5 in binary form is 00000101 and 2 in binary form is 00000010.
Hence 00000101 XOR 00000010 = 00000111.
Question 124 
Runtime polymorphism is achieved by
friend function  
virtual function
 
operator overloading  
function overloading 
Question 125 
The operator that cannot be overloaded is
++  
::  
0  
~ 
Question 126 
The keyword friend does not appear in
the class allowing access to another class  
the class desiring access to another class  
the private section of a class
 
the public section of a class 
Question 127 
What is the appropriate pairing of items in the two columns listing various activities encountered in a software cycle?
P) Requirements Capture 1) Module development and Integration Q) Design 2) Domain Analysis R) Implementation 3) Structural and Behavioural Modeling S) Maintenance 4) Performance Tuning
P3, Q2, R4, S1  
P2, Q3, R1, S4  
P3, Q2, R1, S4  
P2, Q3, R4, S1 
Question 128 
Which of the following software engineering concepts does Ada language support?
Abstraction
 
Generic  
Information hiding
 
All the given options 
Question 129 
Prototyping is used to
test the software as an end product  
expand design details
 
refine and establish requirements gathering  
None of the given options 
Question 130 
Regression testing is primarily related to
function testing  
data flow testing  
development testing  
maintenance testing

Question 131 
Acceptance testing is done by
developers  
customers  
testers
 
None of the given options 
Question 132 
Most Undesirable Type of Coupling is
Data Coupling
 
Control Coupling  
Stamp Coupling
 
Content Coupling

Question 133 
Topdown design does not require
stepwise refinement  
loop invariant  
flow charting  
modularity

Question 134 
Which model is simplest model in software development?
Waterfall model
 
Prototyping model  
Iterative model  
None of the given options 
Question 135 
Match the following:
P) Waterfall model 1) Specifications can be developed incrementally Q) Evolutionary model 2) Requirements compromises are inevitable R) Component based model 3) Explicitly addressing the problem of Risk during development S) Spiral Model 4) Inflexible partitioning of the Project into stages
P1, Q2, R3, S4  
P4, Q1, R2, S3  
P4, Q3, R1, S2  
P3, Q1, R2, S4 
Question 136 
A major defect in waterfall model in software development is that
the documentation is difficult  
a blunder at any stage can be disastrous  
a trial version is available only at the end of the project  
the maintenance of the software

Question 137 
The approach to software testing is to design test cases to
break the software  
understand the software
 
analyze the design of sub processes in the software
 
analyze the output of the software

Question 138 
In a software project, COCOMO (Constructive Cost Model) is used to estimate
effort, cost and schedule based on the size of the software
 
size and duration based on the effort of the software  
effort and cost based on the duration of the software  
size, effort and duration based on the cost of the software

Question 139 
Beta testing is carried out by
users
 
developers
 
managers  
None of the given options

Question 140 
What is the difference between XML and HTML?
HTML is used for exchanging data, XML is not  
XML is used for exchanging data, HTML is not  
HTML can have user defined tags, XML cannot
 
XML is used for exchanging data, HTML is not (and) HTML can have user defined tags, XML cannot

Question 141 
What are tags used for?
To replace paragraph i.e., p tags
 
To logically divide the paragraphs  
To logically divide the document
 
To provide space between tables

Question 142 
What are meta tags used for?
To store information usually relevant to browsers and search engines
 
To only store information usually relevant to browsers
 
To only store information about search engines
 
To store information about external links

Question 143 
Which is true to change the text colour to red?
< BODY BGCOLOUR=RED >  
< BODY TEXT=RED >  
< BODY COLOUR=RED >  
None of the given options

Question 144 
Which tag is used to display the numbered list?
< OL > < /OL >  
< DL > < /DL >
 
< UL > < /UL >  
< LI > < /LI > 
Question 145 
The most popular way to materialize XML document is to use
DTD
 
XSLT
 
HTML  
SOAP 
Question 146 
The ______ method ensures that a new web page is generated.
GET  
POST  
DELETE
 
UPDATE

Question 147 
Apache Tomcat is a
Servlet
 
Java program
 
web server
 
web server that is capable of running Java programs

Question 148 
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 149 
In Javascript, what does in NaN function do?
Return true, if the argument is not a number
 
Return false, if the argument is not a number
 
Return true, if the argument is a number
 
None of the given options

Question 150 
Find the value of Math round(20.5)
21  
20  
20  
21 