GATE 2011 Computer Science Engineering Set - C: Q.1 - Q.25 Carry One Mark Each

GATE 2011
CS Mock Test Series
GATE 2011 Computer Science Engineering Set C

Q.1 - Q.25 Carry One Mark each. 1. Consider a relational table with a single record for each registered student with the following attributes. 1. Registration_Num: Unique registration number of each registered student 2. UID: Unique identity number, unique at the national level for each citizen 3. BankAccount_Num: Unique account number at the bank. A student can have multiple 4. Name: Name of student 5. Hostel_Room: Room number of the hostel Which of the following options is INCORRECT? (A) BankAccount_Num is a candidate key (B) Registration_Num can be a primary key (C) UID is a candidate key if all students are from the same country (D) If S is a superkey such that SUID is NULL then SUID is also a superkey [Ans. A] Since students can have joint accounts, two students can have same bank account number. So, bank account number can not be candidate key. 2. A computer handles several interrupt sources of which of the following are relevant for this question. Interrupt from CPU temperature sensor (raises interrupt if CPU temperature is too high) Interrupt from Mouse (raises interrupt if the mouse is moved or a button is pressed) Interrupt from Keyboard (raises interrupt when a key is pressed or released) Interrupt from Hard Disk (raises interrupt when a disk read is completed) Which one of these will be handled at the HIGHEST priority? (A) Interrupt from Hard Disk (C) Interrupt from Keyboard (B) Interrupt from Mouse (D) Interrupt from CPU temperature sensor [Ans. D] 3. Which one of the following is NOT desired in a good Software Requirement Specifications (SRS) document? (A) Functional Requirements (C) Goals of Implementation (B) Non-Functional Requirements (D) Algorithms for Software Implementation [Ans. D] Algorithms for implementation should not be part of system requirements. 4. HTML (Hyper Text Markup Language) has language elements which permit certain actions other than describing the structure of the web document. Which one of the following actions is NOT supported by pure HTML (without any server or client side scripting) pages? (A) Embed web objects from different sites into the same page (B) Refresh the page automatically after a specified interval (C) Automatically redirect to another page upon download (D) Display the client time as part of the page [Ans. D] Client side scripting is required to display clients system time on page.
*Correspondence Course * Classroom Coaching * All India Mock Test Series * Postal Test Series * Video Lectures * Online Tests/Classes* Crash Course Head Office : #74, Keshava Krupa (Third Floor), 30th Cross, 10th Main, Jayanagar 4th Block, Bangalore- 11, Ph: 080- 22445535, Mob: +91 9663376248, Copyright reserved. Log on to www.thegateacademy.com for details, updates, free online test, analysis, discussions etc. Page 1
GATE 2011
CS Mock Test Series
5. Which of the following pairs have DIFFERENT expressive power? (A) Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA) (B) Deterministic push down automata (DPDA) and Non-deterministic push down automata (NPDA) (C) Deterministic single-tape Turing machine and Non-deterministic single-tape Turing machine (D) Single-tape Turing machine and multi-tape Turing machine [Ans. B] 6. A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs to determine the effort in personmonths needed to develop this software using the basic COCOMO model. The multiplicative factor for this model is given as 2.8 for the software development on embedded systems while the exponentiation factor is given as 1.20. What is the estimated effort in person-months? (A) 234.25 (C) 287.80 (B) 932.50 (D) 122.40 [Ans. A] KLOC = 40 a = 2.8 b = 1.2 Effort a( ) = 234.25 7. Let the time taken to switch between user and kernel modes of execution be switch between two processes be . Which of the following is TRUE? (A) (B) (C) (D) nothing can be said about the relation between and [Ans. B] while the time taken to
8. A company needs to develop a strategy for software product development for which it has a choice of two programming languages L1 and L2. The number of lines of code (LOC) developed using L2 is estimated to be twice the LOC developed with L1. The product will have to be maintained for five years. Various parameters for the company are given in the table below. Parameter Language L1 Language L2 Man years needed for development LOC/10000 LOC/10000 Development Cost per man year Rs. 10,00,000 Rs. 7,50,000 Maintenance time 5 years 5 years Cost of maintenance per year Rs. 1,00,000 Rs. 50,000 Total cost of the project includes cost of development and maintenance. What is the LOC for L1 for which the cost of the project using L1 is equal to the cost of the project using L2? (A) 4000 (C) 4333 (B) 5000 (D) 4667 [Ans. B] Let x be the number of lines of code in language L1. Let and be the project costs if we go ahead with L1 and L2 respectively.
Solving
gives x = 5000
GATE 2011
CS Mock Test Series
9. Consider different activities related to email. m1: Send an email from a mail client to a mail server m2: Download an email from mailbox server to a mail client m3: Checking email in a web browser Which is the application level protocol used in each activity? (A) m1: HTTP m2: SMTP m3: POP (B) m1: SMTP m2: FTP m3: HTTP (C) m1: SMTP m2: POP m3: HTTP (D) m1: POP m2: SMTP m3: IMAP [Ans. C] Mail client uses SMTP (Simple Mail Transfer Protocol) to send mail. (The client need not be web based. So, HTTP may not be involved here). POP (Post Office Protocol) is used to retrieve mail from mail server. HTTP (Hypertext transfer protocol) is used to transfer a HTML page containing the mail message that can be viewed on a web browser. 10. If two fair coins are flipped and at least one of the outcomes is known to be a head, what is the probability that both outcomes are heads? (A) (B) (C) (D)
[Ans. A] Of the three possible equiprobable outcomes (HT, TH, HH), one is favorable. So, the probability is 1/3. 11. A layer-4 firewall (a device that can look at all protocol headers up to the transport layer) CANNOT (A) block entire HTTP traffic during 9:00PM and 5:00AM (B) block all ICMP traffic (C) stop incoming traffic from a specific IP address but allow outgoing traffic to the same IP address (D) block TCP traffic from a specific user on a multi-user system during 9:00PM and 5:00Am [Ans. A] 12. In a compiler, keywords of a language are recognized during (A) parsing of the program (C) the lexical analysis of the program (B) the code generation (D) dataflow analysis [Ans. C] Keywords are recognized during lexical analysis. 13. An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A[0: n 1] is given below. Let denote the length of the longest monotonically increasing sequence starting at index i in the array. =1 Initialize For all i such that 0 i n 2 Finally the length of the longest monotonically increasing is Max . Which of the following statements is TRUE? (A) The algorithm used dynamic programming paradigm (B) The algorithm has a linear complexity and uses branch and bound paradigm (C) The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm (D) The algorithm uses divide and conquer paradigm
GATE 2011
CS Mock Test Series
14. Let P be a regular language and Q be a context-free language such that Q P. (For example. let P be the . Then which of the following language represented by the regular expression p*q* and be ALWAYS regular? (A) P Q (C) * P (B) P Q (D) * Q [Ans. C] A tricky question. Complement of a regular language is always regular. If M is a DFA that accepts a regular language P, then one can construct a DFA by considering non-final states in M as final states in and it accepts * P. (A) 10 (B) 10
[Ans. A] We set the initially and other values are computed in backwards order starting from k = n 2 depends on the which is already computed and hence uses dynamic through k = 0. Each value programming. The algorithm has a linear complexity, but it does not use branch and bound paradigm.
15. A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
1 (C) 10 (D) 5
10
[Ans. B] The structure of a heap is near-complete binary tree. All internal nodes except possibly in last two levels must have two children. Option A does not have this property, where as options C and D violate max-heap property that every node must have higher value than it children. 16. Which does the following fragment of C program print? Char c[] = GATE2011; char *p = c; printf(%s, p + p[3] p [11]); (A) GATE2011 (B) E2011
(C) 2011 (D) 011
GATE 2011
CS Mock Test Series
[Ans. C]
It prints the substring of GATE2011 starting at index 4. 17. Consider a hypothetical processor with an instruction of type LW R1, 20(R2), which during execution reads a 32-bit word from memory and stores it in a 32-bit register R1. The effective address of the memory location is obtained by the addition of a constant 20 and the contents of register R2. Which of the following best reflects the addressing mode implemented by this instruction for the operand in memory? (A) Immediate Addressing (C) Register Indirect Scaled Addressing (B) Register Addressing (D) Base Indexed Addressing [Ans. D] 18. Let the page fault service time be 10 ms in a computer with average memory access time being 20 ns. If one memory access, what is the effective access time for the memory? page fault is generated for every (A) 21 ns (C) 23 ns (B) 30 ns (D) 35 ns [Ans. B] memory accesses there is a page fault. On an average, for every memory accesses Average time spent during = 30 ms = Thus, effective access time per memory access is 30ns. 19. The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense? (A) Finite state automata (C) Non-deterministic pushdown automata (B) Deterministic pushdown automata (D) Turing machine [Ans. A] Lexical analysis constructs are expressed using regular expressions. So, finite state automata is necessary and sufficient to perform lexical analysis. 20. If the difference between the expectation of the square of a random variable is denoted by R, then expectation of the random variable (A) R = 0 (C) R 0 (B) R < 0 (D) R > 0 [Ans. C] Variance of X = This quantity is always non-negative as it is expectation of a non-negative quantity. 21. K4 and Q3 are graphs with the following structures.
K4 Q3
and the square of the
GATE 2011
CS Mock Test Series
Which one of the following statements is TRUE in relation to these graphs? (A) K4 is planar while Q3 is not (C) Q3 is planar while K3 is not (B) Both K4 and Q3 are planar (D) Neither K4 nor Q3 is planar [Ans. B] Both graphs are planar. Heres a planar embedding.
Figure 1: Planar embedding of K4 and Q3
22. A thread is usually defined as a light weight process because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the following is TRUE? (A) On per-thread basis, the OS maintains only CPU register state (B) The OS does not maintain a separate stack for each thread (C) On per-thread basis, the OS does not maintain virtual memory state (D) On per-thread basis, the OS maintains only scheduling and accounting information [Ans. A] 23. The minimum number of D flip-flops needed to design a mod-258 counter is (A) 9 (C) 512 (B) 8 (D) 258 [Ans. A] Mod 258 counter has 258 different states. So minimum number of bits required to represent each state is ceiling of log 258 which is 9, each of which requires one flip-flop. 24. The simplified SOP (Sum of Product) form of the Boolean expression is (A) (C) (D) (B) [Ans. B] P = 1 forces the expression to be 1. This is true only for option B. (Or you can simplify using laws of Boolean algebra and obtain the answer). 25. Which on e of the following circuits is NOT equivalent to a 2-input XNOR (exclusive NOR) gate? (A) (B)
GATE 2011
CS Mock Test Series
(C)
(D)
[Ans. D] Option A is clearly XNOR Option B is Option C is Option D is
which is XNOR which is XNOR which is XOR
Q.26 - Q.55 Carry Two Marks each. 26. Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The variables a, b, c, d and e are initially stored in memory. The binary operators used in this expression tree can be evaluated by the machine only when the operands are in registers. The instructions produce result only in a register. If no intermediate results can be stored in memory, what is the minimum number of registers needed to evaluate this expression?
(A) 2 (C) 5 (B) 9 (D) 3 [Ans. D] At each node in the tree, we can choose to evaluate either the left child or the right child. To minimize the number of registers, we should always choose the one which requires more number of registers, evaluate it and store the result in one of the registers. If both left and right subexpression, required same number of registers, we can evaluate any of them first. The minimum number of registers required in this case is called as Ershov number of the expression, and it is evaluated as follows. Assign 1 to every leaf. For every internal node, if both its children have same value x, assign x + 1 to the internal node. Otherwise, assign the maximum of the values of its children. Following this procedure, we obtain 3 as the Ershov number for the given tree.
GATE 2011
CS Mock Test Series
27. Consider the following table of arrival time and burst time for three processes P0, P1 and P2. Process Arrival Time Burst Time P0 0 ms 9 ms P1 1 ms 4 ms P2 2 ms 9 ms The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes? (A) 5.0 ms (C) 6.33 ms (B) 4.33 ms (D) 7.33 ms [Ans. A] 28. A deck of 5 cards (each carrying a distinct number from 1 to 5) is shuffled thoroughly. Two cards are then removed one at a time from the deck. What is the probability that the two cards are selected with the number on the first card being one higher than the number on the second card? (A) (B) [Ans. A] Four (12, 23, 34, 45) out of 20 outcomes are favorable. 29. Consider a finite sequence of random values X = . Let be the mean and be the standard , where deviation of X. Let another finite sequence Y of equal length be derived from this as be the mean and be the standard deviation of this sequence. Which a and b are positive constants. Let one of the following statements is INCORRECT? (A) Index position of mode of X in X is the same as the index position of mode of Y in Y. (B) Index position of median of X in X is the same as the index position of median of Y in Y. (C) (D) [Ans. D] is the correct expression. 30. Consider a database table T containing two columns X and Y each of type integer. After the creation of the is inserted in the table. table, one record Let MX and MY denote the respective maximum values of X and Y among all records in the table at any point in time. Using MX and MY, new records are inserted in the table 128 times with X and Y values being MX + 1, 2*MY + 1 respectively. It may be noted that each time after the insertion, values of MX and MY change. What will be the output of the following SQL query after the steps mentioned above are carried out? SELECT Y FROM T WHERE X=7; (A) 127 (C) 129 (B) 255 (D) 257 [Ans. A] The entries inserted in order are 11 23 37 4 15 5 31 6 63 7 127 One can also solve the recursion and find out that y =
(C) (D)
GATE 2011
CS Mock Test Series
31. Given (A) 0 (B) 2 [Ans. D]
, what will be the evaluation of the definite integral
(C) (D) i
32. Which one of the following options is CORRECT given three positive integers x, y and z, and a predicate P(x) = (A) P(x) being true means that x is a prime number (B) P(x) being true means that x is a number other than 1 (C) P(x) is always true irrespective of the value of x (D) P(x) being true means that x has exactly two factors other than 1 and x [Ans. A] The given statement reads, P(x) is true whenever x is not 1 and for every y, if there is a z such that x = y *z, then either x = y or y = 1. In other words, P(x) is true whenever x is prime. 33. We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? (A) 0 (C) n! (B) 1 (D) [Ans. B] Given a binary tree, the inorder traversal outputs exactly one permutation of its nodes. Since the values are distinct, the values must be inserted in sorted order in these nodes in order. SO, there is only one way. 34. On a non-pipelined sequential processor, a program segment, which is a part of the interrupt service routine, is given to transfer 500 bytes from an I/O device to memory. Initialize the address register Initialize the count to 500 Loop: Load a byte from device Store in memory at address given by address register Increment the address register Decrement the count If count ! = 0 go to LOOP Assume that each statement in this program is equivalent to a machine instruction which takes one clock cycle to execute if it is a non-load/store instruction. The load-store instructions take two clock cycles to execute. The designer of the system also has an alternate approach of using the DMA controller to implement the same transfer. The DMA controller requires 20 clock cycles for initialization and other overheads. Each DMA transfer cycle takes two clock cycles to transfer one byte of data from the device to the memory. What is the approximate speedup when the DMA controller based design is used in place of the interrupt driven program based input-output? (A) 3.4 (C) 5.1 (B) 4.4 (D) 6.7 [Ans. A] 35. Consider the languages L1, L2 and L3 as given below. L1 = , and L2 = . Which of the following statements is NOT TRUE? L3 =
GATE 2011
CS Mock Test Series
36. Consider the two binary operators and with the precedence of operator being lower than that of the operator . Operator is right associative while operator is left associative. Which one of the following represents the parse tree for expression (73432)? (A) (B)
(A) Push Down Automata (PDA) can be used to recognize L1 and L2 (B) L1 is a regular language (C) All the three languages are context free (D) Turing machines can be used to recognize all the languages [Ans. C] L3 is not context free. (It fails to satisfy pumping lemma for context free languages.) One can also infer the answer by observing that options A, B and D are true.
3 (C)
2 (D)
[Ans. B] When we apply the associativity and precedence rules, we see that 73432 is equivalent to the expression (7(3(43)))2 Clearly, the expression tree is given in option B.
GATE 2011
CS Mock Test Series
37. Database table by name Loan_Records is given below. Borrower Bank_Manager Ramesh Sunderajan Suresh Ramgopal Mahesh Sunderajan
Loan_Amount 10000.00 5000.00 7000.00
What is the output of the following SQL query? SELECT count(*) FROM( (SELECT Borrower, Bank_Manager FROM Loan_Records) AS S NATURAL JOIN (SELECT Bank_Manager, Loan_Amount FROM Loan_Records) AS T ); (A) 3 (C) 5 (B) 9 (D) 6 [Ans. C] The SQL outputs the number of rows in ((Ramesh, Sunderajan), (Suresh, Ramgopal), (Mahesh, Sunderajan)) NATURAL JOIN ((Sunderajan, 10000), (Ramgopal, 5000), (Sunderajan, 7000)) That is, Ramesh, Sunderajan, 10000 Ramesh, Sunderajan, 7000 Suresh, Ramgopal, 5000 Mahesh, Sunderajan, 10000 Mahesh, Sunderajan, 7000 So, it has 5 rows. 38. The following is the comment written for a C function. /* This function computes the roots of a quadratic equation a. . The function stores two real roots in *root1 and *root2 and returns the status of validity of roots. It handles for different kinds of cases. (i) When coefficient a is zero irrespective of discriminant (ii) When discriminant is positive (iii) When discriminant is zero (iv) When discriminant is negative Only in case (ii) and (iii), the stored roots are valid. Otherwise 0 is stored in the roots. The function returns 0 when the roots are valid and 1 otherwise. The function also ensures root1 >= root2. int get_QuadRoots (float a, float b, float c, float *root1, float *root2); */ A software test engineer is assigned the job of doing black box testing. He comes up with the following test cases, many of which are redundant. Test Input Set Expected output set Case a b c root1 root2 Return Value T1 0.0 0.0 7.0 0.0 0.0 1 T2 0.0 1.0 3.0 0.0 0.0 1 T3 1.0 2.0 1.0 0 1.0 1.0 T4 4.0 1.5 1.5 0 12.0 9.0 T5 1.0 0 2.0 3.0 3.0 1.0 T6 1.0 1.0 4.0 0.0 0.0 1
GATE 2011
CS Mock Test Series
Which one of the following options provide the set of non-redundant tests using equivalence class partitioning approach from input perspective for black box testing? (A) T1, T2, T3, T6 (C) T2, T4, T5, T6 (B) T1, T3, T4, T5 (D) T2, T3, T4, T5 [Ans. C] One can verify the expected output is correct for all test cases. T1 and T2 have a = 0. (One is redundant) T3 and T4 have coefficient, = 0 (One is redundant) (It must be present in test plan) T5 has (It must be present in test plan) T6 has 39. A deterministic finite automata (DFA) D with alphabet a, b p b q b r is given below.
a a, b s
a a, b t
Which of the following finite state machines is a valid minimal DFA which accepts the same language as D? (A) a, b p b q b s r p a s a, b (C) (D) b a, b p a, b q b r a a s a, b [Ans. A] One can see that options B, C and D are not equivalent to the given DFA. Options B and C accept input b which is not accepted by input DFA. Option D accepts bba which is not accepted by input DFA. a, b p b q a, b q a b r a, b (B) a, b
GATE 2011
CS Mock Test Series
40. An application loads 100 libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as 10 ms. Rotational speed of disk is 6000 rpm. If all 100 libraries are loaded from random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block once the head has been positioned at the start of the block may be neglected.) (A) 0.50 s (C) 1.25 s (B) 1.50 s (D) 1.00 s [Ans. B] 41. An 8KB direct-mapped write-bank cache is organized as multiple blocks, each of size 32-bytes. The processor generates 32-bit addresses. The cache controller maintains the tag information for each cache block comprising of the following. 1 Valid bit 1 Modified bit As many bits as the minimum needed to identify the memory block mapped in the cache. What is the total size of memory needed at the cache controller to store meta-data (tags) for the cache? (A) 4864 bits (C) 6656 bits (B) 6144 bits (D) 5376 bits [Ans. A] 42. Definition of a language L with alphabet {a} is given as following L= What is the minimum number of states needed in a DFA to recognize L? (A) k + 1 (C) (B) n + 1 (D) [Ans. B] The following DFA that accepts a sequence of as whose length is a positive multiple of a constant n. If has n + 1 states through .
Figure 2: DFA 43. Consider an instruction pipeline with four stages (S1, S2, S3 and S4) each with combinational circuit only. The pipeline registers are required between each stage and at the end of the last stage. Delays for the stages and for the pipeline registers are as given in the figure.
Pipeline Register (Delay 1 ns) Pipeline Register (Delay 1 ns) Pipeline Register (Delay 1 ns) Pipeline Register (Delay 1 ns)
Page 13
Stage S1 Delay 5ns
Stage S2 Delay 6ns
Stage S3 Delay 11ns
Stage S4 Delay 8ns
*Correspondence Course * Classroom Coaching * All India Mock Test Series * Postal Test Series * Video Lectures * Online Tests/Classes* Crash Course Head Office : #74, Keshava Krupa (Third Floor), 30th Cross, 10th Main, Jayanagar 4th Block, Bangalore- 11, Ph: 080- 22445535, Mob: +91 9663376248, Copyright reserved. Log on to www.thegateacademy.com for details, updates, free online test, analysis, discussions etc.
GATE 2011
CS Mock Test Series
What is the approximate speed up of the pipeline in steady state under ideal conditions when compared to the corresponding non-pipeline implementation? (A) 4.0 (C) 1.1 (B) 2.5 (D) 3.0 [Ans. B] 44. Consider the matrix as given below.
45. Consider a relational table r with sufficient number of records, having attributes p n. Two queries Q1 and Q2 are given below. Q1: where c is a constant Q2: where and are constants
Which one of the following options provides the CORRECT values of the eigenvalues of the matrix? (A) 1, 4, 3 (C) 7, 3, 2 (B) 3, 7, 3 (D) 1, 2, 3 [Ans. A] The eigen values of a triangular matrix are given by its diagonal entries. One can also verify the eigen value property, i.e., eigen value of a matrix M must satisfy . . . . ., and let 1
46. Four matrices and of dimensions p q, q r, r s and s t respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as , the total number of scalar multiplications is When multiplied as , the total number of scalar multiplications is . If p = 10, q = 100, r = 20, s = 5, and t = 80, then the minimum number of scalar multiplications needed is (A) 248000 (C) 19000 (B) 44000 (D) 25000 [Ans. C] By inspection, one can find that the optimum order is . The number of multiplications is 100 20 5 + 10 100 5 + 10 5 80 = 19000
or hashing on . Which of the following The database can be configured to do ordered indexing on statements is TRUE? (A) Ordered indexing will always outperform hashing for both queries (B) Hashing will always outperform ordered indexing for both queries (C) Hashing outperform ordered indexing on Q1, but not on Q2 (D) Hashing will outperform ordered indexing on Q2, but not on Q1 [Ans. D] On query Q1, all values of are same, and hence there will be hash conflicts for every access, and this hashing is not of much use. But for query Q2, hashing (constant access time) outperforms ordered indexing (logarithmic access time).
47. Which of the given options provides the increasing order of asymptotic complexity of functions ? (A) (B) (C) (D)
and
GATE 2011
CS Mock Test Series
[Ans. A] This is clear if we take logarithm of the expressions
Common Data Questions Common Data for Questions 48 and 49: Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration.
D clock
D clock
D clock
48. If at some instance prior to the occurrence of the clock edge, P, Q and R have a value 0, 1 and 0 respectively, what shall be the value of PQR after the clock edge? (A) 000 (C) 010 (B) 001 (D) 011 [Ans. D]
If (P, Q, R) = (0, 1, 0), the next state 49. If all the flip-flops were reset to 0 at power on, what is the total number of distinct outputs (states) represented by PQR generated by the counter? (A) 3 (C) 5 (B) 4 (D) 6 [Ans. B] There are four distinct states, 000 010 011 100 ( 000)
GATE 2011
CS Mock Test Series
Common Data for Questions 50 and 51: Consider the following recursive C function that takes two arguments. unsigned int foo (unsigned int n, unsigned int r) { if (n > 0) return ((n%r) + foo (n/r, r)); else return 0; } 50. What is the return value of the function fooo when it is called as foo (345, 10)? (A) 345 (C) 5 (B) 12 (D) 3 [Ans. B] foo(345, 10) = 5 + foo(34, 10) = 5 + 4 + foo(3, 10) = 5 + 4 + 3 + foo(0, 10) = 12 51. What is the return value of the function foo when it is called as foo (513, 2)? (A) 9 (C) 5 (B) 8 (D) 12 [Ans. D] foo(513, 2) = 1 + foo(256, 2) = 1 + foo(128, 2) = 1 + foo(64, 2) = 1 + foo(32, 2) = 1 + foo(16, 2) = 1 + foo(8, 2) = 1 + foo(4, 2) = 1 + foo(2, 2) = 1 + foo(1, 2) = 1 + 1 + foo(0, 2) =2 Linked Answer Questions: Statement fro Linked Questions 52 and 53: Consider a network with five nodes, N1 to N5, as shown below. N1 1 3
N5
N2
N4
N3
GATE 2011
CS Mock Test Series
The network uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as following. N1: (0, 1, 7, 8, 4) N2: (1, 0, 6, 7, 3) N3: (7, 6, 0, 2, 6) N4: (8, 7, 2, 0, 4) N5: (4, 3, 6, 4, 0) Each distance vector is the distance of the best known path at the instance to nodes, N1 to N5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbors. Then all nodes update their distance vectors. In between two rounds, any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectors. 52. The cost of link N2-N3 reduces to 2(in both directions). After the next round of updates, what will be the new distance vector at node, N3. (A) (3, 2, 0, 2, 5) (C) (7, 2, 0, 2, 5) (B) (3, 2, 0, 2, 6) (D) (7, 2, 0, 2, 6) [Ans. A] 53. After the update in the previous question, the link N1-N2 goes down. N2 will reflect this change immediately in its distance vector as cost, . After the NEXT ROUND of update, what will be the cost to N1 in the distance vector of N3? (A) 3 (C) 10 (B) 9 (D) [Ans. C] Statement for Linked Answer Questions 54 and 55: An undirected graph G(V, E) contains n(n >2) nodes named and only if 0 < below. 7 2. Each edge is assigned a weight , . . . ., . Two nodes connected if
. A sample graph with n = 4 is shown
5 6
3 54. What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes? (C) (A) (D) (B) [Ans. B] One can test that for n = 2 and n = 3, the minimum spanning tree weight must be 3 and 7 respectively. We can thus infer that option B is the right answer. The optimum way of constructing the tree is as follows
Figure 3: Minimum spanning tree

