
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

UGC NET DEC 2009 : COMPUTER SCIENCE AND APPLICATIONS PAPER II

7 pages, 50 questions, 50 questions with responses, 99 total responses,

	ugc_net	+Fave Message
	Profile Timeline Uploads Q & A

Home > ugc_net > F Also featured on: abhijay22

Instantly get Model Answers to questions on this ResPaper. Try now!
NEW ResPaper Exclusive!

Formatting page ...

Signature and Name of Invigilator OMR Sheet No. : ......................................... (To be filled by the Candidate) 1. (Signature) __________________________ Roll No. (Name) ____________________________ 2. (Signature) __________________________ (In figures as per admission card) Roll N o.____________________________ (In words) (Name) ____________________________ D-8709 Test Booklet No. PAPER-II Time : 1 1/4 hours] [Maximum Marks : 100 COMPUTER SCIENCE & APPLICATIONS 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 Test Booklet Number should be entered in the OMR Sheet and 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 or put any mark on any part of the test booklet, except for the space allotted for the relevant entries, which may disclose your identity, 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. Negative Marking :- For each incorrect answer, 0.5 marks shall be deducted. D-0109 D-8709 Number of Questions in this Booklet : 50 1. 2. - 3. , - - : (i) - - (ii) - / - - (iii) - OMR OMR - 4. (A), (B), (C) (D) B C A D : (C) 5. I - , 6. 7. (Rough Work) 8. - , 9. - OMR - 10. / 11. ( ) 12. : 0.5 P.T.O. 1 P.T.O. COMPUTER SCIENCE & APPLICATIONS Paper II Note : This paper contains fifty (50) objective type questions, each question carrying two (2) marks. Attempt all the questions. 1. 2. If she is my friend and you are her friend, then relationship in this context is ____________. (i) commutative (ii) transitive (iii) (A) (i) and (ii) (B) (C) (i), (ii), (iii) and (iv) (D) Circle has ____________ (A) No vertices (C) vertices we are friends. Given this, the friend implicative (iii) None of these (iv) equivalence (B) Only 1 vertex (D) None of these 3. If in an error detection and correction code a message M : You are good students is stored as M' : Youare areyou aregood goodare goodstudents studentsgood. What is the space required to store M' in general ? (assume that n is the length of M) (A) 2n (B) 3n (C) 4n (D) less than 4n 4. P : Program is a step by step execution of the instructions . Given P, which of the following is true ? (A) Program is a subset of an instruction set. (B) Program is a sequence of a subset of an instruction set. (C) Program is a partially ordered set of an instruction set. (D) All of the above 5. In a MIU puzzle, either of the letters M, I or U could go as a start symbol. Production rules are given below : R1 : U IU R2 : M.x M.x.x where ... is string concatenation operator. Given this, which of the following holds for (i) MIUIUIUIUIU (ii) MIUIUIUIUIUIUIUIU (A) Either (i) or (ii) but not both of these are valid words. (B) Both (i) and (ii) are valid words and they take identical number of transformations for the production. (C) Both (i) and (ii) are valid words but they involve different number of transformations in the production. (D) None of these 6. The simplified form of the Boolean expression (X + Y + XY) (X + Z) is (A) X + Y + ZX + Y (B) XY YZ (C) X + YZ (D) XZ + Y Paper-II 2 D-8709 7. Identify the logic function performed by the circuit shown (A) (C) 8. 9. exclusive OR NAND (B) exclusive NOR (D) NOR The highest noise margin is offered by (A) BICMOS (C) ECL (B) TTL (D) CMOS The answer of the operation (10111)2 * (1110)2 in hex equivalence is (A) 150 (B) 241 (C) 142 10. How many 1 s are present in the binary representation of 3 512 + 7 64 + 5 8 + 3 (A) 8 (B) 9 (C) 10 11. Recursive functions are executed in a (A) First in first out-order (C) Parallel fashion (D) 101011110 (D) 11 (B) Last in first out-order (D) Load balancing 12. What would be the output of the following program, if run from the command line as myprog 1 2 3 ? main (int argc, char argv[ ]) { int i ; i = argv[1] + argv[2] + argv[3] ; printf ( % d , i) ; } (A) 123 (B) 6 (C) Error (D) 123 13. A __________ is a special method used to initialize the instance variable of a class. (A) Member function (B) Destructor (C) Constructor (D) Structure 14. Encapsulation is (A) Dynamic binding (B) A mechanism to associate the code and data. (C) Data abstraction (D) Creating new class D-8709 3 Paper-II 15. Which of the statements are true ? I. Function overloading is done at compile time. II. Protected members are accessible to the member of derived class. III. A derived class inherits constructors and destructors. IV. A friend function can be called like a normal function. V. Nested class is a derived class. (A) I, II, III (B) II, III, V (C) III, IV, V (D) I, II, IV 16. The E-R model is expressed in term of I. Entities II. The relationship among entities. III. The attributes of the entities. IV. Functional relationship. (A) I, II (B) I, II, IV (C) 17. Specialization is __________ process. (A) top-down (C) both (A) and (B) (B) bottom up (D) none of these 18. Match the following : (1) Determinants (2) Candidate key (3) Non-redundancy (4) Functional dependency (A) (B) (C) (D) 1 d, 2 d, 4 a, 3 a, 2 b, 3 a, 3 b, 4 b, 3 a, 1 b, 2 c, 1 c, (a) (b) (c) (d) II, II, IV (D) I, II, III No attribute can be added Uniquely identified a row A constraint between two attribute Group of attributes on the left hand side of arrow of function dependency. 4 c 4 c 1 d 2 d 19. A function that has no partial functional dependencies is in __________ form. (A) 3 NF (B) 2 NF (C) 4 NF (D) BCNF 20. Which of the following statement is wrong ? I. 2-phase locking protocol suffer from dead lock. II. Time stamp protocol suffer from more aborts. III. A block hole in a DFD is a data store with only inbound flows. IV. Multivalued dependency among attribute is checked at 3 NF level. V. An entity-relationship diagram is a tool to represent event model. (A) I, II, II (B) II, III, IV (C) III, IV, V (D) II, IV, V 21. If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in the tree ? (A) It is an odd number. (B) It is an even number. (C) It cannot be equal to the number of leaves. (D) It is always greater than twice the number of leaves. Paper-II 4 D-8709 22. The number of edges in a complete graph of n vertices is (A) n (B) n(n 1)/2 (C) n(n + 1)/2 (D) n2/2 23. At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car can t leave until all the cars in front of it have left. Is the parking lot more like (A) An array (B) A stack (C) A queue (D) A linked list 24. With regard to linked list, which of the following statement is false ? (A) An algorithm to search for an element in a singly linked list requires 0(n) operations in the worst case. (B) An algorithm for deleting the first element in a singly linked list requires 0(n) operations in the worst case. (C) An algorithm for finding the maximum value in a circular linked list requires 0(n) operations. (D) An algorithm for deleting the middle node of a circular linked list requires 0(n) operations. 25. A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6. What will be the location of 11 ? (A) 3 (B) 4 (C) 5 (D) 6 26. Device on one network can communicate with devices on another network via a (A) Hub/Switch (B) Utility server (C) File server (D) Gateway 27. What is the maximum window size in sliding window protocol used in a computer network ? (A) 4 (B) 8 (C) 15 (D) 16 28. Which of the following are Data Link Layer standard ? 1. Ethernet 2. HSSI 3. Frame Relay 4. 10 Base T 5. Token Ring (A) 1, 2, 3 (B) 1, 3, 5 (C) 1, 3, 4, 5 (D) 1, 2, 3, 4, 5 29. In case of Bus/Tree topology signal balancing issue is overcome by (A) Modulation (B) Polling (C) Segmentation (D) Strong transmitter 30. Match the following : (i) Ethernet (a) (ii) Token Ring (b) (iii) Cut-through switch (c) (iv) Spanning tree (d) Codes : (A) i d, ii a, iii b, iv c (C) i d, ii d, iii c, iv b D-8709 Deterministic Utilize the full wire speed Prevent looping Checking valid address (B) i a, ii d, iii b, iv c (D) i d, ii c, iii b, iv a 5 Paper-II 31. In an absolute loading scheme which loader function is accomplished by assembler ? (A) re-allocation (B) allocation (C) linking (D) loading 32. Which of the following grammar is LR (1) ? (A) A a A b, A b A b, A a , A b (B) A a A a, A a A b, A c (C) A A + A, A a (D) Both (A) and (B) 33. A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar. S x x W [ print 1 ] S y [print 2 ] W S2 [print 3 ], what is the translation of x x x x y z z ? (A) 1 1 2 3 1 (B) 1 1 2 3 3 (C) 2 3 1 3 1 (D) 2 3 3 2 1 34. Contex-free Grammar (CFG) can be recognized by (A) Finite state automata (B) 2-way linear bounded automata (C) push down automata (D) both (B) and (C) 35. Synthesized attribute can be easily simulated by a (A) LL grammar (B) Ambiguous grammar (C) LR grammar (D) None of the above 36. In the process management Round-robin method is essentially the pre-emptive version of _________ (A) FILO (B) FIFO (C) SSF (D) Longest time first 37. A page fault (A) is an error specific page. (B) is an access to the page not currently in memory. (C) occur when a page program occur in a page memory. (D) page used in the previous page reference. 38. A semaphore count of negative n means (s = n) that the queue contains ________ waiting processes. (A) n + 1 (B) n (C) n 1 (D) 0 39. A program is located in the smallest available hole in the memory is _________ (A) best fit (B) first bit (C) worst fit (D) buddy 40. The Unix command used to find out the number of characters in a file is (A) nc (B) wc (C) chcnt (D) lc Paper-II 6 D-8709 41. Software Engineering is a discipline that integrates _________ for the development of computer software. (A) Process (B) Methods (C) Tools (D) All 42. Any error whose cause cannot be identified anywhere within the software system is called ________ (A) Internal error (B) External error (C) Inherent error (D) Logic error 43. Recorded software attributes can be used in the following endeavours : (i) Cost and schedule estimates. (ii) Software product reliability predictions. (iii) Managing the development process. (iv) No where Codes : (A) (i) (ii) (iv) (B) (ii) (iii) (iv) (C) (i) (ii) (iii) (D) (i) (ii) (iii) (iv) 44. Black Box testing is done (A) to show that s/w is operational at its interfaces i.e. input and output. (B) to examine internal details of code. (C) at client side. (D) none of above. 45. The name of the transaction file shall be provided by the operator and the file that contains the edited transactions ready for execution shall be called (A) Batch. Exe (B) Trans. Exe (C) Opt. Exe (D) Edit.Exe 46. The single stage network is also called (A) one sided network (C) recirculating network (B) two sided network (D) pipeline network 47. Analysis of large database to retrieve information is called (A) OLTP (B) OLAP (C) OLDP (D) OLPP 48. Which technology is sometime referred to as wireless cable ? (A) MMDS (B) ATM (C) LMDS (D) CDMA 49. Another name of IEEE 802.11 a is ____________ (A) Wi-Max (B) Fast Ethernet (C) Wi-Fi (D) 802.11 g 50. The unlicensed National Information Infrastructure band operates at the _________ frequency (A) 2.4 GHz (B) 5 GHz (C) 33 MHz (D) 5 MHz _________ D-8709 7 Paper-II

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)

geethubejith
(18)

cool_shaggy
(16)

rimammshah
(11)

jc0def1sh
(8)

Formatting page ...

Additional Info : Ugc Net December 2009 Question Paper - Computer Science And Applications Paper II
Tags : cbse ugc net question papers, UGC NET Solved Sample Question Paper, UGC NET Exam Papers, ugc net past question papers, ugc net syllabus, ugc net specimen, ugc net study material, UGC NET Study Materials FREE, UGC NET Exam Pattern, Free Ugc Net Online Practice Tests, ugc net previous question papers, central board of secondary education,

ugc_net chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: