GATE CS-1 Kindly Submit Your Details, Then You Can Start Your Test !! Name Mobile No. Email City State Country Course 1. Based on the given statements, select the most appropriate option to solve the given question What will be the total weight of 10 poles each of same weight? (i) One fourth of the weight of a pole is(ii) The total weight of these poles is 160 kg more than the total weight of two poles (A) Statement I alone is not sufficient (B) Statement II alone is not sufficient (C) Either I or II alone is sufficient (D) Both statements I and II together are not sufficient. 2.Consider a function f x=1 -x on -1 ≤x≤ 1. The value of x at which the function attains a maximum, and the maximum value of the function are. (A) 0, -1 (B) -1, 0 (C) 0, 1 (D) -1, 2 3. A generic term that include various items of clothing such as a skirt, a pair of trousers and a shirt is A) Fabric (B) Textile (C) Fibre (D) Apparel 4. Choose the statement where underlined word is used correctly. (A) The industrialist load a personnel jet. (B) I write my experience in my personnel diary (C) All personnel are being given the day off. (D) Being religious is a personnel aspect. 5. We our friend’s birthday and we how to make it up to him. (A) Completely forgot - - - don’t just know (B) Forgot completely - - - don’t just know (C) Completely forgot - - - just don’t know (D) Forgot completely - - - just don’t know 6. Out of the following four sentences, select the most suitable sentence with respect to grammar and usage. (A) Since the report lacked needed information, it was of no use to them. (B) The report was useless to them because there were no needed information in it. (C) Since the report did not contain the needed information, it was not real useful to them (D) Since the report lacked needed information, it would not had been useful to them. 7. If the list of letters, P,R,S,T,U is an arithmetic sequence, which of the following are also in arithmetic sequence? I . 2P, 2R, 2S, 2T, 2U II . P - 3, R - 3,S - 3, T - 3, U - 3 P2 , R 2 , S2 , T2 , U2 (A) I only (B) I and II (C) II and III (D) I and III 8. Four branches of a company are located at M.N.O and P. M is north of N at a distance of 4km: P is south of O at a distance of 2 km: N is southeast of O by 1 km. What is the distance between M and P in km? (A) 5.34 (B) 6.74 (C) 28.5 (D) 45.49 9. Let R be the relation on the set of positive integers such that a aRb if and only if a and b are distinct and have a common divisor other than 1. Which one of the following statements about R is true? (A) R is symmetric and reflexive but not transitive (B) R is reflexive but not symmetric and not transitive (C) R is transitive but not reflexive and not symmetric (D) R is symmetric but not reflexive and not transitive 10. Consider the following transaction involving two bank account x and y. read (x) ; x : = x – 50; write (x) ; read (y); y : = y + 50 ; write (y) The constraint that the sum of the accounts x and y should remain constant is that of (A) Atomicity (B) Consistency (C) Isolation (D) Durability 11. Which one of the following statements follows from S1 and S2 per sound interference rules of logic? Consider the following two S1 : if a candidate is known to be corrupt, then he will not be elected S2 : if a candidate is kind, he will be elected (A) If a person is known to corrupt, he is kind (B) If a person is not known to be corrupt, he is not kind (C) If a person is kind, he is not known to be corrupt (D) If a person is not kind, he is not known to be corrupt 12. In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE? (A) In both AST and CFG, let node, N2 be the successor of node N1. In the input program, the code corresponding to N2 is present after the code corresponding in N1. (B) For any input program, neither AST nor CFG will contain a cycle (C) The maximum number of successors of a node in an AST and a CFG depends on the input program (D) Each node is AST and CFG corresponds to at most one statement in the input program 13. A software requirements specification (SRS) document should avoid discussing which one of the following? (A) User interface issues (B) Non-functional requirements (C) Design specification (D) Interfaces with third party software 14. Identify the correct order in which a server process must invoke the function calls accept, bind, listen, and recv according to UNIX socket APL (A) listen, accept, bind recv (B) bind, listen, accept, recv C) bind, accept, listen, recv (D) accept, listen, bind recv 15. Which one of the following statements is NOT correct about HTTP cookies? (A) A cookie is a piece of code that has the potential to compromise the security of an internet user (B) A cookie gains entry to the user’s work area through an HTTP header (C) A cookie has an expiry date and time (D) Cookies can be used to track the browsing pattern of a user at a particular site 16. (A) P -2, Q -3, R -1, S -4 (B) P -2, Q -1, R -4, S -3 (C) P -2, Q -4, R -1, S -3 (D) P -2, Q -3, R -4, S -1 17. Consider two decision problems Q1, Q2 such that Q1 reduces in polynomial time to 3-SAT and 3 -SAT reduces in polynomial time to Q2. Then which one of following is consistent with the above statement? (A) Q1 is in NP, Q2 in NP hard (B) Q2 is in NP, Q1 is NP hard Both Q1 and Q2 are in NP Both Q1 and Q2 are NP hard 18. Which of the above statements is/are true? Consider the following statements(i) The complement of every Turing decidable language is Turing decidable(ii)There exists some language which is in NP but is not turing decidable(iii) If L is a language in NP, L is turing decidable (A) Only II (B) Only III (C) Only I and II (D) Only I and III 19. In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true? ≤Add description here! (A) A tree has no bridges (B) A bridge cannot be part of a simple cycle (C) Every edge of a clique with size ≤3 is a bridge (A clique is any compete sub graph of a graph) (D) A graph with bridges cannot have a cycle 20. Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process? (A) 200KB and 300 KB (B) 200KB and 250 KB (C) 250KB and 300 KB (D) 300KB and 400 KB 21. Which one of the following assertions concerning code inspection and code walkthrough is true? (A) Code inspection is carried out once the code has been unit tested (B) Code inspection and code walkthrough are synonyms (C) Adherence to coding standards is checked during code inspection (D) Code walkthrough is usually carried out by an independent test team 22 Given below are some algorithms, and some algorithm design. (A) 1 -i, 2 -iii, 3 -i, 4 -v (B) 1 -iii, 2 -iii, 3 -i, 4 -v (C) 1 -iii, 2 -ii, 3 -i, 4 -iv (D)1 -iii, 2 -ii, 3 -i, 4 -v 23. The content of PC just before the fetch of a CALL instruction is (5FA0)16. After execution of the CALL instruction, the value of the stack pointer is Consider a processor with byte-addressable Assume that all registers, including Program Counter (PC) and Program Status Word (PSW), are of size 2 bytes. A stack in the main memory is implemented from memory location (0100) and it grows upward. The stack pointer (SP) points to the top element of the stack. The current value of SP is (016E) . The CALL instruction is of two words, the first word is the op-code and the second word is the starting address of the subroutine. (one word = 2bytes) . The CALL instruction is implemented as follows: Store the current Vale of PC in the Stack Store the value of PSW register in the stack Load the starting address of the subroutine in PC (A) (016A)16 (B) (016)16 (C) (0170)16 (D) (0172)16 24. Host A sends a UDP datagram containing 8880 bytes of user data to host B over an Ethernet LAN. Ethernet frames may carry data up to 1500 bytes (i.e. MTU = 1500 bytes). Size of UDP header is 8 bytes and size of IP heard is 20 bytes.There is no option field in IP header How many total number of IP fragments will be transmitted and what will be the contents of offset field in the last fragment? (A) 6 and 95 (B) 6 and 7400 (C) 7 and 1110 (D) 7 and 8880 25. A graph is self-complementary if it is isomorphic to its complement For all self- complementary graphs on n vertices, n is (A) A multiple of 4 (B) Even (C) Odd (D) Congruent to 0 mod 4, or, 1 mod 4 26. Extreme focus on syllabus and studying for tests has become such a dominant concern of Indian students that they close their minds to anything to the requirements of the exam (A) related B) extraneous (C) outside (D) useful 27 A function f(x) is linear and has a value of 29 at x = -2 and 39 at x = 3. Find its value at x = 5. (A) 59 (B) 45 (C) 43 (D) 35 28 The Tamil version of_______John Abraham-starrer Madras café_______ cleared by the Censor Board with no cuts last week but the film’s distributors release in Tamil Nadu_______ this Friday. no takers among the exhibitors for a (A) Mr., was, found, on (B) a, was, found, at (C) the, was, found, on (D) a, being, find at 29. If ROAD is written as URDG, then SWAN should be written as: (A) VXDQ (B) VZDQ (C) VZDP (D) UXDQ 30. Select the pair that best expresses a relationship similar to that expressed in the pair: Children: Pediatrician (A) Adult: Orthopaedist (B) Females: Gynaecologist (C) Kidney: Nephrologist (D) Skin: Dermatologist 31. The head of a newly formed government desires to appoint five of the six selected members P,Q,R,S,T and U to portfolios of Home, Power, Defense, Telecom, and Finance. U does not want any portfolio if S gets one of the five. R wants either Home or Finance or no portfolio. Q says that if S gets either Power or Telecom, then she must get the other one. T insists on a portfolio if P gets one. Which is the valid distribution of portfolios? (A) P-Home, Q-Power, R-Defense, S-Telecom, T-Finance (B) R-Home, S-Power, P-Defense, Q-Telecom, T-Finance (C) P-Home, Q-Power, T-Defense, S-Telecom, U-Finance (D) Q-Home, U-Power, T-Defense, R-Telecom, P-Finance 32. Choose the most appropriate equation for the function drawn as a thick line, in the plot (A) x =y -y (B) x =-(y - y ) (C) x =y +y (D) x =-(y - y ) 33. Which of the statement (s) below is/are logically valid and can be inferred from the above passage? Most experts feel that in spite of possessing all the technical skills required to be a batsman of the highest order, he is unlikely to be so due to lack of requisite He was guilty of throwing away his wicket several times after working hard to lay a strong foundation. His critics pointed out that until he addressed this problem success at the highest level will continue to elude him.(i) He was already a successful batsman at the highest level(ii)He has to improve his temperament in order to become a great batsman(iii)He failed to make many of his good starts count(iv)Improving his technical skills will guarantee success (A) (iii) and (iv) (B) (ii) and (iii) C) (i), (ii) and (iii) (D) (ii) only 34. Alexander turned his attention towards India, since he had conquered Persia. Which one of the statements below is logically valid and can inferred from the above sentence? (A) Alexander would not have turned his attention towards India had he not conquered Persia. (B) Alexander was not ready to rest on his laurels, and wanted to march to India (C) Alexander was completely in control of his army and could command it to move towards India (D) Since Alexander’s kingdom extended to Indian borders after the conquest of Persia, he was keen to move further 35. Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order? (A) SLR, LALR (B) Canonical LR, LALR (C) LR, canonical LR (D) LALR, canonical LR 36. Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order? (A) SLR, LALR (B) Canonical LR, LALR (C) SLR, canonical LR (D) LALR, canonical LR 37. The maximum number of processes that can be in Ready state for a computer system with n CPUs is A. n B. n2 C. 2n .D Independent of n 38. While inserting the elements 71,65,84,69,67,83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is (A) 65 (B) 67 (C) 69 (D) 83 39. Consider a machine with byte addressable main memory of 2020 bytes, block size of 16 bytes and a direct mapped cache having 212 cache lines. Let the address of two consecutive bytes in main memory be (E201F)16 and (E2020)16 . What are the tag and cache line address (in hex) for main memory address (E201F)16? A. E, 201 (B) F, 201 (C) E, E20 (D) 2, 01F 40. The result evaluating the postfix expression 10 5 60 6 / *8 is (A) 284 (B) 213 (C) 142 (D) 71 41. Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (108 bits second) over a 1 km(kilometer) cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is the signal speed (km/sec) in the cable? (A) 8000 (B) 10000 (C) 16000 (D) 20000 42. Assume that a mergesort algorithm in the worst case takes 30 second for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes? (A) 256 (B) 512 (C) 1024 (D) 2048 43. When of the above policies can be used for preventing deadlock? Consider the following policies for preventing deadlock in a system with mutually exclusive resources(i) Processes should acquire all their resources at the beginning of If any resources acquired so far are released.(ii)The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers(iii)The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers.(iv) The resources are numbered A process is allowed to request only for a resource with resource number larger than its currently held resources. (A) Any one of I and III but not II or IV (B) Any one of I, III, and IV but not II (C) Any one of II and III but not I or IV Any one of I, II, III, and IV 44. For the processes listed in the following table, which of the following scheduling schemes will the lowest average turnaround time? (A) Fir Come First Serve (B) Non-preemptive Shortest Job First (C) Shortest Remaining Time (D) Round Robin with Quantum value two 45. Let R be a relation on the set of ordered pairs of positive integers such that (p, q)(r,s) R p s q =r. Which one of the following is true about R? A. Both reflexive and symmetric (B) Reflexive but not symmetric (C) Not reflexive but symmetric D. Neither reflexive nor symmetric 46. Two hosts are connected via a packet switch with 107 bits per second links. Each link has a propagation. Delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 1000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits, the time elapsed between the transmission of the first bit of data and the reception of the last of the data in microsecond is_____ . A. 1575 B. 7515 C.1576 D. 1675 47. Which one of above stamens is/are correct? Consider the following code sequence having five instructions I1 to I5. Each of these instructions has the following format. OP Ri, Rj, Rk Where operation OP is performed on contents of registers Rj and register Ri. I1 : ADD R1, R2, R3 I2 : MUL R7, R1, R3 I3 : SUB R4, R1, R5 I4 : ADD R 3, R 2, R 4 I5 : MUL R7, R8, R9 Consider the following three statements. S1: There is an anti-dependence between instructions I2 and I5 S3: Within an instruction pipeline an anti-dependence always creates on or more stalls A. Only S1 is true (B) Only S2 is true C .Only S1 and S3 are true (D) Only S2 and S3 are true 48. In the network 200.20.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is_______. A. 158 B, 160 C. 170 D.180 49. Which of the following languages are context-free? (A) L1and L2only (B) L1and L3 only (C) L2and L3 only (D) L3 only 50. Language L1 is polynomial time reducible to language L2. Language L3 is polynomial time reducible to L2, which in turn is polynomial time reducible to language L4. Which of the following is/are true? I. III. IV. if L4 ÎP, then L2 ÎP if L1 ÎP or L3 ÎP, then L2 ÎP L1 ÎP, if and only if L3 ÎP if L4 ÎP, then L1 ÎP and L3 ÎP (A) II only (B) III only C) I and IV only (D) I only 51. The man who is now Municipal Commissioner worked as . A. the security guard at a university B. a security guard at the university C. a security guard at university D. the security guard at the university 52. Nobody knows how the Indian cricket team is going to cope with the difficult and seamer-friendly wickets in Australia. Choose the option which is closest in meaning to the underlined phase in the above sentence. A. put up with B. put in with C. put down to D. put up against 53. Find the odd one in the following group of words. Mock, deride, praise, jeer A. mock B. deride C. praise D. jeer 54. Pick the odd one from the following options. A. CADBE B. JHKIL C. XVYWZ D. ONPMQ 55. Among 150 faculty members in an institute, 55 are connected with each other through Facebook and 85 are connected through WhatsApp. 30 faculty members do not have Facebook or WhatsApp accounts. The number of faculty members connected only through Facebook accounts is____ . A. 35 B. 45 C. 65 D. 90 56. Suppose that a shop has an equal number of LEDbulbs of two different types. The probability of an LED bulb lasting more than 100 hours given that it is of Type 1 is 0.7, and given that it is of Type 2 is 0.4. The probability that an LED bulb chosen uniformly at random lasts more than 100 hours is_____ . A. 0.11 B. 0.23 C. 0.55 D. 0.62 57. The Floyd-Warshall algorithm for all-pair shortest paths computation is based on A. Greedy paradigm B. Divide-and-Conquer paradigm C. Dynamic Programming paradigm. D. Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm 58. Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires A. Anarkali’s public key B. Salim’s public key C. Salim’s private key D. Anarkali’s private key 59. The width of the physical address on a machine is 40 bits. The width of the tag field in a 512 KB 8-way set associative cache is bits. A. 14 B. 24 C. 34 D. 44 61. A complete binary min-heap is made by including each integer in [1, 1023] exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth 0. The maximum depth at which integer 9 can appear is________. A. 6 B. 7 C. 8 D. 9 62. All hill-stations have a lake. Ooty has two lakes. Which of the statement(s) below is/are logically valid and can be inferred from the above sentences? (i) Ooty is not a hill-station(ii) No hill-station can have more than one A. (i) Only B. (ii) Only C. both (i) and (ii) D. neither (i) nor (ii) 63. The minimum number of colours that is sufficient to vertex-colour any planar graph is . A. 1 B. 2 C. 3 D. 4 64.Which one of the following is CORRECT? Consider the systems, each consisting of m linear equations in n(i) If m < n, then all such systems have a solution(ii) If m > n, then none of these systems has a solution(iii) If m = n, then there exists a system which has a A. I, II and III are true B. Only II and III are true C. Only III is true D. None of them is true 65. Let X be the number of distinct 16-bit integers in 2’s complement representation. Let Y be the number of distinct 16-bit integers in sign magnitude representation. Then X − Y is . A. 1 B. 2 C. 3 D. 4 Warning: Undefined array key "correct_answer_logic" in /home/kaling/public_html/kalingaplus/wp-content/plugins/quiz-master-next/php/classes/class-qmn-quiz-manager.php on line 451 Time's up