Computer_2010.pdf - CODE AE-C-S M.Tech Common Entrance Test PGCET 2010 Computer Science and Engineering Time 2 Hours Max Marks 100 Read the following

Computer_2010.pdf - CODE AE-C-S M.Tech Common Entrance Test...

This preview shows page 1 - 10 out of 10 pages.

Image of page 1

Subscribe to view the full document.

Image of page 2
Image of page 3

Subscribe to view the full document.

Image of page 4
Image of page 5

Subscribe to view the full document.

Image of page 6
Image of page 7

Subscribe to view the full document.

Image of page 8
Image of page 9

Subscribe to view the full document.

Image of page 10

Unformatted text preview: CODE: AE-C-S M.Tech. Common Entrance Test, PGCET — 2010 Computer Science and Engineering Time: 2 Hours Max. Marks: 100 Read the following instructions before answering the test Write / Darken the particulars of your identity, Test Seat Number and affix your signature on the OMR Response Sheet before the start of the test. All Questions have multiple choices of answers, of which only one is correct. I Mark the correct answer by completely darkening only one oval against I the Question number using Black Ink Ball Point pen only. I There will be no negative evaluation with regard to wrong answers. ' Marks will not be awarded if multiple answers are given. Do not make any stray mark on the OMR Response sheet. For rough work, use blank page on the question paper. Taking the question paper out of the test hall is permitted only after the 1 full duration of the test. Use of only non-programmable calculator is permitted. START ANSWERING ONLY AT THE SPECIFIED TIME WHEN THE INVIGILATOR GIVES INSTRUCTIONS. MARKS DISTRIBUTION . PART —I 50 Questions : 50 x 1 = 50 Marks PART — II 25 Questions : 25 x 2 = 50 Marks Total = 100 Marks PART — I Each Question carries one mark _ 50 X l = 50 Marks 1. In a population of N families, 50% of families have three children, 30% have two children and the remaining have one child. What is the probability that a randomly picked child belongs to a family of two children? (a) 3/23 (b) 6/23 (c) 3/ 10 (d) 3/5 2. Two dice are thrown simultaneously. The probability that the product of the two numbers on the dice is an even number is (a) 1/2 (b) 3/4 (c) 5/16 (d) 3/8 3. The expected value of a probability function, when probability is measured on a scale of 0 to l, coincides with it’s (a) Mean (b) Variance (0) Standard deviation ((1) None of them 4. Which of the following is true? (a) The set of all rational numbers forms a group under multiplication. (b) The set of all matrices forms a group under multiplication; (c) The set of all real numbers forms a group under multiplication. (d) None of these. 5. If X then Y unless Z is represented by which of the following? (a) (X /\—1 Z) 9 Y (b) (XAY) 9 Z (0) X9 (YA—.Z) (d) (X9Y) /\ 92 6. The numbers l,2,.....n are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains p nodes. The first number to be inserted in the tree must be (a)p (b)p+1 (CM—p (d)n—p+1 7. In the depth first traversal of a graph G with n vertices, k edges are marked as tree edges. The number of connected components in G is (a)k (b)k+1 (c)n—k—1 (d)n—k 8. An abstract data type is (a) The same as an abstract class (b) The data type that cannot be instantiated (c) The data type for which only the operations defined on it can be used, but none else (d) All of the above 9. An undirected graph G has n nodes. It’s, adjacency matrix is given by (n X n) matrix, whose diagonal elements are zeros and non-diagonal elements are l’s, which one of the following is true? (a) The graph G has no minimal spanning tree (MST). (b) The graph G has unique of MST of cost (n — l). (c) The graph G has multiple distinct MSTs, each of cost (n — 1). (d) The graph G has multiple MSTs of different costs. AE-CS l 10. The best data structure to check whether an arithmetic expression has balanced parentheses or not is a _. (a) Queue ~ (b) Stack (c) Tree (d) List 11. In a heap of n elements with the smallest element in the root, the 7‘h smallest element can be found in time . (a) 9 (n 10g n) (b) 9 (n) (C) 9 (log n) (d) 9 (1) 12.‘The height of a binary tree is the maximum No.of edges in any root to leaf path. The maximum number of nodes in any binary tree of height h is . (a) 2h (b) 2“'1 — 1 (0)21”l — 1 (d) 2M 13. Which of the following sorting algorithms has the lowest worst-case complexity? (a) Merge sort (b) Bubble sort (c) Quick sort (d) Selection sort 14. The maximum number of edges in a n-node undirected graph without self-loops is (a) n2 (b) n(n-1) / 2 (c) n — 1 (d) (n+ 1) (n) / 2 15. For merging two sorted lists of sizes m and n into a sorted list of (m+n), we require comparisons of the order (a) 0(m) (b) 0(n) (C) 0011+“) 00 0(10gm+10g 11) 16. The range of integers that can be represented by a n bit, 2’s complement number system is (a) —2"“ to (2”1 -1) (b) 42““ -1) to (2"'‘ -1) (c) -2“ to 2'“1 (d) —(2“‘1 +1) to (2“ —1) 17. The Boolean function x’y’+xy+x’y is equivalent to (a) x’+y’ (b) x+y (C) x+y’ (d) X’+y 18. Which of the following addressing modes are suitable for program relocation at run time? (i) absolute addressing (ii) based addressing (iii) relative addressing (iv) indirect addressing (a) (i) and (iv) (b) (i) and (ii) (c) (ii) and (iii) (d) (i), (ii) and (iv) 19. Which of the following DMA transfer modes and interrupt handling mechanisms provide the highest I/O bandwidth? (a) Transparent DMA and polled interrupts (b) Cycle stealing and vectored interrupts (c) Block transfer and vectored interrupts ((1) Block transfer and polled interrupts 20. The addition of the 4 bit 2’s complement binary numbers 1101 and 0100 results in (a) 0001 and an overflow (b) 1001 and no overflow (c) 0001 and no overflow (d) 1001 and an overflow 21. The grammer A9AA|(A)] e is not suitable for predictive parsing because the grammer is (a) Ambiguous (b) Left-recursive (0) Right recursive (d) An operator grammer AE-CS2 22. Which of the following is TRUE about the regular expression 01 *0? (a) It represents a finite set of finite strings (b) It represents an infinite set of finite strings (c) It represents a finite set of infinite strings (d) It represents an infinite set of infinite strings 23. Context free languages closed under (a) Union, Intersection _ (b) Union, Kleene closure (c) Intersection, compliment (d) complement, Kleene closure. 24. Consider the grammer with the following productions S—> a 0L blb a clAb S—> 0t s|b S—> a bbl ab S at -> b d blb The above grammar is (a) Context free (b) Regular (0) Context sensitive (d)LRCK 25. Regarding the power of recognition of languages, which of the following statements is false? (a) The non deterministic finite state automata are equivalent to deterministic finite state automata. (b) Non' deterministic push down automata are equivalent to deterministic push down automata. (0) Non deterministic turing machines are equivalent to deterministic turing machines. (d) Non deterministic turing machines are equivalent to deterministic push down automata. 26. A hash table contains 10 buckets and uses linear probing to resolve collisions. The key values are integers and hash functions used is key %10. If the values 43,165,62,123 and 142 are inserted in the table, in what location would the key value 142 be inserted? (a) 2 (b) 3 (C) 4 (d) 6 27. A linker is given object modules for a set of programs that were compiled separately. What informationneed no_t be included in an object module? (a) Object code (b) relocation bits (0) Names & locations of all external symbols defined in the object module (d) absolute address of internal symbols 28. Relative mode of addressing is most relevant while writing (a) C0 routines (b) Position independent code (c) Shareable code (d) Interrupt handlers 29. Which operation does a simple two pass assembler do during the first pass?‘ (a) Allocates space for literals (b) Computes the total length of program (c) builds the symbol table ((1) all of the above. AE—CS3 30. The parsing technique that avoids back tracking is (a) Top down parsing (b) Recursive descent parsing (c) Predictive parsing (d) both (b) and (c) 31. Test and set are used in (a) Critical region (b) Semaphores (c) Race round (d) None of these. 32. Dijkstra’s bankers’ algorithm is used in the context of (a) dead lock avoidance (b) deadlock recovery (c) mutual exclusion (d) context sustaining. 33. The concept of dirty bit for a page table (a) helps in avoiding unnecessary writing on a paging device (b) helps to maintain LRU information (c) allows only to read the page (d) none of these. 34. In which method of storage is a program placed in the largest available hole in the main memory? (a) Best fit . (b) First fit (c) Worst fit (d) None of these 35. The search concept used in associative memory is (a) Parallel search (b) Sequential search (e) Binary search (d) Selective search 36. Which scheduling policy is most suitable for a time shared operating system? (a) Shortest job first (b) Round Robin (c)First cum first serve (d)Longest job first. 37. For a “tuple” of a database the comparable element of algebra is (a) row (b) column (c) table (d) function. 38. Look at the instance of a relation R(A,B,C) below. We can conclude that (a) A functionally determines B and B functionality determines C. (b) A functionally determines B and B does not fimctionally determine C (c) B does not functionally determine C (d) A does not functionally determine B and B does not functionally determine C 39. Consider a schema R (A, B, C, D) and functional dependencies A-)B and C9D. Then the decomposition of R into R;(AB) and R2(CD) is . (a) Dependency preserving and lossless join (b) Lossless join but not dependency preserving (c) Dependency preserving but not lossless join (d) Neither dependency preserving not lossless join AE-CS4 40. 41. 42. 43. 44. 45. 46. 47. 48. A relation R with an associated set of functional dependencies F is decomposed into BCNF. The redundancy in the resulting set of relations is (a) Zero (b) More than zero, but less than that of an e uivalent q (c) Proportional to the size of Ft (d) Undeterminate Which normal form is considered adequate for normal relational database design? (a) 2NF (b) 5NF (0) 4NF (d) 3NF A subnet has been assigned a subnet mask of 255.255.255.192. What is the maximum number of hosts that can belong to this subnet? (a) 14 (b) 30 (c) 62 (d) 126 In TCP, a unique sequence number is assigned to each (a) Byte (b) Word (c) Segment (d) Message Which one of the following statements is false? (a) Packet switching leads to better utilization of bandwidth than circuit switching (b) Packet switching results is less variation in delay than circuit switching (0) Packet switching needs more per packet processing than circuit switching (d) Packet switching can lead to reordering unlike in circuit switching A sender is employing public key cryptography to send a message to the receiver. Which of the following statements are TRUE ? (a) Sender encrypts using receiver’s public key (b) Sender encrypts using his own public key (c) Receiver decrypts using sender’s public key (d) Receiver decrypts using his own public key Count to infinity is a problem associated with (a) Link state routing protocol (b) Distance vector routing protocol (0) DNS while resolving host name (d) TCP for congestion control Which of the following objects can be used in expressions and scriplets in J SP without explicitly declaring them ? (a) Session and request only (b) Request and response only (c) Response and session only (d) Session, request and response What is ASP ? (a) It is a programming language (b) It is a package (c) It is a Scripting language (d) It is a testing tool AE-CSS 49. A HTML form is to be designed to enable purchase of office stationery. Required items are to be checked. Credit card details are to be entered and the submit button is to be pressed. Which of the following options would be appropriate to send data to the server? (21) GET only (b)POST only (0) either GET or POST (d) Neither GET nor POST. 50. Which of the following is TRUE only in case of XML but not HTML? (a) It is derived from SGML (b) It describes content and layout (c) It allows user defined tags (d) It is restricted only to be used with web browsers PART —— II Each Question carries two marks 25 X 2 = 50 Marks 51. An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is (a) 3 (b) 4 (C) 5 (d) 6 52. Consider the following first order logic formula in which R is a binary relation symbol. \7’x Vy y(R x,y) = R(y,x). The formula is (a) Satisfiable and Valid (b) Satisfiable and so is its negation (c) Unsatisfiable but its negation is valid (cl) Satisfiable but its negation is unsatisfiable. 53. It is desired to find the no. of defective chips in a computer chip production unit. Obviously the probability of finding a defective chip does not depend on whether the previous chip was defective or not. The probability distribution is (a) binomial (b) normal (0) Uniform (d) Triangular 54. In a complete K-ary tree, every internal node has exactly K children. The number of leaves in such a tree with n internal nodes is (a) nk (b) (n-l) k+1 (c) n(k-1)+1 (d) n(k-1) 55. How many distinct binary search trees can be created out of 4 distinct keys? (a) 5 (b) 14 (c) 24 (d) 42 56. Suppose we run Dijkstra’s single source shortest path algorithm on the following edge-weighted directed graph with vertex P as the source 2' 0/ 1“ “w, H" M MW R l ' "' \ a / /’ \ I?” . _ \./ \(f / In what order do the nodes get included into the f l’ ILMMME (SK 1 set of vertices for which the shortest path \"‘4\ //>’ - 3 I distances are finalized? \‘ l 4 ' a \7‘ ”/0 / \ \ { LMWLW 1;) \WI M” , (a) P,Q,R,S,T,U (b) PaQ,R,U,S,T (C) P,Q,R,U,T,S (d) P3Q7T2R2U>S- AE—CSG 57. A circularly linked list is used to represent a queue. A single variable P is used to access the queue. To which node should P point, such that both the operations of enqueue(insert) and dequeue(delete) can be performed in constant time? ' ' ' l 4. u lel'rt E... (a) Rear Mode (b) Front Mode (0) Not possible with a single pointer ((1) Node next to front i 58. Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from vertex i to vertex j if either j = i+1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertexlOO is (a) 4 (b) 7 (c) 23 (d) 99 59. Which of the following sequences of array elements forms a heap? (a) [23,17,14,6,13,10,1,12,7,5] (b) [23,17,14,6,13,10,l,5,7,12] (c) [23,17,14,7,13,10,1,5,6,12] (d) [23,17,14,7,13,10,l,12,5,7] 60. Which of the following expressions is equivalent to (A6) B) G) C? (a) (A+B+C)( A + E + E ) (b) (A+B+C) ( A + E +C) (c) ABC + A(B @ C)+ E (A e C) (d) none of these. 61. A serial transmission T1 uses 8 information bits, 2 start bits, 1 stop bit and l parity bit for each character. A synchronous transmission T2 uses 3 eight bit sync characters followed by 30 eight bit information characters. If the bit rate is 1200 bits/second in both, what are the transfer rates of T1 and T2? (a)100 ch/sec , 153 ch/sec (b) 80 ch/sec, 136 ch/sec (c) 100 ch/sec, 136 ch/sec (d) 80 ch/sec, 153 ch/sec. 62. A certain processor supports only the immediate and direct addressing modes. Which of the following programming language features cannot be implemented on this processor? (a) Pointers (b) Arrays (0) Records (d) all of these. 63. Consider the grammar given below 3 —> xB l yA ' A-) X! xsl yAA B9 yl ySl yBB Consider the following strings: i ) xxyyx ii) xx yy xy iii) xy‘xy iv) yx xy Which of the J strings are generated by the grammer? (a) (i), (ii) and (iii) (b) (ii) (0) (ii) (iii) and iv (d) i, iii, and iv AE-CS7 64. If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DF A? 6 (a) Set of all strings that do not end with ab (b) Set of all strings that begin with either an a or b. (c) Set of all strings that do not contain the substring ab. (d) The set described by the regular expression b* aa* (ba) * b*. 65. Generation of intermediate code based on an abstract machine model is useful in compilers because __ (a) It makes implementation of lexical analysis and syntax analysis easier (b) Syntax directed translations can be written for intermediate code generation (c) It enhances the portability of the front end of the complier. (d) It is not possible to generate code for real machines directly from HLL. 66. An advantage of chained hash table (external hashing) over the open addressing scheme is (a) Worst case complexity of search operations is less (b) Space used is less (c) Deletion is easier I (d) None of the above 67. In a multiprogramming environment a set of processes is deadlocked if each process is waiting for an event to occur that can be initiated only by another process in the set. Which of the following is Not one of the conditions necessary for dead lock to occur ? (a) Mutual Exclusion (b) Partial assignment of resources (0) Non preemption (d) Process suspension. 68. The correct matching for the following pairs (A) Disk Scheduling 1. Round Robin (B) Batch Processing 2. SCAN (C) Time sharing 3. LIFO (D) Interrupt processing 4. FIFO (a) A—3, B—4, C—2, D-l (b) A-4, B—3, C-2, D-l (c) A-2, B-4, C-l, D-3 (d) A-3, 3-4, 01, DZ 69. A relation R is defined on the set of integers as ny if (x+y) is even. Which of the following statements is true? (a) R is not an equivalence relation (b) R is an equivalence relation having 1 equivalent class (c) R is an equivalence relation having 2 equivalent class (d) R is an equivalence relation having 3 equivalent class AE-CSS 70. A binary relation R= {( 1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2), (3,3), (3,4)} on the set A = {1,2,3,4} is _ (a) Reflexive, symmetric and transitive V (b) Neither reflexive nor irreflexive but transitive (c) Irreflexive, symmetric and transitive (d) Irreflexive and antisymmetric 71. In a sliding window ARQ scheme, the transmitter’s window size is N and the receiver’s window size is M. the minimum number of distinct sequence numbers required to ensure correct operation of the ARQ scheme is (a) Min (M,N) (b) max(M,N) (c) M+1 (d) MN 53 72. A 20 Kbps satellite link has a propagation delay of 400 ms. The transmitter employs a “go back n ARQ scheme with n set to 10. Assuming that each frame is 100 bytes long, what is the maximum data rate possible ? (a) 5 kbps (b) 10 kbps (0) 15 kbps (d) 20 kbps 73. A station A uses 32 byte packets to transmit message to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window size that A should use? (a) 20 . (b) 40 (c) 160 (d) 320 74. Consider the following statements (i) telnet, ftp and http are application layer protocols. (ii) EJ B (Enterprise Java Beans) components can be employed by J2EE (Java2 Enterprise Edition) application server (iii) If two languages confirm to the common language specification (CLS) of Microsoft .Net framework, then a class defined in any one of them may be inherited by the other. Which of them are true statements? (a) (i) and (ii) only (b) (i) and (iii) only (0) (ii) and (iii) only (d) all of them 75. Which of the following statements are true? (a) A computer virus infects by attaching its copies to other programs. (b) A network worm enters the system as an independent program. (c) Once inside a system, a worm behaves just like a virus. ((1) All of the above ***** AE-CS9 ...
View Full Document

  • Summer '18
  • Anonymus
  • Computer Science, following statements, Equivalence relation, OMR Response Sheet, Deterministic Turing Machines

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Ask Expert Tutors You can ask 0 bonus questions You can ask 0 questions (0 expire soon) You can ask 0 questions (will expire )
Answers in as fast as 15 minutes