The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Lists
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged gate20171
GATE 2017 Computer Science Set 1 Questions and Solutions
+25
votes
7
answers
1
GATE2017154
A cache memory unit with capacity of $N$ words and block size of $B$ words is to be designed. If it is designed as a direct mapped cache, the length of the TAG field is 10 bits. If the cache unit is now designed as a 16way setassociative cache, the length of the TAG field is ____________ bits.
asked
Feb 14, 2017
in
CO & Architecture
by
Arjun
Veteran
(
359k
points)

6.2k
views
gate20171
coandarchitecture
cachememory
normal
numericalanswers
+29
votes
2
answers
2
GATE2017152
Consider the expression $(a1) * (((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 only load and store instructions can have memory operands and arithmetic instructions can have only register or immediate operands. The value of $X$ is _____________ .
asked
Feb 14, 2017
in
Compiler Design
by
Arjun
Veteran
(
359k
points)

5.9k
views
gate20171
compilerdesign
registerallocation
normal
numericalanswers
+36
votes
4
answers
3
GATE2017151
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 to the contention of multiple blocks for the same cache set. Compulsory misses occur due to first ... ,129,257,129 \big \}$ is repeated $10$ times. The number of conflict misses experienced by the cache is _________ .
asked
Feb 14, 2017
in
CO & Architecture
by
Arjun
Veteran
(
359k
points)

8.1k
views
gate20171
coandarchitecture
cachememory
conflictmisses
normal
numericalanswers
+20
votes
6
answers
4
GATE2017150
Instruction execution in a processor is divided into 5 stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). These stages take 5, 4, 20, 10 and 3 nanoseconds (ns) respectively. A ... . The speedup (correct to two decimal places) achieved by EP over NP in executing 20 independent instructions with no hazards is _________ .
asked
Feb 14, 2017
in
CO & Architecture
by
khushtak
Loyal
(
7.7k
points)

4.3k
views
gate20171
coandarchitecture
pipelining
normal
numericalanswers
+42
votes
7
answers
5
GATE2017108
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p>next != NULL) { p = p>next; } p>next = m; } Assuming that m and n point to valid NULL ... or append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
asked
Feb 14, 2017
in
DS
by
khushtak
Loyal
(
7.7k
points)

5.9k
views
gate20171
datastructure
linkedlists
normal
+17
votes
4
answers
6
GATE2017105
Consider the following table: Algorithms Design Paradigms Kruskal Divide and Conquer Quicksort Greedy FloydWarshall Dynamic Programming Match the algorithms to the design paradigms they are based on. $(P) \leftrightarrow (ii), (Q) \leftrightarrow (iii), (R) \leftrightarrow (i) ... R) \leftrightarrow (iii)$ $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$
asked
Feb 14, 2017
in
Algorithms
by
khushtak
Loyal
(
7.7k
points)

