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

UGC NET JUN 2005 : COMPUTER SCIENCE AND APPLICATIONS PAPER II

7 pages, 50 questions, 49 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. : ...................................................... 1. (Signature) Candidate) Roll No. (Name) (In figures as per admission card) Roll No. 2. (Signature) (Name) PAPER II COMPUTER SCIENCE AND APPLICATIONS Time : 1 hours] Number of Pages in this Booklet : 8 4. U 1. U DU U S U U U U Write your roll number in the space provided on the top of this page. This paper consists of fifty multiple-choice type of questions. 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 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. 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 : A B C 2. - 3. U U U, - S U U U - S U (i) - S U U U U S U U- U S S U U (ii) 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 (iii) - S R U- U U U U U- R - S U U 4. U U (A), (B), (C) (D) U U U U U A B C D ( C) U D 5. U U I U U- U where (C) is the correct response. 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 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 marking. 5. J 8705 [Maximum Marks : 100 Number of Questions in this Booklet : 50 Instructions for the Candidates 2. 3. (In words) Test Booklet No. J 8 7 0 5 1. ( To be filled by the 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 / U Z U S U U ( U U) U U 12. U U 10. 11. 1 P.T.O. COMPUTER SCIENCE AND APPLICATIONS PAPER II Note : This paper contains fifty (50) multiple-choice questions, each question carrying two (2) marks. Attempt all of them. 1. Which of the following is not true ? (A) Power of deterministic automata is equivalent to power of non-deterministic automata. (B) Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata. (C) Power of deterministic turing machine is equivalent to power of non-deterministic turing machine. (D) All the above 2. Identify the language which is not context - free. (A) (B) (C) 3. L5{ w w R w e {0, 1}* } L5{ w w w e {0, 1}* } (D) { } L5{a n b m c m d n | n, m 0 } L5 a n b n |n 0 0 1 0 The transitive closure of a relation R on set A whose relation matrix 0 0 1 is : 1 0 0 (A) 0 1 0 0 0 1 1 0 0 (B) 1 1 0 1 1 0 1 1 0 (C) 1 1 1 1 1 1 1 1 1 (D) 0 1 1 0 1 1 0 1 1 4. Consider the relation on the set of non-negative integers defined by x y if and only if : (A) x mod 353 mod y (B) 3 mod x 3 mod y (C) x mod 35y mod 3 (D) None of the above 5. Minimum number of individual shoes to be picked up from a dark room ( containing 10 pair of shoes) if we have to get atleast one proper pair : (A) 2 (B) 20 (C) 11 (D) None of these 6. (101011)25(53)b , then b is equal to : (A) 4 (B) 8 7. (C) 10 (D) 16 (D) yz The logic expression x y z 1 x y z1 x y z1 x y z reduces to : (A) J 8705 xz (B) xyz (C) 2 y 8. Which of the following logic has the maximum fan out ? (A) RTL (B) ECL (C) N MOS (D) C MOS 9. Which of the following binary number is the same as its 2 s complement : (A) 1010 (B) 0101 (C) 1000 (D) 1001 10. Identify the logic function performed by the circuit shown (A) 11. 13. 14. (B) AND (C) Exclusive-NOR (D) NOR After 3 calls of the c function bug ( ) below, the values of i and j will be : int j = 1; bug ( ) { Static int i = 0; int j = 0; i++; j++; return (i) ; } (A) 12. Exclusive-OR i = 0, j = 0 (B) i = 3, j = 3 (C) i = 3, j = 0 (D) i = 3, j = 1 Find the output of the following C code : Main ( ) { int x = 20, y = 35; x = y++ + x++; y = ++y + ++x; printf ( %d, %d\n , x, y); } (A) 55, 93 (B) 53, 97 (C) 56, 95 (D) 57, 94 The data hiding is taken care by : (A) Abstraction (C) Modularity Encapsulation Inheritance (B) (D) If a data-item is declared as a protected access specifier then it can be accessed : (A) Anywhere in the program (B) By the base and derived classes (C) Only by base class (D) Only by derived class J 8705 3 P.T.O. 15. Main ( ) { char *str = abcde ; printf ( %c , *str); printf ( %c , *str++); printf ( %c , *(str++)); printf ( %s , str);} The output of the above C code will be : (A) (B) aacccde (C) 16. aacbcde aabcde (D) None of these An Entity - relationship diagram is a tool to represent : (A) (B) Process model (C) 17. Data model Event model (D) Customer model Which of the following tools is not required during system analysis phase of system development Life cycle ? (A) (B) RAD Tool (C) 18. CASE Tool Reverse engineering tool (D) None of these A black hole in a DFD is a : (A) (B) A data store with only in bound flows (C) A data store with more than one in bound flow (D) 19. A data store with no in bound flows None of these. Multi-valued dependency among attribute is checked at which level ? (A) 20. 3 NF (C) 4 NF (D) 5 NF Schema (B) View (C) Query (D) Data Dictionary What is the time required to insert an element in a stack with linked implementation ? (A) 22. (B) A WINDOW into a portion of a data base is : (A) 21. 2 NF O (log2n) (B) O (n) (C) Which of the following statement is false ? (A) Every tree is a bipertite graph (B) A tree contains a cycle (C) A tree with n nodes contains n-1 edges (D) A tree is a connected graph J 8705 4 O (n log2n) (D) O (1) 23. In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a child of the node g ? (A) 1 (B) 3 (C) 7 (D) 8 24. If the postfix form of a string is ABC12D*, the actual string is : (A) (A2(B1C))*D (B) ((A2B)1C)*D (C) ((A1B)2C)*D (D) (A1(B2C))*D 25. The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of numbers like : { 1, 3, 2, 5, 4, 6} is : (A) Quick sort (B) Bubble sort (C) Merge sort (D) Selection sort 26. Which of the following are (1) Ethernet (2) (4) 10-base T (5) (A) 1, 2 (B) 1, 3, Data link layer standard ? HSSI (3) Frame Relay Token ring 5 (C) 1, 3, 4, 5 (D) 1, 2, 3, 4, 5 27. Which type of Bridge would be used to connect an Ethernet Segment with a token ring Segment ? (B) Source-Route Bridge (A) Transparent Bridge (C) Translation Bridge (D) None of these 28. Which type of links are used for a connection between two DTE devices ? (A) X.21 (B) Frame Relay (C) ATM (D) Modem 29. Which protocol is used to encapsulate a data pocket created of a higher OSI model layer ? (A) HDLC (B) SDLC (C) LAPB (D) LAPD 30. What is the correct subnet mask to use for a class-B address to support 30 Networks and also have the most hosts possible ? (A) 255 . 255 . 255 . 0 (B) 255 . 255 . 192 . 0 . 255 . 240 . 0 (C) 255 (D) 255 . 255 . 248 . 0 31. Which of the statements related to Compilers is wrong ? (A) Lexical analysis is breaking the input into tokens (B) Syntax analysis is for parsing the phrase (C) Syntax analysis is for analyzing the semantic (D) None of these J 8705 5 P.T.O. 32. Which of the following is the most general phase - structured grammar ? (A) Regular (B) Context - Sensitive (C) Context free (D) None of these 33. Which activity is not included in the first pass of two pass assemblers ? (A) Build the symbol table (B) Construct the machine code (C) Separate mnemonic opcode and operand fields. (D) None of these 34. The dynamic binding occurs during the : (A) Compile time (B) Run time (C) Linking time (D) Pre-processing time. 35. Symbol Table can be used for : (A) Checking type compatibility (B) Suppressing duplication of error message (C) Storage allocation (D) All of these 36. Moving Process from main memory to disk is called : (A) Caching (B) Termination (C) Swapping (D) Interruption 37. The principle of Locality of reference justifies the use of : (A) Virtual memory (B) Interrupts (C) Cache memory (D) Secondary memory 38. Banker s algorithm is for. (A) Dead lock Prevention (C) Dead lock Detection (B) (D) Dead lock Avoidance Dead lock creation 39. Which is the correct definition of a valid process transition in an operating system ? (A) Wake up : Ready Running (B) Dispatch : Ready Running (C) Block : Ready Running (D) Timer run out : Ready Blocked 40. Which of the following is not an Unix Command ? (A) Whoami (B) wc (C) ls J 8705 6 (D) put 41. The capability maturity model (err) defines 5 levels : Managed (a) Level 1 (i) (b) Level 2 (ii) Defined (c) Level 3 (iii) Repeatable (d) Level 4 (iv) Initial (e) Level 5 (v) Optimized correct matching is : a b c d e (A) (i) (ii) (iii) (iv) (v) (B) (iv) (iii) (ii) (i) (v) (C) (v) (i) (iii) (ii) (iv) (D) (v) (ii) (i) (iii) (iv) 42. Which one of the following is not a software process model ? (A) Linear sequential model (B) Prototyping model (D) COCOMO model (C) The spiral model 43. System Development Life-cycle has following stages : (II) Coding (I) Requirement analysis (IV) Testing (III) Design Which option describes the correct sequence of stages ? (A) III, I, IV, II (B) II, III, I, IV (C) I, III, IV, II (D) None of the above 44. Which one is measure of software complexity ? (A) Number of lines of code (LOC) (B) Number of man years (C) Number of function points (FP) (D) All of the above 45. Which type of coupling is least preferred ? (A) Content coupling (B) (C) Control coupling (D) 46. PVM (A) (B) (C) (D) 47. The frequency reuse plan is divided into cell grouping using how many cells, where the number of cells equals N ? (A) 3 (B) 10 (C) 7 (D) 21 48. Which interim standard describes inter-switching networking ? (A) IS - 54 (B) IS - 95 (C) DS - 45 49. Theoretically, how many 1.25 MHz Carriers are there in a CDMA cell ? (A) 18 (B) 22 (C) 9 (D) 64 50. Another name of IEEE 802.11a is : (A) WECA (B) Fast Ethernet 802 . 11g J 8705 Data coupling Common coupling and MPI Library functions are implemented on the top of the : Universal Message Passing (UMS) Network Interface Driver (NID) Media Access Control (MAC) None of these 7 (C) Wi-Fi 5 (D) (D) ANSI - 41 P.T.O.

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)

geethubejith
(19)

vishalchugh786
(9)

rajneesh2013
(8)

naresh_2585
(8)

Formatting page ...

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