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

UGC NET DEC 2007 : COMPUTER SCIENCE AND APPLICATIONS PAPER II

15 pages, 50 questions, 50 questions with responses, 82 total responses,

	ugc_net	+Fave Message
	Profile Timeline Uploads Q & A

Home > ugc_net >

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

Formatting page ...

Signature and Name of Invigilator Answer Sheet No. : ................................................ (To be filled by the Candidate) 1. (Signature) Roll No. (Name) (In figures as per admission card) Roll No. 2. (Signature) (In words) (Name) Test Booklet No. PAPER II D 8 7 0 7 COMPUTER SCIENCE AND APPLICATIONS Time : 1 hours] Number of Pages in this Booklet : 16 [Maximum Marks : 100 Number of Questions in this Booklet : 50 U Instructions for the Candidates 1. Write your roll number in the space provided on the top of this page. 1. U DU U S U U U U 2. This paper consists of fifty multiple-choice type of questions. 3. U U U, - S U U U 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) 2. - - S U (i) - S U U U U S U U- U S S U U (ii) 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. U DU U U U - S DU U U U U U U S DU / U U U U U S S U U U U U S U U - S U U - S U UQ (ii) (iii) 4. 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. After this verification is over, the Serial No. of the booklet should be entered in the Answer-sheets and the Serial No. of Answer Sheet should be entered on this Booklet. (iii) - S R U- U 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. 4. U U (A), (B), (C) (D) Example : A B C U U U U- R - S U U U U U U U D where (C) is the correct response. 5. 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. C D U U U S U U U , U 6. U U 7. (Rough Work) S DU U U 8. U- S U , U U U U 9. U # U U- S U U U U U # U U U You have to return the test question booklet to the invigilators at the end of the examination compulsorily and must not carry it with you outside the Examination Hall. / U Z U S U U ( U U) U U 12. U U 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 marking. D 8707 B 5. U U I U U- U 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. A ( C) U 1 P.T.O. Computer Science and Applications PAPER II Note : 1. This paper contains fifty (50) objective-type questions, each question carrying two (2) marks. Attempt all of them. A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls are red and two are green ? (A) (B) 4 7 (C) 2. 3 7 5 7 (D) 6 7 The number of edges in a complete graph with n vertices is equal to : (A) (B) n (n21) 2 (C) 3. n(n21) n2 (D) 2n21 A context free grammar is : (A) (B) type 1. (C) 4. type 0. type 2. (D) type 3. Let e : B^m B^n is a group code. The minimum distance of e is equal to : (A) the maximum weight of a non zero code word (B) the minimum weight of a non zero code word (C) m (D) n D 8707 2 5. Consider a Moore machine M whose digraph is : Then L(M), the language accepted by the machine M, is the set of all strings having : (A) (B) three or more b s. (C) 6. two or more b s. two or more a s. (D) three or more a s. A WFF that is equivalent to the WFF x5> y is : (A) (B) ~ y5> x (C) 7. y5 > x ~ y5 > ~ x (D) y5> ~ x Simplified form of Boolean expression xy1(~x)z1yz is : (A) (B) (~x)y1 (~x)z. (C) 8. xy 1(~ x)z. (~ x) y 1xz. (D) xy 1 xz. In order to build a MOD - 18 counter, the minimum number of flip flops needed is equal to : (A) (B) 9 (C) 9. 18 5 (D) 4 The dual of the switching function F5x1yz is given by : (A) x 1 yz (B) x( y1 z ) (C) (~x)1(~ y)(~z) (D) (~x)((~y)1(~z)) D 8707 3 P.T.O. 10. Amongst the logic families DTL, TTL, ECL and CMOS, the family with the least power dissipation is : (A) (B) DTL (C) 11. CMOS TTL (D) ECL What cannot replace ? in the following C-code to print all odd numbers less than 100 ? for (i51; ? ; i5i12) printf( %d\n , i); (A) (B) i[101 (C) 12. i[100 i <100 (D) i<101 Consider the following linked list : Which of the following piece of code will insert the node pointed to by q at the end of the list ? (A) for (p5list; p !5NULL; p5p next); p5q; (B) for (p5list; p !5NULL; p5p next); p next5q; (C) for (p5list; p next !5NULL; p5p next); p5q; (D) for (p5list; p next !5NULL; p5p next); p next5q; D 8707 4 13. Which of the following is a valid C code to print character A to C ? (A) x5 A ; switch(x) {case A 5printf ( %d\n , x); .... case C 5printf ( %d\n , x); } (B) x5 A ; switch(x) {case A <5x <5 C : printf ( %d\n , x);} (C) x5 A ; switch(x) { case A : printf ( %d\n , x); break; case B : printf ( %d\n , x); break; case C : printf ( %d\n , x); break; } (D) x5 A ; switch(x) { case A 5printf ( %d\n , x); case B 5printf ( %d\n , x); case C 5printf ( %d\n , x); } D 8707 5 P.T.O. 14. Which of the following is not true in C11 ? (A) (B) Protected elements of base class are not accessible by members of its derived class. (C) When base class access specified is Public , public elements of the base class become public members of its derived class. (D) 15. Private elements of a base class are not accessible by members of its derived class. When base class access specified is Public , protected elements of a base class become protected members of its derived class. Which of the following is true of constructor function in C11 ? (A) (B) A constructor is a unique function which cannot be overloaded. (C) A constructor function must be invoked with the object name. (D) 16. A class must have at least one constructor. A constructor function is automatically invoked when an object is created. A primary key for an entity is : (A) a candidate key (B) any attribute (C) a unique attribute (D) a superkey D 8707 6 17. Aggregate functions in SQL are : (A) (B) SUM, COUNT and AVG (C) UPPER, LOWER and LENGTH (D) 18. GREATEST, LEAST and ABS SQRT, POWER and MOD If a relation is in 2NF and 3NF forms then : (A) (B) no non-prime attribute is functionally dependent on prime attributes (C) all attributes are functionally independent (D) 19. no non-prime attribute is functionally dependent on other non-prime attributes prime attribute is functionally independent of all non-prime attributes The end of an SQL command is denoted by : (A) (B) an enter-key marker (C) entering F4 key (D) 20. an end-of-line character a semicolon (;) Consider the query : SELECT student_name FROM students WHERE class_name 5 (SELECT class_name FROM students WHERE math_marks 5 100); what will be the output ? (A) the list of names of students with 100 marks in mathematics (B) the names of all students of all classes in which at least one student has 100 marks in mathematics (C) the names of all students in all classes having 100 marks in mathematics (D) the names and class of all students whose marks in mathematics is 100 D 8707 7 P.T.O. 21. Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i > 0) of the tree ? Assume that the root is at level 0: (A) (B) 3i (C) 3 (D) 22. 3i 3i + 1 Which of the following data structure is used to implement recursion ? (A) (B) Stacks (C) Queues (D) 23. Arrays Linked lists The height of a binary tree with n nodes, in the worst case is : (A) (B) O(n) (C) (n log n) (D) 24. O(log n) 2 (n ) An example of a file extension is : (A) text (B) pict (C) mp3 (D) web D 8707 8 25. The performance of a file system depends upon the cache hit rate. If it takes 1 msec to satisfy a request from the cache but 10 msec to satisfy a request if a disk read is needed, then the mean time (ms) required for a hit rate h is given by : (A) (B) h 1 10 (1 2 h) (C) (1 2 h) 1 10 h (D) 26. 1 10 The best known example of a MAN is : (A) (B) Cable Television (C) FDDI (D) 27. Ethernet IEEE 802.3 In a broadcast network, a layer that is often thin or non-existent is : (A) (B) transport layer (C) presentation layer (D) 28. network layer application layer The maximum data rate of binary signals on a noiseless 3 KHz channel is : (A) 3000 bps. (B) 6000 bps. (C) 9000 bps. (D) 12,000 bps. D 8707 9 P.T.O. 29. For pure ALOHA, the maximum channel utilization is : (A) (B) 50% (C) 30. 100% 36% (D) 18% An example of an adaptive routing algorithm is : (A) (B) flooding (C) selective flooding (D) 31. distance vector routing shortest path routing In a two pass compiler, during the first pass : (A) (B) the syntax of the statement is checked and mistakes, if any, are listed (C) object program is generated (D) 32. user defined address symbols are correlated with their binary equivalent semantic of the source program is elucidated. A single instruction in an assembly language program contains : (A) one micro operation (B) one macro operation (C) one instruction to be completed in a single pulse (D) one machine code instruction D 8707 10 33. Absolute loader demands that the programmer needs to know the : (A) (B) total size of the program (C) actual address of the data location (D) 34. start address of the available main memory absolute values of the operands used Top-down parsers are predictive parsers, because : (A) (B) length of the parse tree is predicted before hand. (C) lowest node in the parse tree is predicted. (D) 35. next tokens are predicted. next lower level of the parse tree is predicted. In the context of compiler design, reduction in strength refers to : (A) (B) reduction in accuracy of the output (C) reduction in the range of values of input variables (D) 36. code optimization obtained by the use of cheaper machine instructions reduction in efficiency of the program How many states can a process be in ? (A) 2 (B) 3 (C) 4 (D) 5 D 8707 11 P.T.O. 37. A program has five virtual pages, numbered from 0 to 4. If the pages are referenced in the order 012301401234, with three page frames, the total number of page faults with FIFO will be equal to : (A) (B) 4 (C) 38. 0 6 (D) 9 Average process size = s bytes. Each page entry requires e bytes. The optimum page size is given by : (A) (C) 39. (se) s (B) (D) (2se) e An example of a directory found in most UNIX system is : (A) (B) waitpid. (C) 40. usr. brk. (D) unmap. The aging algorithm with a = 0.5 is used to predict run times. The previous four runs from oldest to most recent are 40, 20, 20, and 15 msec. The prediction for the next time will be : (A) (B) 25 msec. (C) 41. 15 msec. 39 msec. (D) 40 msec. A major defect in water fall model in software development is that : (A) the documentation is difficult (B) a blunder at any stage can be disastrous (C) a trial version is available only at the end of the project (D) the maintenance of the software is difficult D 8707 12 42. Function point metric of a software also depends on the : (A) (B) number of final users of the software (C) number of external inputs and outputs (D) 43. number of function needed time required for one set of output from a set of input data An error message produced by an interactive system should have : (A) (B) the list of mistakes done by the user displayed (C) a non-judgmental approach (D) 44. always the error code the past records of the occurrence of the same mistake System development cost estimation with use-cases is problematic because : (A) (B) the data can be totally incorrect (C) the expertise and resource available are not used (D) 45. of paucity of examples the problem is being over simplified The approach to software testing is to design test cases to : (A) break the software (B) understand the software (C) analyse the design of sub processes in the software (D) analyze the output of the software D 8707 13 P.T.O. 46. Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation, then p processors can execute algorithm A in time given by : (A) (B) mt / p (C) 47. t /p t1(m2t)/p (D) (m2t)/ p With reference to implementation of different association mining algorithms, identify the correct statement : (A) (B) Apriori algorithm is usually better than CHARM (C) Apriori algorithm is good when the support required is low (D) 48. The FP growth method was usually better than the best implementation of the apriori algorithm At very low support the number of frequent items becomes less Consider a typical mobile communication system. If 840 frequencies are available, how many can be used in a given cell ? (A) (B) 120 (C) 49. 140 84 (D) 60 Identify the incorrect statement : (A) The internet has evolved into phenomenally successful e-commerce engine (B) e-business is synonymous with e-commerce (C) The e-commerce model B2C did not begin with billboardware (D) The e-commerce model G2C began with billboardware D 8707 14 50. Identify the incorrect statement : (A) ATM provides both real time and non-real time service (B) ATM provides faster packet switching than X.25 (C) ATM was developed as part of the work on broadband ISDN (D) ATM does not have application in Non-ISDN environments where very high data rates are required -oOo- D 8707 15 P.T.O.

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)

itguru
(35)

jc0def1sh
(35)

geethubejith
(5)

nihagourav
(4)

Formatting page ...

Additional Info : Ugc Net December 2007 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: