PAPER-II
COMPUTER SCIENCE AND APPLICATIONS
Signature and Name of Invigilator
1. (Signature) __________________________
(Name) ____________________________
2. (Signature) __________________________
(Name) ____________________________
J 871
1 2
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, 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.
J-87-12
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, each question carrying two (2)
marks. Attempt all the questions.
1. The postfix expression AB + CD – * 5. Networks that use different
can be evaluated using a technologies can be connected by
(A) stack using
(B) tree (A) Packets
(B) Switches
(C) queue
(C) Bridges
(D) linked list
(D) Routers

2. The post order traversal of a binary 6. Both hosts and routers are TCP/IP
tree is DEBFCA. Find out the pre- protocol software. However, routers do
order traversal. not use protocol from all layers. The
layer for which protocol software is not
(A) ABFCDE
needed by a router is
(B) ADBFEC (A) Layer – 5 (Application)
(C) ABDECF (B) Layer – 1 (Physical)
(D) None of the above (C) Layer – 3 (Internet)
(D) Layer – 2 (Network Interface)

3. The branch logic that provides making

7. In multiuser database if two users wish
capabilities in the control unit is known
to update the same record at the same
as
time, they are prevented from doing so
(A) Controlled transfer by
(B) Conditional transfer (A) Jamming
(B) Password
(C) Unconditional transfer
(C) Documentation
(D) None of the above
(D) Record lock

4. The number of colours required to 8. A binary search tree is a binary tree :

properly colour the vertices of every (A) All items in the left subtree are
planer graph is less than root
(A) 2 (B) All items in the right subtree are
greater than or equal to the root
(B) 3
(C) Each subtree is itself a binary
(C) 4 search tree
(D) 5 (D) All of the above
Paper-II 2 J-87-12
9. What deletes the entire file except the 13. Leaves of which of the following trees
file structure ? are at the same level ?
(A) ERASE (A) Binary tree
(B) DELETE
(B) B-tree
(C) ZAP
(C) AVL-tree
(D) PACK
(D) Expression tree

10. Which command is the fastest among

the following ? 14. Which of the following TCP/IP
(A) COPY TO <NEW FILE> Internet protocol is diskless machine
(B) COPY STRUCTURE TO <NEW uses to obtain its IP address from a
FILE> server ?
(C) COPY FILE <FILE 1> <FILE 2> (A) RAP
(D) COPY TO MFILE-DAT (B) RIP
DELIMITED
(C) ARP

11. B+ tree are preferred to binary tree in (D) X.25

Database because
(A) Disk capacity are greater than
15. Decryption and encryption of data are
memory capacities
the responsibility of which of the
(B) Disk access is much slower than following layer ?
memory access
(A) Physical layer
(C) Disk data transfer rates are much
less than memory data transfer (B) Data Link layer
rate
(C) Presentation layer
(D) Disks are more reliable than
memory (D) Session layer

12. A Transaction Manager is which of the 16. In which circuit switching, delivery of
following ? data is delayed because data must be
(A) Maintains a log of transactions stored and retrieved from RAM ?
(B) Maintains before and after (A) Space division
database images
(B) Time division
(C) Maintains appropriate concurrency
control (C) Virtual
(D) All of the above (D) Packet
J-87-12 3 Paper-II
17. In which Routing Method do all the 22. Validation means
routers have a common database ? (A) are we building the product right
(A) Distance vector (B) are we building the right product
(C) verification of fields
(B) Link state
(D) None of the above
(C) Link vector
(D) Dijkestra method 23. If a process is under statistical control,
then it is
(A) Maintainable
18. Page Shift Keying (PSK) Method is
(B) Measurable
used to modulate digital signal at
(C) Predictable
9600 bps using 16 level. Find the line
(D) Verifiable
signals and speed (i.e. modulation
rate).
24. In a function oriented design, we
(A) 2400 bauds (B) 1200 bauds (A) minimize cohesion and maximize
(C) 4800 bauds (D) 9600 bauds coupling
(B) maximize cohesion and minimize
19. The station to hub distance in which it coupling
is 2000 metres. (C) maximize cohesion and
maximize coupling
(A) 100 Base-Tx
(D) minimize cohesion and minimize
(B) 100 Base-Fx coupling
(C) 100 Base-T4
25. Which of the following metric does not
(D) 100 Base-T1 depend on the programming language
used ?
(A) Line of code
20. Main aim of software engineering is to (B) Function count
produce (C) Member of token
(A) program (D) All of the above
(B) software
(C) within budget 26. A / B+ tree index is to be built on the
name attribute of the relation
(D) software within budget in the
STUDENT. Assume that all students
given schedule
names are of length 8 bytes, disk block
are of size 512 bytes and index
21. Key process areas of CMM level 4 are
pointers are of size 4 bytes. Given this
also classified by a process which is
scenario what would be the best choice
(A) CMM level 2 of the degree (i.e. the number of
(B) CMM level 3 pointers per node) of the B+ tree ?
(C) CMM level 5 (A) 16 (B) 42
(D) All of the above (C) 43 (D) 44

