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

APSET 2012 Computer Science and Applications Paper II

16 pages, 0 questions, 0 questions with responses, 0 total responses,

	mravi_jntu	+Fave Message
	Profile Timeline Uploads

Home > mravi_jntu >

Formatting page ...

: II Test Paper Test Booklet Serial No. : ______________________ Test Subject : COMPUTER SCIENCE OMR Sheet No. : ________________________________ AND APPLICATIONS Hall Ticket No. A-04-02 Test Subject Code : (Figures as per admission card) Name & Signature of Invigilator Name : ____________________________________ Paper Signature : ___________________________________ : II Subject : COMPUTER SCIENCE AND APPLICATIONS Time : 1 Hour 15 Minutes Number of Pages in this Booklet : 16 Maximum Marks : 100 Number of Questions in this Booklet : 50 Instructions for the Candidates 1. Write your Hall Ticket 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 Test Booklet Number should be entered in the OMR Sheet and 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 : A B C 1. 2. 3. 4. D where (C) is the correct response. 5. Your responses to the items are to be indicated in the OMR Sheet given to you. If you mark at any place other than in the circle in the Answer 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 or put any mark on any part of the OMR Answer Sheet, except for the space allotted for the relevant entries, which may disclose your identity, you will render yourself liable to disqualification. 9. You have to return the test question booklet and OMR Answer Sheet to the invigilators at the end of the examination compulsorily and must not carry it with you outside the Examination Hall. 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. II 5. 6. 7. 8. 9. 10. 11. 12. 1 A $ M $ *^ $ D #r O V Z C y Z $ s M s $ > $ y . D { { $$ * O $ O_eM { $ M W E . { $$ D { { $$ $M $ C y $ $ . $$ s I $ $ $$ Z D { { $$ $ _ M A $ V> ^ * $M y . (i) D { { $$ $ ^ *y y M M h A ^ $ E M>W # $ $ _ ^ y . tM P $ $ $$ C M _ E { { $$ $ $ $ A XM ^ $ . (ii) M $ h O $${ _ *^ { M> D { { $$ Z i Q $ $ $$ { Q $ ^ * $M y . i Q M $ _ V> *_ _ Q Z { $ M #r f{ M>M #r { $ {M $ Z M #r H O y $ y $r s N $O { { r $$ s I $ $ Z > M $ M W C_a M $ $V> V>Y E { { $M y . { { $$ * a y $ A # $ $ C y $. (iii) O V> ^ * $M > { { Q $ OMR { $$ O A V> OMR { $$ Q $ D { { $$ O t Z > $ $. { { M $ $V $ { * $ { $ (A), (B), (C) $ $$ (D) $V> C y z $$. { { M $ O { $ G $ M M V> OMR { $$ Z { { Q M $ C y $V $ Z O { $ *_ ^ $$ s M V> N ^ . A B C D E : (C) O { A $$ { M $ { $ D { { $$ C y OMR { $$ O C y Z N _ V $ ^ . A M>M * { O M ^ r V $ $ { $* M ^ $ y $. { { $$ Z C_a *^ $ g {V V> ^ y . _ $ { { $$ _ C_a R $$ Z ^ * . OMR { $$ O ~ Z *_ ^ > $ _ C Z $ V $ # $ V> $ $ > $y V> C _ $ rty V> ^ r $$ $ A M $ $ $ # $. N $$ > $ { { $ $$ OMR { V> M $y M C . s V $rM $ $M $ M *y $. / V $ $$ s *{ $ E *W ^ . V $ s $ , M> M $ r $, G [M>t M M > $ $$ V $ V Z E *W ^ y . * M $ * $P WY # $. A-04-02 *A0402* II 2 A-04-02 *A0402* COMPUTER SCIENCE AND APPLICATIONS Paper II 4. An EDP auditor must be an expert in 1. Function overloading is done at (A) Computerised Business Systems (A) Compile time (B) Computerised System Analysis (B) Run time (C) Computerised Accounting Analysis (D) Computerised Program Analysis (C) Linking time 5. If no exception is thrown (D) Execution time (A) A catch block will cause an error (B) The first catch block coded will 2. OLAP is an acronym for execute (A) Online Analytical Project (C) The last catch block coded will execute (B) Online Analytical Processing (D) All catch blocks coded will be (C) Online Application Processing bypassed 6. Consider the following pseudo-code : (D) Online Application Project IF ((A > B) AND (C > D)) THEN 3. Architectural design involves in SE A=A+1 B=B+1 (A) E-R diagram ENDIF (B) Flow-chart The cyclomatic complexity of the pseudo-code is (C) Algorithm (A) 2 (C) 4 (D) DFD II 3 (B) 3 (D) 5 A-04-02 *A0402* 9. Match the following : 7. Which of the following testing methods is 1. Data Link Layer normally used as the acceptance test for i. The lowest layer whose a software system ? function is to (A) Regression testing activate, deactivate (B) Integration testing and maintain the (C) Unit testing DTE and DCE circuit between (D) Functional testing 2. Physical Layer 3. Presentation 8. Match the following ii. Perform routing iii. Detection and Layer recovery of errors in the transmitted I. The beginning of the function code data 1. ( ) 4. Network Layer iv. Provides syntax for the data II. The preprocessor directive always starts with (A) 1 iii, 2 i, 3 iv, 4 ii 2. & (B) 1 ii, 2 i, 3 iv, 4 iii III. The symbol for the address operator 3. (C) 1 iv, 2 i, 3 ii, 4 iii { (D) 1 ii, 2 i, 3 iii, 4 iv IV. The name of a function always ends with 10. Match the following : 4. # I. 0 (log n) 1. Heap sort II. 0 (n) 2. DFS III. 0 (n log n) 3. Binary search IV. 0 (n2) 4. Bubble sort I III IV (A) 1 2 3 4 (B) 3 4 2 1 (B) I 4, II 1, III 3, IV 2 (C) 3 2 4 1 (C) I 3, II 1, III 2, IV 4 (D) II II 3 2 1 4 (D) I 3, II 2, III 4, IV 1 (A) I 3, II 2, III 1, IV 4 4 A-04-02 *A0402* 11. The string accepted by the following finite 14. Let G be a simple graph all of whose vertices have degree 3 and E = 2 V 3 automaton what can be said about G ? s tart a q0 q1 b q2 a, b (A) G has 6 vertices and 9 edges (B) G has 9 vertices and 6 edges where a, b are alphabets, q0, q1, and q2 (C) G has 6 vertices and 12 edges are states and q2 is final state (D) None of the above 15. Which of the following graph is isomorphic (A) abb* to given below graph ? (B) ab* (a + b)* (C) ab (a + b)* (D) (a + b)* 12. What is the maximum number of different (A) Boolean functions involving n Boolean variables ? (A) n2 (C) 2 2n (B) 2n (D) 2 (B) n2 13. Choose the category of following SQL operations INSERT, DELETE and (C) UPDATE (A) DDL (B) PL (C) DML (D) DCL (D) II 5 A-04-02 *A0402* 18. Suppose a tree has d1 vertices of degree 1, 2 16. Consider the join of a relation R with a vertices of degree 2, 4 vertices of degree 3 relation S. If R has m tuples and S has n and 3 vertices of degree 4 then d1 value is tuples, then the maximum and minimum (A) 6 sizes of the join respectively are (B) 4 (A) m + n and 0 (C) 8 (B) mn and 0 (D) 12 (C) m + n and m n 19. A Binary Search Tree (BST) stores values on the range 37 to 573. Consider the (D) mn and m + n following sequence of keys 17. Assertion A : The technique of building i. 81, 537, 102, 439, 285, 376, 305 new classes from the ii. 52, 97, 121, 195, 242, 381, 472 existing classes is called iii. 142, 248, 520, 386, 345, 270, 307 polymorphism. iv. 550, 149, 507, 395, 463, 402, 270 Reason R : Polymorphism requires postponement of binding of Which of the following statements is TRUE ? a function call to the member (A) i, ii and iv are inorder sequences of function until runtime. three different BSTs (A) Both (A) and (R) are true and (R) is (B) i is a preorder sequence of some BST the reason for (A) with 439 as the root (B) Both (A) and (R) are true but (R) is not (C) ii is an inorder sequence of some BST a reason for (A) where 121 is the root and 52 in a leaf (C) Only (A) is true and (R) is false (D) iv is a post order sequence of some (D) Only (R) is true and (A) is false II BST with 149 as the root 6 A-04-02 *A0402* 20. Assertion A : Implicit type conversion in 22. Exterior Gateway Protocol is C++ can lead to errors (A) To exchange routing information keeping into the program, between gateway hosts if adequate care is not taken. (B) To connect two bridges Reason R : Use of explicit type (C) Loop-free conversion is recommend interdomain routing between autonomous systems in mixed mode expression. (D) To provide quality of service (A) Both (A) and (R) are true and (R) is 23. Find the following statements in the the reason for (A) (B) Both (A) and (R) are true but (R) is not context of software testing are TRUE or a reason for (A) FALSE (C) Only (A) is true and (R) is false S1 : Statement coverage cannot guarantee (D) Only (R) is true and (A) is false execution of loops in a program under 21. If X is a Boolean variable, then among test. following what are the statements true according to Idempotent law ? S2 : Use of independent path testing I. X + X = X criterion guarantees execution of II. X . X = X each loop in a program under test III. X . 1 = X more than once. IV. X + 1 = 1 (A) True, True (A) I and II are correct (B) I and IV are correct (C) II and III are correct (C) False, True (D) All four (I, II, III and IV) are correct II (B) True, False (D) False, False 7 A-04-02 *A0402* 26. In a software project, COCOMO 24. Match the following : I. To add 2 bits (Constructive Cost Model) is used to 1. Full adder estimate II. To add 3 bits 2. Left shift by 1 bit (A) Effort and duration based on the size of the software III. To multiply by 2 3. Right shift by 1 bit (B) Size and duration based on the effort IV. To divide by 2 I 4. Half adder II III of the software (C) Effort and cost based on the duration IV of the software (A) 3 1 4 2 (B) 4 1 2 3 cost of the software (C) 4 1 3 2 27. The gray code for decimal 7 is (D) Size, effort and duration based on the (A) 0111 (D) 1 4 2 3 (B) 1011 (C) 0100 25. A medium access control technique for (D) 0101 multiple access transmission media is 28. Error detection at the data link level is (A) ALOHA achieved by (A) Bit stuffing (B) AMPLITUDE (B) Cyclic redundancy codes (C) ATTENUATION (C) Equalization (D) MODULATION II (D) Huffmann code 8 A-04-02 *A0402* 29. In Unix, the file descriptor returned by 32. The task of the Lexical Analysis phase is open system call is of type (A) To parse the source program into the (A) FILE basic elements or tokens of the (B) Integer language (B) To build a literal table and an identifier (C) Char table (D) Structure (C) To build a uniform symbol table 30. The string 1101 does not belong to the (D) All of the above set represented by (A) 110* (0 + 1) 33. Match the following : (B) (10)* (01)* (00 + 11)* I. The processes ID 1. grep (C) 1(0 + 1)* 101 II. Editor 2. ps (D) 1 (10 + 01)* (1 + 0)* III. Searching in files 3. cat IV. Printing a file 4. vi 31. Which of the following tool is known as I parser generator ? II III IV (A) LEX 2 4 1 3 (B) YAAC (B) 3 4 2 1 (C) TEX (C) 2 3 4 1 (D) EMACS II (A) (D) 4 3 1 2 9 A-04-02 *A0402* 34. Consider this C code to swap two integers 35. A compiler for a high level language that and these five statements : runs on one machine and produces code void swap (int px, int py) * * for a different machine is called { (A) Optimizing compiler * px = *px *py ; *py = *px + *py; (B) Cross compiler *px = *py *px; (C) One pass compiler } (D) Multi pass compiler S1 : Will generate a compilation error 36. Match the following : S2 : May generate a segmentation fault at runtime depending on the arguments I. Deadlock avoidance 1. Shortest first algorithm passed S3 : Correctly implement the swap job II. CPU scheduling 3. Banker s algorithm IV. Page replacement referring to integers stored in memory 2. LRU algorithm III. Mutual exclusion procedure for all input pointers 4. Peterson s algorithm locations accessible to the process S4 : Implements the swap procedure correctly for some but not all valid I II III IV (A) 1 3 2 4 (B) 4 2 3 1 (C) 3 1 4 2 (D) 2 4 3 1 input pointers. S5 : May add or subtract integers and pointers. (A) S1 (B) S2 and S3 (C) S2 and S4 (D) S2 and S5 II 10 A-04-02 *A0402* 37. Match the following : 40. Electronic credit cards can be in P. Regular expression Q. Pushdown automata 2. Code generation R. Dataflow analysis 3. Lexical analysis S. Register allocation (A) Unencrypted form only 1. Syntax analysis 4. Code optimization (B) Encrypted form only (C) Both A and B (D) None of the above 41. Consider the following two statements i. A Hash function is an injective function (A) P 4, Q 1, R 2, S 3 which is often used for computing (B) P 3, Q 1, R 4, S 2 digital signature ii. An encryption technique DES (C) P 3, Q 4, R 1, S 2 performs a permutation on the (D) P 2, Q 1, R 4, S 3 elements of its input alphabet 38. Reasoning with uncertain knowledge can Which of the following is valid for the above two statements ? be dealt with (A) Both are false (A) Monotonic reasoning (B) i True, ii false (C) ii True, i false (B) Simple reasoning (D) Both are true (C) Non-monotonic reasoning 42. Select A, B, C from loan table (D) Complex reasoning consisting of fields A, B, C, D, E, F 39. Which of the following eliminates transitive (A) loan (A, B, C) dependency ? (B) ABC (loan) (A) 1NF (C) loan (A, B, C) (C) BCNF II (B) 2NF (D) None of the above (D) None of the above 11 A-04-02 *A0402* 43. The number of flipflops required in a 45. Consider the following statements : P : A page fault occurs when the required decade counter is page is not available in the main (A) 3 memory. (B) 10 Q : There exists a situation that, there is (C) 5 no space available in the main memory. (D) 4 Which of the following is true ? 44. Which of the following is a non-linear data (A) Both P and Q are true, and Q is also a structure ? i. Stack reason for P (B) Both P and Q are true, and Q is not ii. Queue reason for P iii. Tree iv. Graph (C) P is false but Q is true (D) Both P and Q are false v. Doubly linked list 46. Which of the following propositions is a (A) All of the above tautology ? (A) (p q) p (B) iii, iv and v (B) p (q p) (C) iii and iv (C) p (p q) (D) i, ii and v II (D) q (p q) 12 A-04-02 *A0402* 47. Fense Register is used for 50. Consider 4 processes P1, P2, P3 and P4 (A) CPU protection Process Arrival time Time units required (B) File protection P1 5 1 7 P3 3 4 P4 (D) I/O unit protection 0 P2 (C) Memory protection 4 6 48. SQL stands for (A) Structured Query Language (B) Sequential Query Language Find the completion order of the 4 p r o c esses if round robin policy applies (round robin with the quantum of 2 time units) (C) System Query Language (D) Standard Query Language (A) P1 P2 P3 P4 49. Active X control can be added to a webpage by using (B) P4 P3 P2 P1 (A) OBJECT tag (B) SCRIPT tag (C) (C) P2 P3 P1 P4 ACTIVE tag (D) P3 P1 P4 P2 (D) None of the above II 13 A-04-02 *A0402* Space for Rough Work II 14 A-04-02 *A0402* Space for Rough Work II 15 A-04-02 *A0402* Space for Rough Work II 16 A-04-02

Formatting page ...

mravi_jntu chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: