SlideShare a Scribd company logo
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
otherdiscrepancyshouldbegotreplacedimmediately
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.
Number of Pages in this Booklet : 8 Number of Questions in this Booklet : 50
Instructions for the Candidates ¯Ö¸üßõÖÖÙ£ÖμÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
D-87-12 1 P.T.O.
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. ÝÖ»ÖŸÖ ˆ¢Ö¸üÖë Ûêú ×»Ö‹ ÛúÖê‡Ô †ÓÛú ÛúÖ™êü ®ÖÆüà •ÖÖ‹ÑÝÖê …
[Maximum Marks : 100
Time : 1 1
/4
hours]
PAPER-II
COMPUTER SCIENCE AND APPLICATIONS
(To be filled by the Candidate)
Signature and Name of Invigilator
OMR Sheet No. : ...............................................
Roll No.
(In words)
1. (Signature) __________________________
(Name) ____________________________
2. (Signature) __________________________
(Name) ____________________________
Roll No.________________________________
8 7
(In figures as per admission card)
D 1 2
UGC-NET DEC-2012-CS-PAPER-II
Paper-II 2 D-87-12
1. Consider the circuit shown below. In a
certain steady state, Y is at logical ‘l’.
What are possible values of A, B, C ?
(A) A = 0, B = 0, C = 1
(B) A = 0, B = C = 1
(C) A = 1, B = C = 0
(D) A = B = 1, C = 1
2. The worst case time complexity of
AVL tree is better in comparison to
binary search tree for
(A) Search and Insert Operations
(B) Search and Delete Operations
(C) Insert and Delete Operations
(D) Search, Insert and Delete
Operations
3. The GSM network is divided into the
following three major systems :
(A) SS, BSS, OSS
(B) BSS, BSC, MSC
(C) CELL, BSC, OSS
(D) SS, CELL, MSC
4. The power set of the set {} is
(A) {}
(B) {, {}}
(C) {0}
(D) {0, , {}}
5. If the disk head is located initially at
32, find the number of disk moves
required with FCFS if the disk queue
of I/O blocks requests are 98, 37, 14,
124, 65, 67.
(A) 239
(B) 310
(C) 321
(D) 325
6. Component level design is concerned
with
(A) Flow oriented analysis
(B) Class based analysis
(C) Both of the above
(D) None of the above
7. The ‘C’ language is
(A) Context free language
(B) Context sensitive language
(C) Regular language
(D) None of the above
8. The Mobile Application Protocol
(MAP) typically runs on top of which
protocol ?
(A) SNMP (Simple Network
Management Protocol)
(B) SMTP (Simple Mail Transfer
Protocol)
(C) SS7 (Signalling System 7)
(D) HTTP (Hyper Text Transfer
Protocol)
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
Note : This paper contains fifty (50) objective type questions of two (2) marks each. All
questions are compulsory.
ANS
ANS
ANS
ANS
ANS
ANS
ANS
ANS
D-87-12 3 Paper-II
9. If a packet arrive with an M-bit value
is ‘l’ and a fragmentation offset value
‘0’, then it is ______ fragment.
(A) First
(B) Middle
(C) Last
(D) All of the above
10. The number of bit strings of length
eight that will either start with a 1 bit
or end with two bits 00 shall be
(A) 32
(B) 64
(C) 128
(D) 160
11. In compiler design ‘reducing the
strength’ refers to
(A) reducing the range of values of
input variables.
(B) code optimization using cheaper
machine instructions.
(C) reducing efficiency of program.
(D) None of the above
12. In which addressing mode, the
effective address of the operand is
generated by adding a constant value to
the contents of register ?
(A) Absolute
(B) Indirect
(C) Immediate
(D) Index
13. Which of the following is true ?
(A) A relation in BCNF is always in
3NF.
(B) A relation in 3NF is always in
BCNF.
(C) BCNF and 3NF are same.
(D) A relation in BCNF is not in
3NF.
14. Given memory partitions of 100 K,
500 K, 200 K, 300 K and 600 K (in
order) and processes of 212 K, 417 K,
112 K, and 426 K (in order), using the
first-fit algorithm, in which partition
would the process requiring 426 K be
placed ?
(A) 500 K
(B) 200 K
(C) 300 K
(D) 600 K
15. What is the size of the Unicode
character in Windows Operating
System ?
(A) 8-Bits
(B) 16-Bits
(C) 32-Bits
(D) 64-Bits
16. In which tree, for every node the height
of its left subtree and right subtree
differ almost by one ?
(A) Binary search tree
(B) AVL tree
(C) Threaded Binary Tree
(D) Complete Binary Tree
17. The design issue of Datalink Layer in
OSI Reference Model is
(A) Framing
(B) Representation of bits
(C) Synchronization of bits
(D) Connection control
18. Given the following expressions of a
grammar
E  E * F / F + E / F
F  F – F / id
Which of the following is true ?
(A) * has higher precedence than +
(B) – has higher precedence than *
(C) + and – have same precedence
(D) + has higher precedence than *
ANS
ANS
ANS
ANS
ANS
ANS
ANS
ANS
ANS
ANS
Paper-II 4 D-87-12
19. The maturity levels used to measure a
process are
(A) Initial, Repeatable, Defined,
Managed, Optimized.
(B) Primary, Secondary, Defined,
Managed, Optimized.
(C) Initial, Stating, Defined,
Managed, Optimized.
(D) None of the above
20. The problem of indefinite blockage of
low-priority jobs in general priority
scheduling algorithm can be solved
using :
(A) Parity bit
(B) Aging
(C) Compaction
(D) Timer
21. Which API is used to draw a circle ?
(A) Circle ( )
(B) Ellipse ( )
(C) Round Rect ( )
(D) Pie ( )
22. In DML, RECONNCT command
cannot be used with
(A) OPTIONAL Set
(B) FIXED Set
(C) MANDATOR Set
(D) All of the above
23. Coaxial cables are categorized by
Radio Government rating are adapted
for specialized functions. Category
RG-59 with impedance 75  used for
(A) Cable TV
(B) Ethernet
(C) Thin Ethernet
(D) Thick Ethernet
24. RAD stands for ______.
(A) Rapid and Design
(B) Rapid Aided Development
(C) Rapid Application Development
(D) Rapid Application Design
25. Suppose that someone starts with a
chain letter. Each person who receives
the letter is asked to send it on to 4
other people. Some people do this,
while some do not send any letter.
How many people have seen the letter,
including the first person, if no one
receives more than one letter and if the
chain letter ends after there have been
100 people who read it but did not send
it out ? Also find how many people
sent out the letter ?
(A) 122 & 22
(B) 111 & 11
(C) 133 & 33
(D) 144 & 44
26. A hash function f defined as f (key) =
key mod 13, with linear probing is
used to insert keys 55, 58, 68, 91, 27,
145. What will be the location of 79 ?
(A) 1
(B) 2
(C) 3
(D) 4
27. Which of the following is true while
converting CFG to LL(I) grammar ?
(A) Remove left recursion alone
(B) Factoring grammar alone
(C) Both of the above
(D) None of the above
ANS
ANS
ANS
ANS
ANS
ANS
ANS
ANS
ANS
D-87-12 5 Paper-II
28. Identify the Risk factors which are
associated with Electronic payment
system.
(A) Fraudulent use of Credit Cards.
(B) Sending Credit Card details over
internet.
(C) Remote storage of Credit Card
details.
(D) All of the above
29. Which of the following are two special
functions that are meant for handling
exception, that occur during exception
handling itself ?
(A) Void terminate ( ) and Void
unexpected ( )
(B) Non void terminate ( ) and void
unexpected ( )
(C) Void terminate ( ) and non void
unexpected ( )
(D) Non void terminate ( ) and non
void unexpected ( )
30. Which of the following memory
allocation scheme suffers from external
fragmentation ?
(A) Segmentation
(B) Pure demand paging
(C) Swapping
(D) Paging
31. Basis path testing falls under
(A) system testing
(B) white box testing
(C) black box testing
(D) unit testing
32. The User Work Area (UWA) is a set
of Program variables declared in the
host program to communicate the
contents of individual records between
(A) DBMS & the Host record
(B) Host program and Host record
(C) Host program and DBMS
(D) Host program and Host language
33. Consider the tree given below :
Using the property of eccentricity of a
vertex, find every vertex that is the
centre of the given tree.
(A) d & h
(B) c & k
(C) g, b, c, h, i, m
(D) c & h
34. The maximum number of keys stored
in a B-tree of order m and depth d is
(A) md + 1 – 1
(B)
md+1 – 1
m – 1
(C) (m – 1) (md + 1 – 1)
(D)
md – 1
m – 1
35. Which of the following is the most
powerful parring method ?
(A) LL(I)
(B) Canonical LR
(C) SLR
(D) LALR
ANS
ANS
ANS
ANS
ANS
ANS
ANS
ANS
Paper-II 6 D-87-12
36. In UNIX, which of the following
command is used to set the task
priority ?
(A) init
(B) nice
(C) kill
(D) PS
37. AES is a round cipher based on the
Rijndal Algorithm that uses a 128-bit
block of data. AES has three different
configurations. ______ rounds with a
key size of 128 bits, ______ rounds
with a key size of 192 bits and ______
rounds with a key size of 256 bits.
(A) 5, 7, 15
(B) 10, 12, 14
(C) 5, 6, 7
(D) 20, 12, 14
38. Match the following IC families with
their basic circuits :
a. TTL 1. NAND
b. ECL 2. NOR
c. CMOS 3. Inverter
Code :
a b c
(A) 1 2 3
(B) 3 2 1
(C) 2 3 1
(D) 2 1 3
39. Match the following with respect to
C++ data types :
a. User defined type 1. Qualifier
b. Built in type 2. Union
c. Derived type 3. Void
d. Long double 4. Pointer
Code :
a b c d
(A) 2 3 4 1
(B) 3 1 4 2
(C) 4 1 2 3
(D) 3 4 1 2
40. Given an empty stack, after performing
push (1), push (2), Pop, push (3), push
(4), Pop, Pop, push(5), Pop, what is the
value of the top of the stack ?
(A) 4
(B) 3
(C) 2
(D) 1
41. Enumeration is a process of
(A) Declaring a set of numbers
(B) Sorting a list of strings
(C) Assigning a legal values possible
for a variable
(D) Sequencing a list of operators
42. Which of the following mode
declaration is used in C++ to open a
file for input ?
(A) ios : : app
(B) in : : ios
(C) ios : : file
(D) ios : : in
43. Data Encryption Techniques are
particularly used for ______.
(A) protecting data in Data
Communication System.
(B) reduce Storage Space
Requirement.
(C) enhances Data Integrity.
(D) decreases Data Integrity.
44. Let L be a set accepted by a non-
deterministic finite automaton. The
number of states in non-deterministic
finite automaton is |Q|. The maximum
number of states in equivalent finite
automaton that accepts L is
(A) |Q|
(B) 2|Q|
(C) 2|Q| – 1
(D) 2|Q|
ANS
ANS
ANS
ANS
ANS
ANS
ANS
ANS
ANS
D-87-12 7 Paper-II
45. What is the result of the following
expression ?
49. Identify the operation which is
commutative but not associative ?
(1 & 2) + (3 & 4) (A) OR
(A) 1 (B) NOR
(B) 3 (C) EX-OR
(C) 2 (D) NAND
(D) 0
50. Given a Relation POSITION (Posting-
No, Skill), then query to retrieve all
distinct pairs of posting-nos. requiring
skill is
46. Back propagation is a learning
technique that adjusts weights in the
neural network by propagating weight
changes. (A) Select p.posting-No, p.posting-
No
(A) Forward from source to sink
from position p
(B) Backward from sink to source
where p.skill = p.skill
(C) Forward from source to hidden
nodes and p.posting-No < p.posting-No
(D) Backward from since to hidden
nodes
(B) Select p1.posting-No, p2.posting-
No
47. Match the following : from position p1, position p2
a. TTL 1. High fan out
b. ECL 2. Low propagation delay
c. CMOS 3. High power dissipation
where p1.skill = p2.skill
(C) Select p1.posting-No, p2.posting-
No
Code :
a b c
from position p1, position p2
(A) 3 2 1
where p1.skill = p2.skill
(B) 1 2 3
and p1.posting-No < p2.posting-
No
(C) 1 3 2
(D) 3 1 2
(D) Select p1.posting-No, p2.posting-
No
48. ______ is an “umbrella” activity that is
applied throughout the software
engineering process. from position p1, position p2
(A) Debugging
where p1.skill = p2.skill
(B) Testing
and p1.posting-No = p2.posting-
No
(C) Designing
(D) Software quality assurance
ANS
ANS
ANS
ANS
ANS
ANS
Space For Rough Work
Paper-II 8 D-87-12

More Related Content

PDF
UGC-NET-COMPUTER SCIENCE-JUNE-2011-PAPER-II
PDF
NET-CS-JUNE-2012-PAPER-II
PDF
Special june-87-13-iii (comp. sci. & app.)
PDF
Cbse ugc-net-computer-science-paper-2-december-2013
PDF
NET-CS-JUNE-2012-PAPER-III
PDF
UGC NET COMPUTER SCIENCE JUNE 2010 PAPER-II
PDF
Cbse ugc-net-computer-science-paper-2-december-2014
PDF
UGC NET COMPUTER SCIENCE JUNE 2009 PAPER-II
UGC-NET-COMPUTER SCIENCE-JUNE-2011-PAPER-II
NET-CS-JUNE-2012-PAPER-II
Special june-87-13-iii (comp. sci. & app.)
Cbse ugc-net-computer-science-paper-2-december-2013
NET-CS-JUNE-2012-PAPER-III
UGC NET COMPUTER SCIENCE JUNE 2010 PAPER-II
Cbse ugc-net-computer-science-paper-2-december-2014
UGC NET COMPUTER SCIENCE JUNE 2009 PAPER-II

What's hot (18)

PDF
Previous paper economics paper II
PDF
UGC Net June 2009 Paper 1 Solved , Paper 1, Research and Teaching Aptitude, ...
PDF
NET-CS-DEC-2012-PAPER-III
PDF
UGC NET JUNE PAPER 2014
PDF
11. ugc net commerce dec 2010 question paper
PDF
4. ugc net commerce june 2007 question paper
PDF
9. ugc net commerce dec 2009 question paper
PDF
UGC NET June 2014 Paper I
PDF
5. ugc net commerce dec 2007 question paper
PDF
2014
PDF
2. ugc net commerce june 2006 question paper
PDF
UGC NET - DEC-2009- PAPER-I-SET-W
PDF
04 apr 2015 c jee main exam JEE MAIN EXAM 2015 CODE -C QUESTION PAPER DT.04....
PDF
PDF
PDF
PDF
K 3215 (paper iii) (earth science) 0
PDF
Gmat(k 10)
Previous paper economics paper II
UGC Net June 2009 Paper 1 Solved , Paper 1, Research and Teaching Aptitude, ...
NET-CS-DEC-2012-PAPER-III
UGC NET JUNE PAPER 2014
11. ugc net commerce dec 2010 question paper
4. ugc net commerce june 2007 question paper
9. ugc net commerce dec 2009 question paper
UGC NET June 2014 Paper I
5. ugc net commerce dec 2007 question paper
2014
2. ugc net commerce june 2006 question paper
UGC NET - DEC-2009- PAPER-I-SET-W
04 apr 2015 c jee main exam JEE MAIN EXAM 2015 CODE -C QUESTION PAPER DT.04....
K 3215 (paper iii) (earth science) 0
Gmat(k 10)
Ad

