Tuesday 25 September 2012

DECEMBER 2011 - PAPER II


11. A station in a network forward incoming packets by placing them on its shortest output queue. What routing algorithm is being used ?

(A) Hot potato routing
(B) Flooding
(C) Static routing
(D) Delta routing

Ans:-A


12. Start and stop bits are used in serial communications for

(A) Error detection
(B) Error correction
(C) Synchronization
(D) Slowing down the communication

Ans:-C


13. For a data entry project for office staff who have never used computers before (user interface and user- friendliness are extremely important), one will use

(A) Spiral model
(B) Component based model
(C) Prototyping
(D) Waterfall model

Ans:-C


14. An SRS

(A) establishes the basis for agreement between client and the supplier.
(B) provides a reference for validation of the final product.
(C) is a prerequisite to high quality software.
(D) all of the above.

Ans:-D


15. McCabe’ s cyclomatic metric V(G) of a graph G with n vertices, e edges and p connected component is

(A) e
(B) n
(C) e– n +p
(D) e – n + 2p

Ans:-C

Explanation:-
The cyclomatic number V(G) of a graph with n vertices, e edges and p connected component is
V(G) = e - n + p


16. Emergency fixes known as patches are result of

(A) adaptive maintenance
(B) perfective maintenance
(C) corrective maintenance
(D) none of the above

Ans:-C


17. Design recovery from source code is done during

(A) reverse engineering
(B) re-engineering
(C) reuse
(D) all of the above

Ans:-A


18. Following is used to demonstrate that the new release of software still performs the old one did by rerunning the old tests :

(A) Functional testing
(B) Path testing
(C) Stress testing
(D) Regression testing

Ans:-D


19. The post order traversal of a binary tree is DEBFCA. Find out the pre- order traversal.

(A) ABFCDE
(B) ADBFEC
(C) ABDECF
(D) ABDCEF

Ans:-C

Explanation:- The same question is given in Paper II of June 2012 and i have explained the same in this blog. Please refer to paper ii - question no 2 of June 2012 paper.The link is given below
JUNE 2012 - PAPER II


20. B + tree are preferred to binary tree in database because

(A) Disk capacities are greater than memory capacities
(B) Disk access much slower than memory access
(C) Disk data transfer rates are much less than memory data transfer rate
(D) Disk are more reliable than memory

Ans:-B

Explanation:- Again the same question is repeated in June 2012 paper and the answer is B. Explanation for the same is provided there. In Question no 11 of paper ii - june 2012.The link is
June 2012 - PAPER II


21. What deletes the entire file except the file structure ?

(A) ERASE
(B) DELETE
(C) ZAP
(D) PACK

Ans:-C

Explanation:- Again this question is given in June 2012 paper-ii. Since i have solved june 2012-paper II before the answer for the same is available there also. Question No 9 of June 2012-Paper II.


No comments:

Post a Comment