PAPER-III
COMPUTER SCIENCE AND APPLICATIONS
Signature and Name of Invigilator
1. (Signature) __________________________
(Name) ____________________________
2. (Signature) __________________________
(Name) ____________________________
S
1
87 1 3
Time : 2 /2 hours]
Number of Pages in this Booklet : 12
Instructions for the Candidates
1. Write your roll number in the space provided on the top of
this page.
2. This paper consists of seventy five multiple-choice type of
questions.
3. At the commencement of examination, the question booklet
will be given to you. In the first 5 minutes, you are requested
to open the booklet and compulsorily examine it as below :
(i) To have access to the Question Booklet, tear off
the paper seal / polythene bag on the booklet. Do not
accept a booklet without sticker-seal / without
polythene bag and do not accept an open booklet.
(ii) Tally the number of pages and number of questions
in the booklet with the information printed on the
cover page. Faulty booklets due to pages/questions
missing or duplicate or not in serial order or any
other discrepancy should be got replaced immediately
by a correct booklet from the invigilator within the
period of 5 minutes. Afterwards, neither the
Question Booklet will be replaced nor any extra
time will be given.
(iii) After this verification is over, the OMR Sheet Number
should be entered on this Test Booklet.
4. Each item has four alternative responses marked (A), (B),
(C) and (D). You have to darken the circle as indicated below
on the correct response against each item.
Example :
where (C) is the correct response.
5. Your responses to the items are to be indicated in the OMR
Sheet given inside the Booklet only. If you mark at any
place other than in the circle in the OMR Sheet, it will not be
evaluated.
6. Read instructions given inside carefully.
7. Rough Work is to be done in the end of this booklet.
8. If you write your Name, Roll Number, Phone Number or
put any mark on any part of the OMR Sheet, except for the
space allotted for the relevant entries, which may disclose
your identity, or use abusive language or employ any other
unfair means, you will render yourself liable to
disqualification.
9. You have to return the original OMR Sheet to the invigilators
at the end of the examination compulsorily and must not
carry it with you outside the Examination Hall. You are
however, allowed to carry duplicate copy of OMR Sheet on
conclusion of examination.
10. Use only Blue/Black Ball point pen.
11. Use of any calculator or log table etc., is prohibited.
12. There is no negative marks for incorrect answers.
S-87-13
OMR Sheet No. : ...............................................
(To be filled by the Candidate)
Roll No.
(In figures as per admission card)
Roll No.________________________________
(In words)
[Maximum Marks : 150
Number of Questions in this Booklet : 75
¯Ö¸üßõÖÖÙ£ÖμÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
1. ¯ÖÆü»Öê ¯Öéšü Ûêú ‰ú¯Ö¸ü ×®ÖμÖŸÖ Ã£ÖÖ®Ö ¯Ö¸ü †¯Ö®ÖÖ ¸üÖê»Ö ®Ö´²Ö¸ü ×»Ö×ÜÖ‹ …
2. ‡ÃÖ ¯ÖÏ¿®Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÆü¢Ö¸ü ²ÖÆãü×¾ÖÛú»¯ÖßμÖ ¯ÖÏ¿®Ö Æïü …
3. ¯Ö¸üßõÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê®Öê ¯Ö¸ü, ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ †Ö¯ÖÛúÖê ¤êü ¤üß •ÖÖμÖêÝÖß … ¯ÖÆü»Öê
¯ÖÖÑ“Ö ×´Ö®Ö™ü †Ö¯ÖÛúÖê ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ÜÖÖê»Ö®Öê ŸÖ£ÖÖ ˆÃÖÛúß ×®Ö´®Ö×»Ö×ÜÖŸÖ
•ÖÖÑ“Ö Ûêú ×»Ö‹ פüμÖê •ÖÖμÖëÝÖê, וÖÃÖÛúß •ÖÖÑ“Ö †Ö¯ÖÛúÖê †¾Ö¿μÖ Ûú¸ü®Öß Æîü :
(i) ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ÜÖÖê»Ö®Öê Ûêú ×»Ö‹ ¯Öã×ßÖÛúÖ ¯Ö¸ü »ÖÝÖß ÛúÖÝÖ•Ö Ûúß ÃÖᯙ /
¯ÖÖê×»Ö£Öß®Ö ²ÖîÝÖ ÛúÖê ±úÖ›Ìü »Öë … ÜÖã»Öß Æãü‡Ô μÖÖ ×²Ö®ÖÖ Ã™üßÛú¸ü-ÃÖᯙ /
ײ֮ÖÖ ¯ÖÖê×»Ö£Öß®Ö ²ÖîÝÖ Ûúß ¯Öã×ßÖÛúÖ Ã¾ÖßÛúÖ¸ü ®Ö Ûú¸ëü …
(ii) Ûú¾Ö¸ü ¯Öéšü ¯Ö¸ü ”û¯Öê ×®Ö¤ìü¿ÖÖ®ÖãÃÖÖ¸ü ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ Ûêú ¯Öéšü ŸÖ£ÖÖ
¯ÖÏ¿®ÖÖë Ûúß ÃÖÓÜμÖÖ ÛúÖê †“”ûß ŸÖ¸üÆü “ÖîÛú Ûú¸ü »Öë ×Ûú μÖê ¯Öæ¸êü
Æïü … ¤üÖÂê Ö¯ÖæÞÖÔ ¯Öã×ßÖÛúÖ ×•Ö®Ö´Öë ¯Öéšü/¯ÖÏ¿®Ö Ûú´Ö ÆüÖë μÖÖ ¤ãü²ÖÖ¸üÖ †Ö
ÝÖμÖê ÆüÖë μÖÖ ÃÖß׸üμÖ»Ö ´Öë ®Ö ÆüÖë †£ÖÖÔŸÖË ×ÛúÃÖß ³Öß ¯ÖÏÛúÖ¸ü Ûúß
¡Öã×™ü¯ÖæÞÖÔ ¯Öã×ßÖÛúÖ Ã¾ÖßÛúÖ¸ü ®Ö Ûú¸ëü ŸÖ£ÖÖ ˆÃÖß ÃÖ´ÖμÖ ˆÃÖê
»ÖÖî™üÖÛú¸ü ˆÃÖÛêú ãÖÖ®Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆüß ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ »Öê »Öë …
‡ÃÖÛêú ×»Ö‹ †Ö¯ÖÛúÖê ¯ÖÖÑ“Ö ×´Ö®Ö™ü פüμÖê •ÖÖμÖëÝÖê … ˆÃÖÛêú ²ÖÖ¤ü ®Ö
ŸÖÖê †Ö¯ÖÛúß ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ¾ÖÖ¯ÖÃÖ »Öß •ÖÖμÖêÝÖß †Öî¸ü ®Ö Æüß †Ö¯ÖÛúÖê
†×ŸÖ׸üŒŸÖ ÃÖ´ÖμÖ ×¤üμÖÖ •ÖÖμÖêÝÖÖ …
(iii) ‡ÃÖ •ÖÖÑ“Ö Ûêú ²ÖÖ¤ü OMR ¯Ö¡ÖÛú Ûúß ÛÎú´Ö ÃÖÓÜμÖÖ ‡ÃÖ ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ
¯Ö¸ü †Ó×ÛúŸÖ Ûú¸ü ¤ëü …
4. ¯ÖÏŸμÖêÛú ¯ÖÏ¿®Ö Ûêú ×»Ö‹ “ÖÖ¸ü ˆ¢Ö¸ü ×¾ÖÛú»¯Ö (A), (B), (C) ŸÖ£ÖÖ (D) פüμÖê
ÝÖμÖê Æïü … †Ö¯ÖÛúÖê ÃÖÆüß ˆ¢Ö¸ü Ûêú ¾Öé¢Ö ÛúÖê ¯Öê®Ö ÃÖê ³Ö¸üÛú¸ü ÛúÖ»ÖÖ Ûú¸ü®ÖÖ Æîü
•ÖîÃÖÖ ×Ûú ®Öß“Öê פüÜÖÖμÖÖ ÝÖμÖÖ Æîü …
ˆ¤üÖÆü¸üÞÖ : •Ö²Ö×Ûú (C) ÃÖÆüß ˆ¢Ö¸ü Æîü …
5. ¯ÖÏ¿®ÖÖë Ûêú ˆ¢Ö¸ü Ûêú¾Ö»Ö ¯ÖÏ¿®Ö ¯Öã×ßÖÛúÖ Ûêú †®¤ü¸ü פüμÖê ÝÖμÖê OMR ¯Ö¡ÖÛú ¯Ö¸ü
Æüß †Ó×ÛúŸÖ Ûú¸ü®Öê Æïü … μÖפü †Ö¯Ö OMR ¯Ö¡ÖÛú ¯Ö¸ü פüμÖê ÝÖμÖê ¾Öé¢Ö Ûêú †»ÖÖ¾ÖÖ
×ÛúÃÖß †®μÖ Ã£ÖÖ®Ö ¯Ö¸ü ˆ¢Ö¸ü דÖÅ®ÖÖÓ×ÛúŸÖ Ûú¸üŸÖê Æïü, ŸÖÖê ˆÃÖÛúÖ ´Öæ»μÖÖÓÛú®Ö
®ÖÆüà ÆüÖêÝÖÖ …
6. †®¤ü¸ü פüμÖê ÝÖμÖê ×®Ö¤ìü¿ÖÖë ÛúÖê ¬μÖÖ®Ö¯Öæ¾ÖÔÛú ¯ÖœÌëü …
7. Ûú““ÖÖ ÛúÖ´Ö (Rough Work) ‡ÃÖ ¯Öã×ßÖÛúÖ Ûêú †×®ŸÖ´Ö ¯Öéšü ¯Ö¸ü Ûú¸ëü …
8. μÖפü †Ö¯Ö OMR ¯Ö¡ÖÛú ¯Ö¸ü ×®ÖμÖŸÖ Ã£ÖÖ®Ö Ûêú †»ÖÖ¾ÖÖ †¯Ö®ÖÖ ®ÖÖ´Ö, ¸üÖê»Ö
®Ö´²Ö¸ü, ±úÖê®Ö ®Ö´²Ö¸ü μÖÖ ÛúÖê‡Ô ³Öß ‹êÃÖÖ ×“ÖÅ®Ö ×•ÖÃÖÃÖê †Ö¯ÖÛúß ¯ÖÆü“ÖÖ®Ö ÆüÖê
ÃÖÛêú, †Ó×ÛúŸÖ Ûú¸üŸÖê Æïü †£Ö¾ÖÖ †³Ö¦ü ³ÖÖÂÖÖ ÛúÖ ¯ÖÏμÖÖêÝÖ Ûú¸üŸÖê Æïü, μÖÖ ÛúÖê‡Ô
†®μÖ †®Öã×“ÖŸÖ ÃÖÖ¬Ö®Ö ÛúÖ ¯ÖÏμÖÖêÝÖ Ûú¸üŸÖê Æïü, ŸÖÖê ¯Ö¸üßõÖÖ Ûêú ×»ÖμÖê †μÖÖêÝμÖ
‘ÖÖê×ÂÖŸÖ ×ÛúμÖê •ÖÖ ÃÖÛúŸÖê Æïü …
9. †Ö¯ÖÛúÖê ¯Ö¸üßõÖÖ ÃÖ´ÖÖ¯ŸÖ ÆüÖê®Öê ¯Ö¸ü ´Öæ»Ö OMR ¯Ö¡ÖÛú ×®Ö¸üßõÖÛú ´ÖÆüÖê¤üμÖ ÛúÖê
»ÖÖî™üÖ®ÖÖ †Ö¾Ö¿μÖÛú Æîü †Öî¸ü ¯Ö¸üßõÖÖ ÃÖ´ÖÖׯŸÖ Ûêú ²ÖÖ¤ü ˆÃÖê †¯Ö®Öê ÃÖÖ£Ö
¯Ö¸üßõÖÖ ³Ö¾Ö®Ö ÃÖê ²ÖÖÆü¸ü ®Ö »ÖêÛú¸ü •ÖÖμÖë … ÆüÖ»ÖÖÓ×Ûú †Ö¯Ö ¯Ö¸üßõÖÖ ÃÖ´ÖÖׯŸÖ ¯Ö¸ü
OMR ¯Ö¡ÖÛú Ûúß ›ãü¯»ÖßÛêú™ü ¯ÖÏ×ŸÖ †¯Ö®Öê ÃÖÖ£Ö »Öê •ÖÖ ÃÖÛúŸÖê Æïü …
10. Ûêú¾Ö»Ö ®Öß»Öê/ÛúÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ‡Õ™ü ¯Öê®Ö ÛúÖ Æüß ‡ÃŸÖê´ÖÖ»Ö Ûú¸ëü …
11. ×ÛúÃÖß ³Öß ¯ÖÏÛúÖ¸ü ÛúÖ ÃÖÓÝÖÞÖÛú (Ûîú»ÖÛãú»Öê™ü¸ü) μÖÖ »ÖÖÝÖ ™êü²Ö»Ö †Öפü ÛúÖ
¯ÖÏμÖÖêÝÖ ¾ÖÙ•ÖŸÖ Æîü …
12. ÝÖ»ÖŸÖ ˆ¢Ö¸üÖë Ûêú ×»Ö‹ ÛúÖê‡Ô †ÓÛú ÛúÖ™êü ®ÖÆüà •ÖÖ‹ÑÝÖê …
1 P.T.O.
 COMPUTER SCIENCE AND APPLICATIONS
Paper – III
Note : This paper contains seventy five (75) objective type questions of two (2) marks each.
The candidates are required to select the most appropriate answer for each question.
All questions are compulsory.
1. Which of the following is a correct 5. The Blocks World Problem in
predicate logic statement for “Every Artificial Intelligence is normally
Natural number has one successor” ? discussed to explain a _______
(A) ∀x∃y (succ(x, y) ∧ (∃z succ(x, (A) Search technique
z) ⇒ equal (y, z))) (B) Planning system
(B) ∀x∃y (succ(x, y) ∨ (∃z succ(x, (C) Constraint satisfaction system
z) ⇒ equal (y, z))) (D) Knowledge base system
(C) ∃y∀x (succ(x, y) ∧ (∃z succ(x,
z) ⇒ equal (y, z))) 6. Means-Ends Analysis process centres
around the detection of difference
(D) ∀x∃y succ (x, y)
between the current state and the goal
state. Once such a difference is
2. α – β cutoffs are applied to ______ found, then to reduce the difference
(A) Depth first search one applies ______
(B) Best first search (A) a forward search that can
(C) Minimax search reduce the difference.
(D) Breadth first search (B) a backward search that can
reduce the difference.
3. Assume that each alphabet can have a (C) a bidirectional search that can
value between 0 to 9 in a reduce the difference.
CROSS (D) an operator that can reduce the
+ROADS . difference.
cryptoarithmetic problem - - - - - - - -
-DANGER
-------
Which of the following statement is 7. Suppose a file of 10,000 characters is
true ? to be sent over a line at 2400 bps.
(i) No two alphabets can have the Assume that the data is sent in
same numeric value. frames. Each frame consists of 1000
(ii) Any two alphabets may have the characters and an overhead of 48 bits
same numeric value. per frame. Using synchronous
transmission, the total overhead time
(iii) D = 0
is ______.
(iv) D = 1
(A) 0.05 second (B) 0.1 second
(A) (i) and (iii) (B) (i) and (iv)
(C) 0.2 second (D) 2.0 second
(C) (ii) and (iii) (D) (ii) and (iv)
8. Which of the following is the size of
4. Which of the following is not a part Network bits and Host bits of Class
of an expert system shell ? A of IP address ?
(A) Knowledge Base (A) Network bits 7, Host bits 24
(B) Inference Engine (B) Network bits 14, Host bits 16
(C) Explanation Facility (C) Network bits 15, Host bits 16
(D) None of the above (D) Network bits 16, Host bits 16
Paper-III 2 S-87-13
9. Which of the following field of the 14. An optimal assignment requires that
TCP header tells how many bytes the minimum number of horizontal
may be sent starting at the byte and vertical lines that can be drawn
acknowledged ? to cover all zeros be equal to the
(A) TCP header length number of
(B) Window size (A) rows or columns
(C) Acknowledgement number (B) rows + columns
(D) Urgent pointer (C) rows + columns – 1
(D) rows + columns + 1
10. Which of the following is a bit rate of
an 8-PSK signal having 2500 Hz 15. Which of the following is the
bandwidth ? minimum cost for an assignment
(A) 2500 bps (B) 5000 bps problem given below ?
(C) 7500 bps (D) 20000 bps Jobs
A B C D
11. Match the following : I 5 3 2 8
(a) UDP (i) Message Transfer II 7 9 2 6
Workers
Protocol III 6 4 5 7
(b) OSPF (ii) Bit-oriented Protocol IV 5 7 7 8
(c) SMTP (iii) Interior Gateway (A) 13 (B) 16
Routing Protocol (C) 17 (D) 18
(d) HDLC (iv) Connectionless
Transport Protocol 16. Assume, L is regular language. Let
Codes : statements S1 and S2 be defined as :
(a) (b) (c) (d) S1 : SQRT(L) = { x| for some y
(A) (iii) (iv) (ii) (i) with |y| = |x|2, xy ∈L}.
(B) (iv) (iii) (ii) (i) S2 : LOG(L) = { x| for some y with
(C) (iv) (iii) (i) (ii) |y| = 2|x|, xy ∈ L}.
(D) (iii) (iv) (i) (ii) Which of the following is true ?
(A) S1 is correct and S2 is not
12. Given the IP address 201.14.78.65
correct.
and the subnet mask
(B) Both S1 and S2 are correct.
255.255.255.224. What is the subnet
address ? (C) Both S1 and S2 are not correct.
(A) 201.14.78.32 (B) 201.14.78.64 (D) S1 is not correct and S2 is
(C) 201.14.78.65 (D) 201.14.78.224 correct.

13. If an artificial variable is present in
the ‘basic variable’ of optimal
simplex table then the solution is
______
(A) Alternative solution
(B) Infeasible solution
(C) Unbounded solution
(D) Degenerate solution
S-87-13
17. A regular grammar for the language
L = {anbm | n is even and m is
even}is given by
(A) S→aSb | S1; S1 → bS1a | λ
(B) S→aaS | S1; S1 → bSb | λ
(C) S→aSb | S1; S1 → S1ab | λ
(D) S→aaS | S1; S1 → bbS1 | λ
3 Paper-III
18. Given the following productions of a 21. Assume statements S1 and S2 defined
grammar : as :
S→ aA| aBB; S1 : L2-L1 is recursive enumerable
A→aaA |λ ; where L1 and L2 are recursive
B→ bB| bbC; and recursive enumerable
C→ B respectively.
Which of the following is true ? S2 : The set of all Turing machines
(A) The language corresponding to
is countable.
the given grammar is a set of
even number of a’s. Which of the following is true ?
(B) The language corresponding to (A) S1 is correct and S2 is not
the given grammar is a set of correct.
odd number of a’s. (B) Both S1 and S2 are correct.
(C) The language corresponding to
the given grammar is a set of (C) Both S1 and S2 are not correct.
even number of a’s followed by (D) S1 is not correct and S2 is
odd number of b’s. correct.
(D) The language corresponding to
the given grammar is a set of 22. Non-deterministic pushdown automaton
odd number of a’s followed by that accepts the language generated by
even number of b’s. the grammar: S→aSS | ab is
(A) δ(q0, λ, z) = { (q1, z)};
19. The language accepted by the non-
deterministic pushdown automaton δ(q0, a, S) = { (q1, SS)}, (q1, B) }
M= ({q0, q1, q2}, {a, b}, {a, b, z}, δ, δ(q0, b, B) = { (q1, λ)},
q0, z, {q2}) with transitions δ(q1, λ, z) = { (qf, λ)}
δ (q0 a, z) = { (q1 a), (q2 λ)};
(B) δ(q0, λ, z) = { (q1, Sz)};
δ (q1, b, a) = { (q1, b)}
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ (q1, b, b) ={ (q1 b)}, δ (q1, a, b) =
δ(q0, b, B) = { (q1, λ)},
{ (q2, λ)}
δ(q1, λ, z) = { (qf, λ)}
is
(A) L(abb*a) (C) δ(q0, λ, z) = { (q1, Sz)};
(B) {a} U L(abb*a)
δ(q0, a, S) = { (q1, S)}, (q1, B) }
(C) L(ab*a)
(D) {a} U L(ab*a) δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}
20. The language L = | n ≥ 0,
{an bn am bm
m ≥ 0} is (D) δ(q0, λ, z) = { (q1, z)};
(A) Context free but not linear δ(q0, a, S) = { (q1, SS)}, (q1, B) }
(B) Context free and linear
δ(q0, b, λ) = { (q1, B)},
(C) Not Context free and not linear
(D) Not Context free but linear δ(q1, λ, z) = { (qf, λ)}