Similar to NET-DEC-2012-CS-PAPER-II (20)

PDF
NET-CS-DEC-2010- PAPER-II
PDF
NTA-NET-Computer-Science-Paper-3-Jan-2017.pdf
PDF
NTA-NET-Computer-Science-Paper-2-July-2016.pdf
PDF
UGC NET COMPUTER SCIENCE DEC- 2009 PAPER-II
PDF
J 17-14-ii commerce
PDF
P-1-4.pdf
PDF
Paper i set-w
PDF
UGC-NET-JUNE-2012-PAPER-I-SET-W
PDF
J 00-14-i set-w
PDF
UGC-NET-DEC-2012-PAPER-I-SET-W
PDF
UGC Paper i set-w
PDF
Paper i set-w (1)
PDF
Paper i set-w
PDF
net exam
PDF
D 00-12 (w)
PDF
UGC Paper i set-x (1)
PDF
UGC Paper i set-x
PDF
PDF
UGC Paper i set-z (1)
NET-CS-DEC-2010- PAPER-II
NTA-NET-Computer-Science-Paper-3-Jan-2017.pdf
NTA-NET-Computer-Science-Paper-2-July-2016.pdf
UGC NET COMPUTER SCIENCE DEC- 2009 PAPER-II
J 17-14-ii commerce
P-1-4.pdf
Paper i set-w
UGC-NET-JUNE-2012-PAPER-I-SET-W
J 00-14-i set-w
UGC-NET-DEC-2012-PAPER-I-SET-W
UGC Paper i set-w
Paper i set-w (1)
Paper i set-w
net exam
D 00-12 (w)
UGC Paper i set-x (1)
UGC Paper i set-x
UGC Paper i set-z (1)
Ad

