GateAI

GATE CSE 2011 Question Paper with Solutions & Answer Key

All 65 questions of the GATE CSE 2011 paper (100 marks: 30 one-mark and 35 two-mark; 65 MCQ, 0 MSQ, 0 NAT), with the answer key and a verified solution for each. See more GATE CSE question papers or all GATE CSE PYQs.

Questions
65
Total marks
100
MCQ / MSQ / NAT
65 / 0 / 0
Topics
43

GATE CSE 2011 paper analysis

General Aptitude and Engineering Mathematics together made up 28 of 100 marks. 0 of 65 questions were NAT, more than in any earlier paper. Quantitative Aptitude was the heaviest single topic with 7 marks across 4 questions.

All GATE CSE 2011 questions

Each question opens its full verified solution.

  1. Q1 · MCQ · 1 mark · Lexical AnalysisIn a compiler, keywords of a language are recognized during (A) parsing of the program (B) the code generation (C) the lexical analysis of the program (D) dataflow analy…
  2. Q2 · MCQ · 1 mark · Principles of LayeringA 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…
  3. Q3 · MCQ · 1 mark · Probability and StatisticsIf 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) 1/3 (B) 1/4 (C) 1/2 (D) 2…
  4. Q4 · MCQ · 1 mark · DNS and HTTPConsider 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: Chec…
  5. Q5 · MCQ · 1 mark · Programming in CA 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…
  6. Q6 · MCQ · 1 mark · System CallsLet the time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between two processes be t2. Which of the following is TRUE?…
  7. Q7 · MCQ · 1 mark · Software Estimation and Cost ModelsA 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 t…
  8. Q8 · MCQ · 1 mark · Context-Free Grammars and PDAsWhich of the following pairs have DIFFERENT expressive power?
  9. Q9 · MCQ · 1 mark · DNS and HTTPHTML (HyperText Markup Language) has language elements which permit certain actions other than describing the structure of the web document. Which one of the following a…
  10. Q10 · MCQ · 1 mark · Software Requirements SpecificationWhich one of the following is NOT desired in a good Software Requirement Specifications (SRS) document?
  11. Q11 · MCQ · 1 mark · I/O Interface, Interrupts and DMAA computer handles several interrupt sources of which the following are relevant for this question. • Interrupt from CPU temperature sensor (raises interrupt if CPU temp…
  12. Q12 · MCQ · 1 mark · Integrity Constraints and Normal FormsConsider a relational table with a single record for each registered student with the following attributes. 1. Registration : Unique registration number of each register…
  13. Q13 · MCQ · 1 mark · Boolean Algebra and MinimizationWhich one of the following circuits is NOT equivalent to a 2-input XNOR (exclusive NOR) gate?
  14. Q14 · MCQ · 1 mark · Boolean Algebra and MinimizationThe simplified SOP (Sum of Product) form of the Boolean expression (P + Q + R) . (P + Q + R) . (P + Q + R) is
  15. Q15 · MCQ · 1 mark · Combinational and Sequential CircuitsThe minimum number of D flip-flops needed to design a mod-258 counter is
  16. Q16 · MCQ · 1 mark · Processes, Threads and IPCA 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 t…
  17. Q17 · MCQ · 1 mark · Discrete MathematicsK4 and Q3 are graphs with the following structures. Which one of the following statements is TRUE in relation to these graphs?
  18. Q18 · MCQ · 1 mark · Probability and StatisticsIf the difference between the expectation of the square of a random variable (E [X2 ] ) and the square of the expectation of the random variable (E[X] )2 is denoted by R…
  19. Q19 · MCQ · 1 mark · Lexical AnalysisThe 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?
  20. Q20 · MCQ · 1 mark · Memory Management and Virtual MemoryLet the page fault service time be 10 ms in a computer with average memory access time being 20 ns. If one page fault is generated for every 106 memory accesses, what is…
  21. Q21 · MCQ · 1 mark · Instruction Set and Addressing ModesConsider 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 R…
  22. Q22 · MCQ · 1 mark · Programming in CWhat does the following fragment of C program print? Char c[] = "GATE2011"; char *p = c; printf("%s", p + p[3] - p[1]);
  23. Q23 · MCQ · 1 mark · Binary HeapsA 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?
  24. Q24 · MCQ · 1 mark · Regular and Context-Free LanguagesLet P be a regular language and Q be a context-free language such that Q ⊆ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pn…
  25. Q25 · MCQ · 1 mark · Dynamic ProgrammingAn algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A[0:n-1] is given below. Let Li denote the length of the longest…
  26. Q26 · MCQ · 2 marks · Regular and Context-Free LanguagesConsider the languages L1, L2 and L3 as given below. L1 = {0p 1q p, q ∈ N}, L2 = {0p 1q p, q ∈ N and p = q} and L3 = {0p 1q 0r p, q, r ∈ N and p = q = r}. Which of the f…
  27. Q27 · MCQ · 2 marks · Lexical Analysis, Parsing and SDTConsider two binary operators ‘ ’ and ‘ ’ with the precedence of operator being lower than that of the operator . Operator is right associative while operator is left as…
  28. Q28 · MCQ · 2 marks · I/O Interface, Interrupts and DMAOn 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…
  29. Q29 · MCQ · 2 marks · Binary Search TreesWe 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 bi…
  30. Q30 · MCQ · 2 marks · Propositional and First-Order LogicWhich one of the following options is CORRECT given three positive integers x, y and z, and a predicate P(x) = eg (x = 1) ∧ ∀ y ((∃ z (x = y * z)) ⇒ (y = x) ∨ (y = 1))
  31. Q31 · MCQ · 2 marks · CalculusGiven i = √(-1), what will be the evaluation of the definite integral 0 /2 (cos x + i sin x)/(cos x - i sin x) dx?
  32. Q32 · MCQ · 2 marks · SQLConsider a database table T containing two columns X and Y each of type integer . After the creation of the table, one record (X=1, Y=1) is inserted in the table. Let MX…
  33. Q33 · MCQ · 2 marks · Probability and StatisticsConsider a finite sequence of random values X = [x1, x2, , xn]. Let x be the mean and x be the standard deviation of X. Let another finite sequence Y of equal length be…
  34. Q34 · MCQ · 2 marks · Probability and StatisticsA 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 t…
  35. Q35 · MCQ · 2 marks · CPU and I/O SchedulingConsider the following table of arrival time and burst time for three processes P0, P1 and P2. The pre-emptive shortest job first scheduling algorithm is used. Schedulin…
  36. Q36 · MCQ · 2 marks · Intermediate Code GenerationConsider 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…
  37. Q37 · MCQ · 2 marks · Asymptotic AnalysisWhich of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4 ? f1(n) = 2n f2(n) = n3/2 f3(n) = n log2 n f4(n) = nlog2…
  38. Q38 · MCQ · 2 marks · Algorithm Design TechniquesFour matrices M1, M2, M3 and M4 of dimensions p × q, q × r, r × s and s × t respectively can be multiplied in several ways with different number of total scalar multipli…
  39. Q39 · MCQ · 2 marks · File Organization and IndexingConsider a relational table r with sufficient number of records, having attributes A1, A2, , An and let 1 ≤ p ≤ n. Two queries Q1 and Q2 are given below. Q1: A1, , Ap( A…
  40. Q40 · MCQ · 2 marks · Linear AlgebraConsider the matrix as given below. 1 & 2 & 3 0 & 4 & 7 0 & 0 & 3 Which one of the following options provides the CORRECT values of the eigenvalues of the matrix?
  41. Q41 · MCQ · 2 marks · Instruction PipeliningConsider 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…
  42. Q42 · MCQ · 2 marks · Regular Expressions and Finite AutomataDefinition of a language L with alphabet {a} is given as following. L = {ank k > 0, and n is a positive integer constant} What is the minimum number of states needed in…
  43. Q43 · MCQ · 2 marks · Cache Memory and HierarchyAn 8KB direct-mapped write-back cache is organized as multiple blocks, each of size 32-bytes. The processor generates 32-bit addresses. The cache controller maintains th…
  44. Q44 · MCQ · 2 marks · File SystemsAn 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. R…
  45. Q45 · MCQ · 2 marks · Regular Expressions and Finite AutomataA deterministic finite automaton (DFA) D with alphabet = {a, b} is given below. Which of the following finite state machines is a valid minimal DFA which accepts the sam…
  46. Q46 · MCQ · 2 marks · Relational Model and SQLDatabase table by name LoanRecords is given below. What is the output of the following SQL query? SELECT count(*) FROM ( (SELECT Borrower, BankManager FROM LoanRecords)…
  47. Q47 · MCQ · 2 marks · Software TestingThe following is the comment written for a C function. /* This function computes the roots of a quadratic equation a.x2 + b.x + c = 0. The function stores two real roots…
  48. Q48 · MCQ · 2 marks · RecursionCommon Data for Questions 48 and 49: Consider the following recursive C function that takes two arguments. unsigned int foo(unsigned int n, unsigned int r) { if (n>0) re…
  49. Q49 · MCQ · 2 marks · RecursionWhat is the return value of the function foo when it is called as foo(513, 2) ?
  50. Q50 · MCQ · 2 marks · Combinational and Sequential CircuitsCommon Data for Questions 50 and 51: Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration. If at some instanc…
  51. Q51 · MCQ · 2 marks · Combinational and Sequential CircuitsIf 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?
  52. Q52 · MCQ · 2 marks · Distance Vector and Link-State RoutingStatement for Linked Answer Questions 52 and 53: Consider a network with five nodes, N1 to N5, as shown below. The network uses a Distance Vector Routing protocol. Once…
  53. Q53 · MCQ · 2 marks · Distance Vector and Link-State RoutingAfter 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 u…
  54. Q54 · MCQ · 2 marks · Minimum Spanning TreesStatement for Linked Answer Questions 54 and 55: An undirected graph G(V, E) contains n (n > 2) nodes named v1, v2, , vn. Two nodes vi, vj are connected if and only if 0…
  55. Q55 · MCQ · 2 marks · Minimum Spanning TreesThe length of the path from v5 to v6 in the MST of previous question with n = 10 is
  56. Q56 · MCQ · 1 mark · Verbal AptitudeWhich of the following options is the closest in the meaning to the word below: Inexplicable
  57. Q57 · MCQ · 1 mark · Quantitative AptitudeIf Log(P) = (1/2)Log(Q) = (1/3) Log(R), then which of the following options is TRUE?
  58. Q58 · MCQ · 1 mark · Verbal AptitudeChoose 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.
  59. Q59 · MCQ · 1 mark · Verbal AptitudeChoose 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 can…
  60. Q60 · MCQ · 1 mark · Verbal AptitudeChoose the word from the options given below that is most nearly opposite in meaning to the given word: Amalgamate
  61. Q61 · MCQ · 2 marks · Verbal AptitudeFew 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 par…
  62. Q62 · MCQ · 2 marks · Data InterpretationP, 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…
  63. Q63 · MCQ · 2 marks · Quantitative AptitudeThe 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 prod…
  64. Q64 · MCQ · 2 marks · Quantitative AptitudeA transporter receives the same number of orders each day. Currently, he has some pending orders (backlog) to be shipped. If he uses 7 trucks, then at the end of the 4th…
  65. Q65 · MCQ · 2 marks · Quantitative AptitudeA 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 i…

GATE CSE 2011 answer key

Official answers. Open a question for the full solution.

QTypeMarksAnswerTopic
Q1MCQ1CLexical Analysis
Q2MCQ1DPrinciples of Layering
Q3MCQ1AProbability and Statistics
Q4MCQ1CDNS and HTTP
Q5MCQ1BProgramming in C
Q6MCQ1CSystem Calls
Q7MCQ1ASoftware Estimation and Cost Models
Q8MCQ1BContext-Free Grammars and PDAs
Q9MCQ1DDNS and HTTP
Q10MCQ1DSoftware Requirements Specification
Q11MCQ1DI/O Interface, Interrupts and DMA
Q12MCQ1AIntegrity Constraints and Normal Forms
Q13MCQ1DBoolean Algebra and Minimization
Q14MCQ1BBoolean Algebra and Minimization
Q15MCQ1ACombinational and Sequential Circuits
Q16MCQ1CProcesses, Threads and IPC
Q17MCQ1BDiscrete Mathematics
Q18MCQ1CProbability and Statistics
Q19MCQ1ALexical Analysis
Q20MCQ1BMemory Management and Virtual Memory
Q21MCQ1DInstruction Set and Addressing Modes
Q22MCQ1CProgramming in C
Q23MCQ1BBinary Heaps
Q24MCQ1CRegular and Context-Free Languages
Q25MCQ1ADynamic Programming
Q26MCQ2CRegular and Context-Free Languages
Q27MCQ2BLexical Analysis, Parsing and SDT
Q28MCQ2AI/O Interface, Interrupts and DMA
Q29MCQ2BBinary Search Trees
Q30MCQ2APropositional and First-Order Logic
Q31MCQ2DCalculus
Q32MCQ2ASQL
Q33MCQ2DProbability and Statistics
Q34MCQ2AProbability and Statistics
Q35MCQ2ACPU and I/O Scheduling
Q36MCQ2DIntermediate Code Generation
Q37MCQ2AAsymptotic Analysis
Q38MCQ2CAlgorithm Design Techniques
Q39MCQ2CFile Organization and Indexing
Q40MCQ2ALinear Algebra
Q41MCQ2BInstruction Pipelining
Q42MCQ2BRegular Expressions and Finite Automata
Q43MCQ2DCache Memory and Hierarchy
Q44MCQ2BFile Systems
Q45MCQ2ARegular Expressions and Finite Automata
Q46MCQ2CRelational Model and SQL
Q47MCQ2CSoftware Testing
Q48MCQ2BRecursion
Q49MCQ2DRecursion
Q50MCQ2DCombinational and Sequential Circuits
Q51MCQ2BCombinational and Sequential Circuits
Q52MCQ2ADistance Vector and Link-State Routing
Q53MCQ2CDistance Vector and Link-State Routing
Q54MCQ2BMinimum Spanning Trees
Q55MCQ2CMinimum Spanning Trees
Q56MCQ1AVerbal Aptitude
Q57MCQ1BQuantitative Aptitude
Q58MCQ1CVerbal Aptitude
Q59MCQ1BVerbal Aptitude
Q60MCQ1DVerbal Aptitude
Q61MCQ2CVerbal Aptitude
Q62MCQ2DData Interpretation
Q63MCQ2AQuantitative Aptitude
Q64MCQ2CQuantitative Aptitude
Q65MCQ2DQuantitative Aptitude

Subject-wise weightage

Where the marks came from in GATE CSE 2011, against the average paper.

GATE CSE 2011 FAQ

How many questions were in GATE CSE 2011?
GATE CSE 2011 had 65 questions for 100 marks: 65 MCQ, 0 MSQ and 0 NAT.
Which subject carried the most marks in GATE CSE 2011?
General Aptitude carried the most marks (15 of 100). The top three were General Aptitude (15), Engineering Mathematics (13), Programming and Data Structures (9).
Where can I find the GATE CSE 2011 answer key?
The answer key table on this page lists the answer to every question of GATE CSE 2011. Open any question for its full verified solution.
Is the GATE CSE 2011 paper useful for GATE 2027 preparation?
Yes. Solving past GATE CSE papers shows how marks are spread across subjects and which topics repeat. Compare it with other GATE CSE question papers and the topic-wise GATE CSE PYQs.

Explore more GATE CSE papers