GATE 2011
CS Mock Test Series
A new vertex added is made adjacent to the increases by One can verify that
in the spanning tree. The spanning tree weight
55. The length of the path from to in the MST of previous questions with n = 10 is (A) 11 (C) 31 (B) 25 (D) 41 [Ans. C] Let denote the edge from to in spanning tree. The path from to is given by and its weight is 5 + 3 + 3 + 1 + 1 + 2 + 2 + 4 + 4 + 6 = 31
General Aptitude (GA) Questions Q. 56 Q. 60 carry one mark each. 56. Choose the most appropriate word (s) from the options given below to complete the following sentence. I Contemplated ____________ Singapore for my vacation but decided against it. (A) to visit (C) visiting (B) having to visit (D) for a visit [Ans. C] Contemplate is a transitive verb and hence is followed by a gerund. Hence the correct usage of contemplate is verb+ ing form. 57. Choose the most appropriate word from the options given below to complete the following sentence. If you are trying to make a strong impression on your audience, you cannot do so by being understated, tentative or _________. (A) hyperbolic (C) argumentative (B) restrained (D) indifferent [Ans. B] The tone of the sentence clearly indicates a word that is similar to understated is needed for the blank. Alternatively, the word should be antonym of strong (fail to make strong impression). Therefore, the best choice is restrained which means controlled/reserved/timid. 58. Choose the word from the options given below that is most nearly opposite in meaning to the given word: Amalgamate (A) merge (C) collect (B) split (D) separate [Ans. B] Amalgamate means combine or unite to form one organization or structure. SO the best option here is split. Separate on the other hand, although a close synonym, it is too general to be the best antonym in the given question while Merge is the synonym; Collect is not related. 59. Which of the following options is the closest in the meaning to the word below: Inexplicable (A) incomprehensible (C) inextricable (B) indelible (D) infallible [Ans. A] Inexplicable means not explicable; that cannot be explained, understood, or accounted for. So the best synonym here is incomprehensible.
GATE 2011
CS Mock Test Series
60. If Log (P) = (1/2) Log (Q) = (1/3) Log (R), then which of the following options is TRUE? (A) (C) (B) (D) [Ans. B] P= Now,
= PR
Q. 61 to Q. 65 carry two marks each 61. The variable cost (V) of manufacturing a product varies according to the equation V = 4q, where q is the quantity produced. The fixed cost (F) of production of same product reduces with q according to the equation F = 100/q. How many units should be produced to minimize the total cost (V + F)? (A) 5 (C) 7 (B) 4 (D) 6 [Ans. A] Checking with all options in formula: i.e. . Option A gives the minimum cost. 62. A transporter receives the same number of orders each day. Currently, he has some pending orders (backlog) to the shipped. If he uses 7 trucks, then at the end of the 4th day he can clear all the orders. Alternatively, if he uses only 3 trucks, then all the orders are cleared at the end of the 10th day. What is the minimum number of trucks required so that there will be no pending order at the end of the 5th day? (A) 4 (C) 6 (B) 5 (D) 7 [Ans. C] Let each truck carry 100 units. 2800 = 4n + e n = normal 3000 = 10n + e e = excess/pending n= 500x = 5days 500x =
Minimum possible = 6 63. A container originally contains 10 litres of pure spirit. From this container 1 litre of spirit is replaced with 1 litre of water. Subsequently, 1 litre of the mixture is again replaced with 1 litre of water and this process is repeated one more time. How much spirit is now left in the container? (A) 7.58 litres (C) 7 litres (B) 7.84 litres (D) 7.29 litres [Ans. D] 10 = 7.29 litres
64. Few school curricula include a unit on how to deal with bereavement and grief, and yet all students at some point in their lives suffer from losses through death and parting. Based on the above passage which topic would not be included in a unit on bereavement? (A) how to write a letter of condolence (B) what emotional stages are passed through in the healing process (C) what the leading causes of death are (D) how to give support to a grieving friend
GATE 2011
CS Mock Test Series
[Ans. C] The given passage clearly deals with how to deal with bereavement and grief and so after the tragedy occurs and not about precautions. Therefore, irrespective of the causes of death, a school student rarely gets into details of causes which is beyond the scope of the context. Rest all are important in dealing with grief. 65. P, Q, R and S are four types of dangerous microbes recently found in a human habitat. The area of each circle with its diameter printed in brackets represents the growth of a single microbe surviving human immunity system with 24 hours of entering the body. The danger to human beings varies proportionately with the toxicity, potency and growth attributed to a microbe shown in the figure below: Toxicity (milligrams of microbe required to destroy half of the body mass in kilograms) 1000 P (50 mm) 800 600 Q (40 mm) R (30 mm) S (20 mm)
400 200 0 0.2
1 0.6 0.8 Potency (Probability that microbe will overcome human immunity system) 0.4 A pharmaceutical company is contemplating the development of a vaccine against the most dangerous microbe. Which microbe should the company target in its first attempt? (A) P (C) R (B) Q (D) S [Ans. D] By observation of the table, we can say S P Q R S Requirement 800 600 300 200 Potency 0.4 0.5 0.4 0.8

GATE 2011 Computer Science Engineering Set - C: Q.1 - Q.25 Carry One Mark Each

Uploaded by

Copyright:

Available Formats

GATE 2011 Computer Science Engineering Set - C: Q.1 - Q.25 Carry One Mark Each

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

GATE 2011 Computer Science Engineering Set - C: Q.1 - Q.25 Carry One Mark Each

Uploaded by

Copyright:

Available Formats

GATE 2011

CS Mock Test Series