Trending ▼   ResFinder  

june 2013

8 pages, 0 questions, 0 questions with responses, 0 total responses,    0    0
geethubejith
  
+Fave Message
 Home > geethubejith >

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) ____________________________ Roll No. 2. (Signature) __________________________ (In figures as per admission card) (Name) ____________________________ 87 J Roll No.________________________________ (In words) 1 3 1 Time : 1 /4 hours] [Maximum Marks : 100 Number of Pages in this Booklet : 8 Instructions for the Candidates 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. 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 / polythene bag on the booklet. Do not accept a booklet without sticker-seal / without polythene bag 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 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-13 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. The candidates are required to select the most appropriate answer of each question. 1. 2. 3. 4. COCOMO stands for (A) COmposite COst MOdel (B) COnstructive COst MOdel (C) COnstructive COmposite MOdel (D) COmprehensive COnstruction MOdel (A) High module coupling, High module cohesion (B) High module coupling, Low module cohesion (C) Low module coupling, High module cohesion (D) Low module coupling, Low module cohesion Match the following : a. Good quality i. Program does not fail for a specified time in a given environment b. Correctness ii. Meets the functional requirements c. Predictable iii. Meets both functional and non-functional requirements d. Reliable iv. Process is under statistical control Codes : a b c d (A) iii ii iv i (B) ii iii iv i (C) i ii iv iii (D) i ii iii iv 5. Cyclometric complexity of a flow graph G with n vertices and e edges is (A) V(G) = e+n 2 (B) V(G) = e n+2 (C) V(G) = e+n+2 (D) V(G) = e n 2 6. When the following code is executed what will be the value of x and y ? int x = 1, y = 0; y = x++; (A) 2,1 (B) 2,2 (C) 1,1 (D) 1,2 While estimating the cost of software, Lines Of Code (LOC) and Function Points (FP) are used to measure which one of the following ? (A) Length of code (B) Size of software (C) Functionality of software (D) None of the above Paper-II A good software design must have 7. How many values can be held by an array A( 1,m;1,m) ? (A) m (B) m2 (C) m(m+1) (D) m(m+2) 2 J-87-13 8. What is the result of the expression (1&2)+(3/4) ? (A) 1 (B) 2 (C) 3 (D) 0 13. Which normal form is considered as adequate for usual database design ? (A) 2NF (B) 3NF (C) 4NF (D) 5NF 9. How many times the word print shall be printed by the following program segment ? for (i=1, i<2,i++) for (j=1,j<2,j++) for(k=1,k<2,k++) printf("print/n") (A) 1 (B) 3 (C) 6 (D) 8 14. If D1,D2, .. ..Dn are domains in a relational model, then the relation is a table, which is a subset of (A) D1+D2+ +Dn 10. D1 D2 Dn (D) D1 D2 Dn 15. Which of the following addresses is used to deliver a message to the correct application program running on a host ? (A) Port (B) IP (C) Logical (D) Physical 16. In ________ substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text. (A) polyalphabetic (B) monoalphabetic (C) transpositional (D) multialphabetic 17. Manager s salary details are to be hidden from Employee Table. This Technique is called as (A) Conceptual level Datahiding (B) Physical level Datahiding (C) External level Datahiding (D) Logical level Datahiding A Network Schema (A) restricts to one to many relationship (B) permits many to many relationship (C) stores Data in a Database (D) stores Data in a Relation J-87-13 D1 D2 Dn (C) In classful addressing, the IP address 190.255.254.254 belongs to (A) Class A (B) Class B (C) Class C (D) Class D Paper-II Which of the following is not a type of Database Management System ? (A) Hierarchical (B) Network (C) Relational (D) Sequential 11. (B) 12. 3 18. 19. 22. In IPv4 header, the ______ field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs to. (A) identification (B) fragment offset (C) time to live (D) header checksum 20. 21. The equivalent production rules corresponding to the production rules S S 1 |S 2 | 1 | 2 is (A) S 1 | 2, A 1A | 2A | (B) S 1| 2| 1A | 2A, A 1A | 2A Given L1=L(a*baa*) and L2=L(ab*). The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by (A) a*b (B) a*baa* (C) a*ba* (D) None of the above (C) S 1 | 2, A 1A | 2A (D) S 1 | 2 | 1A | 2A, A 1A | 2A | 24. Given the production rules of a grammar G1 as S1 AB | aaB A a | Aa B b and the production rules of a grammar G2 as S2 aS2bS2 | bS2aS2 | Which of the following is correct statement ? (A) G1 is ambiguous and G2 is not ambiguous. (B) G1 is ambiguous and G2 is ambiguous. (C) G1 is not ambiguous and G2 is ambiguous. (D) G1 is not ambiguous and G2 is not ambiguous. Paper-II Given a grammar : S1 Sc, S SA | A, A aSb | ab, there is a rightmost derivation S1 Sc SAC SaSbc Thus, SaSbc is a right sentential form, and its handle is (A) SaS (B) bc (C) Sbc (D) aSb 23. In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a threelayer hierarchy ? (A) 10 clusters, 24 regions and 20 routers (B) 12 clusters, 20 regions and 20 routers (C) 16 clusters, 12 regions and 25 routers (D) 15 clusters, 16 regions and 20 routers Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below : a b p q q r s r r s s r s The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2 4 J-87-13 25. Which is the correct statement(s) for Non Recursive predictive parser ? 29. The value of postfix expression : 8 3 4 + 3 8 2 / + * 2 $ 3 + is (A) 17 (B) 131 (C) 64 (D) 52 30. Consider the following statements for priority queue : S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2 : The elements of a priority queue may be complex structures that are ordered on one or several fields. Which of the following is correct ? (A) Both S1 and S2 are incorrect. (B) S1 is correct and S2 is incorrect. (C) S1 is incorrect and S2 is correct. (D) Both S1 and S2 are correct. 31. Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as (A) Data mining (B) Meta data (C) Data warehousing (D) Database 32. The task of correcting and pre processing data is called as (A) Data streaming (B) Data cleaning (C) Data mining (D) Data storming S1 : First( ) = {t| * t for some string } *t S2 : Follow(X)={ a| S * Xa some strings and } (A) Both statements S1 and S2 incorrect. (B) S1 is incorrect and S2 correct. (C) S1 is correct and S2 incorrect. (D) Both statements S1 and S2 correct. 26. for are is is are Given an open address hash table with load factor < 1, the expected number of probes in a successful search is 1 1 (A) Atmost ln 1 1 (B) Atmost ln 1 1 1 (C) Atleast ln 1 1 (D) Atleast ln 1 27. For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th) 28. The time complexity to build a heap with a list of n numbers is (A) O(log n) (B) O(n) (C) O(n logn) (D) O(n2) J-87-13 5 Paper-II 33. 34. 35. 36. Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ 38. (A) M+N C (B) 39. Give as good a big O estimate as possible for the following functions : (nlogn+n2)(n3+2) and (n!+2n) (n3+log(n2+1)) (A) O(n5+2n2) & O(n3*n!) (B) O(n5) & O(n3*2n) (C) O(n5) & O(n3* n!) (D) O(n5+2n2) & O(n3*2n) Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise ? (A) (p q r) ( p q r) ( p q r) (B) (p q r) ( p q r) ( q p r) (C) (p q r) ( p q r) ( p q r) (D) (p r q) ( p q r) ( p q r) 40. The truth value of the statements : !xP(x) xP(x) and !x P(x) xP(x), (where the notation !xP(x) denotes the proposition There exists a unique x such that P(x) is true ) are : A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also. (A) 100P2 (A) True and False (B) C2 False and True (C) 100 False and False (D) True and True 41. Which of the following connected simple graph has exactly one spanning tree ? (A) Complete graph (B) Hamiltonian graph (C) Euler graph (D) None of the above Paper-II M N+C (D) M+N+C (C) 2100 (D) 3100 37. M N C (C) The relation divides on a set of positive integers is ________. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only (B) How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components ? How many different Boolean functions of degree 4 are there ? (A) 24 (B) 28 (C) 212 (D) 216 6 J-87-13 42. A Boolean operator s is defined as follows : 1 s 1 = 1, 1 s 0 = 0, 0 s 1 = 0 and 0s0=1 What will be the truth value of the expression (x s y) s z = x s (y s z) ? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true 43. 48. Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory ? (A) 21 ns (B) 23 ns (C) 30 ns (D) 35 ns 49. Consider the following UNIX command : sort <in> temp; head 30 <temp; rm temp Which of the following functions shall be performed by this command ? (A) Sort, taking the input from temp , prints 30 lines from temp and delete the file temp (B) Sort the file temp , removes 30 lines from temp and delete the file temp (C) Sort, taking the input from in and writing the output to temp then prints 30 lines from temp on terminal. Finally temp is removed. (D) Sort, taking the input from temp and then prints 30 lines from temp on terminal. Finally temp is removed. 50. A set of processors P1, P2, , Pk can execute in parallel if Bernstein s conditions are satisfied on a pairwise basis; that is P1 || P2 || P3 || .. || Pk if and only if : (A) Pi || Pj for all i j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i < j (D) Pi || Pj for all i > j Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67 : (A) 310 (B) 324 (C) 320 (D) 321 The mv command changes (A) the inode (B) the inode-number (C) the directory entry (D) both the directory entry and the inode Which one of the following is decimal value of a signed binary number 1101010, if it is in 2 s complement form ? (A) 42 (B) 22 (C) 21 (D) 106 44. 47. 45. When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as _______. (A) handoff (B) mobile switching (C) mobile routing (D) cell switching 46. A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion J-87-13 7 Paper-II Space For Rough Work Paper-II 8 J-87-13

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 


Tags : JUNE2011  


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

 

geethubejith chat