The PYQ practice room

GATE CS 2014 Set 3

All 65 solved GATE CS 2014 Set 3 questions in exam order. Open a question, commit to an answer, and learn from the step-by-step solution. One question at a time.

Attempt before revealInstant answer feedbackExplore questions
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.

Questions

65

Paper marks

100

Question formats

2

MCQ · NAT

Revision mode

Self-paced

No timer. Focus on understanding.

Difficulty mixEasy 31Medium 29Hard 5

Explore the questions

65 of 65 questions

General Aptitude (GA)

10
  1. Think it through. Then check your answer.

    Question

    While trying to collectI\underset{\text{I}}{\underline{\text{trying to collect}}} an envelope from under the tableII\underset{\text{II}}{\underline{\text{from under the table}}}, Mr. X fell downIII\underset{\text{III}}{\underline{\text{Mr. X fell down}}} and was losing consciousnessIV\underset{\text{IV}}{\underline{\text{was losing consciousness}}}.
    Which one of the above underlined parts of the sentence is NOT appropriate?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  2. Think it through. Then check your answer.

    Question

    If she _____________ how to calibrate the instrument, she _____________ done the experiment.
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  3. Think it through. Then check your answer.

    Question

    Choose the word that is opposite in meaning to the word “coherent”.
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  4. Think it through. Then check your answer.

    Question

    Which number does not belong in the series below?
    2, 5, 10, 17, 26, 37, 50, 64
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  5. Think it through. Then check your answer.

    Question

    The table below has question-wise data on the performance of students in an examination. The marks for each question are also listed. There is no negative or partial marking in the examination.
    Q No.MarksAnswered CorrectlyAnswered WronglyNot Attempted
    1221176
    2315272
    3223183
    What is the average of the marks obtained by the class in the examination?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  6. Think it through. Then check your answer.

    Question

    A dance programme is scheduled for 10.00 a.m. Some students are participating in the programme and they need to come an hour earlier than the start of the event. These students should be accompanied by a parent. Other students and parents should come in time for the programme. The instruction you think that is appropriate for this is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  7. Think it through. Then check your answer.

    Question

    By the beginning of the 20th20^{\text{th}} century, several hypotheses were being proposed, suggesting a paradigm shift in our understanding of the universe. However, the clinching evidence was provided by experimental measurements of the position of a star which was directly behind our sun.
    Which of the following inference(s) may be drawn from the above passage?
    (i) Our understanding of the universe changes based on the positions of stars
    (ii) Paradigm shifts usually occur at the beginning of centuries
    (iii) Stars are important objects in the universe
    (iv) Experimental evidence was important in confirming this paradigm shift
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  8. Think it through. Then check your answer.

    Question

    The Gross Domestic Product (GDP) in Rupees grew at 7%7\% during 2012-2013. For international comparison, the GDP is compared in US Dollars (USD) after conversion based on the market exchange rate. During the period 2012-2013 the exchange rate for the USD increased from Rs. 50/ USD to Rs. 60/ USD. India’s GDP in USD during the period 2012-2013
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  9. Think it through. Then check your answer.

    Question

    The ratio of male to female students in a college for five years is plotted in the following line graph. If the number of female students in 2011 and 2012 is equal, what is the ratio of male students in 2012 to male students in 2011?
    Line graph showing Ratio of male to female students from 2008 to 2012
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  10. Think it through. Then check your answer.

    Question

    Consider the equation: (7526)8(Y)8=(4364)8(7526)_8 - (Y)_8 = (4364)_8, where (X)N(X)_N stands for X to the base N. Find Y.
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page

Computer Science