More from VIJAY TRIPATHI (DSS Basti) (10)

PPTX
Presentation hotel
DOCX
Wireless Security
DOCX
VEHICULAR AD HOC NETWORKS
DOCX
PDF
Dss e education project
PDF
Computer networks--introduction computer-networking
PDF
UGC-NET-JUNE-2011-PAPER-I
PDF
NET-DEC-2010-PAPER-I-SET-W
PDF
UGC NET - JUNE-2010- PAPER-I-SET-W
PDF
UGC NET June 2009 PAPER I Solved
Presentation hotel
Wireless Security
VEHICULAR AD HOC NETWORKS
Dss e education project
Computer networks--introduction computer-networking
UGC-NET-JUNE-2011-PAPER-I
NET-DEC-2010-PAPER-I-SET-W
UGC NET - JUNE-2010- PAPER-I-SET-W
UGC NET June 2009 PAPER I Solved

Recently uploaded (20)

PDF
STATICS OF THE RIGID BODIES Hibbelers.pdf
PPTX
Microbial diseases, their pathogenesis and prophylaxis
PDF
2.FourierTransform-ShortQuestionswithAnswers.pdf
PDF
3rd Neelam Sanjeevareddy Memorial Lecture.pdf
PPTX
PPH.pptx obstetrics and gynecology in nursing
PDF
Black Hat USA 2025 - Micro ICS Summit - ICS/OT Threat Landscape
PDF
Supply Chain Operations Speaking Notes -ICLT Program
PDF
The Lost Whites of Pakistan by Jahanzaib Mughal.pdf
PDF
RMMM.pdf make it easy to upload and study
PDF
Classroom Observation Tools for Teachers
PDF
Microbial disease of the cardiovascular and lymphatic systems
PDF
Computing-Curriculum for Schools in Ghana
PPTX
IMMUNITY IMMUNITY refers to protection against infection, and the immune syst...
PDF
O5-L3 Freight Transport Ops (International) V1.pdf
PDF
TR - Agricultural Crops Production NC III.pdf
PPTX
Introduction_to_Human_Anatomy_and_Physiology_for_B.Pharm.pptx
PDF
01-Introduction-to-Information-Management.pdf
PDF
Saundersa Comprehensive Review for the NCLEX-RN Examination.pdf
PDF
Anesthesia in Laparoscopic Surgery in India
PPTX
Lesson notes of climatology university.
STATICS OF THE RIGID BODIES Hibbelers.pdf
Microbial diseases, their pathogenesis and prophylaxis
2.FourierTransform-ShortQuestionswithAnswers.pdf
3rd Neelam Sanjeevareddy Memorial Lecture.pdf
PPH.pptx obstetrics and gynecology in nursing
Black Hat USA 2025 - Micro ICS Summit - ICS/OT Threat Landscape
Supply Chain Operations Speaking Notes -ICLT Program
The Lost Whites of Pakistan by Jahanzaib Mughal.pdf
RMMM.pdf make it easy to upload and study
Classroom Observation Tools for Teachers
Microbial disease of the cardiovascular and lymphatic systems
Computing-Curriculum for Schools in Ghana
IMMUNITY IMMUNITY refers to protection against infection, and the immune syst...
O5-L3 Freight Transport Ops (International) V1.pdf
TR - Agricultural Crops Production NC III.pdf
Introduction_to_Human_Anatomy_and_Physiology_for_B.Pharm.pptx
01-Introduction-to-Information-Management.pdf
Saundersa Comprehensive Review for the NCLEX-RN Examination.pdf
Anesthesia in Laparoscopic Surgery in India
Lesson notes of climatology university.

