×
Every great story on the planet happened when someone decided not to give up, but kept going no matter what.
--Your friends at LectureNotes
Close

UGC-NET 2nd paper jun 2018 previous question paper

  • Other
  • 143 Views
  • 1 Offline Downloads
  • Uploaded 2 months ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

Signature and Name of Invigilator OMR Sheet No. : .......................................................... 1. (Signature) (To be filled by the Candidate) (Name) Roll No. 2. (Signature) (Name) J 0 8 7 1 8 Time : 2 hours] (In figures as per admission card) PAPER - II Roll No. COMPUTER SCIENCE AND APPLICATIONS Number of Pages in this Booklet : 24 Instructions for the Candidates !J-08718-PAPER-II! [Maximum Marks : 200 Number of Questions in this Booklet : 100 ¬⁄UˡÊÊÁÕ¸ÿÙ¢ ∑§ Á‹∞ ÁŸŒ¸‡Ê 1. Write your roll number in the space provided on the top of this page. 2. This paper consists of hundred 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 Test Booklet Number should be entered on the OMR Sheet and the OMR Sheet Number should be entered on this Test Booklet. 4. Each item has four alternative responses marked (1), (2), (3) and (4). You have to darken the circle as indicated below on the correct response against each item. Example : where (3) is the correct response. 5. Your responses to the items are to be indicated in the OMR Sheet given inside the Booklet only. If you mark your response 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 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 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 are no negative marks for incorrect answers. J-08718 (In words) 1 ß‚ ¬ÎDU ∑§ ™§¬⁄U ÁŸÿà SÕÊŸ ¬⁄U •¬ŸÊ ⁄UÙ‹U Ÿê’⁄U Á‹Áπ∞– ß‚ ¬˝‡Ÿ-¬òÊ ◊¢ ‚ÊÒ ’„ÈÁfl∑§À¬Ëÿ ¬˝‡Ÿ „Ò¥– 3. ¬⁄UˡÊÊ ¬˝Ê⁄êU÷ „ÙŸ ¬⁄U, ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê •Ê¬∑§Ù Œ ŒË ¡ÊÿªË– ¬„‹U ¬UÊ°ø Á◊Ÿ≈U •Ê¬∑§Ù ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê πÙ‹Ÿ ÃÕÊ ©‚∑§Ë ÁŸêŸÁ‹Áπà ¡Ê°ø ∑§ Á‹∞ ÁŒÿ ¡Êÿ¢ª, Á¡‚∑§Ë ¡Ê°ø •Ê¬∑§Ù •fl‡ÿ ∑§⁄UŸË „Ò — (i) ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê πÙ‹Ÿ ∑§ Á‹∞ ¬ÈÁSÃ∑§Ê ¬⁄U ‹ªË ∑§Êª¡ ∑§Ë ‚Ë‹ ∑§Ê »§Ê«∏ ‹¢U– πÈ‹Ë „È߸ ÿÊ Á’ŸÊ S≈UË∑§⁄U-‚Ë‹U ∑§Ë ¬ÈÁSÃ∑§Ê SflË∑§Ê⁄U Ÿ ∑§⁄¢U– (ii) ∑§fl⁄U ¬ÎDU ¬⁄U ¿U¬ ÁŸŒ¸‡ÊÊŸÈ‚Ê⁄U ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ∑§ ¬ÎDU ÃÕÊ ¬˝‡ŸÙ¢ ∑§Ë ‚¢ÅÿÊ ∑§Ù •ë¿UË Ã⁄U„ øÒ∑§ ∑§⁄U ‹¢U Á∑§ ÿ ¬Í⁄U „Ò¢U– ŒÙ·¬Íáʸ ¬ÈÁSÃ∑§Ê Á¡Ÿ◊¢ ¬ÎDU/¬˝‡Ÿ ∑§◊ „Ù¢ ÿÊ ŒÈ’Ê⁄UÊ •Ê ªÿ „Ù¢ ÿÊ ‚ËÁ⁄Uÿ‹U ◊¢ Ÿ „Ù¢ •ÕʸØ Á∑§‚Ë ÷Ë ¬˝∑§Ê⁄U ∑§Ë òÊÈÁ≈U¬Íáʸ ¬ÈÁSÃ∑§Ê SflË∑§Ê⁄U Ÿ ∑§⁄¢U ÃÕÊ ©‚Ë ‚◊ÿ ©‚ ‹Uı≈UÊ∑§⁄U ©‚∑§ SÕÊŸ ¬⁄U ŒÍ‚⁄UË ‚„Ë ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ‹ ‹¢– U ß‚∑§ Á‹∞ •Ê¬∑§Ù ¬Ê°ø Á◊Ÿ≈U ÁŒÿ ¡Êÿ¢ª– ©‚∑§ ’ÊŒ Ÿ ÃÙ •Ê¬∑§Ë ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê flʬ‚ ‹Ë ¡ÊÿªË •ı⁄U Ÿ „Ë •Ê¬∑§Ù •ÁÃÁ⁄UQ§ ‚◊ÿ ÁŒÿÊ ¡ÊÿªÊ– (iii) ß‚ ¡Ê°ø ∑§ ’ÊŒ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ∑§Ê Ÿ¥’⁄U OMR ¬òÊ∑§ ¬⁄U •¢Á∑§Ã ∑§⁄¢U •Uı⁄U OMR ¬òÊ∑§ ∑§Ê Ÿ¥’⁄U ß‚ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ¬⁄U •¢Á∑§Ã ∑§⁄U Œ¢– 4. ¬˝àÿ∑§ ¬˝‡Ÿ ∑§ Á‹∞ øÊ⁄U ©ûÊ⁄U Áfl∑§À¬ (1), (2), (3) ÃÕÊ (4) ÁŒÿ ªÿ „Ò¢– •Ê¬∑§Ù ‚„Ë ©ûÊ⁄U ∑§ flÎûÊ ∑§Ù ¬Ÿ ‚ ÷⁄U∑§⁄U ∑§Ê‹Ê ∑§⁄UŸÊ „Ò ¡Ò‚Ê Á∑§ ŸËø ÁŒπÊÿÊ ªÿÊ „Ò– ¡’Á∑§ (3) ‚„Ë ©ûÊ⁄U „Ò– ©ŒÊ„⁄UáÊ — 5. ¬˝‡ŸÊ¥ ∑§ ©ûÊ⁄U ∑§fl‹ ¬˝‡Ÿ ¬ÈÁSÃ∑§Ê ∑§ •ãŒ⁄U ÁŒÿ ªÿ OMRU ¬òÊ∑§ ¬⁄U „Ë •¥Á∑§Ã ∑§⁄UŸ „Ò¥– ÿÁŒ •Ê¬ OMRU ¬òÊ∑§ ¬⁄U ÁŒÿ ªÿ flÎûÊ ∑§ •‹ÊflÊ Á∑§‚Ë •ãÿ SÕÊŸ ¬⁄U ©ûÊ⁄U ÁøqÊ¢Á∑§Ã ∑§⁄UÃ „Ò¥, ÃÙ ©‚∑§Ê ◊ÍÀUÿÊ¢∑§Ÿ Ÿ„Ë¢ „٪ʖ 6. •ãŒ⁄U ÁŒÿ ªÿ ÁŸŒ¸‡ÊÙ¢ ∑§Ù äÿÊŸ¬Ífl¸∑§ ¬…∏¢U– 7. ∑§ìÊÊ ∑§Ê◊ (Rough Work) ß‚ ¬ÈÁSÃ∑§Ê ∑§ •ÁãÃ◊ ¬ÎDU ¬⁄U ∑§⁄¢U– 8. ÿÁŒ •Ê¬ OMR ¬òÊ∑§ ¬⁄U ÁŸÿà SÕÊŸ ∑§ •‹ÊflÊ •¬ŸÊ ŸÊ◊, ⁄UÊ‹ Ÿê’⁄U, »§ÊŸ Ÿê’⁄U ÿÊ ∑§Ê߸ ÷Ë ∞‚Ê Áøq Á¡‚‚ •Ê¬∑§Ë ¬„øÊŸ „Ê ‚∑§, •¥Á∑§Ã ∑§⁄UÃ „Ò¥ •ÕflÊ •÷Œ˝ ÷Ê·Ê ∑§Ê ¬˝ÿÊª ∑§⁄UÃ „Ò¥, ÿÊ ∑§Ê߸ •ãÿ •ŸÈÁøà ‚ÊœŸ ∑§Ê ¬˝ÿÊª ∑§⁄UÃ „Ò¥, ¡Ò‚ Á∑§ •¥Á∑§Ã Á∑§ÿ ªÿ ©ûÊ⁄U ∑§Ê Á◊≈UÊŸÊ ÿÊ ‚»§Œ SÿÊ„Ë ‚ ’Œ‹ŸÊ ÃÊ ¬⁄UˡÊÊ ∑§ Á‹ÿ •ÿÊÇÿ ÉÊÊÁ·Ã Á∑§ÿ ¡Ê ‚∑§Ã „Ò¥– 9. •Ê¬∑§Ù ¬⁄UˡÊÊ ‚◊Ê# „ÙŸ §¬⁄U ◊Í‹ OMR ¬òÊ∑§ ÁŸ⁄UˡÊ∑§ ◊„ÙŒÿ ∑§Ù ‹Uı≈UÊŸÊ •Êfl‡ÿ∑§ „Ò •ı⁄U ¬⁄UˡÊÊ ‚◊ÊÁ# ∑§ ’ÊŒ ©‚ •¬Ÿ ‚ÊÕ ¬⁄UˡÊÊ ÷flŸ ‚ ’Ê„⁄U Ÿ ‹∑§⁄U ¡Êÿ¢– „Ê‹Ê¥Á∑§ •Ê¬ ¬⁄UˡÊÊ ‚◊ÊÁ# ¬⁄U ◊Í‹ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê •¬Ÿ ‚ÊÕ ‹ ¡Ê ‚∑§Ã „Ò¥– 10. ∑§fl‹ ŸË‹/∑§Ê‹ ’Ê‹U åflÊßZ≈U ¬Ÿ ∑§Ê „Ë ¬˝ÿÊª ∑§⁄¢U– 11. Á∑§‚Ë ÷Ë ¬˝∑§Ê⁄U ∑§Ê ‚¢ªáÊ∑§ (∑Ò§‹∑ȧ‹≈U⁄U) UÿÊ ‹Êª ≈U’‹ •ÊÁŒ ∑§Ê ¬˝ÿÙª flÁ¡¸Ã „Ò– 12. ª‹Ã ©ûÊ⁄UÊ¥ ∑§ Á‹∞ ∑§Ê߸ Ÿ∑§Ê⁄UÊà◊∑§ •¥∑§ Ÿ„Ë¥ „Ò¥– 1. 2. P.T.O.

Text from page-2

COMPUTER SCIENCE AND APPLICATIONS PAPER - II Note : 1. 2. This paper contains hundred (100) objective type questions of two (2) marks each. All questions are compulsory. The definitions in an XML document are said to be __________ when the tagging system and definitions in the DTD are all in compliance. (1) well-formed (2) reasonable (3) valid (4) logical Consider the JavaScript Code : var y= ’’12”; function f( ) { var y=’’6”; alert (this.y); function g( ) {alert (y); } g( ); } f( ); If M is the number of alert dialog boxes generated by this JavaScript code and D1, D2, ...., DM represents the content displayed in each of the M dialog boxes, then : (1) M=3; D1 displays ”12”; D2 displays ”6”; D3 displays ”12”. (2) M=3; D1 displays ”6”; D2 displays ”12”; D3 displays ”6”. (3) M=2; D1 displays ”6”; D2 displays ”12”. (4) M=2; D1 displays ”12”; D2 displays ”6”. J-08718 !J-08718-PAPER-II! 2 Paper-II

Text from page-3

3. 4. What is the output of the following JAVA program ? class simple { public static void main(String[ ] args) { simple obj = new simple( ); obj.start( ); } void start( ) { long [ ] P= {3, 4, 5}; long [ ] Q= method (P); System.out.print (P[0] + P[1] + P[2]+”:”); System.out.print (Q[0] + Q[1] + Q[2]); } long [ ] method (long [ ] R) { R [1]=7; return R; } } //end of class (1) 12 : 15 (2) 15 : 12 (3) 12 : 12 (4) 15 : 15 What is the output of the following ‘C’ program ? (Assuming little - endian representation of multi-byte data in which Least Significant Byte (LSB) is stored at the lowest memory address.) #include <stdio.h> #include <stdlib.h> /* Assume short int occupies two bytes of storage */ int main ( ) { union saving { short int one; char two[2]; }; union saving m; m.two [0] = 5; m.two [1] = 2; printf(’’%d, %d, %d\n”, m.two [0], m.two [1], m.one); }/* end of main */ (1) 5, 2, 1282 (2) 5, 2, 52 (3) 5, 2, 25 (4) 5, 2, 517 J-08718 !J-08718-PAPER-II! 3 Paper-II

Text from page-4

5. Given below are three implementations of the swap( ) function in C++ : (a) void swap (int a, int b) { int temp; temp = a; a = b; b = temp; } int main( ) { int p = 0, q = 1; swap (p, q); } (b) void swap (int &a, int &b) { int temp; temp = a; a = b; b = temp; } int main( ) { int p = 0, q = 1; swap (p, q); } (c) void swap (int *a, int *b) { int *temp; temp = a; a = b; b = temp; } int main( ) { int p = 0, q = 1; swap (&p, &q); } Which of these would actually swap the contents of the two integer variables p and q ? (1) 6. (a) only (2) (b) only (3) (c) only (4) (b) and (c) only In Java, which of the following statements is/are True ? S1 : The ‘final’ keyword applied to a class definition prevents the class from being extended through derivation. S2 : A class can only inherit one class but can implement multiple interfaces. S3 : Java permits a class to replace the implementation of a method that it has inherited. It is called method overloading. Code : 7. (1) S1 and S2 only (2) S1 and S3 only (3) S2 and S3 only (4) All of S1, S2 and S3 Which of the following statements is/are True ? P: C programming language has a weak type system with static types. Q: Java programming language has a strong type system with static types. Code : (1) P only (2) Q only (3) Both P and Q (4) Neither P nor Q J-08718 !J-08718-PAPER-II! 4 Paper-II

Lecture Notes