Paper-III 4 S-87-13
23. Match the following : 26. Let A be the set of comfortable
(a) Dangling (i) Buffer houses given as
pointer replacement ⎧ x1 x2 x3 x4 ⎫
A = ⎨0.8, 0.9, 0.1, 0.7⎬
policy ⎩ ⎭
(b) Page fault (ii) Variable- and B be the set of affordable houses
length ⎧ x1 x2 x3 x4 ⎫
records B = ⎨0.9, 0.8, 0.6, 0.2⎬
⎩ ⎭
(c) List (iii) Object Then the set of comfortable and
representation identifier affordable houses is
(d) Toss- (iv) Pointer-
⎧ x1 x2 x3 x4 ⎫
immediate swizzling (A) ⎨0.8, 0.8, 0.1, 0.2⎬
Codes : ⎩ ⎭
(a) (b) (c) (d) ⎧ x1 x2 x3 x4 ⎫
(B) ⎨0.9, 0.9, 0.6, 0.7⎬
(A) (iii) (iv) (ii) (i) ⎩ ⎭
(B) (iv) (iii) (ii) (i) ⎧ x1 x2 x3 x4 ⎫
(C) (iv) (iii) (i) (ii) (C) ⎨0.8, 0.8, 0.6, 0.7⎬
⎩ ⎭
(D) (iii) (iv) (i) (ii)
⎧ x1 x2 x3 x4 ⎫
(D) ⎨0.7, 0.7, 0.7, 0.9⎬
24. _______ constraints ensure that a ⎩ ⎭
value that appears in one relation for
a given set of attributes also appears 27. Support of a fuzzy set
for a certain set of attributes in ⎧ x1 x2 x3 x4 x5 ⎫
A = ⎨0.2, 0.15, 0.9, 0.95, 0.15⎬
another relation. ⎩ ⎭
(A) Logical Integrity within a universal set X is given as
(B) Referential Integrity ⎧ x1 x2 x3 x4 x5 ⎫
(C) Domain Integrity (A) ⎨0.15, 0.15, 0.15, 0.15, 0.15⎬
⎩ ⎭
(D) Data Integrity
⎧ x1 x2 x3 x4 x5 ⎫
(B) ⎨0.95, 0.95, 0.95, 0.95, 0.95⎬
25. The SQL expression ⎩ ⎭
Select distinct T, branch_name from (C) {x3, x4}
branch T, branch S (D) {x1, x2, x3, x4, x5}
where T.assets>S.assets and
S.branch_city=”Mumbai” finds the 28. In a single perceptron, the updation
names of rule of weight vector is given by
(A) All branches that have greater (A) w(n + 1)=w(n)+η[d(n)-y(n)]
assets than some branch (B) w(n + 1)=w(n)–η[d(n)-y(n)]
located in Mumbai.
(C) w(n + 1)=w(n)+η[d(n)-y(n)]* x (n)
(B) All branches that have greater (D) w(n + 1)=w(n)–η[d(n)-y(n)]* x (n)
assets than all branches in
Mumbai. 29. ______ refers to the discrepancy
(C) The branch that has greatest among a computed, observed or
asset in Mumbai. measured value and the true specified
(D) Any branch that has greater or theoretically correct values.
assets than any branch in (A) Fault (B) Failure
Mumbai. (C) Defect (D) Error
S-87-13 5 Paper-III
30. Which logic family dissipates the 36. A binary ripple counter is required to
minimum power ? count up to 16383. How many flip-
(A) DTL (B) TTL flops are required ?
(C) ECL (D) CMOS (A) 16382 (B) 8191
(C) 512 (D) 14
31. Which of the following electronic
component is not found in IC’s ? 37. The time complexity of recurrence
relation
(A) Diode (B) Resistor
T(n) = T(n/3) + T(2n/3) + O(n) is
(C) Transistor (D) Inductor
(A) O(Ig n) (B) O(n)
(C) O(n Ig n) (D) O(n2 )
32. A given memory chip has 14 address
pins and 8 data pins. It has the 38. How many people must there be in a
following number of locations. room before there is a 50% chance
(A) 28 (B) 214 that two of them were born on the
(C) 26 (D) 212 same day of the year ?
(A) At least 23 (B) At least 183
33. The instruction: MOV CL, [BX] [DI] (C) At least 366 (D) At least 730
+ 8 represents the _____ addressing
mode. 39. The number of possible
(A) Based Relative parenthesizations of a sequence of n
(B) Based Indexed matrices is
(C) Indexed Relative (A) O(n)
(D) Register Indexed (B) θ(n Ig n)
(C) Ω(2n)
(D) None of the above
34. The power dissipation of a flip-flop
is 3 mW. The power dissipation of a
40. The time complexity of an efficient
digital system with 4 flip-flops is
algorithm to find the longest
given by
monotonically increasing
(A) 34 mW (B) 43 mW subsequence of n numbers is
(C) 4/3 mW (D) 12 mW (A) O(n)
(B) O(n Ig n)
35. An astable multivibrator using the (C) O(n2)
555 timer to generate a square wave (D) None of the above
of 5 KHz with 70% duty cycle will
have 41. Given a binary search trees for a set
(A) RA = 40.4 KΩ, RB = 17.25 KΩ, of n=5 keys with the following
C = 2000 pF probabilities :
(B) RA = 17.25 KΩ, RB = 40.4 KΩ, i 0 1 2 3 4 5
C = 2000 pF pi – 0.15 0.10 0.05 0.10 0.20
(C) RA = 40.4 KΩ, RB = 17.25 KΩ, qi 0.05 0.10 0.05 0.05 0.05 0.10
C = 5000 pF The expected optimal cost of the
(D) RA = 17.25 KΩ, RB = 40.4 KΩ, search is
(A) 2.65 (B) 2.70
C = 5000 pF (C) 2.75 (D) 2.80
Paper-III 6 S-87-13
42. Given 0-1 knapsack problem and
fractional knapsack problem and the
following statements :
S1 : 0-1 knapsack is efficiently
solved using Greedy algorithm.
S2 : Fractional knapsack is
efficiently solved using
Dynamic programming.
Which of the following is true ?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct.
(C) Both S1 and S2 are not correct.
(D) S1 is not correct and S2 is correct.
43. Equivalence class partitioning
approach is used to divide the input
domain into a set of equivalence
classes, so that if a program works
correctly for a value, then it will
work correctly for all the other values
in that class. This is used _____.
(A) to partition the program in the
form of classes.
(B) to reduce the number of test
cases required.
(C) for designing test cases in
white box testing.
(D) all of the above.
44. The failure intensity for a basic model
as a function of failures experienced is
given as λ(μ)-λ0[1 – (μ)/(V0)]
where λ0 is the initial failure intensity
at the start of the execution, μ is the
average or expected number of failures
at a given point in time, the quantity
V0 is the total number of failures that
would occur in infinite time.
Assume that a program will experience
100 failures in infinite time, the initial
failure intensity was 10 failures/CPU
hr. Then the decrement of failures
intensity per failure will be
(A) 10 per CPU hr.
(B) 0.1 per CPU hr.
(C) –0.1 per CPU hr.
(D) 90 per CPU hr.
S-87-13
45. Improving processing efficiency or
performance or restructuring of software
to improve changeability is known as
(A) Corrective maintenance
(B) Perfective maintenance
(C) Adaptive maintenance
(D) Code maintenance
46. In ____,modules A and B make use
of a common data type, but perhaps
perform different operations on it.
(A) Data coupling
(B) Stamp coupling
(C) Control coupling
(D) Content coupling
47. Consider the following schemas :
Branch_Schema = (branch_name, assets,
city)
Customer_Schema = (cutstomer_name,
street, city)
Deposit_Schema = (branch_name,
account_number, customer_name,
balance)
Borrow_Schema = (branch_name,
loan_number, customer_name, amount)
Which of the following tuple
relational calculus finds all customers
who have loan amount more than
` 12,000 ?
(A) {t(customer_name) | t∈borrow[?]
t[amount]>12000}
(B) {t |t(customer_name) |
t∈borrow[?] t[amount]>12000}
(C) {t |[?] ∈ borrow
(t(customer_name=s(customer_
name))[?] [amount]>12000}
(D) {t |[?] ∈ borrow
(t(customer_name)[?] s[amount]
>12000}
48. Match the following :
(a) Create (i) The E-R Model
(b) Select (ii) Relationship Model
(c) Rectangle (iii) DDL
(d) Record (iv) DML
Codes :
(a) (b) (c) (d)
(A) (iii) (iv) (i) (ii)
(B) (iv) (iii) (ii) (i)
(C) (iv) (iii) (i) (ii)
(D) (iii) (iv) (ii) (i)
7 Paper-III
49. Match the following : 52. Assume that we have constructor
(i) One to one function for both Base and Derived
relationship classes. Now consider the declaration :
(a) main ( )
(ii) Relationship Base *p = new Derived;
(b) In what sequence, the constructor
will be executed ?
(iii) Many to many
(c) (A) Derived class constructor is
relationship
followed by Base class
(iv) Many to one constructor.
(d) relationship (B) Base class constructor is
followed by Derived class
Codes : constructor.
(a) (b) (c) (d) (C) Base class constructor is never
(A) (iii) (iv) (ii) (i) called.
(D) Derived class constructor is
(B) (iv) (iii) (ii) (i)
never called.
(C) (ii) (iii) (iv) (i)
(D) (iii) (iv) (i) (ii) 53. What is the output of the following
program ?
50. Sixty (60) reusable components were
#include<stdio.h>
available for an application. If only
main( )
70% of these components can be used,
rest 30% would have to be developed {
from scratch. If average component is int a, b = 0;
100 LOC and cost of each LOC is static int c[10] =
` 14, what will be the risk exposure if {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};
risk probability is 80% ? for (a=0; a<10;++a);
(A) ` 25,200 (B) ` 20,160 if ((c[a]%2)= =0) b+=c[a];
(C) ` 25,160 (D) ` 20,400 printf(“%d”,b);
}
51. Consider the following two function (A) 15 (B) 25
declarations : (C) 45 (D) 20
(i) int *f( ) (ii) int (*f)( )
54. A Program contains the following
Which of the following is true ? declarations and initial assignments
(A) Both are identical. int i = 8, j = 5;
(B) The first is a correct declaration double x = 0.005, y = –0.01;
and the second is wrong. char c=’c’, d=’d’;
(C) Both are different ways of Determine the value of the following
declaring pointer to a function. expressions which involve the use of
library functions:
(D) The first declaration is a
function returning a pointer to abs(i-2*j) ; log(exp(x)) ;
an integer and the second is a toupper(d)
pointer to function returning (A) 2; 0.005; D (B) 1; 0.005; D
integer. (C) 2; 0.005; E (D) 1; 0.005; e
Paper-III 8 S-87-13
55. MPEG involves both spatial 61. Which of the following is/are
compression and temporal fundamental method(s) of
compression. The spatial antialiasing ?
compression is similar to JPEG and
temporal compression removes (i) Increase of sample rate.
______ frames. (ii) Treating a pixel as a finite area
(A) Temporal (B) Voice rather than as a point.
(C) Spatial (D) Redundant (iii) Decrease of sample rate.
56. If the data unit is 111111 and the (A) (i) and (ii) (B) (ii) and (iii)
divisor is 1010. In CRC method, (C) (i) only (D) (ii) only
what is the dividend at the
transmission before division ?
(A) 1111110000 (B) 1111111010 62. The two color systems – the HSV
(C) 111111000 (D) 111111 and HLS are
57. If user A wants to send an encrypted (A) Hue, Saturation, Value and
message to user B. The plain text of A is Hue, Lightness, Saturation.
encrypted with the _______. (B) High, Standard, Value and
(A) Public Key of user A High, Lightness, Saturation.
(B) Public Key of user B
(C) Private Key of user A (C) Highly, Saturated, Value and
(D) Private Key of user B Highly, Lightened, Saturation.
58. A _____ can forward or block (D) Highly, Standard, Value and
packets based on the information in Hue, Lightness, Saturation.
the network layer and transport layer
header. 63. The parametric representation of the
(A) Proxy firewall line segment between the position
(B) Firewall
(C) Packet filter firewall vectors P1(2, 3) and P2(5, 4) is given as
(D) Message digest firewall (A) x(t)= 2+7t, y(t) = 0≤t≤∝
59. Which of the following graphics 3+7t
devices are known as active graphics (B) x(t)=2+10t, y(t) = 0≤t≤1
devices ? 3+12t
(i) Alphanumeric devices
(ii) Thumb wheels (C) x(t)= 2+3t, 0≤t≤1
(iii) Digitizers y(t)=3+t
(iv) Joystics (D) t(x, y) = 14t 0≤t≤1
(A) (i) and (ii)
(B) (iii) and (iv)
(C) (i), (ii) and (iii) 64. Consider the following
(D) (i), (ii), (iii) and (iv) transformation matrix for
60. A diametric projection is said to be rotation(clockwise) :
trimetric projection when ⎡ –sinθ
cosθ sinθ 0 0
⎤
(i) two of the three foreshortening
[T] =
⎢ cosθ 0 0 ⎥
factors are equal and third is
⎢ 0 0 1 0 ⎥
arbitrary.
(ii) all of the three foreshortening ⎣ 0 0 0 1 ⎦
factors are equal. This matrix rotates an object by an
(iii) all of the three foreshortening angle θ about :
factors are arbitrary. (A) X-axis
Which of the above is true ? (B) Y-axis
(A) (i) and (ii) (B) (ii) and (iii) (C) Z-axis
(C) (i) only (D) (iii) only (D) All of the above
S-87-13 9 Paper-III
65. Consider the following sequence of
operations :
(i) Pointer p1 is set to point at a
new heap-dynamic variable.
(ii) Pointer p2 is assigned p1’s
value.
(iii) The heap dynamic variable
pointed to by p1 is explicitly
de-allocated, but p2 is not
changed by the operation.
This situation leads to which of the
following :
(A) p1 becomes a dangling pointer
(B) p2 becomes a dangling pointer
(C) Both p1 and p2 are now
dangling pointers
(D) Neither p1 nor p2 is now a
dangling pointer
66. The programming languages C and
C++ are not strongly typed languages
because :
(A) Both C and C++ allow
functions for which parameters
are not type checked.
(B) Both C and C++ allow
functions for which parameters
are type checked.
(C) Both C and C++ allow
functions for which parameters
are not type checked and also
the union types in these
languages are not type checked.
(D) Union types in these (C and
C++) languages are not type
checked.
67. The tracing model in Prolog
describes program execution in terms
of certain events. These events are
(A) call and exit
(B) call and fail
(C) call, exit and redo
(D) call, exit, redo and fail
Paper-III
68. Which of the following statements is
not correct with reference to
distributed systems ?
(A) Distributed system represents a
global view of the network and
considers it as a virtual uni-
processor system by controlling
and managing resources across
the network on all the sites.
(B) Distributed system is built on
bare machine, not an add-on to
the existing software.
(C) In a distributed system, kernel
provides smallest possible set
of services on which other
services are built. This kernel is
called microkernel. Open
servers provide other services
and access to shared resources.
(D) In a distributed system, if a
user wants to run the program
on other nodes or share the
resources on remote sites due
to their beneficial aspects, user
has to log on to that site.
69. A system contains 10 units of
resource of same type. The resource
requirement and current allocation of
these resources for three processes P,
Q and R are as follows :
P Q R
Maximum requirement 8 7 5
Current allocation 4 1 3
Now, consider the following resource
requests :
(i) P makes a request for 2 resource units.
(ii) Q makes request for 2 resources units.
(iii) R makes a request of 2 resource units.
For a safe state, which of the
following options must be satisfied ?
(A) Only request (i)
(B) Only request (ii)
(C) Only request (iii)
(D) Request (i) and (ii)
70. Consider the following set of
processes with the length of CPU
burst time in milliseconds (ms) :
Process A B C D E
Burst time 6 1 2 1 5
Priority 3 1 3 4 2
Assume that processes are stored in
ready queue in following order :
A–B–C–D–E
Using round robin scheduling with
time slice of 1 ms, the average turn
around time is
(A) 8.4 ms (B) 12.4 ms
(C) 9.2 ms (D) 9.4 ms
10 S-87-13
71. Consider a main memory with 3 page 75. Which of the following statements is
frames for the following page
reference string : not true for UNIX Operating System ?
5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4
Assuming that the execution of
process is initiated after loading page
5 in memory, the number of page (A) Major strength of UNIX
faults in FIFO and second chance
replacement respectively are Operating System is its open
(A) 8 and 9 (B) 10 and 11
(C) 7 and 9 (D) 9 and 8 standards which enabled large
72. Which of the following shell scripts will number of organizations
produce the output “my first script” ?
(A) for i in my first script { echo –i $i} ranging from academicia to
(B) for my first script; do echo –n; done
(C) for i in my first script; do echo industries to participate in its
–i $i; done
(D) for n in my first script; do echo development.
–i $i; done
73. The portion of Windows 2000 operating
system which is not portable is
(A) processor management (B) UNIX kernel uses modules
(B) user interface
(C) device management with well specified interfaces
(D) virtual memory management
and provides advantages like
74. Match the following for Windows
Operating System : simplified testing and
(a) Hard- (i) Starting all processes,
ware emulation of different maintenance of kernel. It has
abstra- operating systems,
ction security functions, better extensibility as the
layer transform character
based applications to kernel is not monolithic.
graphical
representation.
(b) Kernel (ii) Export a virtual
memory interface, (C) UNIX is kernel based operating
support for symmetric
multiprocessing, system with two main
administration, details
of mapping memory, components viz. process
configuring I/O buses,
setting up DMA. management subsystem and
(c) Exe- (iii) Thread scheduling,
cutive interrupt and exception file management subsystem.
handling, recovery
after power failure.
(d) Win32 (iv) Object manager, virtual (D) All devices are represented as
sub- memory manager,
system process manager, plug- files which simplify the
and-play and power
manager. management of I/O devices and
Codes :
(a) (b) (c) (d) files. The directories structure
(A) (i) (iii) (ii) (iv)
(B) (iv) (iii) (ii) (i) used is directed acyclic graph.
(C) (ii) (iii) (iv) (i)
(D) (iii) (ii) (i) (iv)

S-87-13 11 Paper-III
 Space For Rough Work

Paper-III 12 S-87-13