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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Aboveallplayer
User Aboveallplayer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Aboveallplayer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
IIIT Allahabad Query
if i opt for a integrated Phd in IIITA 1.will i also get a Mtech after completion of the degree?or only phd? 2.what will i miss ?(apart from the fact that i will miss a chance of phd from IIT)) given:Placement is not my concern
asked
Mar 27, 2017
in
Written Exam

180
views
3
answers
2
GATE2017130
Let $u$ and $v$ be two vectors in R2 whose Euclidean norms satisfy $\left \ u \right \ = 2\left \ v \right \$. What is the value of $\alpha$ such that $w = u + \alpha v$ bisects the angle between $u$ and $v$? $2$ $\frac{1}{2}$ $1$ $\frac{ 1}{2}$
commented
Mar 25, 2017
in
Linear Algebra

4.9k
views
gate20171
linearalgebra
normal
vectorspace
2
answers
3
difference between if(a=0) and if(a=non zero)
what is the differernce between if (a=0) and if (a= 7) or any other nonzero number e.g what will be the out put of following program a)if ( a=0) printf(""a is zero ") else printf("a is not zero") and if we replace 0 by some +ve or ve number then
answered
Feb 18, 2017
in
Programming

877
views
6
answers
4
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 operator (e.g.. ... . 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$.
commented
Feb 17, 2017
in
Compiler Design

6.4k
views
gate20171
compilerdesign
parsing
normal
numericalanswers
3
answers
5
GATE2017139
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ ... If $f$ is computable then $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.
commented
Feb 17, 2017
in
Theory of Computation

6.1k
views
gate20171
theoryofcomputation
decidability
difficult
6
answers
6
GATE2017127
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. All locks in the program are nonreentrant, i.e., if a thread holds a lock $l$, then it cannot reacquire lock $l$ without releasing it. If a thread ... are: $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
commented
Feb 17, 2017
in
Operating System

9.5k
views
gate20171
operatingsystem
processsynchronization
normal
4
answers
7
GATE2017140
Recall that Belady's anomaly is that the pagefault rate may increase as the number of allocated frames increases. Now, consider the following statement: $S1$: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's anomaly. $S2$: LRU page ... is true $S1$ is true, $S2$is false $S1$ is false, $S2$is true $S1$ is false, $S2$is false
commented
Feb 16, 2017
in
Operating System

4.6k
views
gate20171
pagereplacement
operatingsystem
normal
8
answers
8
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.
commented
Feb 15, 2017
in
DS

8.2k
views
gate20171
datastructure
linkedlists
normal
7
answers
9
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 ____________.
commented
Feb 15, 2017
in
Algorithms

5.4k
views
gate20171
algorithms
normal
numericalanswers
searching
7
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); } void main() ... is defined in $string.h$ as returning a value of type $size\_t$, which is an unsigned int. The output of the program is __________ .
commented
Feb 15, 2017
in
Programming

8.2k
views
gate20171
programming
programminginc
normal
numericalanswers
8
answers
11
GATE201717
The nbit fixedpoint representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = nf$. The range of decimal values for $X$ in this representation is $2^{f}$ to $2^{i}$ $2^{f}$ to $\left ( 2^{i}  2^{f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i}  2^{f} \right )$
commented
Feb 15, 2017
in
Digital Logic

5.6k
views
gate20171
digitallogic
numberrepresentation
fixedpointrepresentation
5
answers
12
GATE2017110
Consider the following contextfree grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
commented
Feb 15, 2017
in
Theory of Computation

5.1k
views
gate20171
theoryofcomputation
contextfreelanguage
normal
4
answers
13
GATE2017131
Let $A$ be $n\times n$ real valued square symmetric matrix of rank 2 with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} =$ 50. Consider the following statements. One eigenvalue must be in $\left [ 5,5 \right ]$ The eigenvalue with the largest ... greater than 5 Which of the above statements about eigenvalues of $A$ is/are necessarily CORRECT? Both I and II I only II only Neither I nor II
commented
Feb 15, 2017
in
Linear Algebra

6.3k
views
gate20171
linearalgebra
eigenvalue
normal
3
answers
14
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 ... $i,$ then the decimal value of the Offset is ____________ .
commented
Feb 14, 2017
in
CO and Architecture

4.2k
views
gate20171
coandarchitecture
normal
numericalanswers
instructionexecution
2
answers
15
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.
answered
Feb 14, 2017
in
Verbal Ability

1.6k
views
gate20171
generalaptitude
verbalability
passagereading
9
answers
16
GATE201716
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$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
answered
Feb 14, 2017
in
DS

3.9k
views
gate20171
datastructure
binarysearchtree
easy
4
answers
17
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
answered
Feb 14, 2017
in
Numerical Ability

3.1k
views
gate20171
numericalability
roundtablearrangement
4
answers
18
GATE20171GA4
Find the smallest number $y$ such that $y \times 162$ is a perfect cube. $24$ $27$ $32$ $36$
answered
Feb 14, 2017
in
Numerical Ability

1.9k
views
gate20171
generalaptitude
numericalability
numericalcomputation
3
answers
19
GATE20171GA2
Research in the workplace reveals that people work for many reasons _______________ . money beside beside money money besides besides money
answered
Feb 14, 2017
in
Verbal Ability

2.3k
views
gate20171
generalaptitude
verbalability
englishgrammar
9
answers
20
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}$, ... $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
answered
Feb 14, 2017
in
Algorithms

4.1k
views
gate20171
algorithms
asymptoticnotations
normal
5
answers
21
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
commented
Feb 14, 2017
in
Mathematical Logic