55
  1. Think it through. Then check your answer.

    Question

    Consider the following statements:
    P: Good mobile phones are not cheap
    Q: Cheap mobile phones are not good
    L: P implies Q
    M: Q implies P
    N: P is equivalent to Q
    Which one of the following about L, M, and N is CORRECT?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  2. Think it through. Then check your answer.

    Question

    Let XX and YY be finite sets and f:XYf: X \rightarrow Y be a function. Which one of the following statements is TRUE?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  3. Think it through. Then check your answer.

    Question

    Let GG be a group with 15 elements. Let LL be a subgroup of GG. It is known that LGL \neq G and that the size of LL is at least 4. The size of LL is __________.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  4. Think it through. Then check your answer.

    Question

    Which one of the following statements is TRUE about every n×nn \times n matrix with only real eigenvalues?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  5. Think it through. Then check your answer.

    Question

    If V1V_1 and V2V_2 are 4-dimensional subspaces of a 6-dimensional vector space VV, then the smallest possible dimension of V1V2V_1 \cap V_2 is ______.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  6. Think it through. Then check your answer.

    Question

    If 02πxsinxdx=kπ\int_0^{2\pi} |x \sin x| dx = k\pi, then the value of kk is equal to ______ .
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  7. Think it through. Then check your answer.

    Question

    Consider the following minterm expression for FF:F(P,Q,R,S)=0,2,5,7,8,10,13,15F(P,Q,R,S) = \sum 0, 2, 5, 7, 8, 10, 13, 15The minterms 2, 7, 8 and 13 are 'do not care' terms. The minimal sum-of-products form for FF is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  8. Think it through. Then check your answer.

    Question

    Consider the following combinational function block involving four Boolean variables x,y,a,bx, y, a, b where x,a,bx, a, b are inputs and yy is the output.
    f (x, y, a, b)
    {
     if (x is 1) y = a;
     else y = b;
    }
    
    Which one of the following digital logic blocks is the most suitable for implementing this function?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  9. Think it through. Then check your answer.

    Question

    Consider the following processors (ns stands for nanoseconds). Assume that the pipeline registers have zero latency.
    P1: Four-stage pipeline with stage latencies 11 ns, 22 ns, 22 ns, 11 ns.
    P2: Four-stage pipeline with stage latencies 11 ns, 1.51.5 ns, 1.51.5 ns, 1.51.5 ns.
    P3: Five-stage pipeline with stage latencies 0.50.5 ns, 11 ns, 11 ns, 0.60.6 ns, 11 ns.
    P4: Five-stage pipeline with stage latencies 0.50.5 ns, 0.50.5 ns, 11 ns, 11 ns, 1.11.1 ns.
    Which processor has the highest peak clock frequency?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  10. Think it through. Then check your answer.

    Question

    Let AA be a square matrix of size n×nn \times n. Consider the following pseudocode. What is the expected output?
    C = 100;
    for i = 1 to n do
        for j = 1 to n do
        {
            Temp = A[i][j] + C;
            A[i][j] = A[j][i];
            A[j][i] = Temp - C;
        }
    for i = 1 to n do
        for j = 1 to n do
            output(A[i][j]);
    
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  11. Think it through. Then check your answer.

    Question

    The minimum number of arithmetic operations required to evaluate the polynomial P(X)=X5+4X3+6X+5P(X) = X^5 + 4X^3 + 6X + 5 for a given value of XX, using only one temporary variable is ______.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  12. Think it through. Then check your answer.

    Question

    Consider the following rooted tree with the vertex labeled P as the root:
    A rooted tree with root P. P has left child Q and right child R. Q has a child S. R has three children T, U, V. U has a child W.
    The order in which the nodes are visited during an in-order traversal of the tree is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  13. Think it through. Then check your answer.

    Question

    Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.
    A connected graph with 19 vertices consisting of two grid-like structures connected by a bridge.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  14. Think it through. Then check your answer.

    Question

    You have an array of nn elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  15. Think it through. Then check your answer.

    Question

    The length of the shortest string NOT in the language (over Σ={a,b}\Sigma = \{a, b\}) of the following regular expression is ______________.ab(ba)aa^* b^* (ba)^* a^*
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  16. Think it through. Then check your answer.

    Question

    Let Σ\Sigma be a finite non-empty alphabet and let 2Σ2^{\Sigma^*} be the power set of Σ\Sigma^*. Which one of the following is TRUE?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  17. Think it through. Then check your answer.

    Question

    One of the purposes of using intermediate code in compilers is to
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  18. Think it through. Then check your answer.

    Question

    Which of the following statements are CORRECT?
    1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.
    2) Automatic garbage collection is essential to implement recursion.
    3) Dynamic allocation of activation records is essential to implement recursion.
    4) Both heap and stack are essential to implement recursion.
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  19. Think it through. Then check your answer.

    Question

    In the context of modular software design, which one of the following combinations is desirable?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  20. Think it through. Then check your answer.

    Question

    A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while processing the page reference string given below?4,7,6,1,7,6,1,2,7,24, 7, 6, 1, 7, 6, 1, 2, 7, 2
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  21. Think it through. Then check your answer.

    Question

    What is the optimized version of the relation algebra expression πA1(πA2(σF1(σF2(r))))\pi_{A1}(\pi_{A2}(\sigma_{F1}(\sigma_{F2}(r)))), where A1,A2A1, A2 are sets of attributes in rr with A1A2A1 \subset A2 and F1,F2F1, F2 are Boolean expressions based on the attributes in rr?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  22. Think it through. Then check your answer.

    Question

    A prime attribute of a relation scheme RR is an attribute that appears
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  23. Think it through. Then check your answer.

    Question

    In the following pairs of OSI protocol layer/sub-layer and its functionality, the INCORRECT pair is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  24. Think it through. Then check your answer.

    Question

    A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output bit-string after stuffing is 01111100101, then the input bit-string is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  25. Think it through. Then check your answer.

    Question

    Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram D?
    (i) TTL
    (ii) Checksum
    (iii) Fragment Offset
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  26. Think it through. Then check your answer.

    Question

    An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address 131.23.151.76. The router’s routing table has the following entries:
    PrefixOutput Interface Identifier
    131.16.0.0/ 123
    131.28.0.0/ 145
    131.19.0.0/ 162
    131.22.0.0/ 151
    The identifier of the output interface on which this packet will be forwarded is ______.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  27. Think it through. Then check your answer.

    Question

    Every host in an IPv4 network has a 1-second resolution real-time clock with battery backup. Each host needs to generate up to 1000 unique identifiers per second. Assume that each host has a globally unique IPv4 address. Design a 50-bit globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  28. Think it through. Then check your answer.

    Question

    An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header of length 20 bytes. The values of the relevant fields in the header of the third IP fragment generated by the router for this packet are
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  29. Think it through. Then check your answer.

    Question

    Consider the transactions T1T_1, T2T_2, and T3T_3 and the schedules S1S_1 and S2S_2 given below.
    T1: r1(X); r1(Z); w1(X); w1(Z)
    T2: r2(Y); r2(Z); w2(Z)
    T3: r3(Y); r3(X); w3(Y)
    
    S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z); w1(X); w1(Z)
    S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z)
    
    Which one of the following statements about the schedules is TRUE?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  30. Think it through. Then check your answer.

    Question

    Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation.
    employee (empId, empName, empAge)
    dependent (depId, eId, depName, depAge)
    Consider the following relational algebra query:ΠempId(employee)ΠempId(employee(empId=eID)(empAgedepAge)dependent)\Pi_{empId}(\text{employee}) - \Pi_{empId}(\text{employee} \bowtie_{(empId = eID) \wedge (empAge \le depAge)} \text{dependent})The above query evaluates to the set of empIds of employees whose age is greater than that of
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  31. Think it through. Then check your answer.

    Question

    A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  32. Think it through. Then check your answer.

    Question

    An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds):
    ProcessArrival TimeBurst Time
    P1012
    P224
    P336
    P485
    The average waiting time (in milliseconds) of the processes is _________.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  33. Think it through. Then check your answer.

    Question

    Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in milliseconds) is _________.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  34. Think it through. Then check your answer.

    Question

    Consider the basic block given below.
    a = b + c 
    c = a + d 
    d = b + c 
    e = d - b 
    a = e + b 
    
    The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  35. Think it through. Then check your answer.

    Question

    Which one of the following problems is undecidable?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  36. Think it through. Then check your answer.

    Question

    Consider the following languages over the alphabet Σ={0,1,c}\Sigma = \{0,1, c\}:
    L1={0n1nn0}L_1 = \{0^n 1^n \mid n \geq 0\}
    L2={wcwrw{0,1}}L_2 = \{w c w^r \mid w \in \{0,1\}^*\}
    L3={wwrw{0,1}}L_3 = \{w w^r \mid w \in \{0,1\}^*\}

    Here, wrw^r is the reverse of the string ww. Which of these languages are deterministic Context-free languages?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  37. Think it through. Then check your answer.

    Question

    Suppose you want to move from 0 to 100 on the number line. In each step, you either move right by a unit distance or you take a shortcut. A shortcut is simply a pre-specified pair of integers i,ji, j with i<ji < j. Given a shortcut i,ji, j if you are at position ii on the number line, you may directly move to jj. Suppose T(k)T(k) denotes the smallest number of steps needed to move from kk to 100. Suppose further that there is at most 1 shortcut involving any number, and in particular from 9 there is a shortcut to 15. Let yy and zz be such that T(9)=1+min(T(y),T(z))T(9) = 1 + \min(T(y), T(z)). Then the value of the product yzyz is _____.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  38. Think it through. Then check your answer.

    Question

    Consider the decision problem 2CNFSAT defined as follows:{ΦΦ is a satisfiable propositional formula in CNF with at most two literals per clause }\{ \Phi \mid \Phi \text{ is a satisfiable propositional formula in CNF with at most two literals per clause } \}For example, Φ=(x1x2)(x1x3)(x2x4)\Phi = (x_1 \lor x_2) \land (x_1 \lor \overline{x_3}) \land (x_2 \lor x_4) is a Boolean formula and it is in 2CNFSAT.
    The decision problem 2CNFSAT is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  39. Think it through. Then check your answer.

    Question

    Suppose we have a balanced binary search tree TT holding nn numbers. We are given two numbers LL and HH and wish to sum up all the numbers in TT that lie between LL and HH. Suppose there are mm such numbers in TT. If the tightest upper bound on the time to compute the sum is O(nalogbn+mclogdn)O(n^a \log^b n + m^c \log^d n), the value of a+10b+100c+1000da + 10b + 100c + 1000d is _____.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  40. Think it through. Then check your answer.

    Question

    Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots are unfilled after the first 3 insertions?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  41. Think it through. Then check your answer.

    Question

    Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode.
    typedef struct treeNode* treeptr;
    
    struct treeNode
    {
        treeptr leftMostChild, rightSibling;
    };
    
    int DoSomething (treeptr tree)
    {
        int value=0;
        if (tree != NULL) {
            if (tree->leftMostChild == NULL)
                value = 1;
            else
                value = DoSomething(tree->leftMostChild);
            value = value + DoSomething(tree->rightSibling);
        }
        return(value);
    }
    
    When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  42. Think it through. Then check your answer.

    Question

    Consider the C function given below. Assume that the array listA contains n (> 0) elements, sorted in ascending order.
    int ProcessArray(int *listA, int x, int n)
    {
        int i, j, k;
        i = 0;
        j = n-1;
        do {
            k = (i+j)/2;
            if (x <= listA[k])
                j = k-1;
            if (listA[k] <= x)
                i = k+1;
        }while (i <= j);
    
        if (listA[k] == x)
            return(k);
        else
            return -1;
    }
    
    Which one of the following statements about the function ProcessArray is CORRECT?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  43. Think it through. Then check your answer.

    Question

    An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback (WB) with stage latencies 1 ns, 2.2 ns, 2 ns, 1 ns, and 0.75 ns, respectively (ns stands for nanoseconds). To gain in terms of frequency, the designers have decided to split the ID/RF stage into three stages (ID, RF1, RF2) each of latency 2.2/32.2/3 ns. Also, the EX stage is split into two stages (EX1, EX2) each of latency 1 ns. The new design has a total of eight pipeline stages. A program has 20% branch instructions which execute in the EX stage and produce the next instruction pointer at the end of the EX stage in the old design and at the end of the EX2 stage in the new design. The IF stage stalls after fetching a branch instruction until the next instruction pointer is computed. All instructions other than the branch instruction have an average CPI of one in both the designs. The execution times of this program on the old and the new design are PP and QQ nanoseconds, respectively. The value of P/QP/Q is __________.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  44. Think it through. Then check your answer.

    Question

    The memory access time is 1 nanosecond for a read operation with a hit in cache, 5 nanoseconds for a read operation with a miss in cache, 2 nanoseconds for a write operation with a hit in cache and 10 nanoseconds for a write operation with a miss in cache. Execution of a sequence of instructions involves 100 instruction fetch operations, 60 memory operand read operations and 40 memory operand write operations. The cache hit-ratio is 0.9. The average memory access time (in nanoseconds) in executing the sequence of instructions is __________.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  45. Think it through. Then check your answer.

    Question

    Circuit diagram with three JK flip-flops

    The above synchronous sequential circuit built using JK flip-flops is initialized with Q2Q1Q0=000Q_2Q_1Q_0 = 000. The state sequence for this circuit for the next 3 clock cycles is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  46. Think it through. Then check your answer.

    Question

    With respect to the numerical evaluation of the definite integral, K=abx2dxK = \int_a^b x^2 dx, where aa and bb are given, which of the following statements is/are TRUE?
    I) The value of KK obtained using the trapezoidal rule is always greater than or equal to the exact value of the definite integral.
    II) The value of KK obtained using the Simpson's rule is always equal to the exact value of the definite integral.
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  47. Think it through. Then check your answer.

    Question

    The value of the integral given below is0πx2cosxdx\int_0^\pi x^2 \cos x \, dx
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  48. Think it through. Then check your answer.

    Question

    Let SS be a sample space and two mutually exclusive events AA and BB be such that AB=SA \cup B = S. If P()P(\cdot) denotes the probability of the event, the maximum value of P(A)P(B)P(A)P(B) is ______.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  49. Think it through. Then check your answer.

    Question

    Consider the set of all functions f:{0,1,,2014}{0,1,,2014}f: \{0,1, \dots, 2014\} \to \{0,1, \dots, 2014\} such that f(f(i))=if(f(i)) = i, for all 0i20140 \leq i \leq 2014. Consider the following statements:
    PP. For each such function it must be the case that for every i,f(i)=ii, f(i) = i.
    QQ. For each such function it must be the case that for some i,f(i)=ii, f(i) = i.
    RR. Each such function must be onto.
    Which one of the following is CORRECT?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  50. Think it through. Then check your answer.

    Question

    There are two elements x,yx, y in a group (G,)(G, *) such that every element in the group can be written as a product of some number of xx's and yy's in some order. It is known thatxx=yy=xyxy=yxyx=ex * x = y * y = x * y * x * y = y * x * y * x = ewhere ee is the identity element. The maximum number of elements in such a group is __________.
    Your answer

    Enter a number. Decimals, negative values and scientific notation are accepted.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  51. Think it through. Then check your answer.

    Question

    If GG is a forest with nn vertices and kk connected components, how many edges does GG have?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  52. Think it through. Then check your answer.

    Question

    Let δ\delta denote the minimum degree of a vertex in a graph. For all planar graphs on nn vertices with δ3\delta \geq 3, which one of the following is TRUE?
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  53. Think it through. Then check your answer.

    Question

    The CORRECT formula for the sentence, "not all rainy days are cold" is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  54. Think it through. Then check your answer.

    Question

    Consider the following relational schema:
    employee(empId, empName, empDept)
    customer(custId, custName, salesRepId, rating)
    salesRepId is a foreign key referring to empId of the employee relation. Assume that each employee makes a sale to at least one customer. What does the following query return?
    SELECT empName 
    FROM employee E 
    WHERE NOT EXISTS (SELECT custId 
                      FROM customer C 
                      WHERE C.salesRepId = E.empId 
                      AND C.rating <> 'GOOD');
    
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page
  55. Think it through. Then check your answer.

    Question

    Let \oplus denote the Exclusive OR (XOR) operation. Let ‘1’ and ‘0’ denote the binary constants. Consider the following Boolean expression for FF over two variables PP and QQ:F(P,Q)=((1P)(PQ))((PQ)(Q0))F(P, Q) = ((1 \oplus P) \oplus (P \oplus Q)) \oplus ((P \oplus Q) \oplus (Q \oplus 0))The equivalent expression for FF is
    Your answer

    Choose one option, then check your answer.

    Restoring your progress…

    The solution stays hidden until you check.
    Open question page