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

UGC NET DEC 2013 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

11 pages, 75 questions, 73 questions with responses, 80 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 ...

PAPER-III COMPUTER SCIENCE & APPLICATIONS Signature and Name of Invigilator 1. (Signature) __________________________ OMR Sheet No. : ............................................... (To be filled by the Candidate) (Name) ____________________________ 2. (Signature) __________________________ (Name) ____________________________ D 87 1 3 Time : 2 1/2 hours] Number of Pages in this Booklet : 12 Instructions for the Candidates 1. Write your roll number in the space provided on the top of this page. 2. This paper consists of seventy five 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 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 such as change of response by scratching or using white fluid, 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-13 Roll No. (In figures as per admission card) Roll No.________________________________ (In words) [Maximum Marks : 150 Number of Questions in this Booklet : 75 1. 2. - 3. , - - , : (i) - - (ii) - / - - (iii) OMR - 4. (A), (B), (C) (D) : (C) 5. OMR OMR , 6. 7. (Rough Work) 8. OMR , , , , , 9. - OMR OMR 10. / 11. ( ) 12. 1 P.T.O. COMPUTER SCIENCE & APPLICATIONS Paper III Note : This paper contains seventy five (75) objective type questions of two (2) marks each. All questions are compulsory. 5. Function points can be calculated by 1. If the primal Linear Programming (A) UFP CAF problem has unbounded solution, (B) UFP FAC then it s dual problem will have (C) UFP Cost (A) feasible solution (D) UFP Productivity (B) alternative solution 6. Match the following : (C) no feasible solution at all List I List II (D) no bounded solution at all a. Data i. Module A and 2. Given the problem to maximize coupling Module B have shared data f(x), X = (x1, x2,......xn) b. Stamp ii. Dependency between subject to m number of inequality coupling modules is based on constraints. the fact they gi(x) bi, i = 1, 2......m communicate by only passing of data including the non-negativity c. Common iii. When complete data constraints x 0. coupling structure is passed Which of the following conditions is from one module to a Kuhn-Tucker necessary condition another for a local maxima at x? d. Content iv. When the control is coupling passed from one L(X, , S) module to the middle (A) = 0, j = 1, 2 .m xj of another Codes : (B) i [gi (X) bi]= 0, i = 1, 2 .m a b c d (A) iii ii i iv (C) gi (X) bi, i = 1, 2 .m (B) ii iii i iv (C) ii iii iv i (D) All of these (D) iii ii iv i 3. The following Linear Programming 7. A process which defines a series of problem has : tasks that have the following four Max Z = x1 + x2 primary objectives is known as 1. to identify all items that collectively Subject to x1 x2 0 define the software configuration. 3x1 x2 3 2. to manage changes to one or more of these items. and x1, x2 0 3. to facilitate the construction of (A) Feasible solution different versions of an application. (B) No feasible solution 4. to ensure that software quality is (C) Unbounded solution maintained as the configuration (D) Single point as solution evolves over time. (A) Software Quality Management 4. Given a flow graph with 10 nodes, Process 13 edges and one connected (B) Software Configuration components, the number of regions Management Process and the number of predicate (decision) (C) Software Version Management nodes in the flow graph will be Process (A) 4, 5 (B) 5, 4 (D) Software Change Management Process (C) 3, 1 (D) 13, 8 Paper-III 2 D-87-13 8. One weakness of boundary value analysis and equivalence partitioning is (A) they are not effective. (B) they do not explore combinations of input circumstances. (C) they explore combinations of input circumstances. (D) none of the above. 9. Which once of the following is not a software myth ? (A) Once we write the program and get it to work, our job is done. (B) Project requirements continually change, but change can be easily accommodated because software is flexible. (C) If we get behind schedule, we can add more programmers and catch up. (D) If an organization does not understand how to control software projects internally, it will invariably struggle when it outsources software projects. 10. 11. 12. D-87-13 3 Which is the protocol for performing RPCs between applications in a language and system independent way ? (A) Hyper Text Transmission Protocol (HTTP) (B) Simple Network Management Protocol (SNMP) (C) Simple Object Access Protocol (SOAP) (D) Simple Mail Transfer Protocol (SMTP) 13. Match the following with respect to relationship between objects and classes : List I List II a. State i. Useful for both diagram abstract modelling and for designing actual program b. Object ii. Describes object diagram classes c. Class iii. Useful for diagram documenting test cases d. Instance iv. Describing the diagram behaviour of a single class of objects. Codes : a b c d (A) iv i ii iii (B) ii iii iv i (C) iii iv ii i (D) ii iv i iii Match the following style rules for reusability : List I List II a. Keep i. Write a method to methods get the last element coherent of a list b. Keep ii. Maintain parallel methods structure when small possible c. Keep iii. Breaking a method methods into smaller parts consistent d. Provide iv. Performs a single uniform function or a group coverage of closely related functions. Codes : a b c d (A) iv iii ii i (B) ii i iv iii (C) iii iv ii i (D) ii iii iv i The document that is used by XSLT to indicate, how to transform the elements of the XML document to another format is (A) HTML page (B) DOC type procedure (C) Style sheet (D) Stored procedure Paper-III 14. Which of the following concepts means adding new concepts to a program as it runs ? (A) Data hiding (B) Dynamic loading (C) Dynamic typing (D) Dynamic binding 15. Which of the following correctly describes overloading of functions ? (A) Virtual polymorphism (B) Transient polymorphism (C) Ad-hoc polymorphism (D) Pseudo polymorphism 16. 20. Match the following with respect to programming languages : List I List II a. Structured i. JAVA Language b. Non-structured ii. BASIC Language c. Object Oriented iii. PASCAL Programming Language d. Interpreted iv. FORTRAN Programming Language Codes : a b c d (A) iii iv i ii (B) iv iii ii i (C) ii iv i iii (D) ii iii iv i 17. 19. The compiler converts all operands upto the type of the largest operand is called (A) Type Promotion (B) Type Evaluation (C) Type Conversion (D) Type Declaration 18. 21. Given the following statements : S1 : The grammars S asb | bsa | ss | a and S asb | bsa | a are not equivalent. S2 : The grammars S ss | sss | asb | bsa | and S ss | asb | bsa | are equivalent. Which of the following is true ? (A) S1 is correct and S2 is not correct. (B) Both S1 and S2 are correct. (C) S1 is not correct and S2 is correct. (D) Both S1 and S2 are not correct. C++ actually supports the following two complete dynamic systems : (A) One defined by C++ and the other not defined by C. (B) One defined by C and one specific to C++ (C) Both are specific to C++ (D) Both of them are improvements of C Paper-III Important advantage of using new and delete operators in C++ is (A) Allocation of memory (B) Frees the memory previously allocated (C) Initialization of memory easily (D) Allocation of memory and frees the memory previously allocated. Match the following control strategies of prolog : List I List II a. Forward i. Variable can be movement done with a constant, another variable or a function. b. Unificaii. The entire tion conjunctive goal is executed. c. Deep back- iii. Previous sub goal tracking to find alternative solutions. d. Shallow iv. Chooses sub goal backwith possible tracking unifier. Codes : a b c d (A) iv i ii iii (B) ii iv i iii (C) iii i iv ii (D) ii iii iv i 4 D-87-13 22. What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below : (A) 11 (C) 01 23. 24. 25. 26. 27. In alpha-beta pruning, _________ is used to cut off the search at maximizing level only and _________ is used to cut off the search at minimizing level only. (A) alpha, beta (B) beta, alpha (C) alpha, alpha (D) beta, beta 28. If A and B are two fuzzy sets with membership functions A(x) = {0.2, 0.5, 0.6, 0.1, 0.9} B(x) = {0.1, 0.5, 0.2, 0.7, 0.8} Then the value of A B will be (A) {0.2, 0.5, 0.6, 0.7, 0.9} (B) {0.2, 0.5, 0.2, 0.1, 0.8} (C) {0.1, 0.5, 0.6, 0.1, 0.8} (D) {0.1, 0.5, 0.2, 0.1, 0.8} 29. The height h(A) of a fuzzy set A is defined as h(A) = sup A(x) x A Then the fuzzy set A is called normal when (A) h(A) = 0 (B) h(A) < 0 (C) h(A) = 1 (D) h(A) < 1 (B) 10 (D) 00 High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences ? (A) Morphological (B) Syntactic (C) Semantic (D) Pragmatic The objective of ________ procedure is to discover at least one ________ that causes two literals to match. (A) unification, validation (B) unification, substitution (C) substitution, unification (D) minimax, maximum If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from the current node to the goal node, then A* algorithm gives an optimal solution if (A) h* is equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these D-87-13 The mean-end analysis process centers around the detection of differences between the current state and goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator can not be applied to the current state. So a sub-problem of getting to a state in which it can be applied is set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the precondition of operators is called (A) backward planning (B) goal stack planning (C) operator subgoaling (D) operator overloading 5 Paper-III 30. An artificial neuron receives n inputs x1, x2,...., xn with weights w1, w2,...., wn attached to the input links. The weighted sum ________ is computed to be passed on to a non-linear filter called activation function to release the output. (A) wi (B) xi (C) wi + xi (D) wi xi 33. The message 11001001 is to be transmitted using the CRC polynomial x3 + 1 to protect it from errors. The message that should be transmitted is (A) 110010011001 (B) 11001001 (C) 110010011001001 (D) 11001001011 31. Consider the formula in image processing 1 RD = 1 C R n1 Where CR = n 2 34. _________ comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. (A) 2n 2 (B) n + floor (lg n) 2 3n (C) floor 2 2 (D) 2 lg n 2 35. Let A and B be two n n matrices. The efficient algorithm to multiply the two matrices has the time complexity (A) O(n3) (B) O(n2.81) (C) O(n2.67) (D) O(n2) CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative _________ of the first data set. (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation 32. 36. Find the false statement : (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product. (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption. Paper-III n The recurrence relation T(n) = m T 2 tan2 is satisfied by (A) O(n2) (B) O(n1g m) (C) O(n2 lg n) (D) O(n 1g n) 37. 38. 6 The longest common subsequence of the sequences X = <A, B, C, B, D, A, B> and Y = <B, D, C, A, B, A> has length (A) 2 (B) 3 (C) 4 (D) 5 Assuming there are n keys and each key is in the range [0, m 1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n + m) D-87-13 39. A _________ complete subgraph and a _________ subset of vertices of a graph G = (V, E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal 40. Pumping lemma for context-free languages states : Let L be an infinite context free language. Then there exists some positive integer m such that any w L with |w| m can be decomposed as w = uv xy Z with |vxy| _________ . 43. What is the bit rate for transmitting uncompressed 800 600 pixel colour frames with 8 bits/pixel at 40 frames/second ? (A) 2.4 Mbps (B) 15.36 Mbps (C) 153.6 Mbps (D) 1536 Mbps 44. In IPV 4, the IP address 200.200.200.200 belongs to (A) Class A (B) Class B (C) Class C (D) Class D 45. Which layer of OSI reference model is responsible for decomposition of messages and generation of sequence numbers to ensure correct re-composition from end to end of the network ? (A) Physical (B) Data-link (C) Transport (D) Application 46. A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in response to a request ? (Note that the speed of light in air is 3,00,000 km/second). (A) 133.33 m sec (B) 266.67 m sec (C) 400.00 m sec (D) 533.33 m sec 47. The start and stop bits are used in serial communication for (A) error detection (B) error correction (C) synchronization (D) slowing down the communication 48. _________ is a type of transmission impairment in which the signal looses strength due to the resistance of the transmission medium. (A) Attenuation (B) Distortion (C) Noise (D) Decibel . and |vy| _________ such that uvz xyz . Z L for all z = 0, 1, 2, ....... . (A) m, 1 (B) m, 1 (C) m, 1 (D) m, 1 41. The Greibach normal form grammar for the language L = {an bn + 1 | n 0} is (A) S a SB, B bB | (B) S a SB, B bB | b (C) S a SB | b, B b (D) S a Sb | b 42. Given the following statements : S1 : Every context-sensitive language L is recursive. S2 : There exists a recursive language that is not context sensitive. Which statement is correct ? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct. D-87-13 7 Paper-III 49. 50. 51. Match the following : List I List II a. Indexed i. is not used when an Addressing operand is moved from memory into a register or from a register to memory. b. Direct ii. Memory address is Addressing computed by adding up two registers plus an (optional) offset. c. Register iii. Addressing Addressing memory by giving a register plus a content offset. d. Baseiv. can only be used to Indexed access global Addressing variables whose address is known at compile time. Codes : a b c d (A) ii i iv iii (B) ii iv i iii (C) iii iv i ii (D) iii i iv ii 52. 53. What will be the output of the following logic diagram ? (A) (B) (C) (D) x OR y x AND y x XOR y x XNOR y 54. Synchronization is achieved by a timing device called a ________ which generates a periodic train of ________. (A) clock generator, clock pulse (B) master generator, clock pulse (C) generator, clock (D) master clock generator, clock pulse The essential difference between traps and interrupts is (A) traps are asynchronous and interrupts are synchronous with the program. (B) traps are synchronous and interrupts are asynchronous with the program. (C) traps are synchronous and interrupts are asynchronous with the I/O devices. (D) None of these. 55. Which of the following is a design criteria for instruction formats ? (A) The size of instructions (B) The number of bits in the address fields (C) The sufficient space in the instruction format to express all the operations desired. (D) All of these Paper-III Serial access memories are useful in applications where (A) Data consists of numbers (B) Short access time is required (C) Each stored word is processed differently. (D) None of these Consider the following ER diagram : The minimum number of tables required to represent M, N, P, R1, R2 is (A) 2 (B) 3 (C) 4 (D) 5 8 D-87-13 56. Consider the following schemas : Branch = (Branch-name, Assets, Branch-city) Customer = (Customer-name, Bank name, Customer-city) Borrow = (Branch-name, loan number, customer account-number) Deposit = (Branch-name, Accountnumber, Customer-name, Balance) Using relational Algebra, the Query that finds customers who have balance more than 10,000 is _______ (A) customer-name ( balance > 58. Consider the table Student (stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5 ? Q.1. Select S.stuid From student S Where not exists (select from student e where e course = 5 and e marks s marks) Q.2. Select s.stu.id From student S Where s marks > any (select distinct marks from student S where s course = 5) (A) Q. 1 (B) Q. 2 (C) Both Q. 1 and Q. 2 (D) Neither Q. 1 nor Q. 2 59. Armstrong (1974) proposed systematic approach to derive functional dependencies. Match the following w.r.t. functional dependencies : List I List II a. Decomi. If X Y and position Z W then rule {X, Z} {Y, W} b. Union rule ii. If X Y and {Y, W} Z then {X, W} Z c. Comiii. If X Y and X Z position then X {Y, Z} rule d. Pseudo iv. If X {Y, Z} transitivity then X Y and rule X Z Codes : a b c d (A) iii ii iv i (B) i iii iv ii (C) ii i iii iv (D) iv iii i ii 10000(Deposit) (B) customer-name ( balance > 10000(Deposit) (C) customer-name ( balance > 10000(Borrow) (D) customer-name ( balance > 10000(Borrow) 57. Find the false statement : (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999) (B) A weak relationship occurs when two relationship types are linked by either EventPrecedent sequence or Condition-Precedent sequence. (C) Conceptual model is not accurate representation of Universe of interest . (D) Ternary, Quaternary and Quintary relationships are shown through a series of application scenario s and vignette s. D-87-13 9 Paper-III 60. 61. 62. 63. Match the following : List I List II a. Secondary i. Functional Index Dependency b. Nonii. B-Tree procedural Query Language c. Closure of iii. Relational Algebraic set of Operation Attributes d. Natural iv. Domain Calculus JOIN Codes : a b c d (A) i ii iv iii (B) ii i iv iii (C) i iii iv ii (D) ii iv i iii 64. 65. Which of the following is not true with respect to a trackball and/or spaceball ? I. A trackball is a two dimensional positioning device while as a spaceball provides six degrees of freedom. II. Unlike the trackball a spaceball does not actually move. III. A trackball is a three dimensional positioning device while as a spaceball provides six degrees of freedom. (A) I & II (B) II & III (C) II only (D) III only 66. Which of the following statement(s) is (are) true ? I. Two successive translations are additive. II. Two successive rotations are additive. III. Two successive scaling operations are multiplicative. (A) I and II (B) I and III (C) II and III (D) All the above Paper-III Given below are three basic rules : I. Squash and Stretch II. Slow-in and Slow-out III. To stage the action properly These rules are applied in case of (A) Rendering (B) Morphing (C) Animation (D) All the above Which of the following points lies on the same side as the origin, with reference to the line 3x + 7y = 2 ? (A) (3, 0) (B) (1, 0) (C) (0.5, 0.5) (D) (0.5, 0) The transformation matrix required for conversion of CMY colour model to RGB colour model is given as : R C 1 G = M 1 (A) B Y 1 R C 1 G = M 2 (B) B Y 3 R 1 C G = 1 M (C) B 1 Y R C 0.5 G = M 0.5 (D) B Y 0.5 What steps shall be required to rotate an object about the point P1 (as shown in fig. 1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig. 2) ? I. II. III. IV. (A) (B) (C) (D) 10 Translate P1 to origin Scale as required Rotate Translate to the final position P2. I, II and III II, III and IV I, III & IV All of the above D-87-13 67. In Unix, how do you check that two given strings a and b are equal ? (A) test $a eq $b (B) test $a equal $b (C) test $a = $b (D) Sh C test $a = = $b 68. In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called (A) NTFS file system (B) Hardware abstraction layer (C) Microkernel (D) Process Manager 69. 73. Which statement is not true about process O in the Unix operating system ? (A) Process O is called init process. (B) Process O is not created by fork system call. (C) After forking process 1, process O becomes swapper process. (D) Process O is a special process created when system boots. 74. Translation Look-aside Buffer (TLB) is (A) a cache-memory in which item to be searched is compared one-by-one with the keys. (B) a cache-memory in which item to be searched is compared with all the keys simultaneously. (C) an associative memory in which item to be searched is compared one-by-one with the keys. (D) an associative memory in which item to be searched is compared with all the keys simultaneously. The directory structure used in Unix file system is called (A) Hierarchical directory (B) Tree structured directory (C) Directed acyclic graph (D) Graph structured directory Which of the following commands would return process_id of sleep command ? (A) Sleep 1 and echo $? (B) Sleep 1 and echo $# To place a sound into a word document, following feature of windows is used : (A) Clip board (B) Task switching (C) C Win App (D) OLE 70. 72. 71. (C) Sleep 1 and echo $ (D) Sleep 1 and echo $! 75. Simplest way of deadlock recovery is (A) Roll back (B) Preempt resource (C) Lock one of the processes (D) Kill one of the processes D-87-13 11 Possible thread states in Windows 2000 operating system include : (A) Ready, running and waiting (B) Ready, standby, running, waiting, transition and terminated (C) Ready, running, waiting, transition and terminated (D) Standby, running, transition and terminated Paper-III Space For Rough Work Paper-III 12 D-87-13

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)

Vishwanath Koli
(50)

nianee
(16)

Selestin Muthu
(8)

Yawar Zafar
(3)

Formatting page ...

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: