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

APSET 2012 ComputerScience and Applications Paper III

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

	mravi_jntu	+Fave Message
	Profile Timeline Uploads

Home > mravi_jntu >

Formatting page ...

Test Paper : III Test Booklet Serial No. : ______________________ Test Subject : COMPUTER SCIENCE OMR Sheet No. : ________________________________ AND APPLICATIONS Hall Ticket No. A-04-03 Test Subject Code : (Figures as per admission card) Name & Signature of Invigilator Name : ____________________________________ Signature : ___________________________________ Paper : III Subject : COMPUTER SCIENCE AND APPLICATIONS Maximum Marks : 150 Time : 2 Hours 30 Minutes Number of Pages in this Booklet : 16 Number of Questions in this Booklet : 75 A $ M $ *^ $ 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 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 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. 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. 6. Read instructions given inside carefully. 7. 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 8. Answer Sheet, except for the space allotted for the relevant entries, which may disclose your identity, you will render yourself liable to disqualification. 9. 9. You have to return the test question booklet and OMR Answer Sheet to the invigilators at the end of the examination compulsorily 10. and must not carry it with you outside the Examination Hall. 11. 10. Use only Blue/Black Ball point pen. 11. Use of any calculator or log table etc., is prohibited. 12. 12. There is no negative marks for incorrect answers. III 1 D #r O V Z C y Z $ s M s $ > $ y . D { { $$ y OI $ $ 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 ^ . E : A B C D (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-03 *A0403* III 2 A-04-03 *A0403* COMPUTER SCIENCE AND APPLICATIONS Paper III 4. The simplified form of the boolean expression ( x + y + z) ( x + y + z ) ( x + y + z) 1. A method of providing security to transport e-mails is (A) TLS (A) x y + z (B) PGP (B) xy + z (C) IP-sec (C) x + y z (D) BGP (D) x + y z 2. A combinational circuit is designed to take 5. Arrange the following IP addresses in the order of Class A, Class B, Class C and Class D. 4 bit input. The number from 0 to 9 are given as input in the binary form. The circuit outputs 1 if 5,6,7 or 9 are given input. I. 193. 200. 151. 2 For all other numbers the circuit outputs II. 189. 51. 21. 200 0 . The circuit is designed only using AND, III. 225. 2. 2. 200 OR, NOT gates. What is the minimum IV. 126. 8. 2. 200 number of gates required ? (A) I, IV, II, III (A) 2 (B) III, II, IV, I (B) 3 (C) IV, II, I, III (C) 4 (D) II, III, IV, I (D) 5 6. Addressing modes of the following 8085 instructions in the same order. LDA, LXI, ADD r1, r2, MOV A,M 3. The MAC protocol used in Ethernet is (A) ALOHA (A) Implicit, Indirect, Direct, Register (B) Token ring (B) Implicit, Indirect, Register, Immediate (C) CSMA/CD (D) Token bus III (C) Direct, Indirect, Immediate, Register (D) Direct, Immediate, Register, Indirect 3 A-04-03 *A0403* 9. Search algorithms are Judged on the basis of 7. The concatenation of two lists is to be performed in 0(1) time. Which of the I. Completeness following implementation of a list should II. Optimality be used ? III. Time complexity IV. Space complexity (A) Singly linked list (A) I and II (B) I, II and III (B) Doubly linked list (C) II, III and IV (C) Circularly doubly linked list (D) All of the above 10. Choose the answer from the following register(s) that store the address of a memory location. (D) Array implementation of list 8. Match the following : I. Program counter I. Non vectored interrupt II. Non Maskable interrupt II. Accumulator 1. ISR 2. RST2 III. MAR IV. BC Register pair (A) I and II are correct III. Program for interrupt 3. TRAP IV. Software Interrupt 4. INTR (B) II and III are correct (C) I and IV are correct (D) I and III are correct I III IV (A) 4 3 1 2 (B) 2 3 4 1 (C) 1 4 3 2 (D) III II 2 1 3 4 11. If G be a complete undirected graph on 6 vertices. If vertices of G are labeled then the number of distinct cycles of length 4 in G is equal to (A) 15 (B) 30 (C) 90 (D) 360 4 A-04-03 *A0403* 16. An Abstract Data Type (ADT) is 12. The number of vectored interrupts in 8085 is (A) same as an abstract class (A) 4 (B) a data type that cannot be instantiated (B) 5 (C) a data type for which only the (C) 6 operations defined on it can be used (D) 3 (D) all of the above 13. The Java compiler translates source code 17. In a paged memory the page hit ratio is into 0.35. The time required to access a page (A) Machine Code in secondary memory is equal to 100 nsec. (B) Assembly Code The time required to access a page in (C) Byte Code primary memory is 10 nsec. The average (D) All of the above 14. Object-Modelling time required to access a page is Technique (A) 55 nsec. was proposed by (B) 68 nsec. (A) Booch (C) 68.5 nsec. (B) Rambaugh (D) 78.5 nsec. (C) Jacobson 18. ______________ abstraction is a named (D) All of the above sequence of instructions that has a specific 15. The following scheduling algorithm is and limited function. inherently pre emptive (A) Procedural (A) FCFS (B) Data (B) SJF (C) LJF (D) Round Robin III (C) Control (D) Physical 5 A-04-03 *A0403* 21. The overlay tree for a program is given 19. A process executes the code below. What will be the size of the physical fork ( ) ; memory partition required to load and run the program ? fork ( ) ; fork ( ) ; fork ( ) ; 8KB The total number of child processes (A) 8 KB (B) 20 KB (C) 12 KB created is (D) 14 KB (A) 4 22. The complexity of inter connection among (B) 15 modules is described by (C) 7 (A) Cohesion (B) Temporal cohesion (D) 5 (C) Logical cohesion (D) Coupling 20. If A = { 0, 1 }, then the number of possible 23. A 1000 K byte memory is managed using strings of length n is variable partitions but to compaction. It currently has two partitions of sizes 200 K (A) n ! bytes and 340 K bytes respectively. The smallest allocation request in K bytes that (B) n n could be denied is for n (C) n (A) 380 (C) 481 (D) 2n III 6 (B) 520 (D) 461 A-04-03 *A0403* 24. The grammar guaranteed by production 27. The algorithm used for searching AND-OR rules graph is S a SBc , CB BC , aB aa is (A) A* (A) an bn cn, n 1 (B) AO* (C) Iterative deepening A* nnn (B) a b c , n 0 (D) Iterative deepening AO* (C) an bn cn, n > 0 28. The PROJECT operator of a relational algebra creates a new table that has always (D) an bn cn, n 0 25. The following page replacement (A) More number of columns than original table algorithms suffer from Belady s anomaly. I. Optimal replacement (B) More number of rows than the original table II. LRU III. FIFO (C) Same number of rows as the original table IV. MRU (A) I and IV correct (B) I and III correct (D) Same number of columns as the original table (C) II and III correct (D) II and IV correct 29. The Natural Language sentence will be represented in NLP with 26. Given the basic ER and relational models, which of the following is INCORRECT ? I. ATN (A) An attribute of an entity can have more II. RTN than one value III. FPL (B) An attribute of an entity can be composite IV. FRAMES (C) In a row of a relational table, an (A) III, IV attribute can have more than one value (B) IV, I (D) In a row of a relational table, an (C) I, II attribute can have exactly one value (D) II, III or a NULL value III 7 A-04-03 *A0403* 30. The file organization in which the physical 32. Which of the sorting algorithm is the location of a record is determined by a slowest ? Mathematical function that maps the key (A) Bubble sort to address of the record is (B) Quick sort (A) Hashed file organization (C) Shell sort (B) B Tree file organization (D) Heap sort (C) B Tree file organization 33. The approach used in top-down analysis and design is (D) Sequential file organization 31. Consider the following statements about (A) to identify the top level functions by combining many smaller components into a single entity the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE ? (B) to identify a top level function and then create a hierarchy of lower level modules and components i. The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the (C) to prepare flowcharts after programming has been completed graph. ii. The cyclomatic complexity of a module (D) all of the above is the number of decisions on the module plus one. Where a decision is 34. Match the following : effectively any conditional statement I. Flow control 1. Token Bucket in the module. II. Error control 2. Sliding window iii. The cyclomatic complexity can also be III. Congestion control 3. Manchester encoding used as a number of linearly independent paths that should be IV. Synchronization tested during path coverage testing 4. Parity bit I II III IV (A) 2 4 1 3 (B) ii and iii (B) 3 4 2 1 (C) i and iii (C) 4 2 1 3 (D) i, ii and iii (D) 1 4 2 3 (A) i and ii III 8 A-04-03 *A0403* 35. Slow start is a technique used by the TCP 38. What is difference between a Java applet to reduce and a Java application ? (A) Number of buffers (A) An application can in general be (B) Number of timers trusted whereas an applet can t (C) Number of TCP connections (B) An applet must be executed in a (D) Number of timeouts of segments browser environment 36. A B-Tree used as an index for a large (C) An applet is not able to access the database table has four levels including files of the computer it runs on root node. If a new key is inserted in this index, then the maximum number of nodes (D) All of the above that could be newly created in the process 39. The following machine will accept the are string (A) 5 (B) 4 (C) 3 (A) aaab (D) 2 (B) aabab (C) baaab 37. Consider the following proportional statements (D) bab P1 : ((A B) C ) ((A C) (B C)) P2 : ((A B) C ) ((A C) (B C)) 40. Types of validation testing Which one of the following are true ? (A) Alpha and Beta Testing (A) P1 is tautology, but not P2 (B) Top down and Bottom up testing (B) P2 is tautology, but not P1 (C) P1 and P2 are tautologies (D) Both P1 and P2 are not tautologies III (C) Recovery and Integrity testing (D) All the above 9 A-04-03 *A0403* 41. Choose the correct answer, the protocols which returns IP address. 44. In UNIX, when the read system call I. ARP encounters EOF, it returns II. RARP (A) Some positive integer III. HTTP IV. DNS (B) Positive integer related to error code (A) I and II correct (C) 0 (B) All correct (D) 1 (C) I, II, III correct (D) II and IV correct 45. Which of the following regular expression 42. Assuming P NP, which of the following is TRUE ? identities are true ? (A) NP complete = NP 1 (A) (r ) = r (B) NP complete nP = (C) NP hard = NP (B) (r s )1 = (r + s)1 (D) P = NP Complete (C) (r + s)1 = r + s 43. What is the appropriate pairing of items in the two columns, listing various activities encountered in a software life cycle ? P. Requirements capture (D) r s = r + s 1. Module Development and Integration Q. Design using the CRC polynomial x3 + 1 to protect 2. Domain analysis R. Implementation 46. The message 11001001 is to be transmitted 3. Structural Behavioural Modelling it from errors. The message that should be transmitted is (A) 11001001000 S. Maintenance 4. Performance Tuning (A) P 3, Q 2, R 4, S 1 (B) P 2, Q 3, R 1, S 4 (C) P 3, Q 2, R 1, S 4 (B) 11001001011 (C) 11001010 (D) 110010010011 (D) All of the above III 10 A-04-03 *A0403* 51. Neural Networks are models of 47. _______________ is black box testing method. (A) Decision making system (A) Boundary value analysis (B) Data processing system (B) Basic path analysis (C) Control systems (C) Code validation analysis (D) Biological nervous systems (D) All of the above Question No. s 52 and 53 48. If the hamming distance is m then the Disk requests come to a disk drive for number of errors that can be corrected is cylinders 10, 22, 20, 2, 40, 6 and 36 in (A) Equal to m that order at a time when the disk drive is (B) Less than m/2 reading from cylinder 20. The seek time is (C) Equal to 2 m 6 ms per cylinder. The disk can be rotated either clockwise or counter clockwise. (D) Greater than 2 m 52. The total seek time if the disk arm 49. What is the maximum number of I/O scheduling algorithm is first-cum-first- devices that can be interfaced to 8085 ? served. (A) 64 (B) 8 (A) 360 msec. (C) 32 (D) 256 (B) 850 msec. (C) 876 msec. 50. Compression Ratio is defined as (D) 900 msec. (A) 1 (compressed size/uncompressed 53. If the scheduling algorithm is closest size) cylinder next, then the total will be (B) compressed size/uncompressed size) (A) 360 msec. (C) 1 (compressed data rate/ (B) 876 msec. uncompressed data rate) (C) 900 msec. (D) All of the above III (D) 330 msec. 11 A-04-03 *A0403* 58. Inference Engine consists of Question No. s 54, 55 and 56 I. Facts The next three questions are based on Huffman s coding for the symbol A with II. User Interface probability 0.3, B with 0.15, C with 0.1, III. Search D with 0.25 and E with 0.2. IV. Domain Expert (A) I, II 54. The minimum number of bits required to (B) II, III represent B is (A) 1 (B) 2 (C) I, III (C) 3 (D) 4 (D) II, IV 59. With regarding to exceptions following is TRUE 55. The minimum number of bits required to represent all the symbols together is (A) 14 (A) Raised by program (B) 11 (B) Raised by user (C) 12 (C) Raised by OS (D) 15 (D) Raised by program and OS 56. The average code length of the given problem is 60. Which of the following concurrency control protocols ensure both conflict (A) 2 serializability and freedom from dead (B) 2.25 deadlock (C) 2.45 I. 2 phase locking (D) 3 II. Time-stamp ordering 57. Character Recognition is application of (A) I only (A) Fuzzy Logic (B) II only (B) Neural Networks (C) Both I and II (C) Genetic Algorithm (D) Neither I nor II (D) Logic III 12 A-04-03 *A0403* 61. The following system calls are related to 63. Search engine is a ____________ agent. file operations in UNIX (A) Learning I. Signal (B) Negotiation II. Kill (C) Intelligent III. Seek (D) Business IV. Unlink 64. The commonly used UNIX commands like (A) I and III correct date, ls, cut etc. are stored in (B) III and IV correct (A) / dev directory (C) II and III correct (B) / sys directory D) II and IV correct (C) / unix directory 62. HTML (Hyper Text Markup Language) has (D) / bin and /usr/bin directory language elements which permit certain 65. ADO stands for actions other than describing the structure of the web document. Which one of the (A) Active Data Object following actions is not supported by pure (B) Active Dynamic Object HTML (without any server or client side (C) Active Downloadable Object scripting) pages ? (D) Active Durability Object (A) Embed web objects from different 66. If f is a linear transformation from the plane sites into the same page to the real numbers and if f(1, 1) = 1 and (B) Refresh the page automatically after f( 1, 0) = 0 then f (3, 5) = a specified interval (A) 6 (C) Automatically redirect to another page (B) 5 upon download (C) 0 (D) Display the client time as part of the (D) 9 page III 13 A-04-03 *A0403* 70. Class C is inherited from Class A and 67. Fuzzy Logic is proposed by Class B, Class D is inherited from Class C (A) MAMDHANI Which of the following is true ? (B) ZADEH I. Class C inherits Class A attributes (C) MUZIMITO II. Class C inherits Class B attributes (D) TANAKA III. Class D inherits Class B attributes only IV. Class D inherits Class A attributes only 68. If the inorder and postorder traversal (A) I, II results of a binary tree are A, C, B, F, E, D, G and A, B, C, E, G, D, F respectively. (B) I, II, III, IV Identify the root node of it. (C) I, III (A) A (D) None of the above 71. Which of the following is an assertion ? (B) D (A) P is true, P and Q are true and K or (C) C not (Q) is true implies K is true (D) F (B) P is true, P and Q are true and K or not (Q) is true implies K is false 69. NLP includes problems (C) P is true, P and Q are false and K or (A) in which the objective function is not (Q) is true implies K is true linear but some constraints are not (D) P is true linear 72. In 8085, the addressing mode used for (B) in which the constraints are linear but LDAX rp instruction is the objective function is not linear (A) Direct (C) in which both the objective function (B) Indirect and all the constraints are not linear (C) Register (D) all of the above III (D) Immediate 14 A-04-03 *A0403* 75. Which of the following statements are TRUE about an SQL query ? 73. Given an arbitrary Non-deterministic Finite Automation (NFA) with N states, the maximum number of states in an equivalent minimized DFA is atleast (A) N P : An SQL query can contain a HAVING clause even if it doesnot have a 2 GROUP by clause. (B) 2N Q : An SQL query can contain a HAVING clause only if it has GROUP by clause. (C) 2N (D) N! R : All attributes used in the GROUP by clause must appear in the SELECT clause. 74. The maximum packet size of IPV4 is (A) 1500 bytes (C) 65535 bytes S : Not all attributes used in the GROUP by clause need to appear in the SELECT clause. (D) 48 bytes (A) P and R (B) P and S (C) Q and R (D) Q and S (B) 2 MB ___________________ III 15 A-04-03 *A0403* Space for Rough Work III 16 A-04-03

Formatting page ...

mravi_jntu chat

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