APPSC-2016-DL-CA

Question 1

What are you predicting by the logic:

 ∨x:€y:loyalto(x,y) 
A
Everyone is loyal to someone
B
Everyone is loyal to all
C
Everyone is not loyal to someone
D
Everyone is loyal
       Engineering-Mathematics       Propositional-Logic
Question 2

The field that investigates the mechanics of human intelligence is _______.

A
Artificial science
B
Cognitive science
C
Psychology
D
Sociology
Question 3

A1 computing focus on ______ and conventional computing focus on ______ and ______.

A
data, information, knowledge
B
information, data, knowledge
C
knowledge, data, information
D
None of the given options
Question 3 Explanation: 
A1 computing focuses on knowledge and conventional computing focus on data and information.
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

A
Minmax rule
B
Modus Pones rule
C
Chain rule
D
None of the given options
       Engineering-Mathematics       Propositional-Logic
Question 4 Explanation: 
Modus ponen rule says that "P implies Q and P is asserted to be true, therefore Q must be true."
Question 5

Which one of the following is blind search?

A
Breadth first search
B
Depth first search
C
Breadth first search and Depth first search
D
None of the given options
       Data-Structures       Graphs-and-Tree
Question 5 Explanation: 
Blind search algorithms have no additional information on the goal node other than the one provided in the problem definition. The plans to reach the goal state from the start state differ only by the order and/or length of actions.
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 _______.

A
sensors, actuators
B
remove, signals
C
sensors, actuators and remote, signals
D
None of the given options
Question 7

Local maximum Plateau, Ridge are the difficulties in which searching algorithms?

A
Hill climbing search
B
Best first search
C
Breadth first search
D
None of the given options
       Algorithms       Algorithm-Paradigms
Question 8

A* algorithm uses ___________ heuristic function to search any goal node.

A
admissible function
B
fitness number
C
evaluation function
D
None of the given options
Question 9

An algorithm, if it is guaranteed to return an optimal solution if it exists, is known as

A
admissible
B
heuristic
C
optimistic
D
cognitive
Question 10

AO* algorithm is also known as

A
Admissible optimal algorithm
B
Accurate optimistic algorithm
C
And – or algorithm
D
None of the given options
Question 11

Raster systems display a picture from a definition in a _________

A
Display file program
B
Frame buffer
C
Display controller
D
None of the given options
Question 12

A bilinear transformation can be simulated by the transformations

A
Translation, rotation and stretching
B
Translation and rotation
C
Rotation, stretching and inversion
D
Rotation, stretching, inversion and translation
Question 13

Hue of a colour is related to its ___________

A
Luminance
B
Saturation
C
Incandescence
D
Wavelength
Question 14

If the eccentricity is less than one, then conic is a __________

A
Circle
B
Parabola
C
Ellipse
D
Hyperbola
       Engineering-Mathematics       Co-ordinate-Geometry
Question 14 Explanation: 
If the eccentricity is zero, the curve is a circle; if equal to one, a parabola; if less than one, an ellipse; and if greater than one, a hyperbola.
Question 15

The refresh rate below which a picture flickers is ___________

A
25
B
30
C
35
D
40
Question 15 Explanation: 
The refresh rate below which a picture flickers is 25.
Question 16

The physical layer of a network _________

A
Defines the electrical characteristics of signals passed between the computer and communication devices
B
Controls error detection and corrector
C
Constructs packets of data and sends them across the network
D
All the given options
       Computer-Networks       OSI-TCP-layers
Question 16 Explanation: 
The physical layer of a network defines the electrical characteristics of signals passed between the computer and communication devices.
Question 17

End-to End connectivity is provided from host-to-host in _________

A
Session Layer
B
Network Layer
C
Data link Layer
D
Transport Layer
       Computer-Networks       OSI-TCP-layers
Question 17 Explanation: 
Transport layer provides end to end connectivity.
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?

A
Internet Layer
B
Application Layer
C
Session Layer
D
Transport Layer
       Computer-Networks       TCP/IP-Layers
Question 18 Explanation: 
TCP/IP model contains only 5 layers:
Application layer
Transport layer
Network layer
Data link layer
Physical layer
Question 19

Nyquist Theorem to calculate maximum data rate is _______

A
2H log2 bits/ses
B
H log2 V bits/ses
C
H log2 (1+S/N)
D
2H log2 (1+S/N)
Question 19 Explanation: 
Nyquist theorem to calculate maximum data rate is 2H log2bits/sec.
Question 20

LANs can be connected by devices called _________ which operate in the data link layer?

A
Hub
B
Bridges
C
HDCL
D
Tunnel
       Computer-Networks       LAN
Question 20 Explanation: 
LANs can be connected by devices which have at least data link layer.So bridge is the correct option, because it has data link layer.
Question 21

