Trending ▼   ResFinder  

UGC NET DEC 2012 : COMPUTER SCIENCE AND APPLICATIONS PAPER II

7 pages, 50 questions, 50 questions with responses, 65 total responses,    0    0
ugc_net
  
+Fave Message
 Home > ugc_net >   F Also featured on: abhijay22

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

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) ____________________________ 2. (Signature) __________________________ (Name) ____________________________ D 87 1 2 1 Time : 1 /4 hours] 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 circle as indicated below on the correct response against each item. Example : where (C) is the correct response. 5. Your responses to the items are to be indicated in the OMR Sheet given inside the Paper I Booklet only. If you mark at any place other than in the circle in the OMR 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 OMR 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 Original OMR Sheet to the invigilators at the end of the examination compulsorily and must not carry it with you outside the Examination Hall. You are, however, allowed to carry duplicate copy of OMR Sheet on conclusion of examination. 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-12 Roll No. (In figures as per admission card) Roll No.________________________________ (In words) [Maximum Marks : 100 Number of Questions in this Booklet : 50 1. 2. - 3. , - - , : (i) - - (ii) - / - - (iii) OMR - 4. (A), (B), (C) (D) : (C) 5. I OMR OMR , 6. 7. (Rough Work) 8. OMR , , , , , 9. - OMR OMR 10. / 11. ( ) 12. 1 P.T.O. COMPUTER SCIENCE AND APPLICATIONS Paper II Note : This paper contains fifty (50) objective type questions of two (2) marks each. All questions are compulsory. 1. 5. Consider the circuit shown below. In a certain steady state, Y is at logical l . What are possible values of A, B, C ? If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67. (A) 239 (B) 310 (C) 321 (D) 325 (A) A = 0, B = 0, C = 1 (B) (C) 6. A = 0, B = C = 1 A = 1, B = C = 0 (A) Flow oriented analysis (D) A = B = 1, C = 1 2. Component level design is concerned with (B) (C) The worst case time complexity of AVL tree is better in comparison to binary search tree for (A) Search and Insert Operations (B) Search and Delete Operations (C) Insert and Delete Operations (D) Search, Insert and Delete Operations Class based analysis Both of the above (D) None of the above 7. The C language is (A) Context free language (B) Context sensitive language (C) Regular language (D) None of the above 3. 4. The GSM network is divided into the following three major systems : (A) SS, BSS, OSS (B) BSS, BSC, MSC (C) CELL, BSC, OSS (D) SS, CELL, MSC 8. (A) SNMP (Simple Network Management Protocol) (B) SMTP (Simple Mail Transfer Protocol) (C) The power set of the set { } is (A) { } (B) { , { }} (C) {0} (D) {0, , { }} Paper-II The Mobile Application Protocol (MAP) typically runs on top of which protocol ? SS7 (Signalling System 7) (D) HTTP (Hyper Text Transfer Protocol) 2 D-87-12 9. If a packet arrive with an M-bit value is l and a fragmentation offset value 0 , then it is ______ fragment. (A) First (B) Middle (C) Last (D) All of the above 10. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be (A) 32 (B) 64 (C) 128 (D) 160 11. 12. 13. 14. 15. D-87-12 3 The design issue of Datalink Layer in OSI Reference Model is (A) Framing (B) Representation of bits (C) Synchronization of bits (D) Connection control 18. Which of the following is true ? (A) A relation in BCNF is always in 3NF. (B) A relation in 3NF is always in BCNF. (C) BCNF and 3NF are same. (D) A relation in BCNF is not in 3NF. In which tree, for every node the height of its left subtree and right subtree differ almost by one ? (A) Binary search tree (B) AVL tree (C) Threaded Binary Tree (D) Complete Binary Tree 17. In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register ? (A) Absolute (B) Indirect (C) Immediate (D) Index What is the size of the Unicode character in Windows Operating System ? (A) 8-Bits (B) 16-Bits (C) 32-Bits (D) 64-Bits 16. In compiler design reducing the strength refers to (A) reducing the range of values of input variables. (B) code optimization using cheaper machine instructions. (C) reducing efficiency of program. (D) None of the above Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K, and 426 K (in order), using the first-fit algorithm, in which partition would the process requiring 426 K be placed ? (A) 500 K (B) 200 K (C) 300 K (D) 600 K Given the following expressions of a grammar E E * F / F + E / F F F F / id Which of the following is true ? (A) * has higher precedence than + (B) has higher precedence than * (C) + and have same precedence (D) + has higher precedence than * Paper-II 19. 20. The maturity levels used to measure a process are (A) Initial, Repeatable, Defined, Managed, Optimized. (B) Primary, Secondary, Defined, Managed, Optimized. (C) Initial, Stating, Defined, Managed, Optimized. (D) None of the above 24. RAD stands for ______. (A) Rapid and Design (B) Rapid Aided Development (C) Rapid Application Development (D) Rapid Application Design 25. The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using : (A) Parity bit (B) Aging (C) Compaction (D) Timer Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to 4 other people. Some people do this, while some do not send any letter. How many people have seen the letter, including the first person, if no one receives more than one letter and if the chain letter ends after there have been 100 people who read it but did not send it out ? Also find how many people sent out the letter ? (A) 122 & 22 21. Which API is used to draw a circle ? (A) Circle ( ) (B) Ellipse ( ) (C) Round Rect ( ) (D) Pie ( ) (B) (C) In DML, RECONNCT cannot be used with (A) OPTIONAL Set (B) FIXED Set (C) MANDATOR Set (D) All of the above 133 & 33 (D) 144 & 44 26. 22. 111 & 11 command A hash function f defined as f (key) = key mod 13, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79 ? (A) 1 (B) 2 (C) 3 (D) 4 23. Coaxial cables are categorized by Radio Government rating are adapted for specialized functions. Category RG-59 with impedance 75 used for (A) Cable TV (B) Ethernet (C) Thin Ethernet (D) Thick Ethernet Paper-II 27. Which of the following is true while converting CFG to LL(I) grammar ? (A) Remove left recursion alone (B) Factoring grammar alone (C) Both of the above (D) None of the above 4 D-87-12 28. Identify the Risk factors which are associated with Electronic payment system. 32. The User Work Area (UWA) is a set of Program variables declared in the host program to communicate the contents of individual records between (A) DBMS & the Host record (B) Host program and Host record (C) Host program and DBMS (D) Host program and Host language 33. Consider the tree given below : (A) Fraudulent use of Credit Cards. (B) Sending Credit Card details over internet. (C) Remote storage of Credit Card details. (D) All of the above 29. Which of the following are two special functions that are meant for handling exception, that occur during exception handling itself ? (A) Void terminate ( ) and Void unexpected ( ) (B) Non void terminate ( ) and void unexpected ( ) (C) Void terminate ( ) and non void unexpected ( ) Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree. (A) d & h (B) c & k (C) g, b, c, h, i, m (D) c & h (D) Non void terminate ( ) and non void unexpected ( ) 30. Which of the following memory allocation scheme suffers from external fragmentation ? 34. (B) Pure demand paging The maximum number of keys stored in a B-tree of order m and depth d is (A) md + 1 1 md+1 1 (B) m 1 (C) Swapping (C) (A) Segmentation (m 1) (md + 1 1) md 1 (D) m 1 (D) Paging 31. Basis path testing falls under 35. (A) system testing (B) white box testing (C) black box testing (D) unit testing D-87-12 5 Which of the following is the most powerful parring method ? (A) LL(I) (B) Canonical LR (C) SLR (D) LALR Paper-II 36. In UNIX, which of the following command is used to set the task priority ? (A) init (B) nice (C) kill (D) PS 37. AES is a round cipher based on the Rijndal Algorithm that uses a 128-bit block of data. AES has three different configurations. ______ rounds with a key size of 128 bits, ______ rounds with a key size of 192 bits and ______ rounds with a key size of 256 bits. (A) 5, 7, 15 (B) 10, 12, 14 (C) 5, 6, 7 (D) 20, 12, 14 38. 39. 40. 41. Match the following C++ data types : a. User defined type b. Built in type c. Derived type d. Long double Code : a b c (A) 2 3 4 (B) 3 1 4 (C) 4 1 2 (D) 3 4 1 Paper-II Enumeration is a process of (A) Declaring a set of numbers (B) Sorting a list of strings (C) Assigning a legal values possible for a variable (D) Sequencing a list of operators 42. Which of the following mode declaration is used in C++ to open a file for input ? (A) ios : : app (B) in : : ios (C) ios : : file (D) ios : : in 43. Data Encryption Techniques are particularly used for ______. (A) protecting data in Data Communication System. (B) reduce Storage Space Requirement. (C) enhances Data Integrity. (D) decreases Data Integrity. 44. Match the following IC families with their basic circuits : a. TTL 1. NAND b. ECL 2. NOR c. CMOS 3. Inverter Code : a b c (A) 1 2 3 (B) 3 2 1 (C) 2 3 1 (D) 2 1 3 Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push(5), Pop, what is the value of the top of the stack ? (A) 4 (B) 3 (C) 2 (D) 1 Let L be a set accepted by a nondeterministic finite automaton. The number of states in non-deterministic finite automaton is |Q|. The maximum number of states in equivalent finite automaton that accepts L is (A) |Q| (B) 2|Q| (C) 2|Q| 1 (D) 2|Q| with respect to 1. 2. 3. 4. Qualifier Union Void Pointer d 1 2 3 2 6 D-87-12 45. What is the result of the following expression ? (1 & 2) + (3 & 4) 49. Identify the operation which commutative but not associative ? is (A) OR (A) 1 (B) NOR (B) 3 (C) EX-OR (C) 2 (D) NAND (D) 0 50. 46. Back propagation is a learning technique that adjusts weights in the neural network by propagating weight changes. Given a Relation POSITION (PostingNo, Skill), then query to retrieve all distinct pairs of posting-nos. requiring skill is (A) Select p.posting-No, p.postingNo (A) Forward from source to sink (B) Backward from sink to source from position p (C) Forward from source to hidden nodes where p.skill = p.skill and p.posting-No < p.posting-No (D) Backward from since to hidden nodes 47. (B) Match the following : a. TTL 2. Low propagation delay c. CMOS from position p1, position p2 1. High fan out b. ECL Select p1.posting-No, p2.postingNo 3. High power dissipation where p1.skill = p2.skill (C) Code : Select p1.posting-No, p2.postingNo a c (A) 3 2 1 from position p1, position p2 (B) 1 2 3 where p1.skill = p2.skill (C) 1 3 2 (D) 3 48. b 1 2 and p1.posting-No < p2.postingNo (D) Select p1.posting-No, p2.postingNo ______ is an umbrella activity that is applied throughout the software engineering process. from position p1, position p2 (A) Debugging (B) (C) where p1.skill = p2.skill Testing Designing and p1.posting-No = p2.postingNo (D) Software quality assurance D-87-12 7 Paper-II Space For Rough Work Paper-II 8 D-87-12

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)


aarav29oct

(43)

netuser

(7)

vijaysakshi

(4)

Asjad Nabeel

(4)

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 


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,  

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

 

ugc_net chat