Paper-II 4 J-87-12
27. The Inorder traversal of the tree will
yield a sorted listing of elements of
tree in
(A) Binary tree
(B) Binary search tree
(C) Heaps
(D) None of the above
28. Mobile IP provides two basic
functions.
(A) Route discovery and registration
(B) Agent discovery and registration
(C) IP binding and registration
(D) None of the above
29. Pre-emptive scheduling is the strategy
of temporarily suspending a gunning
process
(A) before the CPU time slice expires
(B) to allow starving processes to run
(C) when it requests I/O
(D) to avoid collision
30. In round robin CPU scheduling as time
quantum is increased the average turn
around time
(A) increases
(B) decreases
(C) remains constant
(D) varies irregularly
31. Resources are allocated to the process
on non-sharable basis is
(A) mutual exclusion
(B) hold and wait
(C) no pre-emption
(D) circular wait
J-87-12
32. Cached and interleaved memories are
ways of speeding up memory access
between CPU’s and slower RAM.
Which memory models are best suited
(i.e. improves the performance most)
for which programs ?
(i) Cached memory is best suited for
small loops.
(ii) Interleaved memory is best
suited for small loops
(iii) Interleaved memory is best
suited for large sequential code.
(iv) Cached memory is best suited for
large sequential code.
(A) (i) and (ii) are true.
(B) (i) and (iii) are true.
(C) (iv) and (ii) are true.
(D) (iv) and (iii) are true.
33. Consider the following page trace :
4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5
Percentage of page fault that would
occur if FIFO page replacement
algorithm is used with number of
frames for the JOB m = 4 will be
(A) 8
(B) 9
(C) 10
(D) 12
34. Check sum used along with each
packet computes the sum of the data,
where data is treated as a sequence of
(A) Integer
(B) Character
(C) Real numbers
(D) Bits
5 Paper-II
35. If an integer needs two bytes of 40. Consider the following statements :
storage, then the maximum value of a
I. Recursive languages are closed
signed integer is
under complementation.
(A) 216 – 1
II. Recursively enumerable languages
15
(B) 2 –1 are closed under union.
(C) 216 III. Recursively enumerable languages
(D) 2 15 are closed under complementation.
Which of the above statements are true ?
36. Which of the following logic families (A) I only
is well suited for high-speed operations ?
(B) I and II
(A) TTL
(C) I and III
(B) ECL
(C) MOS (D) II and III

(D) CMOS
41. What is the routing algorithm used by
37. Interrupts which are initiated by an RIP and IGRP ?
instruction are (A) OSPF
(A) Internal (B) Link-state
(B) External
(C) Dynamic
(C) Hardware
(D) Dijkestra vector
(D) Software

38. printf(“%c”, 100); 42. Identify the incorrect statement :

(A) prints 100 (A) The overall strategy drives the
(B) prints ASCII equivalent of 100 E-Commerce data warehousing
strategy.
(C) prints garbage
(D) none of the above (B) Data warehousing in an
E-Commerce environment should
be done in a classical manner.
39. For the transmission of the signal,
Bluetooth wireless technology uses (C) E-Commerce opens up an
entirely new world of web
(A) time division multiplexing
server.
(B) frequency division multiplexing
(D) E-Commerce security threats can
(C) time division duplex be grouped into three major
(D) frequency division duplex categories.
Paper-II 6 J-87-12
43. Reliability of software is directly 47. Where does a computer add and
dependent on compare data ?

(A) quality of the design (A) Hard disk

(B) number of errors present (B) Floppy disk
(C) software engineers experience (C) CPU chip
(D) user requirement (D) Memory chip

44. ______ is not an E-Commerce 48. Pipelining strategy is called implement

application.
(A) instruction execution
(A) House banking
(B) instruction prefetch
(B) Buying stocks
(C) instruction decoding
(C) Conducting an auction
(D) instruction manipulation
(D) Evaluating an employee

49. Which of the following data structure

45. ______ is a satellite based tracking
is linear type ?
system that enables the determination
of person’s position. (A) Strings
(A) Bluetooth (B) Lists
(B) WAP (C) Queues
(C) Short Message Service (D) All of the above
(D) Global Positioning System

50. To represent hierarchical relationship

46. A complete microcomputer system between elements, which data structure
consists of is suitable ?

(A) Microprocessor (A) Dequeue

(B) Memory (B) Priority

(C) Peripheral equipment (C) Tree

(D) All of the above (D) All of the above

J-87-12 7 Paper-II
 ANSWER KEY

1 2 3 4 5 6 7 8 9 10
A C A A D A D D C B
11 12 13 14 15 16 17 18 19 20
B D B C C B B A B D
21 22 23 24 25 26 27 28 29 30
C B C B B A B B A D
31 32 33 34 35 36 37 38 39 40
A B C B B B C B C B
41 42 43 44 45 46 47 48 49 50
D D B D D D C B D C