GATE Computer Science Engineering 2017

View note:GATE-Computer-Science-Engineering-2017



Questions of this subject!.

QuestionLikes!Dislikes!Answers!
Fill in the blanks: GATE-Computer-Science-Engineering-2017

001
Consider the Karnaugh map given below, where x represents “don’t care” and blank represents 0. GATE-Computer-Science-Engineering-2017

001
The statement (¬p ) ⇒(¬q ) is logically equivalent to which of the statements below? GATE-Computer-Science-Engineering-2017

001
Consider the following table: GATE-Computer-Science-Engineering-2017

001
A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place GATE-Computer-Science-Engineering-2017

001
Threads of a process share GATE-Computer-Science-Engineering-2017

001
What are most essential tags in HTML? CBSE CLASS VI- 2017

001
Find the smallest number y such that y x 162 (y multiplied by 162) is a perfect cube. -gate computer science 2017

101
rali, Srinivas and Arul are seated around a square table. Rahul is sitting to trali. Srinivas is sitting to the right of Arul. Which of the following pairs are seated opposite each other ? -gate computer science 2017

101
Research in the workplace reveals that people work for many reasons _________. -gate computer science 2017

101
The probability that a k-digit number does NOT contain the digits 0, 5 or 9 is -gate computer science 2017

101
After Rajendra Chola returned from his voyage to Indonesia, he ______ to visit the temple in Thanjavur. -gate computer science 2017

101
Six people are seated around a circular table. There are at least two men and two women. There are at least three right-handed persons. Every woman has a left-handed person to her immediate right. None of the women are right-handed. The number of women at the table is -gate computer science 2017

101
"The hold of the nationalist imagination on our colonial past is such that anything inadequately or improperly nationalist is just not history" -gate computer science 2017

101
Q.8) The expression [(x + y)-|x - y|]/2 is equal to : -gate computer science 2017

101
Q.9) A contour line joins locations having the same height above the mean sea level. The following is a contour plot of a geographical region. Contour lines are shown at 25 m intervals in this plot. -gate computer science 2017

101
Q.9) A contour line joins locations having the same height above the mean sea level. The following is a contour plot of a geographical region. Contour lines are shown at 25 m intervals in this plot. -gate computer science 2017

001
Q.10) Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shweta dislikes the colour white. Gulab and Neel like all the colours. In how many different ways can they choose the shirts so that no one has a shirt with a colour he or she dislikes? -gate computer science 2017

101
Q.11) Let X be a Gaussian random variable with mean 0 and variance σ2. Let Y = max(X,0) where max(a,b) is the maximum of a and b. The median of Y is _____. -gate computer science 2017

101
Q.13) A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place. -gate computer science 2017

101
Q.13) A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place. -gate computer science 2017

001
Q.14) Consider the following intermediate program in three address code p = a - b q = p * c p = u * v q = p + q -gate computer science 2017

101
Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0. -gate computer science 2017

101
The statement (¬ p) → (¬ q) is logically equivalent to which of the statements below? I. p → q II. q → p III. (¬ q) ∨ p IV. (¬ p) ∨ q -gate computer science 2017

101
Q.20) Threads of a process share -gate computer science 2017

101
Consider the first-order logic sentence F: ∀ x (∃ y R(x,y)). Assuming non-empty logical domains, which of the sentences below are implied by F? -gate computer science 2017

101
Consider the following grammar p --> xQRS Q --> yz|z R --> w|∈ S -> y Which is FOLLOW(Q)? -gate computer science 2017

101
Consider the following functions from positives integers to real numbers 10, √n, n, log2n, 100/n. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: -gate computer science 2017

101
Consider the following C code: -gate computer science 2017

101
Consider the C code fragment given below. -gate computer science 2017

201
Consider the language L given by the regular expression (a + b) *b(a +b) over the alphabet {a, b}. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting L is ______. -gate computer science 2017

101
The n-bit fixed-point representation of an unsigned real number X uses f bits for the fraction part. Let i = n - f. The range of decimal values for X in this representation is :- -gate computer science 2017