2.8k
views
gate20171
mathematicallogic
propositionallogic
easy
6
answers
22
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
answered
Feb 14, 2017
in
Mathematical Logic

5.6k
views
gate20171
mathematicallogic
firstorderlogic
4
answers
23
GATE201713
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... of equations has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
commented
Feb 14, 2017
in
Linear Algebra

5.6k
views
gate20171
linearalgebra
systemofequations
normal
4
answers
24
GATE2017121
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$, the respective complements $\left ( \bar{a}, \bar{b}, \bar{c}, \bar{d} \right )$ are also available. The above logic is implemented using $2$input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .
answered
Feb 14, 2017
in
Digital Logic

4.5k
views
gate20171
digitallogic
kmap
numericalanswers
normal
3
answers
25
GATE2017246
Consider the following database table named $\text{top_scorer}$ ... ANY (SELECT tc.goals FROM top_scorer AS tc WHERE tc.country='Germany') The number of tuples returned by the above SQL query is ______
comment edited
Feb 14, 2017
in
Databases

4.8k
views
gate20172
databases
sql
numericalanswers
6
answers
26
GATE2017252
If the characteristic polynomial of a 3 $\times$ 3 matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \mathbb{R}$, and one eigenvalue of $M$ is 2, then the largest among the absolute values of the eigenvalues of $M$ is _______
answered
Feb 14, 2017
in
Linear Algebra

3.9k
views
gate20172
engineeringmathematics
linearalgebra
numericalanswers
eigenvalue
8
answers
27
GATE2017239
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$NFA whose transition table is given below: $\begin{array}{cccc}\hline \delta & \text{$\epsilon$} & \text{$a$} & \text{$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
answered
Feb 14, 2017
in
Theory of Computation

6.1k
views
gate20172
theoryofcomputation
finiteautomata
5
answers
28
GATE20171GA1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. was wishing is wishing wished had wished
answered
Feb 14, 2017
in
Verbal Ability

3.8k
views
gate20171
generalaptitude
verbalability
tenses
englishgrammar
normal
5
answers
29
GATE20172GA10
An air pressure contour line joins locations in a region having the same atmospheric pressure. The following is an air pressure contour plot of a geographical region. Contour lines are shown at $0.05$ bar intervals in this plot. If the possibility of a thunderstorm is ... drops over a region, which of the following regions is most likely to have a thunderstorm? $P$ $Q$ $R$ $S$
commented
Feb 14, 2017
in
Numerical Ability

3.1k
views
gate20172
numericalability
datainterpretation
normal
contourplots
4
answers
30
GATE2017112
Consider the following intermediate program in three address code p = a  b q = p * c p = u * v q = p + q Which one of the following corresponds to a static single assignment form of the above code? p1 = a  b q1 = p1 * c p1 = u * v q1 = p1 + q1 p3 = a  b q4 = p3 * c p4 = u * v q5 = p4 + q4 p1 = a  b q1 = p2 * c p3 = u * v q2 = p4 + q3 p1 = a  b q1 = p * c p2 = u * v q2 = p + q
commented
Feb 14, 2017
in
Compiler Design

3.9k
views
gate20171
compilerdesign
intermediatecode
normal
staticsingleassignment
12
answers
31
GATE2017214
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); } The output of invoking $printxy(1,1)$ is: $0, 0$ $0, 1$ $1, 0$ $1, 1$
answered
Feb 14, 2017
in
Programming

2.6k
views
gate20172
programminginc
programming
1
answer
32
GATE201712178751948
answered
Feb 14, 2017
in
Numerical Ability

206
views
numericalability
1
answer
33
GATE201712178751946
answered
Feb 14, 2017
in
Verbal Ability

298
views
7
answers
34
GATE2017203
Match the algorithms with their time complexities: $\begin{array}{ll}\hline \textbf{Algorithms} & \textbf{Time Complexity} \\\hline \text{P. Tower of Hanoi with $n$ disks} & \text{i. $\Theta (n^2)$} \\\hline \text{Q. Binary Search given $ ... $P\rightarrow (iv) \quad Q \rightarrow(iii)\quad r \rightarrow(ii) \quad S\rightarrow(i)$
answered
Feb 14, 2017
in
Algorithms

1.7k
views
gate20172
algorithms
timecomplexity
1
answer
35
GATE201712178751942
answered
Feb 14, 2017
in
Verbal Ability

139
views
1
answer
36
GATE201712178751944
answered
Feb 14, 2017
in
Numerical Ability

150
views
5
answers
37
GATE2017215
The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below? $\text{MNOPQR}$ $\text{NQMPOR}$ $\text{QMNROP}$ $\text{POQNMR}$
answered
Feb 14, 2017
in
Algorithms

1.8k
views
gate20172
algorithms
graphalgorithms
4
answers
38
GATE2017119
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
commented
Feb 14, 2017
in
Probability

5.7k
views
gate20171
probability
numericalanswers
normaldistribution
5
answers
39
GATE2017209
Consider the following statements about the routing protocols. Routing Information Protocol (RIP) and Oprn Shortest Path First (OSPF) in an IPv4 network. RIP uses distance vector routing RIP packets are sent using UDP OSPF packets are sent using TCP OSPF operation is based on linkstate ... statements are CORRECT? I and IV only I, II and III only I, II and IV only II, III and IV only
answered
Feb 14, 2017
in
Computer Networks

3.8k
views
gate20172
computernetworks
routing
2
answers
40
GATE2017208
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed ? Contiguous Linked Indexed 1 and 3 only 2 only 3 only 2 and 3 only
answered
Feb 14, 2017
in
Operating System

3.7k
views
gate20172
operatingsystem
filesystem
normal
50,644
questions
56,531
answers
195,622
comments
101,346
users