Trending ▼   ResFinder  

UGC NET :JUNE 2012 COMPUTER SCIENCE AND APPLICATION PAPER IIi

12 pages, 75 questions, 33 questions with responses, 32 total responses,    0    0
phaninet
   		+Fave Message
ProfileTimelineUploads
 Home > phaninet >

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) ____________________________ J 87 12 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. J-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. 2. 3. 4. What is Granularity ? (A) The size of database (B) The size of data item (C) The size of record (D) The size of file 5. Suppose that a given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl s law is (A) 4.22 (B) 3.22 (C) 3.32 (D) 3.52 6. Consider the following pseudocode segment : K:=0 for i1:= l to n for i2:= 1 to i1 : : : for im:= 1 to im 1 K:= K+1 The value of K after the execution of this code shall be (A) C(n + m 1, m) (B) C(n m + 1, m) (C) C(n + m 1, n) (D) C(n m + 1, n) If two fuzzy sets A and B are given with membership functions A(x) = {0.2, 0.4, 0.8, 0.5, 0.1} In Delta Rule for error minimization (A) weights are adjusted w.r.to change in the output (B) weights are adjusted w.r.to difference between desired output and actual output (C) weights are adjusted w.r.to difference between input and output (D) none of the above B(x) = {0.1, 0.3, 0.6, 0.3, 0.2} Then the value of will be A B (A) {0.9, 0.7, 0.4, 0.8, 0.9} (B) {0.2, 0.4, 0.8, 0.5, 0.2} (C) {0.1, 0.3, 0.6, 0.3, 0.1} (D) {0.7, 0.3, 0.4, 0.2, 0.7} The concept of pipelining is most effective in improving performance if the tasks being performed in different stages : (A) require different amount of time (B) require about the same amount of time (C) require different amount of time with time difference between any two tasks being same (D) require different amount with time difference between any two tasks being different Paper-III 7. 2 Match the following : (i) OLAP (a) Regression (ii) OLTP (b) Data Warehouse (iii) Decision (c) RDBMS Tree (iv) Neural (d) Classification Network (i) (ii) (iii) (iv) (A) (b) (c) (a) (d) (B) (b) (c) (d) (a) (C) (c) (b) (a) (d) (D) (c) (b) (d) (a) J-87-12 8. If the pixels of an image are shuffled then the parameter that may change is (A) Histogram (B) Mean (C) Entropy (D) Covariance 15. 9. 14. Which level of Abstraction describes what data are stored in the Database ? (A) Physical level (B) View level (C) Abstraction level (D) Logical level The common property of functional language and logical programming language : (A) Both are declarative The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is ________. (A) Temporary Select Problem (B) Temporary Modify Problem (C) Dirty Read Problem (D) None (B) Both are based on -calculus (C) Both are procedural (D) Both are functional 16. 10. Which of the following can be used for clustering of data ? (A) Single layer perception (B) Multilayer perception (C) Self organizing map (D) Radial basis function Let Q(x, y) denote x + y = 0 and let there be two quantifications given as X.25 is ________ Network. (A) Connection Oriented Network (B) Connection Less Network (C) Either Connection Oriented or Connection Less (D) Neither Connection Oriented nor Connection Less 12. 17. In an image compression system 16384 bits are used to represent 256 256 image with 256 gray levels. What is the compression ratio for this system ? (A) 1 (B) 2 (C) 4 (D) 8 11. Given the following statements : (i) The power of deterministic finite state machine and nondeterministic finite state machine are same. (ii) The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same. Which of the above is the correct statement(s) ? (A) Both (i) and (ii) (B) Only (i) (C) Only (ii) (D) Neither (i) nor (ii) 13. (i) (ii) x y Q(x, y) where x & y are real numbers. Then which of the following is valid ? (A) (i) is true & (ii) is false. (B) (i) is false & (ii) is true. (C) (i) is false & (ii) is also false. (D) both (i) & (ii) are true. Which of the following is scheme to deal with deadlock ? (A) Time out (B) Time in (C) Both (A) & (B) (D) None of the above J-87-12 y x Q(x, y) 3 Paper-III 18. 22. 19. 20. A* algorithm uses f ' = g + h' to estimate the cost of getting from the initial state to the goal state, where g is a measure of the cost of getting from initial state to the current node and the function h' is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should set (A) g = 1 (B) g = 0 (C) h' = 0 (D) h' = 1 Paper-III Which is not the correct statement(s) ? (i) Every context sensitive language is recursive. (ii) There is a recursive language that is not context sensitive. (A) (i) is true, (ii) is false. (B) (i) is true and (ii) is true. (C) (i) is false, (ii) is false. (D) (i) is false and (ii) is true. 26. Data Warehouse provides (A) Transaction Responsiveness (B) Storage, Functionality Responsiveness to queries (C) Demand and Supply Responsiveness (D) None of the above The _______ memory allocation function modifies the previous allocated space. (A) calloc( ) (B) free( ) (C) malloc( ) (D) realloc( ) 25. The quantiser in an image-compression system is a (A) lossy element which exploits the psychovisual redundancy (B) lossless element which exploits the psychovisual redundancy (C) lossy element which exploits the statistical redundancy (D) lossless element which exploits the statistical redundancy Which one of the following prolog programs correctly implement if G succeeds then execute goal P else execute goal ? (A) if-else (G, P, ) :- !, call(G), call(P). if-else (G, P, ) :- call( ). (B) if-else (G, P, ) :- call(G), !, call(P). if-else (G, P, ) :- call( ). (C) if-else (G, P, ) :- call(G), call(P), !. if-else (G, P, ) :- call( ). (D) All of the above 24. (A) Dependency preserving but not lossless join (B) Dependency preserving and lossless join (C) Lossless Join but not dependency preserving (D) Lossless Join The transform which possesses the highest energy compaction property is (A) Slant transform (B) Cosine transform (C) Fourier transform (D) Karhunen-Loeve transform 23. Consider a schema R(A, B, C, D) and functional dependencies A B and C D. Then the decomposition R1(A, B) and R2(C, D) is The mechanism that binds code and data together and keeps them secure from outside world is known as (A) Abstraction (B) Inheritance (C) Encapsulation (D) Polymorphism J-87-12 21. 4 27. 28. 32. Identify the addressing modes of below instructions and match them : (a) ADI (1) Immediate addressing (b) STA (2) Direct addressing (c) CMA (3) Implied addressing (d) SUB (4) Register addressing (A) a 1, b 2, c 3, d 4 (B) a 2, b 1, c 4, d 3 (C) a 3, b 2, c 1, d 4 (D) a 4, b 3, c 2, d 1 (a) 33. (d) Which one of the following is not a Greibach Normal form grammar ? (i) S a | bA | aA | bB A a B b (ii) S a | aA | AB A a B b (iii) S a | A | aA A a (A) (i) and (ii) (B) (i) and (iii) (C) (ii) and (iii) (D) (i), (ii) and (iii) 29. 30. 31. Which of the following IP address class is a multicast address ? (A) Class A (B) Class B (C) Class C (D) Class D Which one of the following statements is incorrect ? (A) The number of regions corresponds to the cyclomatic complexity. (B) Cyclometric complexity for a flow graph G is V(G) = N E + 2, where E is the number of edges and N is the number of nodes in the flow graph. (C) Cyclometric complexity for a flow graph G is V(G) = E N + 2, where E is the number of edges & N is the number of nodes in the flow graph. (D) Cyclometric complexity for a flow graph G is V(G) = P + 1, where P is the number of predicate nodes contained in the flow graph G. 34. The upper bound of computing time of m coloring decision problem is (A) O(nm) (B) O(nm) (C) O(nmn) (D) O(nmmn) 5 Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex s to u has weight 53 and shortest path from s to v has weight 65. Which statement is always true ? (A) Weight (u, v) < 12 (B) Weight (u, v) = 12 (C) Weight (u, v) > 12 (D) Weight (u, v) > 12 35. While unit testing a module, it is found that for a set of test data, maximum 90% of the code alone were tested with a probability of success 0.9. The reliability of the module is (A) atleast greater than 0.9 (B) equal to 0.9 (C) atmost 0.81 (D) atleast 1/0.81 J-87-12 The equivalent grammar corresponding to the grammar G : S aA, A BB, B aBb | is (A) S aA, A BB, B aBb (B) S a|aA, A BB, B aBb | ab (C) S a | aA, A BB | B, B aBb (D) S a | aA, A BB | B, B aBb | ab Consider the regular expression (a + b) (a + b) (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains (A) n states (B) n + 1 states (C) n + 2 states (D) 2n states Paper-III 36. Number of binary trees formed with 5 nodes are (A) 32 (B) 36 (C) 120 (D) 42 37. Are we building the right product ? This statement refers to (A) Verification (B) Validation (C) Testing (D) Software quality assurance 38. 39. 40. 42. (A) The following postfix expression is evaluated using a stack 823^/23* + 51* The top two elements of the stack after first * is evaluated (A) 6, 1 (B) 5, 7 (C) 3, 2 (D) 1, 5 (B) The following CFG S aB | bA, A a | as | bAA, B b | bs | aBB generates strings of terminals that have (A) odd number of a s and odd number of b s (B) even number of a s and even number of b s (C) equal number of a s and b s (D) not equal number of a s and b s (C) (D) Consider the following pseudo-code : If (A > B) and (C > D) then A=A+1 B=B+1 Endif The cyclomatic complexity of the pseudo-code is (A) 2 (B) 3 (C) 4 (D) 5 43. The regular expression following DFA for the is (A) ab*(b + aa*b)* 41. Which layer of OSI reference model uses the ICMP (Internet Control Message Protocol) ? (A) Transport layer (B) Data link layer (C) Network layer (D) Application layer Paper-III Which one of the following binary search tree is optimal, if probabilities of successful search and unsuccessful search are same ? (B) a*b(b + aa*b)* (C) a*b(b* + aa*b) (D) a*b(b * + aa*b)* 6 J-87-12 44. 45. 46. How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric ? (A) 2n(n+1)/2 and 2n.3n(n 1)/2 (B) 3n(n 1)/2 and 2n(n 1) (C) 2n(n+1)/2 and 3n(n 1)/2 (D) 2n(n+1)/2 and 2n(n 1)/2 51. The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is (A) Minmax strategy (B) Alpha-beta pruning strategy (C) Constraint satisfaction strategy (D) Static max strategy 52. A polygon Unbounded feasible region A point None of these Match the following : (i) Regular (a) Grammar (ii) Context free (b) Grammar (iii) Unrestricted Grammar The colour of an object is largely determined by its diffuse reflection coefficient. If Kd = (0.8, 0.4, 0), then what shall be the colour of the object, if the light used is blue and magenta ? (A) White and Red (B) Red and Blue (C) Black and White (D) Black and Red J-87-12 In any simplex table, if corresponding to any negative j, all elements of the column are negative or zero, the solution under the test is (A) degenerate solution (B) unbounded solution (C) alternative solution (D) non-existing solution 50. The feasible region represented by the constraints x1 x2 < 1, x1 + x2 > 3, x1 > 0, x2 > 0 of the objective function Max Z = 3x1 + 2x2 is If an instruction takes i microseconds and a page fault takes an additional j microseconds. The effective instruction time, if on the average a page fault occurs every k instructions, is (A) i + j/k (B) i + j * k (C) (i + j)/k (D) (i + j) * k 49. A computer system supports 32 bit virtual address as well as 32 bit physical addresses. Since the virtual address space is of same size as that of physical address space, if we want to get rid of virtual memory, which one of the following is true ? (A) Efficient implementation of multiuser support is no longer possible. (B) The processor cache can be made more efficient. (C) Hardware support for memory management is not needed. (D) CPU scheduling can be made more efficient. (A) (B) (C) (D) 47. 48. Which diagram provides a formal graphic notation for modelling objects, classes and their relationships to one another ? (A) Object diagram (B) Class diagram (C) Instance diagram (D) Analysis diagram Pushdown automaton Linear bounded automaton (c) Deterministic finite automaton (d) Turing machine (iv) Context Sensitive Grammar (i) (ii) (iii) (iv) (A) (c) (a) (b) (d) (B) (c) (a) (d) (b) (C) (c) (b) (a) (d) (D) (c) (b) (d) (a) 7 Paper-III 53. 57. A user level process in Unix traps the signal sent on a Ctrl + C input and has a signal handling routine that saves appropriate files before terminating the process. When a Ctrl + C input is given to this process, what is the mode in which the signal handling routine executes ? (A) User mode (B) Kernel mode (C) Superuser mode (D) Privileged mode 58. A CPU generally handles an interrupt by executing an interrupt service routine (A) as soon as an interrupt is raised (B) by checking the interrupt register at the end of fetch cycle (C) by checking the interrupt register after finishing the executing the current instruction (D) by checking the interrupt register at fixed time intervals 59. Consider the below circuit and find the output function f(x, y, z). The perspective projection matrix, on the view plane z = d where the centre of projection is the origin (0, 0, 0) shall be 000d (A) x + xy + z yz (B) x + xy + z yz xz + xy + yz (D) xz + x + y yz (C) 54. What is the size (in terms of bits) of Header length field in IPV4 header ? (A) 2 (B) 4 (C) 8 (D) 16 55. Match the following with respect to java.util.* class methods : (a) Bit Set (i) Time zone getTimezone( ) (b) Calendar (ii) int hashcode( ) (c) Time zone (iii) int nextInt( ) (d) Random (iv) Void setID(String tzName) (a) (b) (c) (d) (A) (ii) (i) (iv) (iii) (B) (iii) (iv) (i) (ii) (C) (iv) (iii) (ii) (i) (D) (ii) (i) (iii) (iv) 56. (A) (B) ______ is sometimes said to be object oriented, because the only way to manipulate kernel objects is by invoking methods on their handles. (A) Windows NT (B) Windows XP (C) Windows VISTA (D) Windows 95/98 Paper-III (C) (D) 8 0 0 d 0 0 d 0 0 d d 0 0 0 0 1 0 0 d 0 0 0 0 d 0 0 0 0 0 1 0 0 d 0 0 d 0 0 d 0 0 1 d 0 0 0 0 0 0 0 d 0 0 0 0 d 0 0 0 0 1 J-87-12 60. Radio signals generally propagate according to the following mechanisms: (A) Modulation, Scattering Reflection, Diffraction, Scattering (C) Amplification, Modulation (B) If both end points are left, right, above or below the window, the line is completely visible. (C) Diffraction, (D) Reflection, Diffraction If both end points are left, right, above or below the window, the line is trivially visible. Amplification, Identify the devices given below with their IC numbers : (i) USART (b) 8051 (iii) Interrupt controller (c) 8259 (iv) DMA controller (D) If both end points are left, right, above or below the window, the line is trivially invisible. (a) 8251 (ii) Micro controller (d) 8257 (i) (a) (b) (c) (d) (B) (b) (a) (d) (c) (C) (c) (d) (a) (b) (D) (d) (a) (b) 64. (ii) (iii) (iv) (A) 62. If a and b are the end points of a line, then which one of the following is true ? (A) If both end points are left, right, above or below the window, the line is invisible. Amplification, (B) 61. 63. (c) Match the following with link quality measurement and handoff initiation : (a) Networked- (i) Controlled Handoff (NCHO) (b) MobileAssisted Handoff (MAHO) II III A 8 26 17 11 B 13 28 4 26 C 38 19 18 15 D 19 26 24 (iii) First Generation Analog Cellular System (d) Hard Handoff IV (ii) Process channel target BS (c) Forward Handoff The optimal solution of the following assignment problem using Hungarian method is I MS connect to BS (iv) Second Generation Digital Cellular System 10 (b) (c) (d) (II) (III) (IV) (A) (iii) (iv) (ii) (i) (I) (III) (II) (IV) (B) (ii) (iii) (i) (iv) (I) (III) (IV) (II) (C) (ii) (iv) (iii) (D) (I) (IV) (II) (III) (D) (iv) (iii) (A) (B) (A) (I) (B) (C) J-87-12 (a) via the (C) (D) 9 (i) (i) (ii) Paper-III 65. 68. Consider the methods used by processes P1 and P2 for accessing their critical sections. The initial values of shared Boolean variables S1 and S2 are randomly assigned, P1 (A) ISO 8878 P2 (B) critical section critical section S1 = S2; S1 = S2; but Progress exclusion (C) 66. (B) (C) 3 KHz 10 1 KHz Restart the computers in normal mode. (C) Shutdown the computer terminating all the running applications. and (D) Shutdown the computer without closing the running applications. If the period of a signal is 1000 ms, then what is its frequency in kilohertz ? (A) 10 67. mutual exclusion What is the meaning of Hibernate in Windows XP/Windows 7 ? (A) Restart the computers in safe mode. Neither mutual exclusion nor progress (D) Both mutual progress not 69. not (B) ISO 8880 (D) ISO 8881 Which one of the following statements describes the properties achieved ? but ISO 8879 (C) while (S1 = = S2); while (S1 = = S2); (A) Mutual exclusion progress HTML is defined using SGML an _______ standard, information processing-text and office systems (SGML) for text information processing. (B) 10 2 70. KHz (D) 1 KHz Let a * H and b * H be two cosets of H. (i) (A) Derived class constructor followed by Base class constructor. Either a * H and b * H are disjoint (ii) Assume that we have constructor functions for both base class and derived class. Now consider the declaration in main( ). Base * P = New Derived; in what sequence will the constructor be called ? a * H and b * H are identical (B) Base class constructor followed by derived class constructor. (C) Then, Base class constructor will not be called. (A) only (i) is true (B) only (ii) is true (C) (i) or (ii) is true (D) Derived class constructor will not be called. (D) (i) and (ii) is false Paper-III 10 J-87-12 71. Which one of the following options is not a shell in UNIX system ? 74. On a disk with 1000 cylinders (0 to 999) find the number of tracks, (A) Bourne Shell the disk arm must move to satisfy all (B) C Shell the requests in the disk queue. Assume (C) Net Shell the last request service was at track 345 and the head is moving toward (D) Korn Shell track 0. The queue in FIFO order contains requests for the following tracks : 123, 874, 692, 475, 105, 376 72. (Assume SCAN algorithm) (A) 2013 (B) (C) G1 and G2 are two graphs as shown : (A) Both G1 and G2 are planar graphs. (B) (C) 1219 1967 (D) 1507 Both G1 and G2 are not planar graphs. 75. G1 is planar and G2 is not planar graph. Halftoning is defined as (A) a technique to obtain increased visual resolution using multiple (D) G1 is not planar and G2 is planar graph. intensity levels. (B) a technique for using minimum number of intensity levels to 73. In which file the compiler manage the various objects, which are used in windows programming ? obtain increased visual resolution. (C) visual resolution using maximum (A) Control File (B) number of intensity levels. Binary File (C) a technique to obtain increased Text File (D) a technique for using appropriate number intensity levels to obtain (D) Obj File J-87-12 increased visual resolution. 11 Paper-III Space For Rough Work Paper-III 12 J-87-12

Formatting page ...

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)


phaninet
(32)

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


 

 


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

 

phaninet chat