2.2k
views
gate20171
algorithms
algorithmdesigntechniques
+23
votes
9
answers
7
GATE2017104
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt{n}$, $n$ $\frac{100}{n ... frac{100}{n}$, $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
asked
Feb 14, 2017
in
Algorithms
by
khushtak
Loyal
(
7.7k
points)

3.1k
views
gate20171
algorithms
asymptoticnotations
normal
+26
votes
6
answers
8
GATE2017102
Consider the firstorder logic sentence $F:\forall x(\exists yR(x,y))$. Assuming nonempty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ IV only I and IV only II only II and III only
asked
Feb 14, 2017
in
Mathematical Logic
by
khushtak
Loyal
(
7.7k
points)

3.9k
views
gate20171
mathematicallogic
firstorderlogic
+15
votes
5
answers
9
GATE2017101
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below? $p \Rightarrow q$ $q \Rightarrow p$ $\left ( ¬q \right ) \vee p$ $\left ( ¬p \right ) \vee q$ I only I and IV only II only II and III only
asked
Feb 14, 2017
in
Mathematical Logic
by
khushtak
Loyal
(
7.7k
points)

2.3k
views
gate20171
mathematicallogic
propositionallogic
easy
+44
votes
5
answers
10
GATE2017153
Consider the following C program. #include<stdio.h> #include<string.h> void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s)  strlen(t)) > c) ? strlen(s) : strlen(t); printf("%d\n", len); } ... $strlen$ is defined in $string.h$ as returning a value of type $size\_t$, which is an unsigned int. The output of the program is __________ .
asked
Feb 14, 2017
in
Programming
by
srestha
Veteran
(
98.5k
points)

5.9k
views
gate20171
programming
programminginc
normal
numericalanswers
+28
votes
3
answers
11
GATE2017155
The output of executing the following C program is _______________ . #include<stdio.h> int total(int v) { static int count = 0; while(v) { count += v&1; v >>= 1; } return count; } void main() { static int x=0; int i=5; for(; i>0; i) { x = x + total(i); } printf("%d\n", x); }
asked
Feb 14, 2017
in
Programming
by
srestha
Veteran
(
98.5k
points)

4.5k
views
gate20171
programming
programminginc
normal
numericalanswers
+14
votes
3
answers
12
GATE20171GA10
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. If in a flood, the water level rises to 525 m, which of the villages P, Q, R, S, T get submerged? P, Q P, Q, T R, S, T Q, R, S
asked
Feb 14, 2017
in
Numerical Ability
by
Arjun
Veteran
(
359k
points)

2.7k
views
gate20171
numericalability
datainterpretation
normal
+14
votes
4
answers
13
GATE20171GA9
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? $21$ $18$ $16$ $14$
asked
Feb 14, 2017
in
Numerical Ability
by
Arjun
Veteran
(
359k
points)

2.8k
views
gate20171
permutationsandcombinations
numericalability
+18
votes
4
answers
14
GATE20171GA8
The expression $\large \frac{(x+y)  xy}{2}$ is equal to : The maximum of $x$ and $y$ The minimum of $x$ and $y$ $1$ None of the above
asked
Feb 14, 2017
in
Numerical Ability
by
Arjun
Veteran
(
359k
points)

2.2k
views
gate20171
numericalability
maximaminima
absolutevalue
+12
votes
6
answers
15
GATE20171GA7
Six people are seated around a circular table. There are at least two men and two women. There are at least three righthanded persons. Every woman has a lefthanded person to her immediate right. None of the women are righthanded. The number of women at the table is $2$ $3$ $4$ Cannot be determined
asked
Feb 14, 2017
in
Numerical Ability
by
Arjun
Veteran
(
359k
points)

2.3k
views
gate20171
numericalability
logicalreasoning
+8
votes
2
answers
16
GATE20171GA6
"The hold of the nationalist imagination on our colonial past is such that anything inadequately or improperly nationalist is just not history." Which of the following statements best reflects the author's opinion? Nationalists are highly ... the filter of nationalism. Our colonial past never happened. Nationalism has to be both adequately and properly imagined.
asked
Feb 14, 2017
in
Verbal Ability
by
Arjun
Veteran
(
359k
points)

1.3k
views
gate20171
verbalability
passagereading
+10
votes
6
answers
17
GATE20171GA5
The probability that a $k$digit number does NOT contain the digits $0, 5,$ or $9$ is $0.3^{k}$ $0.6^{k}$ $0.7^{k}$ $0.9^{k}$
asked
Feb 14, 2017
in
Numerical Ability
by
Arjun
Veteran
(
359k
points)

2.7k
views
gate20171
numericalability
probability
easy
+8
votes
4
answers
18
GATE20171GA4
Find the smallest number $y$ such that $y \times 162$ is a perfect cube. $24$ $27$ $32$ $36$
asked
Feb 14, 2017
in
Numerical Ability
by
Arjun
Veteran
(
359k
points)

1.5k
views
gate20171
numericalability
numericalcomputation
+8
votes
3
answers
19
GATE20171GA3
Rahul, Murali, Srinivas and Arul are seated around a square table. Rahul is sitting to the left of Murali. Srinivas is sitting to the right of Arul. Which of the following pairs are seated opposite each other? Rahul and Murali Srinivas and Arul Srinvas and Murali Srinivas and Rahul
asked
Feb 14, 2017
in
Numerical Ability
by
Arjun
Veteran
(
359k
points)

1.6k
views
gate20171
numericalability
logicalreasoning
+6
votes
3
answers
20
GATE20171GA2
Research in the workplace reveals that people work for many reasons _______________ . money beside beside money money besides besides money
asked
Feb 14, 2017
in
Verbal Ability
by
Arjun
Veteran
(
359k
points)

1.9k
views
gate20171
verbalability
englishgrammar
+13
votes
5
answers
21
GATE20171GA1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. was wishing is wishing wished had wished
asked
Feb 14, 2017
in
Verbal Ability
by
Arjun
Veteran
(
359k
points)

3.4k
views
gate20171
verbalability
tenses
englishgrammar
normal
+25
votes
2
answers
22
GATE2017149
Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PCrelative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is always with ... Offset If the target of the branch instruction is $i,$ then the decimal value of the Offset is ____________ .
asked
Feb 14, 2017
in
CO & Architecture
by
Arjun
Veteran
(
359k
points)

2.9k
views
gate20171
coandarchitecture
normal
numericalanswers
instructionexecution
+30
votes
6
answers
23
GATE2017148
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\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
asked
Feb 14, 2017
in
Algorithms
by
Arjun
Veteran
(
359k
points)

3.8k
views
gate20171
algorithms
normal
numericalanswers
searching
+9
votes
8
answers
24
GATE2017147
The number of integers between $1$ and $500$ (both inclusive) that are divisible by $3$ or $5$ or $7$ is ____________ .
asked
Feb 14, 2017
in
Set Theory & Algebra
by
Arjun
Veteran
(
359k
points)

2.9k
views
gate20171
settheory&algebra
normal
numericalanswers
sets
+17
votes
2
answers
25
GATE2017146
Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below. CR StudentName CourseName SA CA SA CB SA CC SB CB SB CC SC CA SC CB SC CC SD CA SD CB SD CC SD CD SE CD SE CA SE CB SF CA SF ... ( \sigma _{StudentName=SA}\left ( CR \right ) \right )$ $T2 \leftarrow CR\div T1$ The number of rows in $T2$ is ______________ .
asked
Feb 14, 2017
in
Databases
by
Arjun
Veteran
(
359k
points)

3k
views
gate20171
databases
relationalalgebra
normal
numericalanswers
+25
votes
5
answers
26
GATE2017145
The values of parameters for the StopandWait ARQ protocol are as given below: Bit rate of the transmission channel = $1$ Mbps. Propagation delay from sender to receiver = $0.75$ ms. Time to process a frame = $0.25$ ms. Number of bytes ... efficiency (expressed in percentage) of the StopandWait ARQ protocol for the above parameters is _____________ (correct to $2$ decimal places).
asked
Feb 14, 2017
in
Computer Networks
by
Arjun
Veteran
(
359k
points)

8.2k
views
gate20171
computernetworks
stopandwait
numericalanswers
normal
+20
votes
8
answers
27
GATE2017144
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate here public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .
asked
Feb 14, 2017
in
Computer Networks
by
Arjun
Veteran
(
359k
points)

4.9k
views
gate20171
networksecurity
computernetworks
rsasecuritynetworks
numericalanswers
normal
+20
votes
5
answers
28
GATE2017143
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt  $0$ expr $\rightarrow$ term relop term  term term $\rightarrow$ id  number id $\rightarrow$ a  b  c number $\rightarrow [09]$ where relop is a relational ... . For example. the program if $e_1$ then $e_2$ else $e_3$ has $2$ control flow paths. $e_1 \rightarrow e_2$ and $e_1 \rightarrow e_3$.
asked
Feb 14, 2017
in
Compiler Design
by
Arjun
Veteran
(
359k
points)

4.4k
views
gate20171
compilerdesign
parsing
normal
numericalanswers
+27
votes
3
answers
29
GATE2017142
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions $T_{1}$ and $T_{2}$ respectively. Besides, $T_{1}$ holds a lock ... not starvationfree. The database system is starvationfree, but not deadlockfree. The database system is neither deadlockfree nor starvationfree.
asked
Feb 14, 2017
in
Databases
by
Arjun
Veteran
(
359k
points)

5.5k
views
gate20171
databases
timestampordering
deadlock
normal
+18
votes
4
answers
30
GATE2017141
Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relation EMP. Consider the following queries on the database expressed in tuple relational calculus. {$t$  $\exists$u $ ... ))} Which of the above queries are safe? I and II only I and III only II and III only I, II and III
asked
Feb 14, 2017
in
Databases
by
Arjun
Veteran
(
359k
points)

3.7k
views
gate20171
databases
relationalcalculus
safequery
normal
Page:
1
2
3
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
List of Available Exams
New Assignment on Network programming : P2P simulation
Theory of Computation  GO Classroom
Probability  GO Classroom
Daily Quiz
Follow @csegate
Gatecse
Recent questions tagged gate20171
Recent Blog Comments
Nice 2 know. You are welcome. :)
Hello @Arjun, I got books now...thanks for your...
You may contact FedEx local delivery office. It...
Yes you are right, it's showing this status from...
FedEx delivery is shown and as per that it is out...
40,976
questions
47,609
answers
146,779
comments
62,342
users