NET-DEC-2012-CS-PAPER-II

  • 1. 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 otherdiscrepancyshouldbegotreplacedimmediately 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. Number of Pages in this Booklet : 8 Number of Questions in this Booklet : 50 Instructions for the Candidates ¯Ö¸üßõÖÖÙ£ÖμÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö D-87-12 1 P.T.O. 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. ÝÖ»ÖŸÖ ˆ¢Ö¸üÖë Ûêú ×»Ö‹ ÛúÖê‡Ô †ÓÛú ÛúÖ™êü ®ÖÆüà •ÖÖ‹ÑÝÖê … [Maximum Marks : 100 Time : 1 1 /4 hours] PAPER-II COMPUTER SCIENCE AND APPLICATIONS (To be filled by the Candidate) Signature and Name of Invigilator OMR Sheet No. : ............................................... Roll No. (In words) 1. (Signature) __________________________ (Name) ____________________________ 2. (Signature) __________________________ (Name) ____________________________ Roll No.________________________________ 8 7 (In figures as per admission card) D 1 2 UGC-NET DEC-2012-CS-PAPER-II
  • 2. Paper-II 2 D-87-12 1. Consider the circuit shown below. In a certain steady state, Y is at logical ‘l’. What are possible values of A, B, C ? (A) A = 0, B = 0, C = 1 (B) A = 0, B = C = 1 (C) A = 1, B = C = 0 (D) A = B = 1, C = 1 2. The worst case time complexity of AVL tree is better in comparison to binary search tree for (A) Search and Insert Operations (B) Search and Delete Operations (C) Insert and Delete Operations (D) Search, Insert and Delete Operations 3. The GSM network is divided into the following three major systems : (A) SS, BSS, OSS (B) BSS, BSC, MSC (C) CELL, BSC, OSS (D) SS, CELL, MSC 4. The power set of the set {} is (A) {} (B) {, {}} (C) {0} (D) {0, , {}} 5. If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67. (A) 239 (B) 310 (C) 321 (D) 325 6. Component level design is concerned with (A) Flow oriented analysis (B) Class based analysis (C) Both of the above (D) None of the above 7. The ‘C’ language is (A) Context free language (B) Context sensitive language (C) Regular language (D) None of the above 8. The Mobile Application Protocol (MAP) typically runs on top of which protocol ? (A) SNMP (Simple Network Management Protocol) (B) SMTP (Simple Mail Transfer Protocol) (C) SS7 (Signalling System 7) (D) HTTP (Hyper Text Transfer Protocol) COMPUTER SCIENCE AND APPLICATIONS Paper – II Note : This paper contains fifty (50) objective type questions of two (2) marks each. All questions are compulsory. ANS ANS ANS ANS ANS ANS ANS ANS
  • 3. D-87-12 3 Paper-II 9. If a packet arrive with an M-bit value is ‘l’ and a fragmentation offset value ‘0’, then it is ______ fragment. (A) First (B) Middle (C) Last (D) All of the above 10. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be (A) 32 (B) 64 (C) 128 (D) 160 11. In compiler design ‘reducing the strength’ refers to (A) reducing the range of values of input variables. (B) code optimization using cheaper machine instructions. (C) reducing efficiency of program. (D) None of the above 12. In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register ? (A) Absolute (B) Indirect (C) Immediate (D) Index 13. Which of the following is true ? (A) A relation in BCNF is always in 3NF. (B) A relation in 3NF is always in BCNF. (C) BCNF and 3NF are same. (D) A relation in BCNF is not in 3NF. 14. Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K, and 426 K (in order), using the first-fit algorithm, in which partition would the process requiring 426 K be placed ? (A) 500 K (B) 200 K (C) 300 K (D) 600 K 15. What is the size of the Unicode character in Windows Operating System ? (A) 8-Bits (B) 16-Bits (C) 32-Bits (D) 64-Bits 16. In which tree, for every node the height of its left subtree and right subtree differ almost by one ? (A) Binary search tree (B) AVL tree (C) Threaded Binary Tree (D) Complete Binary Tree 17. The design issue of Datalink Layer in OSI Reference Model is (A) Framing (B) Representation of bits (C) Synchronization of bits (D) Connection control 18. Given the following expressions of a grammar E  E * F / F + E / F F  F – F / id Which of the following is true ? (A) * has higher precedence than + (B) – has higher precedence than * (C) + and – have same precedence (D) + has higher precedence than * ANS ANS ANS ANS ANS ANS ANS ANS ANS ANS
  • 4. Paper-II 4 D-87-12 19. The maturity levels used to measure a process are (A) Initial, Repeatable, Defined, Managed, Optimized. (B) Primary, Secondary, Defined, Managed, Optimized. (C) Initial, Stating, Defined, Managed, Optimized. (D) None of the above 20. The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using : (A) Parity bit (B) Aging (C) Compaction (D) Timer 21. Which API is used to draw a circle ? (A) Circle ( ) (B) Ellipse ( ) (C) Round Rect ( ) (D) Pie ( ) 22. In DML, RECONNCT command cannot be used with (A) OPTIONAL Set (B) FIXED Set (C) MANDATOR Set (D) All of the above 23. Coaxial cables are categorized by Radio Government rating are adapted for specialized functions. Category RG-59 with impedance 75  used for (A) Cable TV (B) Ethernet (C) Thin Ethernet (D) Thick Ethernet 24. RAD stands for ______. (A) Rapid and Design (B) Rapid Aided Development (C) Rapid Application Development (D) Rapid Application Design 25. Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to 4 other people. Some people do this, while some do not send any letter. How many people have seen the letter, including the first person, if no one receives more than one letter and if the chain letter ends after there have been 100 people who read it but did not send it out ? Also find how many people sent out the letter ? (A) 122 & 22 (B) 111 & 11 (C) 133 & 33 (D) 144 & 44 26. A hash function f defined as f (key) = key mod 13, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79 ? (A) 1 (B) 2 (C) 3 (D) 4 27. Which of the following is true while converting CFG to LL(I) grammar ? (A) Remove left recursion alone (B) Factoring grammar alone (C) Both of the above (D) None of the above ANS ANS ANS ANS ANS ANS ANS ANS ANS
  • 5. D-87-12 5 Paper-II 28. Identify the Risk factors which are associated with Electronic payment system. (A) Fraudulent use of Credit Cards. (B) Sending Credit Card details over internet. (C) Remote storage of Credit Card details. (D) All of the above 29. Which of the following are two special functions that are meant for handling exception, that occur during exception handling itself ? (A) Void terminate ( ) and Void unexpected ( ) (B) Non void terminate ( ) and void unexpected ( ) (C) Void terminate ( ) and non void unexpected ( ) (D) Non void terminate ( ) and non void unexpected ( ) 30. Which of the following memory allocation scheme suffers from external fragmentation ? (A) Segmentation (B) Pure demand paging (C) Swapping (D) Paging 31. Basis path testing falls under (A) system testing (B) white box testing (C) black box testing (D) unit testing 32. The User Work Area (UWA) is a set of Program variables declared in the host program to communicate the contents of individual records between (A) DBMS & the Host record (B) Host program and Host record (C) Host program and DBMS (D) Host program and Host language 33. Consider the tree given below : Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree. (A) d & h (B) c & k (C) g, b, c, h, i, m (D) c & h 34. The maximum number of keys stored in a B-tree of order m and depth d is (A) md + 1 – 1 (B) md+1 – 1 m – 1 (C) (m – 1) (md + 1 – 1) (D) md – 1 m – 1 35. Which of the following is the most powerful parring method ? (A) LL(I) (B) Canonical LR (C) SLR (D) LALR ANS ANS ANS ANS ANS ANS ANS ANS
  • 6. Paper-II 6 D-87-12 36. In UNIX, which of the following command is used to set the task priority ? (A) init (B) nice (C) kill (D) PS 37. AES is a round cipher based on the Rijndal Algorithm that uses a 128-bit block of data. AES has three different configurations. ______ rounds with a key size of 128 bits, ______ rounds with a key size of 192 bits and ______ rounds with a key size of 256 bits. (A) 5, 7, 15 (B) 10, 12, 14 (C) 5, 6, 7 (D) 20, 12, 14 38. Match the following IC families with their basic circuits : a. TTL 1. NAND b. ECL 2. NOR c. CMOS 3. Inverter Code : a b c (A) 1 2 3 (B) 3 2 1 (C) 2 3 1 (D) 2 1 3 39. Match the following with respect to C++ data types : a. User defined type 1. Qualifier b. Built in type 2. Union c. Derived type 3. Void d. Long double 4. Pointer Code : a b c d (A) 2 3 4 1 (B) 3 1 4 2 (C) 4 1 2 3 (D) 3 4 1 2 40. Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push(5), Pop, what is the value of the top of the stack ? (A) 4 (B) 3 (C) 2 (D) 1 41. Enumeration is a process of (A) Declaring a set of numbers (B) Sorting a list of strings (C) Assigning a legal values possible for a variable (D) Sequencing a list of operators 42. Which of the following mode declaration is used in C++ to open a file for input ? (A) ios : : app (B) in : : ios (C) ios : : file (D) ios : : in 43. Data Encryption Techniques are particularly used for ______. (A) protecting data in Data Communication System. (B) reduce Storage Space Requirement. (C) enhances Data Integrity. (D) decreases Data Integrity. 44. Let L be a set accepted by a non- deterministic finite automaton. The number of states in non-deterministic finite automaton is |Q|. The maximum number of states in equivalent finite automaton that accepts L is (A) |Q| (B) 2|Q| (C) 2|Q| – 1 (D) 2|Q| ANS ANS ANS ANS ANS ANS ANS ANS ANS
  • 7. D-87-12 7 Paper-II 45. What is the result of the following expression ? 49. Identify the operation which is commutative but not associative ? (1 & 2) + (3 & 4) (A) OR (A) 1 (B) NOR (B) 3 (C) EX-OR (C) 2 (D) NAND (D) 0 50. Given a Relation POSITION (Posting- No, Skill), then query to retrieve all distinct pairs of posting-nos. requiring skill is 46. Back propagation is a learning technique that adjusts weights in the neural network by propagating weight changes. (A) Select p.posting-No, p.posting- No (A) Forward from source to sink from position p (B) Backward from sink to source where p.skill = p.skill (C) Forward from source to hidden nodes and p.posting-No < p.posting-No (D) Backward from since to hidden nodes (B) Select p1.posting-No, p2.posting- No 47. Match the following : from position p1, position p2 a. TTL 1. High fan out b. ECL 2. Low propagation delay c. CMOS 3. High power dissipation where p1.skill = p2.skill (C) Select p1.posting-No, p2.posting- No Code : a b c from position p1, position p2 (A) 3 2 1 where p1.skill = p2.skill (B) 1 2 3 and p1.posting-No < p2.posting- No (C) 1 3 2 (D) 3 1 2 (D) Select p1.posting-No, p2.posting- No 48. ______ is an “umbrella” activity that is applied throughout the software engineering process. from position p1, position p2 (A) Debugging where p1.skill = p2.skill (B) Testing and p1.posting-No = p2.posting- No (C) Designing (D) Software quality assurance ANS ANS ANS ANS ANS ANS
  • 8. Space For Rough Work Paper-II 8 D-87-12