101
Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____. -gate computer science 2017

001
Consider the following context-free grammar over the alphabet ∑ = {a, b, c} with S as the start symbol: S → abScT | abcT T → bT | b -gate computer science 2017

001
When two 8-bit numbers A7 ... A0 and B7 ... B0 in 2s complement representation (with A0 and B0 as the least significant bits) are added using ripple-carry adder. the sum bits obtained are S7 ... S0 and the carry bits are C7 ... C0. An overflow is said to have occured if : -gate computer science 2017

001
When two 8-bit numbers A7 ... A0 and B7 ... B0 in 2s complement representation (with A0 and B0 as the least significant bits) are added using ripple-carry adder. the sum bits obtained are S7 ... S0 and the carry bits are C7 ... C0. An overflow is said to have occured if : -gate computer science 2017

001
Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements: -gate computer science 2017

201
Consider the expression (a-1) * ((( b + c ) / 3 )) + d)). Let X be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which : -gate computer science 2017

101
Consider the expression (a-1) * ((( b + c ) / 3 )) + d)). Let X be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which : -gate computer science 2017

001
Consider the C functions foo and bar given below: -gate computer science 2017

101
Let p, q, and r be the propositions and the expression (p -> q) -> r be a contradiction. Then, the expression (r -> p)-> q is : -gate computer science 2017

101
Consider the following grammar over the alphabet {a,b,c} given below, S and T are non-terminals. -gate computer science 2017

101
If G is grammar with productions S → SaS | aSb | bSa | SS | ∈ where S is the start variable, then which one of the following is not generated by G? -gate computer science 2017

001
In a RSA cryptosystem a particular A uses two prime numbers p = 13 and q =17 to generate her public and private keys. If the public key of Ais 35. Then the private key of A is ____________. -gate computer science 2017

101
In a RSA cryptosystem a particular A uses two prime numbers p = 13 and q =17 to generate her public and private keys. If the public key of Ais 35. Then the private key of A is ____________. -gate computer science 2017

001
Q.46) In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database assuming that a killed transaction is restarted with the same timestamp. -gate computer science 2017

001
The values of parameters for the Stop-and – Wait ARQ protocol are as given below. -gate computer science 2017

101
Q.49) Consider the following two functions : -gate computer science 2017

101
Q.50) Consider a 2-way set associative cache with 256 blocks and uses LRU replacement, Initially the cache is empty. Conflict misses are those misses which occur due the contention of multiple blocks for the same cache set. -gate computer science 2017

101
Q.51) A computer network uses polynomial over GF(2) for error checking with 8 bits as information bits and uses x3 + x + 1 as the generator polynomial to generate the check bits. In this network, the message 01011011 is transmitted as -gate computer science 2017

101
Q.52) Consider the following languages over the alphabet ∑= {a,b,c}. Let L1 = {an bncm | m, n >= 0 } and L2 = {ambncn| m, n >= 0}. -gate computer science 2017

401
Q.53) Consider the following grammar: -gate computer science 2017

001
Q.54) A multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory locations. -gate computer science 2017

101
Q.55) Consider the following C program. -gate computer science 2017

001
Q.57) Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is________. -gate computer science 2017

101
Q.58) The number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7 is ______. -gate computer science 2017

301
Q.61) Let u and v be two vectors in R2 whose Euclidean norms satisfy |u| = 2|v|. What is the value α such that w = u + αv bisects the angle between u and v ? -gate computer science 2017

101
Q.62) Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total functional from A* to B* .We say f is computable if there exists a Turning machine M which given an input x in A*, always halts with f(x) on its tape. Let Lf denotes the language {x#f(x)|x∈A*}. Which of the following statements is true? -gate computer science 2017

101
Q.63) Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements: -gate computer science 2017

101
Q.64) The output of executing the following C program is ________. -gate computer science 2017

101

Not the question you are looking for? Ask it here!

Join eduladder!