Two different networks can be connected by using

A
Satellite
B
Gateway
C
Bridges
D
None of the given options
       Computer-Networks       Hardware-and-various-devices-in-networking
Question 21 Explanation: 
Two different networks can be connected by devices which have at least a network layer. So from the given option gateway has the network layer.
Question 22

Which of the following is not a Routing Algorithm?

A
Broadcast
B
Link state
C
Traffic shaping
D
Distance vector
       Computer-Networks       Routing
Question 22 Explanation: 
Traffic shaping is a congestion control algorithm and not a routing algorithm.
Question 23

_________ is a device that receives a radio signal, strengthens it, and sends it on.

A
Repeater
B
WiFi
C
Hub
D
Microwave
       Computer-Networks       Routing
Question 23 Explanation: 
Repeater is a device that receives a radio signal, strengthens it, and sends it to the other side.
Question 24

What is the main reason for developing ISO/OSI model for networks?

A
Manufactures disliked the TCP/IP protocol suite
B
The rate of data transfer was increasing exponentially
C
Standards were needed to allow any two systems to communicate
D
None of the given options
       Computer-Networks       ISO-OSI-layers
Question 24 Explanation: 
The main reason for developing the OSI model for networks is to create a common platform for software developers and hardware manufactures that encourage the creation of networking products that can communicate with each other over the network. To help network administrators by dividing large data exchange process in smaller segments.
Question 25

Which layer functions as a liaison between user support layers and network support layers?

A
Network layer
B
Physical layer
C
Transport layer
D
Session layer
       Computer-Networks       ISO-OSI-layers
Question 26

In the IPv-4 addressing format, the number of networks allowed under Class C addresses is

A
214
B
221
C
27
D
224
       Computer-Networks       IP-Address
Question 26 Explanation: 
The number of networks allowed under Class C addresses are 221 and each network contains 28 IP addresses.
Question 27

Which of the following flip-flops is free from race around problem?

A
D flip-flop
B
T flip-flop
C
S-R flip-flop
D
Master-slave J-K flip-flop
       Digital-Logic-Design       Sequential-Circuits
Question 27 Explanation: 
Master slave JK flip-flops is free from race around condition.
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 falling-edge of the clock signal. In other words, the Master-Slave 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 16-bit numbers are

A
8 half adders, 8 full adders
B
1 half adder, 15 full adders
C
16 half adders, 0 full adders
D
half adders, 12 full adders
       Digital-Logic-Design       Combinational-Circuit
Question 28 Explanation: 
For the first 15 bits we need 15 full adders and for LSB we need 1 half adder.
Question 29

An example of a tautology is

A
x ∨ y
B
x ∨ (¬ y)
C
x ∨ (¬ x)
D
(x →y) ^ (x ← y)
       Engineering-Mathematics       Propositional-Logic
Question 29 Explanation: 
Question 30

The idempotent law in the Boolean algebra says that

A
¬ (¬ x) = x
B
x + x = x
C
x + xy = x
D
x(x + y) = x
       Engineering-Mathematics       Propositional-Logic
Question 30 Explanation: 
The idempotent law in the Boolean algebra says that a op a = a, where op is any operator.
Question 31

The proposition (p→q) ^ (¬ q ∨ (p ∨ p) is equivalent to

A
q → p
B
p → q
C
(q → p) ∨ (p → q)
D
(p → q) ∧ (q → p)
       Engineering-Mathematics       Propositional-Logic
Question 31 Explanation: 
(p→q) ^ (¬ q ∨ (p ∨ p) = (p->q) ^ (¬ q v p) (since pvp = p)
= (p->q) ^ (q ->p) (since ¬ q v p = q->p)
Question 32

How many flip-flops are required mod – 16 counters?

A
5
B
6
C
3
D
4
       Digital-Logic-Design       Sequential-Circuits
Question 32 Explanation: 
No. of flip flops required for the mod N counter is log2 N.
So log2 16=4.
Question 33

The number of control lines for a 8 to 1 multiplexer is

A
2
B
3
C
4
D
5
       Digital-Logic-Design       Combinational-Circuit
Question 33 Explanation: 
No. of control lines for 8 to 1 multiplexer is log2 8 = 3.
Question 34

The gray code for decimal number 6 is equivalent

A
1100
B
1001
C
0101
D
0110
       Digital-Logic-Design       Number-Systems
Question 34 Explanation: 
The binary value of 6 is 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

A
Ex-OR gate and NOR gate
B
Ex-OR gate and OR gate
C
Ex-OR gate and AND gate
D
Four NAND gates
       Digital-Logic-Design       Combinational-Circuit
Question 35 Explanation: 
In half adder for sum value we need 1 XOR gate and for carry value we need 1 AND gate.
Question 36

In order to implement an n-variable switching function, a MUX must have

A
2n inputs
B
2n + inputs
C
2n-1 inputs
D
2n – 1 inputs
       Digital-Logic-Design       Combinational-Circuit
Question 36 Explanation: 
In order to implement an n-variable switching function, a MUX must have 2n-1 inputs, where we can give n-1 variables and remaining 1 we can give to the select lines.
Question 37

The worst case time complexity of Quick Sort is __________

A
O(n2)
B
O(log n)
C
O(n)
D
O(n logn)
       Algorithms       Sorting
Question 37 Explanation: 
The worst case time complexity of Quick Sort is O(n2).
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 _______

A
O(n2)
B
O(log n)
C
O(n)
D
O(n logn)
       Algorithms       Sorting
Question 38 Explanation: 
The worst case time complexity of Merge Sort is 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?

A
Quick sort
B
Heap sort
C
Shell sort
D
Bubble sort
       Algorithms       Sorting
Question 39 Explanation: 
Bubble sorting is the slowest because the average time complexity of all other sorting algorithms given in options are less than O(n2) but for bubble sort it is O(n2).
Question 40

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is

A
T(n) = 2T(n-2) + 2
B
T(n) = 2T(n-1) + n
C
T(n) = 2T(n/2) + 1
D
T(n) = 2T(n-1) + 1
       Algorithms       Recurrences
Question 40 Explanation: 
Tower of Hanoi is a mathematical puzzle where we have three rods and n disks. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
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(n-1) + 1
This recurrence relation will give O(2n) time complexity.
Question 41

Which of the following sorting methods would be most suitable for sorting a list which is almost sorted?

A
Bubble Sort
B
Insertion Sort
C
Selection Sort
D
Quick Sort
       Algorithms       Sorting
Question 41 Explanation: 
If the elements of the list are almost sorted then insertion is the best to be chosen because it will take O(n) time.
Question 42

The running time of insertion sort is

A
O(n2)
B
O(n)
C
O(log n)
D
O(n log n)
       Algorithms       Sorting
Question 42 Explanation: 
The worst case time complexity of insertion sort algorithm is O(n2).
Question 43

A sort which compares adjacent elements in a list and switches where necessary is _________

A
Insertion sort
B
Heap sort
C
Quick sort
D
Bubble sort
       Algorithms       Sorting
Question 43 Explanation: 
The given description in question is about bubble sort in which we compare adjacent elements in the list and switches where necessary.
Question 44

The correct order of the efficiency of the following sorting algorithms according to their overall running time comparison is

A
insertion>selection>bubble
B
insertion>bubble>selection
C
selection>bubble>insertion
D
bubble >selection>insertion
       Algorithms       Sorting
Question 44 Explanation: 
Option 2 is the most satisfying option because best case time complexity for insertion sort and bubble sort is O(N) but for selection sort it is O(N2). So selection sort is the least efficient.
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

A
insertion sort
B
selection sort
C
heap sort
D
quick sort
       Algorithms       Sorting
Question 45 Explanation: 
The given characteristics in question are of selection sort.
Question 46

A primary key for an entity is

A
A candidate
B
Any attribute
C
A unique attribute
D
A super key
       Database-Management-System       Keys
Question 46 Explanation: 
A primary key for an entity is a candidate key.
Question 47

Aggregate functions in SQL are

A
GREATEST, LEAST and ABS
B
SUM, COUNT AND AVG
C
UPPER, LOWER AND LENGTH
D
SQRT, POWER AND MOD
       Database-Management-System       SQL
Question 47 Explanation: 
Aggregate functions in SQL are SUM,COUNT and AVG.
Question 48

If a relation is an 2NF and 3NF forms, then

A
no non-prime attribute is functionally dependent on other non-prime attributes
B
no non-prime attribute is functionally depend on the prime attributes
C
all attributes are functionally independent
D
prime attribute is functionally independent of all non-prime attributes
       Database-Management-System       Normalization
Question 48 Explanation: 
If a relation is an 2NF and 3NF forms, then no non-prime attribute is functionally dependent on other non-prime attributes because for 3NF the condition is that for A->B , either A is a super key or B is a prime attribute.
Question 49

Which normal form is considered adequate for relational database design?

A
2 NF
B
3 NF
C
4 NF
D
BCNF
       Database-Management-System       Normalization
Question 49 Explanation: 
Because 3NF is more restricted than 2NF and is always lossless join and dependency preserving unlike in BCNF.
Question 50

The data type created by data abstraction process is called

A
class
B
structure
C
abstract data type
D
user defined data type
       Programming       Data-Type
Question 50 Explanation: 
The data type created by the data abstraction process is called abstract data type.
Question 51

A super key for an entity consists of

A
one attribute only
B
At least two attributes
C
at most two attributes
D
one or more attributes
       Database-Management-System       Keys
Question 51 Explanation: 
Super key is a set of attributes of a relation schema upon which all attributes of the schema are functionally dependent. It can consist of 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?

A
SELECT, FROM, TABLE
B
SELECT, FROM, WHERE
C
CONNECT, TABLE, CREATE
D
SELECT, TABLE, INSERT
       Database-Management-System       SQL
Question 52 Explanation: 
Explanation: SELECT, FROM, WHERE are the keywords that constitute a mapping in SQL.
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

A
O(n)
B
O(log n)
C
O(n2)
D
O(n log n)
       Algorithms       Time-Complexity
Question 53 Explanation: 
The recurrence relation of binary search algorithm is
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

A
sorting
B
merging
C
inserting
D
traversal
       Data-Structures       Linked-List
Question 54 Explanation: 
The operation of processing each element in the list is simply known as traversal because we are just traversing the list.
Question 55

The postfix for a string is ABC + -D*, the actual string will be

A
(A-(B+C))*D
B
((A-B)+C)*D
C
((A+B)-C)*D
D
(A+(B-C))*D
       Data-Structures       Prefix-Postfix-Expression
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

A
quick sort
B
bubble sort
C
merge sort
D
selection sort
       Algorithms       Sorting
Question 56 Explanation: 
Best case of quick sort is O(n logn)
Best case of Bubble sort is O(n)
Best case of merge sort is O(n logn)
Best case of selection sort is (n2)
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

A
2n
B
(2n-1)/2
C
2e
D
e2/2
       Engineering-Mathematics       Graph-Theory
Question 57 Explanation: 
sum of the degree of each vertex = 2 * no. of edges
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(n2) time
II. Bubble sort runs in Q(n2) time
III. Merge-sort runs in Q(n2) time
IV. Insertion sort runs in Q(n2) time

A
I and II only
B
I and III only
C
II and IV only
D
I and IV only
E
None of the above.
       Algorithms       Sorting
Question 58 Explanation: 
Quick sort runs in O(n2) if the input is already in sorted order.
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

A
n nodes
B
log2 n nodes
C
2n - 1 nodes
D
2n nodes
       Data-Structures       Binary-Trees
Question 59 Explanation: 
A full binary tree with n leaves contains 2n-1 nodes.
Question 60

If (rear == maxsize - 1) rear=0; else rear = rear + 1; is required in

A
circular queue
B
linear queue
C
stack
D
deque
       Data-Structures       Queues-and-Stacks
Question 60 Explanation: 
Because If (rear == maxsize - 1) rear=0, is used in a circular queue because after maxsize-1 the index will be 0.
Question 61

How much extra space is used by heap sort?

A
O(1)
B
O(log n)
C
O(n)
D
O(n2)
       Algorithms       Sorting
Question 61 Explanation: 
Heap sort space complexity is O(1).--
Heap sort uses Max-Heapify 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

A
queue
B
stack
C
array
D
tree
       Data-Structures       Queues-and-Stacks
Question 62 Explanation: 
The data structure required for breadth first traversal on a graph is Queue.
The data structure required for depth first traversal on a graph is Stack.
Question 63

Data scrubbing is which of the following?

A
A process to reject data from the data warehouse and to create the necessary indexes
B
A process to load the data in the data warehouse and to create the necessary indexes
C
A process to upgrade the quality of data after it is moved into a data warehouse
D
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?

A
At least one data mart
B
Data that can extracted from numerous internal and external sources
C
Near real-time updates
D
All the given options
Question 65

A goal of data mining includes which of the following?

A
To explain some observed event or condition
B
To confirm that data exists
C
To analyze data for expected relationships
D
To create a new data warehouse
Question 66

A snowflake scheme is which of the following types of tables?

A
Fact
B
Dimension
C
Helper
D
All the given options
Question 67

The generic two level data warehouse architecture includes which of the following?

A
At least one data mart
B
Data that can extracted from numerous internal and external sources
C
Near real time updates
D
All the given options
Question 68

Fact tables are which of the following?

A
Completely denormalized
B
Partially denormalized
C
Completely normalized
D
Partially normalized
Question 69

Data transformation includes which of the following?

A
A process to change data from a detailed level to a summary level
B
A process to change data from a summary level to a detailed level
C
Joining data from one source into various sources of data
D
Separating data from one source into various sources of data
Question 70

A digital signature is

A
scanned signature
B
signature in binary form
C
encrypting information
D
handwritten signature
       Computer-Networks       Network-Security
Question 70 Explanation: 
Digital Signature is a process that guarantees that the contents of a message have not been altered in transit. When you, the server, digitally sign a document, you add a one-way hash (encryption) of the message content using your public and private key pair.
Question 71

Which of the following clustering algorithms is applicable for grouping nearly 10000 data points into ten mutually exclusive clusters?

A
Agglomerative clustering
B
Divisive clustering
C
DBSCAN
D
K-means clustering
Question 72

An E-business that allows consumers to select their own descriptions for products and services (like Blogs) is following which E-business model?

A
B2B
B
B2C
C
C2C
D
C2B
Question 73

Kerberos is an encryption based system that uses

A
secret key encryption
B
public key encryption
C
private key encryption
D
datakey encryption
Question 73 Explanation: 
Kerberos is an encryption based system that uses secret key encryption.
Question 74

A firewall is

A
an established network performance reference point
B
software or hardware used to isolate a private network from a public network
C
a virus that infects macros
D
a predefined encryption key used to encrypt and decrypt data transmissions
       Computer-Networks       Network-Security
Question 74 Explanation: 
A firewall is a software used to isolate a private network from a public network.
Question 75

LDAP stands for

A
Light weight Data access protocol
B
Light weight Directory Access protocol
C
Large Data Access protocol
D
Large Directory Access protocol
Question 75 Explanation: 
LDAP stands for Light weight Directory Access protocol.
Question 76

Amazon.com comes under the following model

A
B2B
B
B2C
C
C2C
D
C2B
Question 76 Explanation: 
Amazon.com comes under the following model B2C.
Question 77

Internet access components in E-commerce infrastructure involves

A
TCP/IP package
B
kiosks
C
web browsers
D
All the given options
Question 78

E-commerce infrastructure involves

A
web servers
B
e-catalogs
C
networks
D
All the given options
Question 79

How many 8-bit 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?

A
600
B
800
C
876
D
1200
       Computer-Organization       Synchronous-and-asynchronous-Communication
Question 79 Explanation: 
To send one 8-bit character we have to send 12 bits.
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

A
encryption
B
hashing
C
decryption
D
decryption and hashing
       Computer-Networks       Network-Security
Question 80 Explanation: 
The private key in public key encryption is used for hashing.
Question 81

Public key encryption makes use of

A
one key
B
two keys
C
hash function
D
All the given options
       Computer-Networks       Network-Security
Question 81 Explanation: 
Public key encryption makes use of two keys, public key and private key.
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.

A
1.75
B
1.428
C
2
D
2.152
       Computer-Networks       Ethernet
Question 82 Explanation: 
In Ethernet,
Tt ≥ 2Tp
Where Tt = Transmission delay
Tp = Propagation delay
L/B ≥ 2×d/V
d ≤ L×V/2×B
d ≤ 10000×2×108/2×700×106 = 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?

A
SMTP
B
DHCP
C
ARP
D
TCP/IP
       Computer-Networks       IP-Address
Question 84

The complete graph Kn has _______ different spanning trees.

A
nn-2
B
n×n
C
nn
D
n2
       Engineering-Mathematics       Graph-Theory
Question 84 Explanation: 
Formula for the complete graph kn has nn-2 different spanning trees.
Question 85

Which of the following is not a type of graph?

A
Euler
B
Hamiltonian
C
Tree
D
Path
       Engineering-Mathematics       Graph-Theory
Question 85 Explanation: 
Path is not a type of graph.
Question 86

Pigeonhole principle states that if A→B and |A|>|B| then _______

A
f is not onto
B
f is not one-one
C
f is neither one-one nor onto
D
f may be one-one
       Engineering-Mathematics       Combinatorics
Question 86 Explanation: 
From the given question we can clearly say that the given relation is not one-one because for the given relation to be one-one |A|<=|B|.
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?

A
1,638
B
2,640
C
2,100
D
None of the given options
       Engineering-Mathematics       Combinatorics
Question 87 Explanation: 
The formula for distributing n identical objects among m person is = C(n+m-1,m-1)
So for roses = C(10+2-1,2-1) = 11
For sunflowers = C(15+2-1,2-1) = 16
For daffodils = C(14+2-1,2-1) = 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?

A
e<=n
B
e<=2n
C
e<=3n
D
None of the given options
       Engineering-Mathematics       Graph-Theory
Question 88 Explanation: 
for planar graphs, 3r <= 2e and n - e + r = 2
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 ______.

A
4/5
B
2/3
C
0.5
D
1/3
       Engineering-Mathematics       Probability
Question 89 Explanation: 
= 10C1/2C1 × 15C1/2C1 + 15C1/25C1 × 10C1/24C1
= 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 _____

A
R is reflexive, R is symmetric and R is transitive
B
R is anti reflexive, R is symmetric and R is transitive
C
R is anti reflexive, R is antisymmetric and R is transitive
D
None of the given options
       Engineering-Mathematics       Set-Theory
Question 90 Explanation: 
A relation R is equivalence if and only if it is reflexive, symmetric and transitive.
Question 91

Which of the following are tautologies?

A
((PvQ)^Q↔Q
B
(Pv(P→Q))→P
C
((PvQ)^P)→Q
D
((PvQ)^P)→Q
       Engineering-Mathematics       Propositional-Logic
Question 91 Explanation: 
Let's check option 1,
((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?

A
Addition in the set of natural numbers
B
Subtraction in the set of integers
C
Multiplication over the set of integers
D
All the given options
       Engineering-Mathematics       Set-Theory
Question 92 Explanation: 
Subtraction is not associative so option 2 is not even a semi group.
Question 93

A binary relation S = ϕ(empty set) on set A = {1,2,3} is

A
neither reflexive nor symmetric
B
symmetric and reflexive
C
transitive and reflexive
D
transitive and symmetric
       Engineering-Mathematics       Set-Theory
Question 93 Explanation: 
Reflexive relation must contain (1,1), (2,2), (3,3), so S is not reflexive but symmetric and transitive.
Question 94

The asymptotic notation for defining the average time complexity is

A
Equivalence
B
Symmetric
C
Reflexive
D
Both Symmetric and Reflexive
       Algorithms       Asymptotic-Complexity
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

A
reflexive, symmetric and transitive
B
neither reflexive nor irreflexive but transitive
C
irreflexive and antisymmetric
D
irreflexive, symmetric and transitive
       Engineering-Mathematics       Set-Theory
Question 95 Explanation: 
The given relation is not reflexive because it does not contain (4,4). It is also not irreflexive because it contains (1,1),(2,2),(3,3). It is also not symmetric because it contains (2,1) but does not contains (1,2). But the given relation is transitive.
Question 96

Management information systems (MIS)

A
create and share documents that support day-today office activities
B
process business transactions (e.g., time cards, payments, orders, etc.)
C
capture and reproduce the knowledge of an expert problem solver
D
use the transaction data to produce information needed by managers to run the business
Question 97

If a university sets up a web-based information system that faculty could access to record student grades and to advise students, that would be an example of a/an

A
CRM
B
intranet
C
ERP
D
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?

A
0
B
3
C
18
D
30
Question 99

Which of the following enables enterprise interoperability?

A
DFD
B
Information flow diagram
C
XML
D
Entity relationship diagram
Question 100

Banker’s algorithm is used for _______ purpose.

A
deadlock avoidance
B
deadlock removal
C
deadlock prevention
D
deadlock continuations
       Operating-Systems       Deadlock
Question 100 Explanation: 
Banker’s algorithm is used for deadlock avoidance purpose.
Question 101

An example of a memory management system call in UNIX is

A
fork
B
mmap
C
sigaction
D
execve
       Operating-Systems       UNIX-Operating-System
Question 101 Explanation: 
Mmap is a memory management system call in UNIX.
Question 102

In processor management, round-robin method essentially uses the pre-emptive version of

A
FILO
B
FIFO
C
SJF
D
longest time first
       Operating-Systems       Process-Scheduling
Question 102 Explanation: 
Round Robin method uses FIFO, i.e., First In First Out.
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

A
Synchronization
B
fault tolerance
C
paging system
D
Scheduling
       Operating-Systems       Memory-Management
Question 103 Explanation: 
n paging system we can execute program size greater than the existing ram of computer.
Question 104

Variable partition memory management technique with compaction results in

A
reduction of fragmentation
B
minimal wastage
C
segment sharing
D
None of the given options
       Operating-Systems       Memory-Management
Question 104 Explanation: 
Variable partition memory management technique with compaction results in reduction of fragmentation or removing external fragmentation.
Question 105

Moving process from main memory to disk is called

A
caching
B
termination
C
swapping
D
Interruption
       Operating-Systems       Process-State-Transition-Diagram
Question 105 Explanation: 
When the process is moved from main memory to disk then this method is called swapping.
Question 106

The principle of locality of reference justifies the use of

A
virtual memory
B
interrupts
C
cache memory
D
secondary memory
       Computer-Organization       Cache
Question 106 Explanation: 
The principal of locality of reference justifies the use of cache 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?

A
cat
B
head
C
more
D
grep
Question 107 Explanation: 
Head command is used to display the top of the file.
Question 108

Which command is used to remove the read permission of the file ‘note’ from both the group and others?

A
chmodgo+r note
B
chmodgo+rw note
C
chmod go-x note
D
chmod go-r, 4-x note
       Operating-Systems       UNIX-Operating-System
Question 109

Which of the following is not a communication command?

A
write
B
mesg
C
mail
D
grep
Question 110
_______ checks type field in the file’s inode structure.
A
Shell
B
Kernel
C
Compiler
D
None of the given options
       Operating-Systems
Question 111

Which of the following commands can be used to get information about individual terminal?

A
who am i
B
pwd
C
i/u
D
which
       Operating-Systems       UNIX-Operating-System
Question 112

UNIX command used to compare the successive lines of file1 with the corresponding lines of file2 and output a 3-columnar report on lines unique to file1, file2 and common to both is ______

A
cmp file1 file2
B
comm file1 file2
C
diff file1 file2
D
comp file1 file2
       Operating-Systems       UNIX-Operating-System
Question 113

We can append to a file instead of overwriting by using the

A
B
>>symbols
C
>symbols
D
<
       Operating-Systems       UNIX-Operating-System
Question 114

Which of the following is not a filter?

A
cat
B
wc
C
grep
D
sort
       Operating-Systems       UNIX-Operating-System
Question 115
main( )
{
   int x;
   x=3*4%5;
   printf(“x=%d”,x);
} 

The output is

A
x=2
B
x=2.3
C
x=5
D
x=1.9
       Programming       Operator
Question 115 Explanation: 
‘*’ and ‘%’ operator have the same precedence but the associativity is from left to write. So x = 3*4%5 = 12%5 = 2.
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 (n-1) + recursive(n-1));
}
A
O(n)
B
O(n log n)
C
O(n2)
D
O(2n)
       Programming       Functions
Question 116 Explanation: 
T(n) = 2T(n-1)+a is the recurrence equation found from the code given.
Note ‘a’ is a constant O(1) cost that the non-recursive part of the function takes.
Solving the recurrence by Back Substitution:
T(n) = 2T(n-1)+a
T(n-1) = 2T(n-2)+a
T(n-2) = 2T(n-3)+a
:
:
Thus we can write the equation as follows
T(n) = 2(2T(n-2)+a)+a = 4T(n-2) + 2a + a
T(n) = 4(2T(n-3)+a) + 2a + a = 8T(n-3) + 4a + 2a + a
:
:
:
T(n) = 2k T(n-k) + (2k - 1)a
On substituting limiting condition,
T(1) = 1
=> n - k = 1
=> k = n-1
Therefore, our solution becomes
2n-1 + (2n-1 - 1)a
= O(2n)
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

A
protected and public data in C and B
B
protected and public data only C
C
private data in A and B
D
protected data in A and B
       Programming-in-c++       Properties
Question 118

In C++ operator, << operator is called as

A
an insertion operator or put to operator
B
an extraction operator or get from operator
C
an insertion operator or get from operator
D
None of the given options
       Programming-in-c++       Operators
Question 118 Explanation: 
In C++ operator, << operator is called as an an insertion operator or put to operator.
Question 119

Function overloading in C++ is

A
A group function with the same name
B
all have the same numbers and type of arguments
C
functions with same name and same numbers and same type of arguments
D
None of the given options
       Programming-in-c++       Properties
Question 119 Explanation: 
Function Overloading is defined as the process of having two or more function with the same name, but different in parameters is known as function overloading in C++. In function overloading, the function is redefined by using either different types of arguments or a different number of arguments.
Question 120

How constructor differ from destructor?

A
Constructors can be overloaded but destructors can’t be overloaded
B
Constructors can take arguments but destructor can’t
C
Constructors can be overloaded but destructors can’t be overloaded and Constructors can take arguments but destructor can’t
D
None of the given options
       Programming-in-c++       Constructor-Destructor
Question 120 Explanation: 
Constructors can be overloaded but destructors can’t be overloaded.
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

A
zero instance
B
multiple instance
C
Both zero instance and multiple instance
D
None of the given options
       Programming-in-c++       Constructor-Destructor
Question 122

Usually a pure virtual function

A
has complete function body
B
will never be called
C
will be called only to delete an object
D
is defined only in derived class
       Programming-in-c++       Virtual-Functions
Question 123

If x=5, y=2, then x^y equals (where, ^ is a bitwise XOR operator)

A
00000111
B
10000010
C
10100000
D
11001000
       Programming-in-c++       Operators
Question 123 Explanation: 
In XOR,
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

Run-time polymorphism is achieved by

A
friend function
B
virtual function
C
operator overloading
D
function overloading
       OOPS       Properties
Question 124 Explanation: 
Run-time polymorphism is achieved by function overriding.
Question 125

The operator that cannot be overloaded is

A
++
B
::
C
0
D
~
       OOPS       Properties
Question 125 Explanation: 
There are 4 operators that cannot be overloaded in C++. They are :: (scope resolution), . (member selection), . * (member selection through pointer to function) and ?: (ternary operator).
Question 126

The keyword friend does not appear in

A
the class allowing access to another class
B
the class desiring access to another class
C
the private section of a class
D
the public section of a class
       OOPS       Properties
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 
A
P-3, Q-2, R-4, S-1
B
P-2, Q-3, R-1, S-4
C
P-3, Q-2, R-1, S-4
D
P-2, Q-3, R-4, S-1
       Software-Engineering       Software-configuration-management
Question 128

Which of the following software engineering concepts does Ada language support?

A
Abstraction
B
Generic
C
Information hiding
D
All the given options
Question 129

Prototyping is used to

A
test the software as an end product
B
expand design details
C
refine and establish requirements gathering
D
None of the given options
Question 130

Regression testing is primarily related to

A
function testing
B
data flow testing
C
development testing
D
maintenance testing
       Software-Engineering       Software-testing
Question 131

Acceptance testing is done by

A
developers
B
customers
C
testers
D
None of the given options
       Software-Engineering       Software-testing
Question 132

Most Undesirable Type of Coupling is

A
Data Coupling
B
Control Coupling
C
Stamp Coupling
D
Content Coupling
       Software-Engineering       Coupling-and-Cohesion
Question 133

Top-down design does not require

A
step-wise refinement
B
loop invariant
C
flow charting
D
modularity
Question 134

Which model is simplest model in software development?

A
Waterfall model
B
Prototyping model
C
Iterative model
D
None of the given options
       Software-Engineering       Software-process-models
Question 134 Explanation: 
Waterfall model is the simplest model of software development paradigm. It says that all the phases of SDLC will function one after another in linear manner.
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 
A
P-1, Q-2, R-3, S-4
B
P-4, Q-1, R-2, S-3
C
P-4, Q-3, R-1, S-2
D
P-3, Q-1, R-2, S-4
       Software-Engineering       Software-process-models
Question 136

A major defect in waterfall model in software development is that

A
the documentation is difficult
B
a blunder at any stage can be disastrous
C
a trial version is available only at the end of the project
D
the maintenance of the software
       Software-Engineering       Waterfall-model
Question 137

The approach to software testing is to design test cases to

A
break the software
B
understand the software
C
analyze the design of sub processes in the software
D
analyze the output of the software
       Software-Engineering       Software-testing
Question 138

In a software project, COCOMO (Constructive Cost Model) is used to estimate

A
effort, cost and schedule based on the size of the software
B
size and duration based on the effort of the software
C
effort and cost based on the duration of the software
D
size, effort and duration based on the cost of the software
       Software-Engineering       COCOMO-Model
Question 139

Beta testing is carried out by

A
users
B
developers
C
managers
D
None of the given options
       Software-Engineering       Software-testing
Question 140

What is the difference between XML and HTML?

A
HTML is used for exchanging data, XML is not
B
XML is used for exchanging data, HTML is not
C
HTML can have user defined tags, XML cannot
D
XML is used for exchanging data, HTML is not (and) HTML can have user defined tags, XML cannot
       Web-Technologies       XML
Question 141

What are tags used for?

A
To replace paragraph i.e., p tags
B
To logically divide the paragraphs
C
To logically divide the document
D
To provide space between tables
       Web-Technologies       HTML
Question 142

What are meta tags used for?

A
To store information usually relevant to browsers and search engines
B
To only store information usually relevant to browsers
C
To only store information about search engines
D
To store information about external links
       Web-Technologies       HTML
Question 143

Which is true to change the text colour to red?

A
< BODY BGCOLOUR=RED >
B
< BODY TEXT=RED >
C
< BODY COLOUR=RED >
D
None of the given options
       Web-Technologies       HTML
Question 144

Which tag is used to display the numbered list?

A
< OL > < /OL >
B
< DL > < /DL >
C
< UL > < /UL >
D
< LI > < /LI >
       Web-Technologies       HTML
Question 145

The most popular way to materialize XML document is to use

A
DTD
B
XSLT
C
HTML
D
SOAP
       Web-Technologies       XML
Question 145 Explanation: 
The most popular way to materialize XML document is to use XSLT ( eXtensible Stylesheet Language)
Question 146

The ______ method ensures that a new web page is generated.

A
GET
B
POST
C
DELETE
D
UPDATE
Question 147

Apache Tomcat is a

A
Servlet
B
Java program
C
web server
D
web server that is capable of running Java programs
       Web-Technologies       Java-Script
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 _______

A
2 Percent
B
20 Percent
C
3 Percent
D
30 Percent
Question 149

In Javascript, what does in NaN function do?

A
Return true, if the argument is not a number
B
Return false, if the argument is not a number
C
Return true, if the argument is a number
D
None of the given options
       Web-Technologies       Java-Script
Question 150

Find the value of Math round(-20.5)

A
-21
B
20
C
-20
D
21
There are 150 questions to complete.