UGC NET 2011: December, Paper II, Computer Science and Applications
Text of page 1
PAPER-II
COMPUTER SCIENCE AND APPLICATIONS
Signature and Name of Invigilator
1. (Signature) __________________________ OMR Sheet No. : ...............................................
(Name) ____________________________ (To be filled by the Candidate)
2. (Signature) __________________________ Roll No.
(Name) ____________________________ (In figures as per admission card)
Roll No.________________________________
D 8 7 1 1 (In words)
Time : 1 1/4 hours] [Maximum Marks : 100
Number of Pages in this Booklet : 8 Number of Questions in this Booklet : 50
Instructions for the Candidates ¯Ö¸üßõÖÖÙ£ÖµÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
1. Write your roll number in the space provided on the top of 1. ¯ÖÆü»Öê ¯Öéšü Ûêú ‰ú¯Ö¸ü ×®ÖµÖŸÖ Ã£ÖÖ®Ö ¯Ö¸ü †¯Ö®ÖÖ ¸üÖê»Ö ®Ö´²Ö¸ü ×»Ö×ÜÖ‹ …
this page. 2. ‡ÃÖ ¯ÖÏ¿®Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÖÃÖ ²ÖÆãü×¾ÖÛú»¯ÖßµÖ ¯ÖÏ¿®Ö Æïü …
2. This paper consists of fifty multiple-choice type of questions. 3. ¯Ö¸üßõÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê®Öê ¯Ö¸ü, ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ †Ö¯ÖÛúÖê ¤êü ¤üß •ÖÖµÖêÝÖß … ¯ÖÆü»Öê
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) ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ÜÖÖê»Ö®Öê Ûêú ×»Ö‹ ˆÃÖÛêú Ûú¾Ö¸ü ¯Öê•Ö ¯Ö¸ü »ÖÝÖß ÛúÖÝÖ•Ö
(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) Ûú¾Ö¸ü ¯Öéšü ¯Ö¸ü ”û¯Öê ×®Ö¤ìü¿ÖÖ®ÖãÃÖÖ¸ü ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ Ûêú ¯Öéšü ŸÖ£ÖÖ
(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 (iii) ‡ÃÖ •ÖÖÑ“Ö Ûêú ²ÖÖ¤ü OMR ¯Ö¡ÖÛú Ûúß ÛÎú´Ö ÃÖÓܵÖÖ ‡ÃÖ ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ
should be entered on this Test Booklet. ¯Ö¸ü †Ó×ÛúŸÖ Ûú¸ü ¤ëü …
4. Each item has four alternative responses marked (A), (B), (C) 4. ¯ÖÏŸµÖêÛú ¯ÖÏ¿®Ö Ûêú ×»Ö‹ “ÖÖ¸ü ˆ¢Ö¸ü ×¾ÖÛú»¯Ö (A), (B), (C) ŸÖ£ÖÖ (D) פüµÖê
and (D). You have to darken the oval as indicated below on the ÝÖµÖê Æïü … †Ö¯ÖÛúÖê ÃÖÆüß ˆ¢Ö¸ü Ûêú ¤üß‘ÖÔ¾Öé¢Ö ÛúÖê ¯Öê®Ö ÃÖê ³Ö¸üÛú¸ü ÛúÖ»ÖÖ Ûú¸ü®ÖÖ
correct response against each item. Æîü •ÖîÃÖÖ ×Ûú ®Öß“Öê פüÜÖÖµÖÖ ÝÖµÖÖ Æîü …
Example : A B C D ˆ¤üÖÆü¸üÞÖ : A B C D
where (C) is the correct response. •Ö²Ö×Ûúú(C) ÃÖÆüß ˆ¢Ö¸ü Æîü …
5. Your responses to the items are to be indicated in the Answer 5. ¯ÖÏ¿®ÖÖë Ûêú ˆ¢Ö¸ü Ûêú¾Ö»Ö ¯ÖÏ¿®Ö ¯Ö¡Ö I Ûêú †®¤ü¸ü פüµÖê ÝÖµÖê ˆ¢Ö¸ü-¯Ö¡ÖÛú ¯Ö¸ü Æüß
Sheet given inside the Paper I Booklet only. If you mark at †Ó×ÛúŸÖ Ûú¸ü®Öê Æïü … µÖפü †Ö¯Ö ˆ¢Ö¸ü ¯Ö¡ÖÛú ¯Ö¸ü פüµÖê ÝÖµÖê ¤üß‘ÖÔ¾Öé¢Ö Ûêú †»ÖÖ¾ÖÖ
any place other than in the ovals in the Answer Sheet, it will ×ÛúÃÖß †®µÖ ãÖÖ®Ö ¯Ö¸ü ˆ¢Ö¸ü דÖÅ®ÖÖÓ×ÛúŸÖ Ûú¸üŸÖê Æïü, ŸÖÖê ˆÃÖÛúÖ ´Ö滵ÖÖÓÛú®Ö
not be evaluated. ®ÖÆüà ÆüÖêÝÖÖ …
6. Read instructions given inside carefully. 6. †®¤ü¸ü פüµÖê ÝÖµÖê ×®Ö¤ìü¿ÖÖë ÛúÖê ¬µÖÖ®Ö¯Öæ¾ÖÔÛú ¯ÖœÌëü …
7. Rough Work is to be done in the end of this booklet. 7. Ûú““ÖÖ ÛúÖ´Ö (Rough Work) ‡ÃÖ ¯Öã×ßÖÛúÖ Ûêú †×®ŸÖ´Ö ¯Öéšü ¯Ö¸ü Ûú¸ëü …
8. If you write your Name, Roll Number, Phone Number or put 8. µÖפü †Ö¯Ö ˆ¢Ö¸ü-¯Öã×ßÖÛúÖ ¯Ö¸ü ×®ÖµÖŸÖ Ã£ÖÖ®Ö Ûêú †»ÖÖ¾ÖÖ †¯Ö®ÖÖ ®ÖÖ´Ö, ¸üÖê»Ö
any mark on any part of the Answer 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 OMR Answer 9. †Ö¯ÖÛúÖê ¯Ö¸üßõÖÖ ÃÖ´ÖÖ¯ŸÖ ÆüÖê®Öê ¯Ö¸ü ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ‹¾ÖÓ OMR ˆ¢Ö¸ü-¯Ö¡ÖÛú
sheet to the invigilators at the end of the examination ×®Ö¸üßõÖÛú ´ÖÆüÖê¤üµÖ ÛúÖê »ÖÖî™üÖ®ÖÖ †Ö¾Ö¿µÖÛú Æîü †Öî¸ü ¯Ö¸üßõÖÖ ÃÖ´ÖÖׯŸÖ Ûêú ²ÖÖ¤ü
compulsorily and must not carry it with you outside the ˆÃÖê †¯Ö®Öê ÃÖÖ£Ö ¯Ö¸üßõÖÖ ³Ö¾Ö®Ö ÃÖê ²ÖÖÆü¸ü ®Ö »ÖêÛú¸ü •ÖÖµÖë …
Examination Hall. 10. Ûêú¾Ö»Ö ®Öß»Öê/ÛúÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ‡Õ™ü ¯Öê®Ö ÛúÖ Æüß ‡ÃŸÖê´ÖÖ»Ö Ûú¸ëü …
10. Use only Blue/Black Ball point pen. 11. ×ÛúÃÖß ³Öß ¯ÖÏÛúÖ¸ü ÛúÖ ÃÖÓÝÖÞÖÛú (Ûîú»ÖÛãú»Öê™ü¸ü) µÖÖ »ÖÖÝÖ ™êü²Ö»Ö †Öפü ÛúÖ
11. Use of any calculator or log table etc., is prohibited. ¯ÖϵÖÖêÝÖ ¾ÖÙ•ÖŸÖ Æîü …
12. There is no negative marks for incorrect answers. 12. ÝÖ»ÖŸÖ ˆ¢Ö¸üÖë Ûêú ×»Ö‹ ÛúÖê‡Ô †ÓÛú ÛúÖ™êü ®ÖÆüà •ÖÖ‹ÑÝÖê …
D-87-11 1 P.T.O.
Text of page 2
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. Which of the following data 5. Maximum number of edges in a n-
structure is Non-linear type ? Node undirected graph without self
loop is
(A) Strings
(A) n2 (B) n(n – 1)
(B) Lists
n(n – 1)
(C) n(n + 1) (D) 2
(C) Stacks
(D) None of the above
6. A hash table has space for 75
records, then the probability of
2. The total number of comparisons in collision before the table is 6% full.
a bubble sort is
(A) .25 (B) .20
(A) 0(log n)
(C) .35 (D) .30
(B) 0(n log n)
(C) 0(n) 7. BCC in the internet refers to
(D) None of the above (A) Black carbon copy
(B) Blind carbon copy
3. Which of the following is a bad (C) Blank carbon copy
example of recursion ? (D) Beautiful carbon copy
(A) Factorial
(B) Fibonacci numbers 8. Hub is a term used with
(C) Tower of Hanai (A) A Star Networks
(D) Tree traversal (B) A Ring Networks
(C) A Router
4. Domain and Range of the function (D) A Bridge
Y = – –2x + 3 is
3 3 9. The amount of uncertainty in a
(A) x ≥ 2, y ≥ 0 (B) x > 2, y ≤ 0 system of symbol is called
(A) Bandwidth (B) Entropy
3 3
(C) x ≥ 2, y ≤ 0 (D) x ≤ 2, y ≤ 0
(C) Loss (D) Quantum
Paper-II 2 D-87-11
Text of page 3
10. Which of the following network 14. An SRS
access standard disassembler is used
for connection station to a packet (A) establishes the basis for
switched network ? agreement between client and
the supplier.
(A) X.3 (B) X.21
(B) provides a reference for
(C) X.25 (D) X.75 validation of the final product.
(C) is a prerequisite to high quality
11. A station in a network in a network software.
forward incoming packets by placing
(D) all of the above.
them on its shortest output queue.
What routing algorithm is being used ?
(A) Hot potato routing 15. McCabe’s cyclomatic metric V(G)
of a graph G with n vertices, e edges
(B) Flooding
and p connected component is
(C) Static routing
(A) e
(D) Delta routing
(B) n
(C) e–n+p
12. Start and stop bits are used in serial
(D) e – n + 2p
communications for
(A) Error detection
(B) Error correction 16. Emergency fixes known as patches
are result of
(C) Synchronization
(A) adaptive maintenance
(D) Slowing down the
communication (B) perfective maintenance
(C) corrective maintenance
13. For a data entry project for office (D) none of the above
staff who have never used computers
before (user interface and user-
friendliness are extremely 17. Design recovery from source code is
important), one will use done during
(A) Spiral model (A) reverse engineering
(B) Component based model (B) re-engineering
(C) Prototyping (C) reuse
(D) Waterfall model (D) all of the above
D-87-11 3 Paper-II
Text of page 4
18. Following is used to demonstrate 22. Which command classes text file,
that the new release of software still which has been created using “SET
performs the old one did by ALTERNATIVE” <FILE NAME>
rerunning the old tests : “Command” ?
(A) Functional testing (A) SET ALTERNATE OFF
(B) CLOSE DATABASE
(B) Path testing
(C) CLOSE ALTERNATE
(C) Stress testing (D) CLEAR ALL
(D) Regression testing
23. Data security threats include
(A) privacy invasion
19. The post order traversal of a binary
tree is DEBFCA. Find out the pre- (B) hardware failure
order traversal. (C) fraudulent manipulation of data
(D) encryption and decryption
(A) ABFCDE (B) ADBFEC
(C) ABDECF (D) ABDCEF
24. Which of the following statements is
true, when structure of database file
with 20 records is modified ?
20. B + tree are preferred to binary tree
(A) ? EOF ( ) Prints. T
in database because
(B) ? BOF ( ) Prints F
(A) Disk capacities are greater than
(C) ? BOF ( ) Prints T
memory capacities
(D) ? EOF ( ) Prints F
(B) Disk access much slower than
memory access
25. The SQL Expression
(C) Disk data transfer rates are Select distinct T. branch name from
much less than memory data branch T, branch S where T. assets >
transfer rate S. assets and S. branch-city
(D) Disk are more reliable than = DELHI, finds the name of
memory (A) all branches that have greater
asset than any branch located
in DELHI.
21. What deletes the entire file except (B) all branches that have greater
the file structure ? assets than allocated in
DELHI.
(A) ERASE
(C) the branch that has the greatest
(B) DELETE asset in DELHI.
(C) ZAP (D) any branch that has greater
asset than any branch located
(D) PACK in DELHI.
Paper-II 4 D-87-11
Text of page 5
26. Dijkestra banking algorithm in an 30. Consider a logical address space of 8
operating system, solves the problem of pages of 1024 words mapped with
memory of 32 frames. How many
(A) deadlock avoidance
bits are there in the physical address ?
(B) deadlock recovery
(A) 9 bits (B) 11 bits
(C) mutual exclusion
(C) 13 bits (D) 15 bits
(D) context switching
27. The multiuser operating system, 20 31. CPU does not perform the operation
requests are made to use a particular
(A) data transfer
resource per hour, on an average the
probability that no request are made (B) logic operation
in 45 minutes is
(C) arithmetic operation
(A) e–15 (B) e–5
(D) all of the above
(C) 1 – e–5 (D) 1 – e–10
28. On receiving an interrupt from an 32. A chip having 150 gates will be
I/O device, the CPU classified as
(A) halts for predetermined time. (A) SSI (B) MSI
(B) branches off to the interrupt (C) LSI (D) VLSI
service routine after
completion of the current
instruction. 33. If an integer needs two bytes of
(C) branches off to the interrupt storage, then the maximum value of
service routine immediately. unsigned integer is
(D) hands over control of address (A) 216 – 1
bus and data bus to the
(B) 215 – 1
interrupting device.
(C) 216
29. The maximum amount of (D) 215
information that is available in one
portion of the disk access arm for a
removal disk pack (without further 34. Negative numbers cannot be
movement of the arm with multiple represented in
heads)
(A) signed magnitude form
(A) a plate of data
(B) a cylinder of data (B) 1’s complement form
(C) a track of data (C) 2’s complement form
(D) a block of data (D) none of the above
D-87-11 5 Paper-II
Text of page 6
35. The cellular frequency reuse factor 39. All of the following are examples of
for the cluster size N is real security and privacy risks except
(A) N (A) Hackers
(B) N2 (B) Spam
1 (C) Viruses
(C)
N (D) Identify theft
1
(D)
N2
40. Identify the incorrect statement :
(A) The ATM adoption layer is not
36. X – = Y + 1 means service dependent.
(A) X = X – Y + 1 (B) Logical connections in ATM
are referred to as virtual
(B) X = –X – Y – 1
channel connections.
(C) X = –X + Y + 1
(C) ATM is streamlined protocol
(D) = X – Y – 1 with minimal error and flow
control capabilities
(D) ATM is also known as cell
37. Handoff is the mechanism that
delays.
(A) transfer an ongoing call from
one base station to another
41. Software risk estimation involves
(B) initiating a new call following two tasks :
(C) dropping an ongoing call (A) Risk magnitude and risk
(D) none of above impact
(B) Risk probability and risk
impact
38. Which one of the following
statement is false ? (C) Risk maintenance and risk
impact
(A) Context-free languages are
(D) Risk development and risk
closed under union.
impact
(B) Context-free languages are
closed under concatenation.
42. The number of bits required for an
(C) Context-free languages are
IPV address is
closed under intersection. 6
(D) Context-free languages are (A) 16 (B) 32
closed under Kleene closure. (C) 64 (D) 128
Paper-II 6 D-87-11
Text of page 7
43. The proposition ~ qvp is equivalent 47. Web Mining is not used in which of
–
to the following areas ?
(A) Information filtering
(A) p → q (B) q →p
(B) Crime fighting on the internet
(C) p↔ q (D) p ∨ q
(C) Online transaction processing
(D) Click stream analysis.
44. Enterprise Resource Planning (ERP)
(A) has existed for over a decade.
48. A telephone conference call is an
(B) does not integrate well with example of which type of
the functional areas other than communications ?
operations.
(A) same time / same place
(C) is inexpensive to implement.
(B) same time / different place
(D) automate and integrates the
majority of business processes. (C) different time / different place
(D) different time / same place
45. Which of the following is false
concerning Enterprise Resource
Planning (ERP) ? 49. What is the probability of choosing
correctly an unknown integer
(A) It attempts to automate and between 0 and 9 with 3 chances ?
integrate the majority of
963
business processes. (A) 1000
(B) It shares common data and
practices across the enterprise. 973
(B) 1000
(C) It is inexpensive to implement.
983
(D) It provides and access (C)
1000
information in a real-time
environment. 953
(D) 1000
46. To compare, overlay or cross
analyze to maps in GIS 50. The number of nodes in a complete
(A) both maps must be in digital binary tree of height h (with roots at
form level 0) is equal to
(B) both maps must be at the same (A) 20 + 21 + ….. 2h
equivalent scale. (B) 20 + 21 + ….. 2h – 1
(C) both maps must be on the same
(C) 20 + 21 + ….. 2h + 1
coordinate system
(D) All of the above (D) 21 + ….. 2h + 1
D-87-11 7 Paper-II
Text of page 8
Space For Rough Work
D-0109
Paper-II 8 P.T.O.
D-87-11Official key not published for this paper.
Page 1 of 8
Source: University Grants Commission. Question paper published by University Grants Commission.