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
Answers 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
+2
votes
1
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
+8
votes
2
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$.
answered
Feb 15, 2017
in
Compiler Design

6.5k
views
gate20171
compilerdesign
parsing
normal
numericalanswers
+8
votes
3
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
+3
votes
4
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
+8
votes
5
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
+2
votes
6
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
+6
votes
7
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
+39
votes
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.
answered
Feb 14, 2017
in
DS

8.2k
views
gate20171
datastructure
linkedlists
normal
+10
votes
9
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
votes
10
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
+36
votes
11
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
+7
votes
12
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 )$
answered
Feb 14, 2017
in
Digital Logic

5.6k
views
gate20171
digitallogic
numberrepresentation
fixedpointrepresentation
+5
votes
13
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
+30
votes
14
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.2k
views
gate20172
theoryofcomputation
finiteautomata
+10
votes
15
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 )$
answered
Feb 14, 2017
in
Digital Logic

5.6k
views
gate20171
digitallogic
numberrepresentation
fixedpointrepresentation
0
votes
16
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
+3
votes
17
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
+30
votes
18
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
0
votes
19
GATE201712178751948
answered
Feb 14, 2017
in
Numerical Ability

207
views
numericalability
+1
vote
20
GATE201712178751946
answered
Feb 14, 2017
in
Verbal Ability

299
views
+5
votes
21
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
+5
votes
22
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
0
votes
23
GATE201712178751942
answered
Feb 14, 2017
in
Verbal Ability

140
views
+2
votes
24
GATE201712178751944
answered
Feb 14, 2017
in
Numerical Ability

151
views
+5
votes
25
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
+18
votes
26
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
+2
votes
27
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 __________ .
answered
Feb 14, 2017
in
Programming

8.3k
views
gate20171
programming
programminginc
normal
numericalanswers
+6
votes
28
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
+30
votes
29
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
+24
votes
30
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
0
votes
31
Gate_2017_Set_1_5
answered
Feb 14, 2017
in
Programming

209
views
datastructure
algorithms
+6
votes
32
GATE2017204
Let $L_1, L_2$ be any two contextfree languages and $R$ be any regular language. Then which of the following is/are CORRECT? $L_1 \cup L_2$ is contextfree $\overline{L_1}$ is contextfree $L_1  R$ is contextfree $L_1 \cap L_2$ is contextfree I, II and IV only I and III only II and IV only I only
answered
Feb 14, 2017
in
Theory of Computation

3.7k
views
gate20172
theoryofcomputation
closureproperty
0
votes
33
GATE2017147
The number of integers between $1$ and $500$ (both inclusive) that are divisible by $3$ or $5$ or $7$ is ____________ .
answered
Feb 12, 2017
in
Set Theory & Algebra

3.6k
views
gate20171
settheory&algebra
normal
numericalanswers
sets
0
votes
34
SDT Compiler
I think in this correct option would be C but ans is marked as option A.
answered
Feb 9, 2017
in
Compiler Design

173
views
+2
votes
35
Ace Test Series: Computer Networks  Sliding Window
Pls verify that Ans. would be 45 or 46 ?
answered
Feb 9, 2017
in
Computer Networks

311
views
acetestseries
computernetworks
slidingwindow
0
votes
36
Made easy mock
Can a layer3 firewall stop incoming packet from a specific host...???
answered
Feb 7, 2017
in
Computer Networks

151
views
+1
vote
37
gatebook mock 2
Sender window size is 2^6 . So reciever window should be the same. i. e. 2^6. Sequence no = (sender window + rexiever window) =2^7 i.e. 7 bit
answered
Feb 7, 2017
in
Computer Networks

136
views
+2
votes
38
Memory management
(a) P3, Ps, P3, P2 (b)P2, P5, P3, 426k waits (c)P3, Ps, P2, 426k waits (d)P4, P2, P5, P3
answered
Feb 4, 2017
in
Operating System

187
views
memorymanagement
+3
votes
39
UGCNETDEC2016II19
Consider a schema R(MNPQ) and functional dependencies M→N, P→Q. Then the decomposition of R into R1(MN) and R2(PQ) is _______ Dependency preserving but not lossless join Dependency preserving and lossless join Lossless join but not dependency preserving Neither dependency preserving nor lossless join
answered
Feb 4, 2017
in
Others

1.5k
views
ugcnetdec2016ii
+1
vote
40
UGCNETDEC2016II5
Consider a Hamiltonian Graph G with no loops or parallel edges and with V(G)=n≥3. Then which of the following is true? deg(v) ≥ n/2 for each vertex v E(G) ≥ 1/2(n1)(n2)+2 deg(v)+deg(w) ≥ n whenever v and w are not connected by an edge All of the above
answered
Feb 4, 2017
in
CBSE/UGC NET

1.4k
views
ugcnetdec2016ii
Page:
1
2
3
4
5
6
next »
50,645
questions
56,601
answers
195,850
comments
102,208
users