PAPER-II
COMPUTER SCIENCE AND APPLICATIONS
Signature and Name of Invigilator
1. (Signature) __________________________
(Name) ____________________________
2. (Signature) __________________________
(Name) ____________________________
J 871
1 4
Time : 1 /4 hours]
Number of Pages in this Booklet : 8
Instructions for the Candidates
1. Write your roll number in the space provided on the top of
this page.
2. This paper consists of fifty 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 on the edge of this cover page. Do not accept
a booklet without sticker-seal 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 Paper I 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 such as change of response by scratching or using
white fluid, you will render yourself liable to disqualification.
9. You have to return the test question booklet and 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 original
question booklet and 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.
J-87-14
OMR Sheet No. : ...............................................
(To be filled by the Candidate)
Roll No.
(In figures as per admission card)
Roll No.________________________________
(In words)
[Maximum Marks : 100
Number of Questions in this Booklet : 50
¯Ö¸üßõÖÖÙ£ÖµÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
1. ‡ÃÖ ¯Öéšü Ûêú ‰ú¯Ö¸ü ×®ÖµÖŸÖ Ã£ÖÖ®Ö ¯Ö¸ü †¯Ö®ÖÖ ¸üÖê»Ö ®Ö´²Ö¸ü ×»Ö×ÜÖ‹ …
2. ‡ÃÖ ¯ÖÏ¿®Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÖÃÖ ²ÖÆãü×¾ÖÛú»¯ÖßµÖ ¯ÖÏ¿®Ö Æïü …
3. ¯Ö¸üßõÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê®Öê ¯Ö¸ü, ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ †Ö¯ÖÛúÖê ¤êü ¤üß •ÖÖµÖêÝÖß … ¯ÖÆü»Öê
¯ÖÖÑ“Ö ×´Ö®Ö™ü †Ö¯ÖÛúÖê ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ÜÖÖê»Ö®Öê ŸÖ£ÖÖ ˆÃÖÛúß ×®Ö´®Ö×»Ö×ÜÖŸÖ
•ÖÖÑ“Ö Ûêú ×»Ö‹ פüµÖê •ÖÖµÖëÝÖê, וÖÃÖÛúß •ÖÖÑ“Ö †Ö¯ÖÛúÖê †¾Ö¿µÖ Ûú¸ü®Öß Æîü :
(i) ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ÜÖÖê»Ö®Öê Ûêú ×»Ö‹ ˆÃÖÛêú Ûú¾Ö¸ü ¯Öê•Ö ¯Ö¸ü »ÖÝÖß ÛúÖÝÖ•Ö
Ûúß ÃÖᯙ ÛúÖê ±úÖ›Ìü »Öë … ÜÖã»Öß Æãü‡Ô µÖÖ ×²Ö®ÖÖ Ã™üßÛú¸ü-ÃÖᯙ Ûúß
¯Öã×ßÖÛúÖ Ã¾ÖßÛúÖ¸ü ®Ö Ûú¸ëü …
(ii) Ûú¾Ö¸ü ¯Öéšü ¯Ö¸ü ”û¯Öê ×®Ö¤ìü¿ÖÖ®ÖãÃÖÖ¸ü ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ Ûêú ¯Öéšü ŸÖ£ÖÖ
¯ÖÏ¿®ÖÖë Ûúß ÃÖÓܵÖÖ ÛúÖê †“”ûß ŸÖ¸üÆü “ÖîÛú Ûú¸ü »Öë ×Ûú µÖê ¯Öæ¸êü
Æïü … ¤üÖÂê Ö¯ÖæÞÖÔ ¯Öã×ßÖÛúÖ ×•Ö®Ö´Öë ¯Öéšü/¯ÖÏ¿®Ö Ûú´Ö ÆüÖë µÖÖ ¤ãü²ÖÖ¸üÖ †Ö
ÝÖµÖê ÆüÖë µÖÖ ÃÖß׸üµÖ»Ö ´Öë ®Ö ÆüÖë †£ÖÖÔŸÖË ×ÛúÃÖß ³Öß ¯ÖÏÛúÖ¸ü Ûúß
¡Öã×™ü¯ÖæÞÖÔ ¯Öã×ßÖÛúÖ Ã¾ÖßÛúÖ¸ü ®Ö Ûú¸ëü ŸÖ£ÖÖ ˆÃÖß ÃÖ´ÖµÖ ˆÃÖê
»ÖÖî™üÖÛú¸ü ˆÃÖÛêú ãÖÖ®Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆüß ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ »Öê »Öë …
‡ÃÖÛêú ×»Ö‹ †Ö¯ÖÛúÖê ¯ÖÖÑ“Ö ×´Ö®Ö™ü פüµÖê •ÖÖµÖëÝÖê … ˆÃÖÛêú ²ÖÖ¤ü ®Ö
ŸÖÖê †Ö¯ÖÛúß ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ¾ÖÖ¯ÖÃÖ »Öß •ÖÖµÖêÝÖß †Öî¸ü ®Ö Æüß †Ö¯ÖÛúÖê
†×ŸÖ׸üŒŸÖ ÃÖ´ÖµÖ ×¤üµÖÖ •ÖÖµÖêÝÖÖ …
(iii) ‡ÃÖ •ÖÖÑ“Ö Ûêú ²ÖÖ¤ü OMR ¯Ö¡ÖÛú Ûúß ÛÎú´Ö ÃÖÓܵÖÖ ‡ÃÖ ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ
¯Ö¸ü †Ó×ÛúŸÖ Ûú¸ü ¤ëü …
4. ¯ÖÏŸµÖêÛú ¯ÖÏ¿®Ö Ûêú ×»Ö‹ “ÖÖ¸ü ˆ¢Ö¸ü ×¾ÖÛú»¯Ö (A), (B), (C) ŸÖ£ÖÖ (D) פüµÖê
ÝÖµÖê Æïü … †Ö¯ÖÛúÖê ÃÖÆüß ˆ¢Ö¸ü Ûêú ¾Öé¢Ö ÛúÖê ¯Öê®Ö ÃÖê ³Ö¸üÛú¸ü ÛúÖ»ÖÖ Ûú¸ü®ÖÖ Æîü
•ÖîÃÖÖ ×Ûú ®Öß“Öê פüÜÖÖµÖÖ ÝÖµÖÖ Æîü …
ˆ¤üÖÆü¸üÞÖ :
•Ö²Ö×Ûúú(C) ÃÖÆüß ˆ¢Ö¸ü Æîü …
5. ¯ÖÏ¿®ÖÖë Ûêú ˆ¢Ö¸ü Ûêú¾Ö»Ö ¯ÖÏ¿®Ö ¯Ö¡Ö I Ûêú †®¤ü¸ü פüµÖê ÝÖµÖê OMR ¯Ö¡ÖÛú ¯Ö¸ü Æüß
†Ó×ÛúŸÖ Ûú¸ü®Öê Æïü … µÖפü †Ö¯Ö OMR ¯Ö¡ÖÛú ¯Ö¸ü פüµÖê ÝÖµÖê ¾Öé¢Ö Ûêú †»ÖÖ¾ÖÖ
×ÛúÃÖß †®µÖ ãÖÖ®Ö ¯Ö¸ü ˆ¢Ö¸ü דÖÅ®ÖÖÓ×ÛúŸÖ Ûú¸üŸÖê Æïü, ŸÖÖê ˆÃÖÛúÖ ´Ö滵ÖÖÓÛú®Ö
®ÖÆüà ÆüÖêÝÖÖ …
6. †®¤ü¸ü פüµÖê ÝÖµÖê ×®Ö¤ìü¿ÖÖë ÛúÖê ¬µÖÖ®Ö¯Öæ¾ÖÔÛú ¯ÖœÌëü …
7. Ûú““ÖÖ ÛúÖ´Ö (Rough Work) ‡ÃÖ ¯Öã×ßÖÛúÖ Ûêú †×®ŸÖ´Ö ¯Öéšü ¯Ö¸ü Ûú¸ëü …
8. µÖפü †Ö¯Ö OMR ¯Ö¡ÖÛú ¯Ö¸ü ×®ÖµÖŸÖ Ã£ÖÖ®Ö Ûêú †»ÖÖ¾ÖÖ †¯Ö®ÖÖ ®ÖÖ´Ö, ¸üÖê»Ö
®Ö´²Ö¸ü, ±úÖê®Ö ®Ö´²Ö¸ü µÖÖ ÛúÖê‡Ô ³Öß ‹êÃÖÖ ×“ÖÅ®Ö ×•ÖÃÖÃÖê †Ö¯ÖÛúß ¯ÖÆü“ÖÖ®Ö ÆüÖê
ÃÖÛêú, †Ó×ÛúŸÖ Ûú¸üŸÖê Æïü †£Ö¾ÖÖ †³Ö¦ü ³ÖÖÂÖÖ ÛúÖ ¯ÖϵÖÖêÝÖ Ûú¸üŸÖê Æïü, µÖÖ ÛúÖê‡Ô
†®µÖ †®Öã×“ÖŸÖ ÃÖÖ¬Ö®Ö ÛúÖ ¯ÖϵÖÖêÝÖ Ûú¸üŸÖê Æïü, •ÖîÃÖê ×Ûú †Ó×ÛúŸÖ ×ÛúµÖê ÝÖµÖê
ˆ¢Ö¸ü ÛúÖê ×´Ö™üÖ®ÖÖ µÖÖ ÃÖ±êú¤ü õÖÖÆüß ÃÖê ²Ö¤ü»Ö®ÖÖ ŸÖÖê ¯Ö¸üßõÖÖ Ûêú ×»ÖµÖê
†µÖÖêÝµÖ ‘ÖÖê×ÂÖŸÖ ×ÛúµÖê •ÖÖ ÃÖÛúŸÖê Æïü …
9. †Ö¯ÖÛúÖê ¯Ö¸üßõÖÖ ÃÖ´ÖÖ¯ŸÖ ÆüÖê®Öê ¯Ö¸ü ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ‹¾ÖÓ ´Öæ»Ö OMR ¯Ö¡ÖÛú
×®Ö¸üßõÖÛú ´ÖÆüÖê¤üµÖ ÛúÖê »ÖÖî™üÖ®ÖÖ †Ö¾Ö¿µÖÛú Æîü †Öî¸ü ¯Ö¸üßõÖÖ ÃÖ´ÖÖׯŸÖ Ûêú ²ÖÖ¤ü
ˆÃÖê †¯Ö®Öê ÃÖÖ£Ö ¯Ö¸üßõÖÖ ³Ö¾Ö®Ö ÃÖê ²ÖÖÆü¸ü ®Ö »ÖêÛú¸ü •ÖÖµÖë … ÆüÖ»ÖÖÓ×Ûú †Ö¯Ö
¯Ö¸üßõÖÖ ÃÖ´ÖÖׯŸÖ ¯Ö¸ü ´Öæ»Ö ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ŸÖ£ÖÖ OMR ¯Ö¡ÖÛú Ûúß ›ãü¯»ÖßÛêú™ü
¯ÖÏ×ŸÖ †¯Ö®Öê ÃÖÖ£Ö »Öê •ÖÖ ÃÖÛúŸÖê Æïü …
10. Ûêú¾Ö»Ö ®Öß»Öê/ÛúÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ‡Õ™ü ¯Öê®Ö ÛúÖ Æüß ‡ÃŸÖê´ÖÖ»Ö Ûú¸ëü …
11. ×ÛúÃÖß ³Öß ¯ÖÏÛúÖ¸ü ÛúÖ ÃÖÓÝÖÞÖÛú (Ûîú»ÖÛãú»Öê™ü¸ü) µÖÖ »ÖÖÝÖ ™êü²Ö»Ö †Öפü ÛúÖ
¯ÖϵÖÖêÝÖ ¾ÖÙ•ÖŸÖ Æîü …
12. ÝÖ»ÖŸÖ ˆ¢Ö¸üÖë Ûêú ×»Ö‹ ÛúÖê‡Ô ®ÖÛúÖ¸üÖŸ´ÖÛú †ÓÛú ®ÖÆüà Æïü …
1 P.T.O.
 COMPUTER SCIENCE AND APPLICATIONS
Paper – II
Note : This paper contains fifty (50) objective type questions of two (2) marks each. All
questions are compulsory.
1. Infrared signals can be used for short 6. A grammar G is LL(1) if and only if
range communication in a closed the following conditions hold for two
area using _______ propagation. distinct productions A → α | β
(A) ground (B) sky I. First (α) ∩ First (β) ≠ {a} where
(C) line of sight (D) space a is some terminal symbol of the
grammar.
2. A bridge has access to _______ II. First (α) ∩ First (β) ≠ λ
address in the same network. III. First (α) ∩ Follow (A) = φ if λ ∈
(A) Physical (B) Network First (β)
(C) Datalink (D) Application (A) I and II (B) I and III
(C) II and III (D) I, II and III
3. The minimum frame length for
10 Mbps Ethernet is _______ bytes 7. Which of the following suffices to convert
and maximum is _______ bytes. an arbitrary CFG to an LL(1) grammar ?
(A) Removing left recursion alone
(A) 64 & 128 (B) 128 & 1518
(B) Removing the grammar alone
(C) 1518 & 3036 (D) 64 & 1518 (C) Removing left recursion and
4. The bit rate of a signal is 3000 bps. If factoring the grammar
each signal unit carries 6 bits, the baud (D) None of the above
rate of the signal is _______. 8. A shift reduce parser suffers from
(A) 500 baud/sec (A) shift reduce conflict only
(B) 1000 baud/sec (B) reduce reduce conflict only
(C) 3000 baud/sec (C) both shift reduce conflict and
reduce reduce conflict
(D) 18000 baud/sec. (D) shift handle and reduce handle
5. Match the following : conflicts
List – I List – II 9. The context free grammar for the
a. Physical i. Allow resources to language L = {anbmck | k = |n – m|,
layer network access n > 0, m > 0, k > 0} is
b. Datalink ii. Move packets from (A) S → S1S3, S1 → aS1c | S2| λ,
layer one destination to
S2 → aS2b|λ, S3 → aS3b| S4 | λ,
other
c. Network iii. Process to process S4 → bS4c|λ
layer message delivery (B) S → S1S3, S1→ aS1S2c | λ,
d. Transport iv. Transmission of S2 → aS2b|λ, S3 → aS3b| S4 |λ,
layer bit stream
e. Application v. Formation of S4 → bS4c|λ
Layer frames (C) S → S1|S2, S1→ aS1S2c | λ,
Codes : S2 → aS2b | λ, S3 → aS3b | S4 |λ,
a b c d e S4 → bS4c|λ
(A) iv v ii iii i
(B) v iv i ii iii (D) S → S1 | S3, S1→ aS1c|S2 | λ,
(C) i iii ii v iv S2 → aS2b | λ, S3 → a S3b| S4 | λ,
(D) i ii iv iii v S4 → bS4c | λ
Paper-II 2 J-87-14
10. The regular grammar for the language
L = {w|na(w) and nb(w) are both even,
w ∈ {a, b}*} is given by :
(Assume, p, q, r and s are states)
(A) p → aq | br | λ, q → bs | ap
r → as | bp, s → ar | bq, p and s
are initial and final states.
(B) p → aq | br, q → bs | ap
r → as | bp, s → ar | bq, p and s
are initial and final states.
(C) p → aq | br | λ, q → bs | ap
r → as | bp, s → ar | bq
p is both initial and final states.
(D) p → aq | br, q → bs | ap
r → as | bp, s → ar | bq
p is both initial and final states.
11. KPA in CMM stands for
(A) Key Process Area
(B) Key Product Area
(C) Key Principal Area
(D) Key Performance Area
12. Which one of the following is not a
risk management technique for
managing the risk due to unrealistic
schedules and budgets ?
(A) Detailed multi source cost and
schedule estimation.
(B) Design cost
(C) Incremental development
(D) Information hiding
13. _______ of a system is the structure or
structures of the system which
comprise software elements, the
externally visible properties of these
elements and the relationship amongst
them.
(A) Software construction
(B) Software evolution
(C) Software architecture
(D) Software reuse
14. In function point analysis, the number
of complexity adjustment factors is
(A) 10 (B) 12
(C) 14 (D) 20
J-87-14
15. Regression testing is primarily related to
(A) Functional testing
(B) Development testing
(C) Data flow testing
(D) Maintenance testing
16. How many different truth tables of the
compound propositions are there that
involve the propositions p & q ?
(A) 2 (B) 4
(C) 8 (D) 16
17. A Boolean function F is called self-
dual if and only if
– – –
F(x1, x2, … xn) = F(x 1, x2, … x n)
How many Boolean functions of
degree n are self-dual ?
n
(A) 2n (B) (2)2
2 n–1
(C) (2) n (D) (2) 2
18. Which of the following statement(s) is
(are) not correct ?
i. The 2’s complement of 0 is 0.
ii. In 2’s complement, the left most
bit cannot be used to express a
quantity.
iii. For an n-bit word (2’s
complement) which includes the
sign bit, there are 2n–1 positive
integers, 2n+1 negative integers
and one 0 for a total of 2n unique
states.
iv. In 2’s complement the significant
information is contained in the
1’s of positive numbers and 0’s
of the negative numbers.
(A) i & iv (B) i & ii
(C) iii (D) iv
19. The notation ∃!xP(x) denotes the
proposition “there exists a unique x
such that P(x) is true”.
Give the truth values of the following
statements :
I. ∃!xP(x) → ∃xP(x)
II. ∃!x ¬ P(x) → ¬∀xP(x)
(A) Both I & II are true.
(B) Both I & II are false.
(C) I – false, II – true
(D) I – true, II – false
3 Paper-II
20. Give a compound proposition 23. Consider a complete bipartite graph
involving propositions p, q and r that is km,n. For which values of m and n does
true when exactly two of p, q and r are
true and is false otherwise. this, complete graph have a Hamilton
(A) (p∨q∧¬r) ∧ (p∧¬q∧r) ∧ (¬p∧q∧r) circuit
(B) (p∧q∧¬r) ∧ (p∨q∧¬r) ∧ (¬p∧q∧r) (A) m = 3, n = 2 (B) m = 2, n = 3
(C) (p∧q∧¬r) ∨ (p∧¬q∧r) ∧ (¬p∧q∧r) (C) m = n > 2 (D) m = n > 3
(D) (p∧q∧¬r) ∨ (p∧¬q∧r) ∨ (¬p∧q∧r)
21. Consider the graph given below as : 24. Big-O estimates for the factorial
function and the logarithm of the
factorial function i.e. n! and log n! is
given by
(A) O(n!) and O(n log n)
(B) O(nn) and O(n log n)
(C) O(n!) and O(log n!)
Which one of the following graph is (D) O(nn) and O(log n!)
isomorphic to the above graph ?
25. How many cards must be chosen from
a deck to guarantee that atleast
(A) i. two aces of two kinds are chosen.
ii. two aces are chosen.
iii. two cards of the same kind are
chosen.
iv. two cards of two different kinds
(B) are chosen.
(A) 50, 50, 14, 5 (B) 51, 51, 15, 7
(C) 52, 52, 14, 5 (D) 51, 51, 14, 5
26. Match the following with respect to the
mobile computing technologies :
(C) List – I List – II
a. GPRS i. An integrated digital
radio standard
b. GSM ii. 3G wireless/Mobile
technology
(D) c. UMTS iii. Nine different
schemes for
modulation and error
22. The upper bound and lower bound for correction
the number of leaves in a B-tree of d. EDGE iv. An emerging wireless
degree K with height h is given by : service that offers a
h–1 mobile data
(A) Kh and 2K/2
Codes :
h–1 a b c d
(B) K*h and 2K/2
(A) iii iv ii i
h–1
(C) Kh and 2K/2 (B) iv i ii iii
h–1 (C) ii iii iv i
(D) K*h and 2K/2 (D) ii i iv iii
Paper-II 4 J-87-14
27. Object Request Broker (ORB) is 32. Match the following :
I. A software program that runs on List – I List – II
the client as well as on the a. Multilevel i. Time-slicing
application server. feedback queue
II. A software program that runs on b. FCFS ii. Criteria to
the client side only. move processes
III. A software program that runs on between queues
the application server, where c. Shortest iii. Batch
most of the components reside. process next processing
(A) I, II & III (B) I & II d. Round robin iv. Exponential
(C) II & III (D) I only scheduling smoothening
28. A software agent is defined as Codes :
I. A software developed for a b c d
accomplishing a given task. (A) i iii ii iv
II. A computer program which is (B) iv iii ii i
capable of acting on behalf of the (C) iii i iv i
user in order to accomplish a (D) ii iii iv i
given computational task. 33. Consider a system with five processes
III. An open source software for
accomplishing a given task. P0 through P4 and three resource types
(A) I R1, R2 and R3. Resource type R1 has
(B) II
(C) III 10 instances, R2 has 5 instances and R3
(D) All of the above has 7 instances. Suppose that at time
29. Match the following : T0, the following snapshot of the
List – I List – II system has been taken :
a. Classification i. Principal
component Allocation
analysis R1 R2 R3
b. Clustering ii. Branch and Bound P0 0 1 0
c. Feature iii. K-nearest
Extraction neighbour P1 2 0 0
d. Feature iv. K-means P2 3 0 2
Selection
Codes : P3 2 1 1
a b c d P4 0 2 2
(A) iii iv ii i
(B) iv iii i ii Max
(C) iii iv i ii R1 R2 R3
(D) iv iii ii i 7 5 3
30. SET, an open encryption and security 3 2 2
specification model that is designed for 9 0 2
protecting credit card transactions on 2 2 2
the internet, stands for 4 3 3
(A) Secure Electronic Transaction
(B) Secular Enterprise for Transaction Available
(C) Security Electronic Transmission R1 R2 R3
(D) Secured Electronic Termination 3 3 2
31. In a paged memory management Assume that now the process P1 requests
algorithm, the hit ratio is 70%. If it takes
30 nanoseconds to search Translation one additional instance of type R1 and
Look-aside Buffer (TLB) and 100 two instances of resource type R3. The
nanoseconds (ns) to access memory, the
effective memory access time is state resulting after this allocation will be
(A) 91 ns (B) 69 ns (A) Ready state (B) Safe state
(C) 200 ns (D) 160 ns (C) Blocked state (D) Unsafe state
J-87-14 5 Paper-II
34. Match the following : 38. Searching for an element in the hash
List – I List – II table requires O(1) time for the
a. Contiguous i. This scheme ________ time, whereas for direct
allocation supports very addressing it holds for the ________
large file sizes. time.
b. Linked ii. This allocation
allocation technique (A) worst-case, average
supports only (B) worst-case, worst-case
sequential files. (C) average, worst-case
c. Indexed iii. Number of (D) best, average
allocation disks required
to access file is 39. An algorithm is made up of 2 modules
minimal. M1 and M2. If time complexity of
d. Multi-level iv. This technique modules M1 and M2 are h(n) and g(n)
indexed suffers from
maximum respectively, the time complexity of
wastage of the algorithm is
space in storing (A) min (h(n), g(n))
pointers. (B) max (h(n), g(n))
Codes : (C) h(n) + g(n)
a b c d (D) h(n) * g(n)
(A) iii iv ii i
(B) iii ii iv i 40. What is the maximum number of
(C) i ii iv iii parenthesis that will appear on the
(D) i iv ii iii stack at any one time for parenthesis
expression given by
35. Which of the following commands will (( ) ( ( ) ) ( ( ) ) )
output “onetwothree” ? (A) 2 (B) 3
(A) for val; do echo-n $val; done <
one two three (C) 4 (D) 5
(B) for one two three; do echo-n-; 41. Match the following :
done List – I List – II
(C) for n in one two three; do echo-n a. Automatic i. Scope of the
$n; done storage class variable is global.
(D) for n in one two three {echo –n $ n}
b. Register ii. Value of the
36. Mergesort makes two recursive calls. storage class variable persists
Which statement is true after these two between different
recursive calls finish, but before the function calls.
merge step ? c. Static iii. Value stored in
(A) The array elements form a heap. storage class memory and
(B) Elements in each half of the array local to the block
are sorted amongst themselves.
(C) Elements in the first half of the in which the
array are less than or equal to variable is
elements in second half of the array. defined.
(D) All of the above d. External iv. Value stored in
storage class CPU registers.
37. A text is made up of the characters α, Codes :
β, γ, δ and σ with the probability 0.12, a b c d
0.40, 0.15, 0.08 and 0.25 respectively.
The optimal coding technique will (A) iii iv i ii
have the average length of (B) iii iv ii i
(A) 1.7 (B) 2.15 (C) iv iii ii i
(C) 3.4 (D) 3.8 (D) iv iii i ii
Paper-II 6 J-87-14
42. When we pass an array as an argument 47. Which of the following statements is
to a function, what actually gets passed ? false ?
(A) Address of the array (A) Any relation with two attributes
(B) Values of the elements of the is in BCNF.
array (B) A relation in which every key
has only one attribute is in 2NF.
(C) Base address of the array
(C) A prime attribute can be
(D) Number of elements of the array
transitively dependent on a key
in 3NF relation.
43. While (87) printf(“computer”); (D) A prime attribute can be
The above C statement will transitively dependent on a key
in BCNF relation.
(A) print “computer” 87 times
(B) print “computer” 0 times
48. A clustering index is created when
(C) print “computer” 1 times _______.
(D) print “computer” infinite times (A) primary key is declared and
ordered
44. A friend function can be used to (B) no key ordered
(A) avoid arguments between classes. (C) foreign key ordered
(B) allow access to classes whose (D) there is no key and no order
source code is unavailable.
(C) allow one class to access an 49. Let R ={A, B, C, D, E, F} be a relation
unrelated class. schema with the following dependencies
C → F, E → A, EC → D, A → B
(D) None of the above
Which of the following is a key for R ?
(A) CD (B) EC
45. Which of the following is the correct
(C) AE (D) AC
value returned to the operating system
upon the successful completion of a
program ? 50. Match the following :
(A) 0 List – I List – II
(B) 1 a. DDL i. LOCK TABLE
(C) –1 b. DML ii. COMMIT
(D) Program do not return a value. c. TCL iii. Natural Difference
d. BINARY iv. REVOKE
Operation
46. Manager’s salary details are hidden
Codes :
from the employee. This is called as
a b c d
(A) Conceptual level data hiding
(A) ii i iii iv
(B) Physical level data hiding
(B) i ii iv iii
(C) External level data hiding (C) iii ii i iv
(D) Local level data hiding (D) iv i ii iii
J-87-14 7 Paper-II
 Space For Rough Work

Paper-II 8 J-87-14