Trending ▼   ResFinder  

UGC NET DEC 2012 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

11 pages, 75 questions, 75 questions with responses, 90 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-III 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 : 2 /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, 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 : 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 AND APPLICATIONS PAPER III Note : This paper contains seventy five (75) objective type questions of two (2) marks each. All questions are compulsory. 1. Eco system is a Frame work for (A) Building a Computer System (B) Building Internet Market (C) Building Offline Market (D) Building Market 2. The efficiency (E) and speed up (sp) for Multiprocessor with p processors satisfies : (A) E p and sp p (B) ______ is process of extracting previously non known valid and actionable information from large data to make crucial business and strategic decisions. (A) Data Management (B) Data base (C) Data Mining (D) Meta Data 6. The aspect ratio of an image is defined as (A) The ratio of width to its height measured in unit length. (B) The ratio of height to width measured in number of pixels. (C) The ratio of depth to width measured in unit length. (D) The ratio of width to depth measured in number of pixels. 7. E 1 and sp p (C) 5. Which of the following features will characterize an OS as multiprogrammed OS ? (a) More than one program may be loaded into main memory at the same time. (b) If a program waits for certain event another program is immediately scheduled. (c) If the execution of a program terminates, another program is immediately scheduled. (A) (a) only (B) (a) and (b) only (C) (a) and (c) only (D) (a), (b) and (c) only E p and sp 1 (D) E 1 and sp 1 3. 4. Match the following : List I List II a. Critical region 1. Hoares Monitor b. Wait/signal 2. Mutual exclusion c. Working set 3. Principal of locality d. Dead lock 4. Circular wait Codes : a b c d (A) 2 1 3 4 (B) 1 2 4 3 (C) 2 3 1 4 (D) 1 3 2 4 The technique of temporarily delaying outgoing acknowledgements so that they can be hooked onto the next outgoing data frame is known as (A) Bit stuffing (B) Piggy backing (C) Pipelining (D) Broadcasting Paper-III 2 D-87-12 8. Using RSA algorithm, what is the value of cipher text C, if the plain text M = 5 and p = 3, q = 11 & d = 7 ? (A) 33 (B) 5 (C) 25 (D) 26 9. 11. You are given an OR problem and a XOR problem to solve. Then, which one of the following statements is true ? (A) Both OR and XOR problems can be solved using single layer perception. (B) OR problem can be solved using single layer perception and XOR problem can be solved using self organizing maps. (C) OR problem can be solved using radial basis function and XOR problem can be solved using single layer perception. (D) OR problem can be solved using single layer perception and XOR problem can be solved using radial basis function. The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity ? (n and m are no. of nodes and edges respectively) a. Bellman Ford 1. O (m log n) algorithm b. Kruskals algorithm 2. O (n3) c. Floyd Warshall algorithm d. Topological sorting Codes : a b c (A) 3 1 2 (B) 2 4 3 (C) 3 4 1 (D) 2 1 3 12. 3. O(mn) 4. O(n + m) d 4 1 2 4 Let V1 = 2I J + K and V2 = I + J K, then the angle between V1 & V2 and a vector perpendicular to both V1 & V2 shall be : (A) 90 and ( 2I + J 3K) (B) 10. (C) Match the following : List I List II a. Application 1. TCP layer b. Transport 2. HDLC layer c. Network 3. HTTP layer d. Data link 4. BGP layer Codes : a b c d (A) 2 1 4 3 (B) 3 4 1 2 (C) 3 1 4 2 (D) 2 4 1 3 D-87-12 60 and (2I + J + 3K) 90 and (2I + J 3K) (D) 90 and ( 2I J + 3K) 13. Consider a fuzzy set A defined on the interval X = [0, 10] of integers by the membership Junction x A(x) = x + 2 Then the cut corresponding to = 0.5 will be (A) {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10} (B) {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} (C) {2, 3, 4, 5, 6, 7, 8, 9, 10} (D) { } 3 Paper-III 14. Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n, which of the following is TRUE ? (A) T(n) = O( n) (B) T(n) = O(log2n) 19. 16. In classful addressing, an IP address 123.23.156.4 belongs to ______ class format. (A) A (B) B (C) C (D) D 20. The Mandelbrot set used for the construction of beautiful images is based on the following transformation : xn + 1= x2 +z n 18. The no. of ways to distribute n distinguishable objects into k distinguishable boxes, so that ni objects are placed into box i, i = 1, 2, . k equals which of the following ? n! (A) n ! + n ! + ..... + n ! 1 2 k n! n1! n2! n3! ..... nk! (D) 21. n1! + n2! + ..... + nk! n1! n2! n3! ..... nk! (C) Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is 1, 2, 3, 4, 5 ? (A) 3, 2, 1, 5, 4 (B) 5, 4, 3, 2, 1 (C) 3, 4, 5, 2, 1 (D) 3, 4, 5, 1, 2 n1! n2! ..... nk! n1! n2! n3! ..... nk! How many solutions do the following equation have x1 + x2 + x3 = 11 where x1 1, x2 2, x3 3 (A) (B) (C) (D) In a Linear Programming Problem, suppose there are 3 basic variables and 2 non-basic variables, then the possible number of basic solutions are (A) 6 (B) 8 (C) 10 (D) 12 Paper-III activation (B) Here, (A) Both x & z are real numbers. (B) Both x & z are complex numbers. (C) x is real & z is complex. (D) x is complex & z is real. 17. following 1 (V) = Z + 1 + exp ( x V + Y) , * Z, X, Y are parameters (A) Step function (B) Ramp function (C) Sigmoid function (D) Gaussian function (C) T(n) = O(n) (D) T(n) = O(n2) 15. Identify the function : 22. 4 C(7, 11) C(11, 3) C(14, 11) C(7, 5) Which provides an interface to the TCP/IP suit protocols in Windows95 and Windows NT ? (A) FTP Active-X Control (B) TCP/IP Active-X Control (C) Calinsock Active-X Control (D) HTML Active-X Control D-87-12 23. 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) (B) (C) (D) 24. 25. 26. 27. 11 10 01 00 (A) 1.62 (B) 1.55 (C) If dual has an unbounded solution, then its corresponding primal has (A) no feasible solution (B) unbounded solution (C) feasible solution (D) none of these 1.85 (D) 1.285 28. The initial basic feasible solution to the following transportation problem using Vogel s approximation method is D1 The number of distinct bracelets of five beads made up of red, blue, and green beads (two bracelets are indistinguishable if the rotation of one yield another) is, (A) 243 (B) 81 (C) 51 (D) 47 D2 D3 D4 Supply S1 1 2 1 4 30 S2 3 3 2 1 50 S3 4 2 5 9 20 Demand 20 40 30 10 (A) x11 = 20, x13 = 10, x21 = 20, x23 = 20, x24 = 10, x32 = 10, Total cost = 180 Which are the classifications of data used in Mobile Applications ? (A) Private data, User data, Shared data. (B) Public data, User data, Virtual data. (C) Private data, Public data, Shared data. (D) Public data, Virtual data, User data. D-87-12 In an enhancement of a CPU design, the speed of a floating point unit has been increased by 20% and the speed of a fixed point unit has been increased by 10%. What is the overall speed achieved if the ratio of the number of floating point operations to the number of fixed point operations is 2 : 3 and the floating point operation used to take twice the time taken by the fixed point operation in original design ? (B) x11 = 20, x12 = 20, x13 = 10, x22 = 20, x23 = 20, x24 = 10, Total cost = 180 (C) x11 = 20, x13 = 10, x22 = 20, x23 = 20, x24 = 10, x32 = 10, Total cost = 180 (D) None of the above 5 Paper-III 29. 58 lamps are to be connected to a single electric outlet by using an extension board each of which has four outlets. The number of extension boards needed to connect all the light is (A) 29 (B) 28 (C) 20 (D) 19 33. The Z-buffer algorithm is used for Hidden surface removal of objects. The maximum number of objects that can be handled by this algorithm shall (A) Depend on the application (B) be arbitrary no. of objects (C) Depend on the memory availability (D) Depend on the processor 30. Match the following with respect to the Mobile Computing Architecture. a. Downlink 1. 100 Mbps control b. Radio 2. Residency communication latency (RL) data rate c. The average 3. Sending data duration of user s from a BS to stay in cell MD d. FDDI 4. 2-Mbps bandwidth Codes : a b c d (A) 2 1 4 3 (B) 3 4 2 1 (C) 4 1 2 1 (D) 4 3 1 2 34. The power set of AUB, where A = {2, 3, 5, 7} and B = {2, 5, 8, 9} is (A) 256 (B) 64 (C) 16 (D) 4 35. In Win32, which function is used to create Windows Applications ? (A) Win APP (B) Win API (C) Win Main (D) Win Void 36. Suppose a processor does not have any stack pointer registers, which of the following statements is true ? (A) It cannot have subroutine call instruction. (B) It cannot have nested subroutine calls. (C) Interrupts are not possible. (D) All subroutine calls and interrupts are possible. 37. Everything below the system call interface and above the physical hardware is known as ______. (A) Kernel (B) Bus (C) Shell (D) Stub 31. 32. Which of the following flags are set when JMP instruction is executed ? (A) SF and CF (B) AF and CF (C) All flags (D) No flag is set A thread is a light weight process. In the above statement, weight refers to (A) time (B) number of resources (C) speed (D) All the above Paper-III 6 D-87-12 38. Which is not the correct statement ? 42. The grammar G1 S OSO| ISI | 0|1| and the grammar G2 is S as |asb| X, X Xa | a. Which is the correct statement ? (A) G1 is ambiguous, G2 is unambiguous (B) G1 is unambiguous, G2 is ambiguous (C) Both G1 and G2 are ambiguous (D) Both G1 and G2 are unambiguous 43. Consider n processes sharing the CPU in round robin fashion. Assuming that each process switch takes s seconds. What must be the quantum size q such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the CPU at least every t seconds ? t ns (A) q n 1 t ns (B) q n 1 t ns (C) q n + 1 t ns (D) q n + 1 44. The Default Parameter Mechanism is called as (A) Call by Value (B) Call by Reference (C) Call by Address (D) Call by Name 45. Which of the following regular expression identities are true ? (A) (r + s)* = r* s* (B) (r + s)* = r* + s* (C) (r + s)* = (r*s*)* (D) r* s* = r* + s* Paper-III (A) The class of regular sets is closed under homomorphisms. (B) The class of regular sets is not closed under inverse homomorphisms. (C) The class of regular sets is closed under quotient. (D) The class of regular sets is closed under substitution. 39. When a programming Language has the capacity to produce new datatype, it is called as, (A) Overloaded Language (B) Extensible Language (C) Encapsulated Language (D) Abstraction Language 40. Which of the following operating system is better for implementing client-server network ? (A) Windows 95 (B) Windows 98 (C) Windows 2000 (D) All of these 41. Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur ? (A) 7 (B) 9 (C) 10 (D) 13 D-87-12 7 Passing 46. Two graphs A and B are shown below : Which one of the following statement is true ? 47. Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure) (A) O (n log logn) Both A and B are planar. Neither A nor B is planar. A is planar and B is not. B is planar and A is not. The minimum number of states of the non-deterministic finite automation which accepts the language {a b a bn|n 0} {a b an|n 0} is (A) 3 (B) 4 (C) 5 (D) 6 48. 49. (B) 52. P P f(P + 1) (C) (n logn) (D) (n3/2) Let f be the fraction of a computation (in terms of time) that is parallelizable, P the number of processors in the system, and sp the speed up achievable in comparison with sequential execution then the sp can be calculated using the relation : 1 (A) 1 f f/P (B) (n logn) (C) Functions defined with class name are called as (A) Inline function (B) Friend function (C) Constructor (D) Static function 1 1 f + f/P P (D) P + f(P 1) Paper-III Which of the following definitions generates the same Language as L, where L = {WWR | W {a, b}*} (A) S asb|bsa| (B) S asa|bsb| (C) S asb|bsa|asa|bsb| (D) S asb|bsa|asa|bsb 51. (A) (B) (C) (D) 50. 8 Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping int i; program Main( ) { i = 10; call f ( ); } procedure f( ) { int i = 20; call g ( ); } procedure g( ) { print i; } Let x be the value printed under static scoping and y be the value printed under dynamic scoping. Then x and y are (A) x = 10, y = 20 (B) x = 20, y = 10 (C) x = 20, y = 20 (D) x = 10, y = 10 D-87-12 53. If the parse tree of a word w generated by a Chomsky normal form grammar has no path of length greater than i, then the word w is of length (A) no greater than 2i+1 (B) no greater than 2i (C) no greater than 2i 1 (D) no greater than i 54. The Object Modelling Technique (OMT) uses the following three kinds of model to describe a system (A) Class Model, Object Model and Analysis Model. (B) Object Model, Dynamic Model, and Functional Model. (C) Class Model, Dynamic Model and Functional Model. (D) Object Model, Analysis Model and Dynamic Model. 55. 56. 57. 58. Skolmization is the process of (A) bringing all the quantifiers in the beginning of a formula in FDL. (B) removing all the universal quantifiers. (C) removing all the existential quantifiers. (D) all of the above. 59. Which level of Abstraction describes how data are stored in the data base ? (A) Physical level (B) View level (C) Abstraction level (D) Logical level 60. The transform which possesses the multi-resolution property is (A) Fourier transform (B) Short-time-Fourier transform (C) Wavelet transform (D) Karhunen-Loere transform 61. The factors that determine the quality of a software system are (A) correctness, reliability (B) efficiency, usability, maintainability (C) testability, portability, accuracy, error tolerances, expandability, access control, audit. (D) All of the above Given the following statements : (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complementation. Which is/are the correct statements ? (A) only (i) (B) only (ii) (C) both (i) and (ii) (D) neither (i) nor (ii) Which one is a collection of templates and rules ? (A) XML (B) CSS (C) DHTML (D) XSL If a relation with a Schema R is decomposed into two relations R1 and R2 such that (R1 R2) = R1 then which one of the following is to be satisfied for a lossless joint decomposition ( indicates functional dependency) (A) (R1 R2) R1 or R1 R2 R2 (B) R1 R2 R1 (C) R1 R2 R2 (D) R1 R2 R1and R1 R2 R2 D-87-12 9 Paper-III 62. A program P calls two subprograms P1 and P2. P1 can fail 50% times and P2 40% times. Then P can fail 66. Match the following with respect to HTML tags and usage. a. CITE b. EM 60% (C) 10% 3. Represents to other source d. SAMP (B) 2. Represents output from programmes c. VAR (A) 50% 1. Italic representation 4. Argument to a programme (D) 70% 63. Third normal form is based on the concept of ______. Codes : a b c d (A) 3 (A) Closure Dependency 1 4 2 (B) Transitive Dependency (B) 2 3 1 4 (C) Normal Dependency (C) 4 2 3 1 (D) 1 3 4 1 (D) Functional Dependency 64. 67. If the Fourier transform of the function f(x, y) is F(m, n), then the Fourier transform of the function f(2x, 2y) is : (A) domain knowledge 1 m n (A) 4 F 2 , 2 (B) (B) 1 4 F (m, n) explanation facility (C) 1 4 F (2m, 2n) (C) An expert system shell is an expert system without reasoning with knowledge (D) all of the above 68. 1 m n (D) 4 F 4 , 4 An example of a dictionary-based coding technique is (A) Run-length coding ______ establishes information about when, why and by whom changes are made in a software. (A) Software Management. (B) 69. Configuration Which is the method used to retrieve the current state of a check box ? (A) get State ( ) Version Control. (B) put State ( ) (C) (D) An Audit Trail. Paper-III Predictive coding (D) LZW coding Change Control. (C) Huffman coding (C) 65. (B) retrieve State ( ) (D) write State ( ) 10 D-87-12 70. Referential integrity is directly related to 73. Match the following : a. Supervised 1. The decision learning system receives rewards for its action at the end of a sequence of steps. b. Unsupervised 2. Manual labels of learning inputs are not used. c. Re3. Manual labels of inforcement inputs are used. learning d. Inductive 4. System learns by learning example Codes : a b c d (A) 1 2 3 4 (B) 2 3 1 4 (C) 3 2 4 1 (D) 3 2 1 4 74. A* algorithm is guaranteed to find an optimal solution if (A) h' is always 0. (B) g is always 1. (C) h' never overestimates h. (D) h' never underestimates h. 75. Let (x, y, z) be the statement x + y = z and let there be two quantifications given as (A) Relation key (B) Foreign key (C) Primary key (D) Candidate key 71. You are given four images represented as 0 0 0 1 , I2 = , I1 = 0 0 0 0 0 1 1 1 , I4 = I3 = 1 0 1 0 The value of entropy is maximum for image (A) I1 (B) I2 (C) I3 (D) I4 72. A cryptarithmetic problem of the type SEND + MORE (i) x y Z (x, y, z) (ii) Z x y (x, y, z) Where x, y, z are real numbers. Then which one of the following is correct ? (A) (i) is true and (ii) is true. (B) (i) is true and (ii) is false. (C) (i) is false and (ii) is true. (D) (i) is false and (ii) is false. MONEY Can be solved efficiently using (A) depth first technique (B) breadth first technique (C) constraint satisfaction technique (D) bidirectional technique D-87-12 11 Paper-III Space For Rough Work Paper-III 12 D-87-12

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)


antonyms

(65)

netuser

(7)

Ashok Kumar

(5)

Ankit Khare

(3)

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

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