APPSC-2012-DL CA
Question 1 |
Which error detection method involves polynomials?
VRC | |
LRC | |
CRC
| |
Checksum |
The divisor in the CRC generator is most often represented not as a string of 1s and 0s, but as an algebraic polynomial. The polynomial format is used for it is short and it can be used to prove the concept mathematically. A string of 0s and 1s can be represented as a polynomial with coefficients of 0 and 1, where the power of each term in the polynomial indicates the position of the bit and the corresponding coefficient reflects the value of the bit (0 or 1).
Question 2 |
Which one from the following is memory of a volatile nature?
Flash | |
Masked ROM | |
DRAM
| |
EPROM |
Most RAM (random access memory) used for primary storage in personal computers is volatile memory. RAM is much faster to read from and write to than the other kinds of storage in a computer, such as the hard disk or removable media. However, the data in RAM stays there only while the computer is running; when the computer is shut off, RAM loses its data.
Question 3 |
For a Binomial distribution mean is always
greater than variance | |
less than variance | |
equal to variance | |
greater than or equal to variance |
Variance = npq, where q=(1-p)
Logically we are multiplying some number q =1-p to mean to get variance and q belongs to [ 0,1]. so if we multiply a value less than 1 to np to get npq then
np>=npq.
Question 4 |
Which layer of OSI model is responsible for transmitting raw bit stream over on physical cable?
Presentation
| |
Physical
| |
Transport
| |
Network
|
Question 5 |
Which one from the following is a true statement about Binary trees (BST)?
A BST is the Binary tree in which data in the nodes is ordered in a particular way.
| |
The data in any nodes of right subtree of BST must be greater than or equal to the data in the given node.
| |
A BST have worst case when the data is already in order.
| |
All (1), (2) and (3). |
2. True.
3. True, in this case the tree will be skewed.
Question 6 |
Which of the following is not a logical database structure?
Chain
| |
Network | |
Tree
| |
Relational |
Question 7 |
Which layer of OSI model is responsible to translates logical network address and names to their physical address?
Session | |
Presentation | |
Data | |
Network
|
Question 8 |
The number of tuples in the result of a left outer join operation will always be
greater than the number of tuples in the result of the corresponding join operation.
| |
at least equal to the number of tuples in the result of the corresponding join operation. | |
less than the number of tuples in the result of the corresponding join operation.
| |
greater than the number of tuples in the result of the corresponding right outer join operation.
|
Question 9 |
If A and B are independent events then
P(A∪B) = P(A) + P(B) + (A∩B)
| |
P(A∪B) = 0 | |
P(A∪B) = P(A) + P(B) – (A∩B)
| |
P(A∪B) = P(A) + P(B) | |
None of the above |
P(A∩B) = P(A)P(B)
So finally we can say that,
P(AUB) = P(A) + P(B) - P(A∩B)
= P(A) + P(B) - P(A)P(B)
Question 10 |
A vertex of how many degree is isolated?
0 | |
1 | |
2 | |
3 |
Question 11 |
Which network component is not associated at physical layer of OSI model?
Multiplexer | |
Hubs | |
Amplifier
| |
Router
|
Question 12 |
A closed path with no other repeated vertices than the starting and ending vertices is known as
Steiner tree
| |
Cycle | |
Complement graph
| |
Spanning tree
|
Question 13 |
Which one from the following is a false statement about TCP/IP model?
Network Access layer performs encapsulation of IP datagrams into frames and mapping IP addresses to physical hardware addresses. | |
Transport layer has primary two protocols – TCP and UDP.
| |
The Internet Layer is in between Network Access layer and Transport layer.
| |
The IP is a primary protocol at Transport Layer.
|