Trending ▼   ResFinder  

UGC NET DEC 2011 : COMPUTER SCIENCE AND APPLICATIONS PAPER II

7 pages, 50 questions, 0 questions with responses, 0 total responses,    0    0
jc0def1sh
  
+Fave Message
 Home > jc0def1sh >

Formatting page ...

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

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

Additional Info : UGC NET DEC 2010 : COMPUTER SCIENCE AND APPLICATIONS PAPER II
Tags : UGC NET DEC 2010 : COMPUTER SCIENCE AND APPLICATIONS PAPER II , UGC NET DEC 2011 : GENERAL PAPER,UGC NET,GENERAL PAPER  


© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

jc0def1sh chat