PAPER-II
COMPUTER SCIENCE AND APPLICATIONS
Signature and Name of Invigilator
1. (Signature) __________________________
(Name) ____________________________
2. (Signature) __________________________
(Name) ____________________________
D 871
1 3
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 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.
D-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 : 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.
www.examrace.com
 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. When data and acknowledgement are 6. FAN IN of a component A is defined

sent in the same frame, this is called as
as (A) Number of components that
(A) Piggy packing can call or pass control to
component A.
(B) Piggy backing
(B) Number of components that are
(C) Back packing called by component A.
(D) Good packing (C) Number of components related
to component A.
2. Encryption and Decryption is the (D) Number of components
responsibility of Layer. dependent on component A.
(A) Physical
7. The relationship of data elements in a
(B) Network
module is called
(C) Application
(A) Coupling
(D) Datalink (B) Modularity
(C) Cohesion
3. An analog signal carries 4 bits in (D) Granularity
each signal unit. If 1000 signal units
are sent per second, then baud rate
8. Software Configuration Management
and bit rate of the signal are
is the discipline for systematically
and _______.
controlling
(A) 4000 bauds \ sec & 1000 bps (A) the changes due to the
(B) 2000 bauds \ sec & 1000 bps evolution of work products as
(C) 1000 bauds \ sec & 500 bps the project proceeds.
(D) 1000 bauds \ sec & 4000 bps (B) the changes due to defects
(bugs) being found and then
fixed.
4. The VLF and LF bauds use _______ (C) the changes due to requirement
propagation for communication. changes
(A) Ground (B) Sky (D) all of the above
(C) Line of sight (D) Space
9. Which one of the following is not a
5. Using the RSA public key crypto step of requirement engineering ?
system, if p = 13, q = 31 and d = 7, (A) Requirement elicitation
then the value of e is (B) Requirement analysis
(A) 101 (B) 103 (C) Requirement design
(C) 105 (D) 107 (D) Requirement documentation
Paper-II 2 D-87-13

www.examrace.com
10. Testing of software with actual data 15. Data Integrity control uses
and in actual environment is called (A) Upper and lower limits on
(A) Alpha testing numeric data.
(B) Beta testing (B) Passwords to prohibit
unauthorised access to files.
(C) Regression testing (C) Data dictionary to keep the data
(D) None of the above (D) Data dictionary to find last
access of data
11. The student marks should not be
greater than 100. This is 16. What does the following declaration
(A) Integrity constraint mean ?
int (*ptr) [10];
(B) Referential constraint (A) ptr is an array of pointers of 10
(C) Over-defined constraint integers.
(D) Feasible constraint (B) ptr is a pointer to an array of 10
integers.
(C) ptr is an array of 10 integers.
12. GO BOTTOM and SKIP-3
(D) none of the above.
commands are given one after
another in a database file of 30
17. Which of the following has
records. It shifts the control to
compilation error in C ?
(A) 28th record (B) 27th record (A) int n = 32 ;
(C) 3rd record (D) 4th record (B) char ch = 65 ;
(C) float f = (float) 3.2 ;
13. An ER Model includes (D) none of the above
I. An ER diagram portraying
18. Which of the following operators can
entity types.
(A) ∗
not be overloaded in C+ + ?
II. Attributes for each entity type (B) + =
III. Relationships among entity (C) = = (D) : :
types.
IV. Semantic integrity constraints 19. _________ allows to create classes
that reflects the business rules which are derived from other classes,
about data not captured in the so that they automatically include
ER diagram. some of its “parent’s” members, plus
(A) I, II, III & IV (B) I & IV its own members.
(C) I, II & IV (D) I & III (A) Overloading
(B) Inheritance
(C) Polymorphism
14. Based on the cardinality ratio and (D) Encapsulation
participation associated
with a relationship type, choose 20. The correct way to round off a floating
either the Foreign Key Design, the number x to an integer value is
Cross Referencing Design or Mutual (A) y = (int) (x + 0.5)
Referencing Design. (B) y = int (x + 0.5)
(A) Entity (B) Constraints (C) y = (int) x + 0.5
(C) Rules (D) Keys (D) y = (int) ((int)x + 0.5)
D-87-13 3 Paper-II

www.examrace.com
21. What is the value of the postfix 26. Given the following statements :
expression ? S1 : SLR uses follow information to
a b c d + – ∗ (where a = 8, b = 4, guide reductions. In case of LR
c = 2 and d = 5) and LALR parsers, the look-
3 8 aheads are associated with the
(A) – 8 (B) –
3 items and they make use of the
(C) 24 (D) –24 left context available to the parser.
S2 : LR grammar is a larger sub-
22. If the queue is implemented with a class of context free grammar
linked list, keeping track of a front as compared to that SLR and
pointer and a rear pointer, which of LALR grammars.
these pointers will change during an Which of the following is true ?
insertion into a non-empty queue ? (A) S1 is not correct and S2 is not
(A) Neither of the pointers change correct.
(B) Only front pointer changes (B) S1 is not correct and S2 is
(C) Only rear pointer changes correct.
(D) Both of the pointers changes (C) S1 is correct and S2 is not
correct.
23. is often used to prove the (D) S1 is correct and S2 is correct.
correctness of a recursive function.
(A) Diagonalization 27. The context free grammar for the

L = {an bm | n ≤ m + 3, n ≥ 0, m ≥ 0} is
(B) Communitivity language

(A) S → aaa A; A → aAb | B,

(C) Mathematical Induction

B → Bb | λ
(D) Matrix Multiplication
(B) S → aaaA|λ, A → aAb | B,
B → Bb | λ
t ≥ 2, every node other than the root
24. For any B-tree of minimum degree
(C) S → aaaA | aa A | λ, A → aAb | B,
B → Bb| λ
must have atleast keys and
(D) S → aaaA | aa A | aA | λ, A →
every node can have at most
aAb | B, B → Bb | λ
keys.
(A) t – 1, 2t + 1
(B) t + 1, 2t + 1
28. Given the following statements :
(C) t – 1, 2t – 1 S1 : If L is a regular language then
the language {uv | u ∈ L, v ∈ LR}
(D) t + 1, 2t – 1
is also regular.
25. Given two sorted list of size ‘m’ and S2 : L = {wwR} is regular language.
‘n’ respectively. The number of
comparison needed in the worst case Which of the following is true ?
by the merge sort algorithm will be (A) S1 is not correct and S2 is not
(A) m × n correct.
(B) S1 is not correct and S2 is correct.
(B) max (m, n)
(C) min (m, n) (C) S1 is correct and S2 is not correct.
(D) m + n – 1 (D) S1 is correct and S2 is correct.
Paper-II 4 D-87-13

www.examrace.com
29. The process of assigning load 33. The sum of products expansion for
addresses to the various parts of the the function
program and adjusting the code and
F(x, y, z) = (x + y)–z is given as
data in the program to reflect the
assigned addresses is called _______. (A) –x yz
– + xy–z + –x y–z
(A) Symbol resolution
(B) xyz + xy–z + xy– –z
(B) Parsing
(C) x y– –z + –x y– –z + xy–z
(C) Assembly
(D) Relocation (D) x y–z + xy– –z + –x y–z

30. Which of the following derivations 34. Let P(m, n) be the statement
does a top-down parser use while “m divides n” where the universe of
parsing an input string ? The input is discourse for both the variables is the
scanned from left to right. set of positive integers. Determine
(A) Leftmost derivation the truth values of each of the
(B) Leftmost derivation traced out following propositions :
in reverse I. ∀m ∀n P(m, n),
(C) Rightmost derivation traced out II. ∃m ∀n P(m, n)
in reverse
(A) Both I and II are true
(D) Rightmost derivation
(B) Both I and II are false
(C) I – false & II – true
31. The dual of a Boolean expression is
obtained by interchanging (D) I – true & II – false
(A) Boolean sums and Boolean
products 35. Big – O estimate for
(B) Boolean sums and Boolean f(x) = (x + 1) log(x2 + 1) + 3x2 is
products or interchanging 0’s given as
and 1’s (A) O(x log x)
(C) Boolean sums and Boolean
(B) O(x2)
products and interchanging 0’s
& 1’s (C) O(x3)
(D) Interchanging 0’s and 1’s (D) O(x2 log x)

32. Given that (292)10 = (1204)x in some 36. How many edges are there in a forest
of t-trees containing a total of n
number system x. The base x of that
vertices ?
number system is
(A) 2 (A) n + t
(B) n–t
n∗t
(B) 8
(C) 10 (C)
(D) None of the above (D) nt
D-87-13 5 Paper-II

www.examrace.com
37. Let f and g be the functions from the 41. Active X controls are Pentium binary
set of integers to the set integers programs that can be embedded in
defined by
f(x) = 2x + 3 and g(x) = 3x + 2 (A) Word pages
Then the composition of f and g and (B) URL pages
g and f is given as (C) Script pages
(A) 6x + 7, 6x + 11 (D) Web pages
(B) 6x + 11, 6x + 7
(C) 5x + 5, 5x + 5 42. Match the following :
(D) None of the above
List – I List – II
a. Wireless i. HTTP
and n ≥ r, then p(n + 1, r) equals to
38. If n and r are non-negative integers
Application
Environment
p(n, r) (n + 1)
(A) b. Wireless ii. IP
(n + 1 – r)
Transaction
p(n, r) (n + 1) Protocol
(B) (n – 1 + r)
c. Wireless iii. Scripts
p(n, r) (n – 1) Datagram
(C) (n + 1 – r) Protocol
p(n, r) (n + 1) d. Wireless iv. UDP
(D) (n + 1 + r) Codes :
a b c d
39. A graph is non-planar if and only if it
(A) ii iv i iii
contains a subgraph homomorphic to
(B) iv iii ii i
(A) K3, 2 or K5 (B) K3, 3 and K6
(C) iv iii i ii
(C) K3, 3 or K5 (D) K2, 3 and K5
(D) iii i iv ii

40. Which of the following statements 43. Which of the following is widely
are true ? used inside the telephone system for
I. A circuit that adds two bits, long-haul data traffic ?
producing a sum bit and a carry (A) ISDN
bit is called half adder. (B) ATM
II. A circuit that adds two bits, (C) Frame Relay
producing a sum bit and a carry
(D) ISTN
bit is called full adder.
III. A circuit that adds two bits and
a carry bit producing a sum bit 44. The document standards for EDI
and a carry bit is called full were first developed by large
adder. business house during the 1970s and
IV. A device that accepts the value are now under the control of the
of a Boolean variable as input following standard organisation :
and produces its complement is (A) ISO
called an inverter. (B) ANSI
(A) I & II (B) II & III (C) ITU-T
(C) I, II, III (D) I, III & IV (D) IEEE
Paper-II 6 D-87-13

www.examrace.com
45. Electronic Data Interchange Software
consists of the following four layers :
(A) Business application, Internal
format conversion, Network
translator, EDI envelope
(B) Business application, Internal
format conversion, EDI
translator, EDI envelope
(C) Application layer, Transport
layer, EDI translator, EDI
envelope
(D) Application layer, Transport
layer, IP layer, EDI envelope
46. Consider a preemptive priority based
scheduling algorithm based on
dynamically changing priority.
Larger priority number implies
higher priority. When the process is
waiting for CPU in the ready queue
(but not yet started execution), its
priority changes at a rate a = 2. When
it starts running, its priority changes
at a rate b = 1. All the processes are
assigned priority value 0 when they
enter ready queue. Assume that the
following processes want to execute :
Process Arrival Service
ID Time Time
P1 0 4
P2 1 1
P3 2 2
P4 3 1
The time quantum q = 1. When two
processes want to join ready queue
simultaneously, the process which
has not executed recently is given
priority. The finish time of processes
P1, P2, P3 and P4 will respectively
be
(A) 4, 5, 7 and 8
(B) 8, 2, 7 and 5
(C) 2, 5, 7 and 8
(D) 8, 2, 5 and 7
47. The virtual address generated by a
CPU is 32 bits. The Translation
Look-aside Buffer (TLB) can hold
total 64 page table entries and a
4-way set associative (i.e. with 4-
cache lines in the set). The page size
is 4 KB. The minimum size of TLB
tag is
(A) 12 bits
(B) 15 bits
(C) 16 bits
(D) 20 bits
48. Consider a disk queue with request
for input/output to block on cylinders
98, 183, 37, 122, 14, 124, 65, 67
in that order. Assume that disk head
is initially positioned at cylinder 53
and moving towards cylinder number
0. The total number of head
movements using Shortest Seek Time
First (SSTF) and SCAN algorithms
are respectively
(A) 236 and 252 cylinders
(B) 640 and 236 cylinders
(C) 235 and 640 cylinders
(D) 235 and 252 cylinders
49. How much space will be required to
store the bit map of a 1.3 GB disk
with 512 bytes block size ?
(A) 332.8 KB
(B) 83.6 KB
(C) 266.2 KB
(D) 256.6 KB
50. Linux operating system uses
(A) Affinity Scheduling
(B) Fair Preemptive Scheduling
(C) Hand Shaking
(D) Highest Penalty Ratio Next

D-87-13 7 Paper-II

www.examrace.com
 Space For Rough Work

Paper-II 8 D-87-13

www.examrace.com