Question | Likes! | Dislikes! | Answers! |
---|

Consider the following logical inferences. -gate-cse-2012
| 0 | 0 | 1 |

Which of the following is TRUE? -gate-cse-2012
| 0 | 0 | 1 |

What will be the output of the following C program segment? -gate-cse-2012
| 0 | 0 | 1 |

Assuming P != NP, which of the following is true ? -gate-cse-2012
| 0 | 0 | 1 |

The worst case running time to search for an element in a balanced in a binary search tree with n2^n elements is -gate-cse-2012
| 0 | 0 | 1 |

The truth table truthtable represents the Boolean function -gate-cse-2012
| 0 | 0 | 1 |

The decimal value 0.5 in IEEE single precision floating point representation has -gate-cse-2012
| 0 | 0 | 1 |

A process executes the code -gate-cse-2012
| 0 | 0 | 1 |

Consider the function f(x) = sin(x) in the interval [π/4, 7π/4]. The number and location(s) of the local minima of this function are -gate-cse-2012
| 0 | 0 | 1 |

The protocol data unit (PDU) for the application layer in the Internet stack is -gate-cse-2012
| 0 | 0 | 1 |

Let A be the 2 × 2 matrix with elements a11 = a12 = a21 = +1 and a22 = −1. Then the eigenvalues of the matrix A19 are -gate-cse-2012
| 0 | 0 | 1 |

What is the complement of the language accepted by the NFA shown below? -gate-cse-2012
| 0 | 0 | 1 |

What is the correct translation of the following statement into mathematical logic? “Some real numbers are rational” -gate-cse-2012
| 0 | 0 | 1 |

Given the basic ER and relational models, which of the following is INCORRECT? -gate-cse-2012
| 0 | 0 | 1 |

Which of the following statements are TRUE about an SQL query? -gate-cse-2012
| 0 | 0 | 1 |

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is -gate-cse-2012
| 0 | 0 | 1 |

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to A -gate-cse-2012
| 0 | 0 | 1 |

Let w(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. which of the following is ALWAYS TRUE? -gate-cse-2012
| 0 | 0 | 1 |

The amount of ROM needed to implement a 4 bit multiplier is -gate-cse-2012
| 0 | 0 | 1 |

Which of the following transport layer protocols is used to support electronic mail? -gate-cse-2012
| 0 | 0 | 1 |

In the IPv4 addressing format, the number of networks allowed under Class C addresses is A -gate-cse-2012
| 0 | 0 | 1 |

Which of the following problems are decidable? -gate-cse-2012
| 0 | 0 | 1 |

Given the language L = {ab, aa, baa}, which of the following strings are in L*?-gate-cse-2012
| 0 | 0 | 1 |

Which of the following graphs is isomorphic to -gate-cse-2012
| 0 | 0 | 1 |

Consider the following transactions with data items P and Q initialized to zero: -gate-cse-2012
| 0 | 0 | 1 |

-gate-cseThe bisection method is applied to compute a zero of the function f(x) = x^4 – x^3 – x62 – 4 in the interval [1,9]. The method converges to a solution after ––––– iterations -2012
| 0 | 0 | 1 |

Let G be a weighted graph with edge weights greater than one and Gbe the graph constructed by squaring the weights of edges in G. Let T and T be the minimum spanning trees of G and G, respectively, with total weights t and t. Which of the following i
| 0 | 0 | 1 |

What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don’t care term. -gate-cse-2012
| 0 | 0 | 1 |

Consider the 3 processes, P1, P2 and P3 shown in the table.-gate-cse-2012
| 0 | 0 | 1 |

Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location X, increments it by the value i, and returns the old value of X. It is used in the pseudocode shown below to implement a busy-wait lock. L is an uns
| 0 | 0 | 1 |

Suppose a fair six-sided die is rolled once. If the value on the die is 1, 2, or 3, the die is rolled a second time. What is the probability that the sum total of values that turn up is at least 6? -gate-cse-2012
| 0 | 0 | 1 |

An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B, while retaining the r
| 0 | 0 | 1 |

Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. -gate-cse-2012
| 0 | 0 | 1 |

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-cse-2012
| 0 | 0 | 1 |

Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. -gate-cse-2012
| 0 | 0 | 1 |

How many onto (or surjective) functions are there from an n-element (n >= 2) set to a 2-element set? -gate-cse-2012
| 0 | 0 | 1 |

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is -gate-cse-2012
| 0 | 0 | 1 |

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijstra?s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is upda
| 0 | 0 | 1 |

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 -gate-cse-2012
| 0 | 0 | 1 |

Suppose (A, B) and (C,D) are two relation schemas. -gate-cse-2012
| 0 | 0 | 1 |

Consider a source computer(S) transmitting a file of size 10^6 bits to a destination computer(D) -gate-cse-2012
| 0 | 0 | 1 |

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm -gate-cse-2012
| 0 | 0 | 1 |

Consider the set of strings on {0,1} -gate-cse-2012
| 0 | 0 | 1 |

Register renaming is done in pipelined processors -gate-cse-2012
| 0 | 0 | 1 |

Consider a random variable X that takes values +1 and −1 with probability 0.5 each. -gate-cse-2012
| 0 | 0 | 1 |

Consider the following C program. -gate-cse-2012
| 0 | 0 | 1 |

Consider the below question. -gate-cse-2012
| 0 | 0 | 1 |

Consider the following relations A, B, C. -gate-cse-2012
| 0 | 0 | 1 |

Consider the below tables A, B and C. How many tuples does the result of the following SQL query contains? -gate-cse-2012
| 0 | 0 | 1 |

For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. -gate-cse-2012
| 0 | 0 | 1 |

Consider the date same as above question. The appropriate entries for E1, E2, and E3 are -gate-cse-2012
| 0 | 0 | 1 |

A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. -gate-cse-2012
| 0 | 0 | 1 |

A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. -gate-cse-2012
| 0 | 0 | 1 |

The cost function for a product in a firm is given by 5q^2, where q is the amount of production. -gate-cse-2012
| 0 | 0 | 1 |

Choose the most appropriate alternative from the options given below to complete the following sentence: -gate-cse-2012
| 0 | 0 | 1 |

Which one of the following options is the closest in meaning to the word given below? Mitigate -gate-cse-2012
| 0 | 0 | 1 |

Choose the grammatically INCORRECT sentence: -gate-cse-2012
| 0 | 0 | 1 |

Choose the most appropriate alternative from the options given below to complete the following sentence:-gate-cse-2012
| 0 | 0 | 1 |

Wanted Temporary, Part-time persons for the post of Field Interviewer to conduct personal interviews to collect and collate economic data. -gate-cse-2012
| 0 | 0 | 1 |

A political party orders an arch for the entrance to the ground in which the annual convention is being held. -gate-cse-2012
| 0 | 0 | 1 |

An automobile plant contracted to buy shock absorbers from two suppliers X and Y. -gate-cse-2012
| 0 | 0 | 1 |

Which of the following assertions are CORRECT? -gate-cse-2012
| 0 | 0 | 1 |

Given the sequence of terms, AD CG FK JP, the next term is -gate-cse-2012
| 0 | 0 | 1 |