×
MY GOAL IS TO PAY BACK MY PARENTS
--Your friends at LectureNotes
Close

UGC-NET November 2017 paper -II previous question paper

  • Other
  • 32 Views
  • 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) N0 8 7 1 7 Time : 1¼ hours] (In figures as per admission card) PAPER - II Roll No. COMPUTER SCIENCE AND APPLICATIONS Number of Pages in this Booklet : 12 Instructions for the Candidates ¬⁄UˡÊÊÁÕ¸ÿÙ¢ ∑§ Á‹∞ ÁŸŒ¸‡Ê 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 and 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 are no negative marks for incorrect answers. N-08717 !N-08717-PAPER-II! [Maximum Marks : 100 Number of Questions in this Booklet : 50 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 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 : (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ŸÊ „Ò ¡Ò‚Ê Á∑§ ŸËø ÁŒπÊÿÊ ªÿÊ „Ò– ©ŒÊ„⁄UáÊ — ¡’Á∑§ (3) ‚„Ë ©ûÊ⁄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Ã∑§Ê ÃÕÊ OMR ¬òÊ∑§ ∑§Ë «ÈUå‹Ë∑§≈U ¬˝Áà •¬Ÿ ‚ÊÕ ‹ ¡Ê ‚∑§Ã „Ò¥– 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. This paper contains fifty (50) objective type questions of two (2) marks each. All questions are compulsory. If the time is now 4 O’clock, what will be the time after 101 hours from now ? (1) 2. 3. 1 0 Let A =  1  0 8 O’clock (3) 5 O’clock 1 0  1  1 (4) 4 O’clock (4) (1301) 4 1 0 1 0 0 0 1 0  and B =  0 1 1 0  Find the boolean product A ⊙ B of the two matrices.   1 0  1 0 1 1   0 1 1 1 0 1 1 0  1 1 0  0 1 1 (2) 1 0  1  1 1 0 1 1 0 1  1 1 0  0 1 1 (3) 1 0  1  1 1 0 1 1 1 0  1 1 0  0 1 1 (4) 1 0  1  1 1 1 0 1 1 0  0 1 1  0 1 1 How many distinguishable permutations of the letters in the word BANANA are there ? (1) 5. (2) Let m=(313)4 and n=(322)4. Find the base 4 expansion of m+n. (1) (635) 4 (2) (32312) 4 (3) (21323) 4 (1) 4. 9 O’clock 720 (2) 120 (3) 60 (4) 360 Consider the graph given below : Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the tree in the order in which they are choosen is ? (1) AD, AE, AG, GC, GB, BF (2) GC, GB, BF, GA, AD, AE (3) GC, AD, GB, GA, BF, AE (4) AD, AG, GC, AE, GB, BF N-08717 !N-08717-PAPER-II! 2 Paper-II

Text from page-3

6. The Boolean function with the Karnaugh map AB CD 00 01 11 10 00 0 0 1 0 01 1 1 1 1 11 1 1 1 1 10 0 1 1 0 is : 7. (1) (A+C).D+B (2) (A+B).C+D (3) (A+D).C+B (4) (A+C).B+D The Octal equivalent of the binary number 1011101011 is : (1) 8. 1353 (3) 5651 (4) 5657 P↔¬Q (2) ¬P↔Q (3) ¬P↔¬Q (4) Q→P (3) ∀ x H(x) (4) ¬ x H(x) (4) P፱1+P2 P3 Negation of the proposition › x H(x) is : (1) 10. (2) Let P and Q be two propositions, ¬ (P ↔ Q) is equivalent to : (1) 9. 7353 › x ¬ H(x) (2) ∀ x ¬ H(x) The output of the following combinational circuit is F. The value of F is : (1) N-08717 P1+P፱2 P3 (2) !N-08717-PAPER-II! P1+P፱2 P፱3 (3) 3 P1+P2 P፱3 Paper-II

Text from page-4

11. 12. 13. 14. 15. 16. ‘ptrdata’ is a pointer to a data type. The expression *ptrdata++ is evaluated as (in C++) : (1) *(ptrdata++) (2) (*ptrdata)++ (3) *(ptrdata)++ (4) Depends on compiler The associativity of which of the following operators is Left to Right, in C++ ? (1) Unary Operator (2) Logical not (3) Array element access (4) addressof A member function can always access the data in __________ , (in C++). (1) the class of which it is member (2) the object of which it is a member (3) the public part of its class (4) the private part of its class Which of the following is not correct for virtual function in C++ ? (1) Must be declared in public section of class. (2) Virtual function can be static. (3) Virtual function should be accessed using pointers. (4) Virtual function is defined in base class. Which of the following is not correct (in C++) ? (1) Class templates and function templates are instantiated in the same way. (2) Class templates differ from function templates in the way they are initiated. (3) Class template is initiated by defining an object using the template argument. (4) Class templates are generally used for storage classes. Which of the following is/are true with reference to ‘view’ in DBMS ? (a) A ‘view’ is a special stored procedure executed when certain event occurs. (b) A ‘view’ is a virtual table, which occurs after executing a pre-compiled query. Code : 17. (1) Only (a) is true (2) Only (b) is true (3) Both (a) and (b) are true (4) Neither (a) nor (b) are true In SQL, __________ is an Aggregate function. (1) N-08717 SELECT (2) !N-08717-PAPER-II! CREATE (3) 4 AVG (4) MODIFY Paper-II

Lecture Notes