APPSC2012DL 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=(1p)
Logically we are multiplying some number q =1p 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.

Question 14 
Let the functional dependencies, (A → B, B → C) hold for relation P(A,B,C). If it is decomposed in R(A,B) and S(B,C), then the decomposition will be
Lossy
 
Lossless
 
NonLossless  
Strongly

Question 15 
Y = 4x^{2} is an equation of
Parabola
 
Circle  
Hyperbola
 
Eclipse 
Question 16 
To find the second highest salary from Employees table, which of the following query is true?
Select max (salary) from employees where salary = (select max (salary from employees where salary < (select max (salary) from employees);
 
Select min (salary) from (select salary from employees order by salary desc) where rownum ←2  
Select max (salary) from employees where salary <
(select max(salary from employees)
 
Select max (salary) from employees where salary = (select salary from employees where rownum = 2 order by salary)

Question 17 
Which one from the following is a false statement about memory management?
Thrashing improves system performance.  
Swapping increases system overhead.
 
Overhead is more in noncontiguous memory allocation compared to contiguous allocation.  
Swapping is more effective in noncontiguous memory allocation.

Question 18 
Array is
A non linear data structure  
A primitive data structure
 
A linear data structure  
None from (1), (2), and (3) 
Question 19 
Consider following three statement about memory management
(I) Memory fragmentation results in poor utilization of memory.
(II) Memory fragmentation is the area of memory, which is allocated to a process but unused.
(III) Demand paging can increase the degree of multiprogramming.
Only (I) and (III)
 
Only (ii) and (III)  
All (I), (II) and (III)
 
None from (I), (II) and (III) 
Also demand paging increase the degree of multiprogramming. Hence statement III is also true.
Question 20 
Which searching algorithm requires that all of the data must be in order?
Sequential search  
Binary search
 
Linear search  
All (1), (2), and (3)

Question 21 
Which one from the following is a false statement about page replacement algorithm?
LRU page replacement algorithm uses the principle of locality of reference.  
LRU page replacement algorithm does not posses the stack property.
 
Optimal page replacement algorithm is infeasible.
 
FIFO page replacement algorithm does not posses the stack property. 
S2 is false,because LRU page replacement algorithm possess the stack property.
S3 is true because Optimal page replacement is infeasible because the virtual memory handler does not have knowledge of the future reference. It is just used to evaluate the performance with other algorithms for comparison.
S4 is true thats why FIFO suffers from anomaly called belady's anamoly.
Question 22 
Which one from the following is a false statement about Poisson distribution?
In Poisson distribution, the number of trials is infinite.  
Poisson distribution is useful with discrete variable only.
 
Poisson distribution is for unequal probability in single trial.  
None from the above (1), (2), and (3) is a false statement. 
S2 is true.
S3 is false because Poisson distribution is for unequal probability in multiple trial.
Question 23 
Time complexity of Binary search is
O(n)
 
O(n^{2})  
O(log n)
 
O(n log n) 
Question 24 
If a surgeon transplants kidney in 250 cases and succeeds in 130 cases, then the probability of success after operation is
0.52  
048  
0  
0.25 
Question 25 
Consider following two statements about I/O organization.
(I) An I/O port uses a flipflop to implement memory cell.
(II) In DMA I/O peripheral device reads and writes memory without going through CPU.
Which one from the following is more appropriate?
Statement (I) is true while (II) is false.
 
Statement (II) is true while (I) is false.
 
Both statements (I) and (II) are true.
 
Both statements (I) and (II) are false. 
S2 is true.
Question 26 
Time complexity of Merge sort is
O(n)  
O(n^{2})  
O(log n)  
O(n log n) 
Question 27 
In which Disk scheduling algorithm starvation is possible?
FCFS  
SCAN
 
Shortest Seek Time First (SSTF)
 
CSCAN

Question 28 
In which sorting algorithm average number of comparison is (n^{2} – n) / 2?
Insertion sort
 
Selection sort  
Merge sort
 
Quick sort 
Question 29 
What should be the access time of cache memory in order to achieve 98% hit ratio, if the memory access time in 200ns and effective access time required is 20ns?
16ns  
18ns  
20ns  
10ns

20 = 0.98 × H + 0.02 (200 + H)
20 = 0.98H + 0.02 × 200 + 0.02H
20 = 0.98H + 4 + 0.02H
16 = H
∴ Access time of cache memory = 16 ns
Question 30 
Variance of binomial distribution is
p  
np  
q  
npq 
Question 31 
The Leaves of a tree
Are those nodes with single child.
 
Is the maximum length of a branch from the root to leaf.
 
Are those nodes with no children.
 
Are those nodes have same parent. 
Question 32 
Consider following three statements about Data Encryption Standard (DES).
(I) DES uses a 56 bit key to encrypt 64 bit data blocks.
(II) DES is a Block cipher.
(III) DES provides Cipher Block Chaining mode to overcome the problem of poor diffusion.
The false statement from above statements is/are
Only (I)  
Only (I) and (III)  
Only (III)
 
None from (I), (II) and (III)

Hence all the statements are true.
Question 33 
Consider following three statements above scheduler
(I) Dispatcher is a part of schedule responsible to select a new process whenever the current process yields the CPU.
(II) The medium term scheduler is responsible for swapping.
(III) The Long Term scheduler determines to whom CPU should be allocated from the ready queue.
The true statement from above statements is/are
All (I), (II), and (III)  
Only (I) and (II)
 
Only (I) and (III)
 
Only (II) and (III) 
S2 is true.
S3 is false, because the short term scheduler determines to whom CPU should be allocated from the ready queue.
Question 34 
The number 105 in decimal system is equal to
(140)_{5}  
(410)_{5}
 
(042)_{5}
 
(321)_{5} 
∴ Answer is (410)_{5}
Question 35 
While restarting recovery, which sequence is followed?
Undo transactions of undolist; redo transactions of redolist.  
Reo transactions of redolist; undo transactions of undolist.  
Undo transactions of undolist.  
Redo transactions of redolist.

Question 36 
IP address range for E class network is
1.0.0.0 to 127.0.0.0
 
128.0.0.0 to 191.255.0.0
 
224.0.0 to 239.255.255.0  
240.0.0.0 to 255.255.255

Question 37 
SQL injection consists of
Authorized Physicians injecting SQL in patients.  
A mechanism to improve performance of database  
A hacking mechanism enters the system by providing erroneous input.
 
Exception handling routines. 
SQL injection is a code injection technique that might destroy your database.
SQL injection is one of the most common web hacking techniques.
SQL injection is the placement of malicious code in SQL statements, via web page input.
Question 38 
If A, B, and C are subsets of U then the simplified form of the expression ~A∪~B∪(A∩B∩~C) using the law of set theory is
~A∩~B∩~C  
~A∪~B∪~C  
~A∪~B∪C  
~A∩~B∪~C 
In general we can write it as,
A’ + B’ + (ABC’)
= A’ + B’ + ABC’
= A’ + (B’ + B)(B’ + AC’)
= A’ + 1∙(B’ + AC’)
= A’ + B’ + AC’
= (A’ + A)(A’ + C’) + B’
= A’ + C’ + B’
= A’∪C’∪B’
= A’∪B’∪C’
Question 39 
The C++ statement cout <<(0 ==0) will
Outputs as 0  
Outputs as 1  
Generate error at the time of compilation
 
Generate run time 
Question 40 
Project 802 defines standards for which layers of the OSI Models?
Application and Presentation layers
 
Physical and Data Link layers  
Network and Data Link layers
 
Transport and Network layers

Question 41 
Which scheduling algorithm from the following is allows processes to move from one queue (different classified queues based on scheduling parameters) to another?
Multilevel Queue Scheduling
 
Priority Based Scheduling
 
Round Robin Scheduling
 
Multilevel Feedback Queue Scheduling 
Question 42 
A multiprocessor computer architecture where two or more identical processor are connected to a single shared main memory is known as
Asymmetric Multiprocessing
 
Symmetric Multiprocessing
 
NUMA – Non Uniform Memory Access
 
Clustered Multiprocessing

Question 43 
Which of the following statements is true about C++ language?
C++ supports multiple inheritance  
C++ does not support operator overloading.  
C++ supports dynamic polymorphism
 
C++ supports interface definitions.  
Both A and D 
C++ supports operator overloading.
C++ supports static polymorphism.
C++ supports interface definitions.
Question 44 
Which one from the following is a false statements about deadlock?
Memory is a nonpreemptible resource.
 
Mutual exclusion condition is not possible for several resources under deadlock prevention
 
Recovery from deadlock is possible through rollback  
If there is a cycle and there is single instance per resource type then there is a deadlock. 
True.
True.
True.
Question 45 
Following are the conditions of deadlock
(I) Mutual exclusion
(II) Hold and Wait
(III) No preemption
(IV) Circular Wait
Which conditions from above are necessary conditions for deadlock?
Only (I), (II), and (III)
 
Only (II, (III) and (IV)  
Only (I), (III) and (IV)  
All (I), (II), (III) and (IV)

Mutual exclusion
Hold and wait
No preemption
Circular wait
Question 46 
In OSI model, data compression is carried out by
Network layer  
Physical layer
 
Data Link layer
 
Presentation layer

Question 47 
The age of a father is twice that of the elder son. After ten years the age of the father will be three times that of younger son. If the difference of ages of the two sons is 15 years then what will be the age of the father?
50  
54  
56  
58 
The age of father = 2E
Let the age of younger son = Y
Then according to question,
2E + 1 = 3(Y + 10)  (I)
and
E  Y = 15
Y = E  15 (II)
Putting (II) in (I),
2E + 10 = 3(E  15 + 10)
2E + 10 = 3(E  5)
2E + 10 = 3E  15
25 = E
∴ Age of father = 2E = 2 × 25 = 50
Question 48 
For the sets A = {X∈R: 4 < X < 3} and B = x∈R: 1 < x < 7, the value of A∪B is
{x∈R: 1  
{x∈R: 4  
{x∈R: 4  
{x∈R: 1 
So from above diagram, the union of two ranges will be,
4 < x < 7
Question 49 
Which of the following properties is implemented by concurrency control algorithms.
Durability
 
Consistency
 
Atomicity
 
Isolation 
Question 50 
Consider the following ‘C’ language declaration in a[4] = {1,2,3,4}; What would be the output of the following
Printf(“%d”, *(a+2)+1);
2  
3  
4  
None of the above 
Question 51 
Program Counter register contains address of the
Memory data
 
Next instruction to be executed by the CPU  
Current instruction being executed by the CPU  
Address (i,e. indirect address) of next instruction to be executed by the CPU

Question 52 
Any “C” statement that beings with # is process by
Compiler
 
Linker  
Preprocessor
 
Assembler 
Question 53 
Partial dependencies are removed to achieve which normal form?
First normal form  
Second normal form
 
BCNF
 
Third normal form
