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

UGC NET JUN 2007 : COMPUTER SCIENCE AND APPLICATIONS PAPER II

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

	ugc_net	+Fave Message
	Profile Timeline Uploads Q & A

Home > ugc_net >

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 J 8 7 0 7 COMPUTER SCIENCE AND APPLICATIONS Time : 1 hours] Number of Pages in this Booklet : 8 [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. J 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. The following determiniotic finite automata recognizes : (A) (B) (C) (D) 2. Set of all strings containing ab Set of all strings containing aab Set of all strings ending in abab None of the above Depth ion travels of the following directed graph is : (A) (C) ABCDEF ACEBDF (B) (D) ABDEFC None of the above 3. The maximum number of nodes in a binary tree of depth 10 : (C) 1000 (D) None of the above (A) 1024 (B) 210 - 1 4. The regular expression given below describes : r 5 (1101)* (01 ) (A) Set of all string not containing 11 (B) Set of all string not containing 00 (C) Set of all string containing 01 (D) Set of all string ending in 0 5. Which of the following language is regular : (A) L = { an bn| n 1 } (B) L = { an bm cn dm|n, m 1 } (C) L = { an bm|n, m 1 } (D) L = { an bm cn|n, m 1 } J 8707 2 6. 7. 2 s complement of 100 is : (A) 00011100 (B) 10011101 (C) 10011100 (D) 11100100 Which of the following expression remove hazard form : xy 1 z x ? (A) xy 1 z x (B) xy 1 z x (C) x y 1 z x 1 yz (D) xy 1 z x 1 wz 8. How many 1 s are present in the binary representation of 153256 1 53161 3 : (A) 8 (B) 9 (C) 10 (D) 11 9. If A B 5 C , then : (A) A C 5 B (B) B C 5A (C) (D) A B C 50 A B C 51 10. What is the maximum counting speed of a 4-bit binary counter which is composed of Flip-Flop with a propagation delay of 25ns ? (A) 1MHz (B) 10MHz (C) 100MHz (D) 4MHz 11. The following loop in C : int i50; While (i11< 0)i22 ; (A) will terminate (B) will go into an infinite loop (C) will give compilation error (D) will never be executed 12. In case of right shift bitwise operator in C language, after shifting n bits, the leftmost n bits : (A) are always filled with zeroes (B) are always filled with ones (C) are filled with zeroes or ones and is machine dependent (D) none of the above 13. What keyboard in class specification helps to hide data : (A) Public (B) Private (C) Static (D) Void What is the output of the following C program ? main( ) {printf ( %3 , 21>>4);} (A) ffff (B) Offf (C) OOOO (D) fffO 14. J 8707 3 P.T.O. 15. Runtime polymorphism can be achieved by : (A) Accessing virtual function through the pointer of the base class (B) Accessing virtual function through the object (C) The derived class (D) None of these 16. Which of the following statements is wrong ? (A) 2-phase Locking Protocols suffer from dead locks. (B) Time - Stamp Protocols suffer from more aborts. (C) Time - Stamp Protocols suffer from cascading roll back where as 2-phase locking Protocol donot. (D) None of these 17. A recursive foreign key is a : (A) references a relation. (C) references its own relation 18. A subclass having more than one super class is called : (A) Category (B) Classification (C) Combination (D) Partial Participation 19. A Relation R = {A,B,C,D,E,F} is given with following set of functional dependencies : (B) (D) references a table. references a foreign key. F5 {A B, AD C, B F, A E} . Which of the following is Candidate Key ? (A) A (B) AC (C) AD (D) None of these 20. Which statement is false regarding data Independence : (A) Hierarchical data model suffers from data Indepedence. (B) Network model suffers from data Independence. (C) Relational model suffers only from logical data Independence. (D) Relational model suffers only from physical data Independence. SET - II 21. The time required to find shortest path in a graph with n vertices and e edges is : (D) O(n2) (A) O(e) (B) O(n) (C) O(e2) 22. Pre order is also known as : (A) Depth first order (C) Topological order 23. (B) (D) Breadth first order Linear order The equivalent postfix express for d/(e+f) + b*c is : (A) defbc/11 (B) (C) def1/bc*1 def1/bc1* (D) None of these J 8707 4 24. Which algorithm has some average, worst case and best case time : (A) Binary search (B) Maximum of n numbers (C) Quick sort (D) Fibonacci search 25. Application of data structure is queue is : (A) Level wise printing of tree. (B) Implementation of priority queues. (C) Function call implementation (D) Depth first search in a graph. 26. In case of Bus/Tree topology signal balancing issue is overcome by : (A) Strong Transmitter (B) Polling (C) Segmentation (D) Modulation 27. Which of the following techniques are used to control data flow ? 1. Windowing 2. Routing 3. RPCs (A) 1,4 (B) 2,3,4 (C) 1,3,4 4. (D) 28. TDM is __________ . (A) A primary/secondary type protocol (B) A peer/peer protocol (C) A Non-priority peer/peer protocol (D) A priority type protocol 29. What services does the Internet Layer provide ? 1. Quality of service 2. Routing 3. Addressing 4. Connection-oriented delivery 5. Framming bits (A) 1,2,3 (B) 2,3,4 (C) 1,3,4,5 (D) Buffering 1,2,3,4 30. Which of the following protocols is used to prevent looping ? (A) OSPF (B) Spanning tree (C) SRB (D) Fragment free switching 31. The parsing technique that avoids back tracking is : (A) Top - down parsing (B) Recursive - descent parsing (C) Predicative (D) Syntax tree 32. A Top - down Parse generates : (A) Right - most derivation. (C) Left - most derivation. 2,3,4,5 J 8707 (B) (D) 5 Right - most derivation, in reverse. Left - most derivation in reverse. P.T.O. 33. In an absolute loading scheme, which loader function is accomplished by programmer ? (A) Allocation (B) Linking (C) Rellocation (D) Both (A) and (B) 34. Symbol table can be used for : (A) Checking type compability (B) Suppressing duplication of error message (C) Storage allocation (D) All of these above 35. Moving process from main memory to disk is called : (A) Caching (B) Termination (C) Swapping (D) Interruption 36. Part of a program where the shared memory is accessed and which should be executed indivisibly, is called : (A) Semaphores (B) Directory (C) Critical section (D) Mutual exclusion 37. Windows is a __________ operating system : (A) Non-preemptive (B) Preemptive (C) Multi-user (D) Real time 38. The (A) (B) (C) (D) 39. Which page replacement policy suffers from Belady s anomaly ? (A) LRV (B) LFU (C) FIFO 40. Cache memory is : (A) High-Speed Register (C) Non-Volatile RAM 41. Which of the following combination is preferred with respect to cohesion and coupling : (A) low and low (B) low and high (C) high and low (D) high and high 42. Difference between flow-chart and data-flow diagram is : (A) there is no difference (B) usage in high level design and low level design (C) control flow and data flow (D) used in application programs and system programs J 8707 nice command is used in Unix : to decrease the priority of a process. to increase the priority of a process. to get the highest priority. nothing to do with the priorities. (B) (D) 6 (D) OPTIMAL Low-Speed RAM High-speed RAM 43. Match the following : (a) Unit test (b) System test (c) Validation test (d) Integration test Which of the following is true : (a) (b) (c) (d) (A) (ii) (iii) (iv) (i) (B) (i) (ii) (iv) (iii) (C) (iii) (iv) (i) (ii) (D) None of the above 44. Problems with waterfall model are : 1. Real projects rarely follow this model proposes 2. It is often difficult for the customer 3. Working model is available only in the end 4. Developers are delayed unnecessarily Which of the following is true : (A) 1 and 4 only (B) 2 and 3 only (C) 1, 2 and 3 only (D) 1, 2, 3 and 4 45. Which one of the following is a object-oriented approaches : (A) The Booch method (B) The Rambaugh method (C) The Load and Yomdon method (D) All of the above 46. Which technical concept sets cellular apart from all preceding mobile/radio systems ? (A) FM-Transmission (B) Duplex Functionality (C) Frequency Reuse (D) TDMA Technology 47. Wireless interconnection to the PSTN are also known as : (A) Localities (B) CLECs (C) POPs (D) IXCs 48. Dimentional modeling in Data Mining refers to : (A) view and interrogate data (B) define structures and store data (C) retrieve information only (D) none of these 49. The U-NII (Unlicensed National Information Infrastructure) band operates at the __________ frequency : (A) 2.4 GHz (B) 33 MHz (C) 5 GHz (D) 16 GHz 50. Which digital radio technology employs an N = 1 frequency-reuse plan ? (A) GSM (B) TDMA (C) D AMPS (D) CDMA (i) (ii) (iii) (iv) Requirements Design Code System Engineering -oOoJ 8707 7 P.T.O.

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)

itguru
(50)

Rajesh Puppala
(5)

anonymous123
(4)

nihagourav
(4)

Formatting page ...

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