Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Aboveallplayer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Aboveallplayer
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 non-zero 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
in
Programming in C
Feb 18, 2017
2.1k
views
8
votes
2
GATE CSE 2017 Set 1 | Question: 43
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$ expr $\rightarrow$ term relop term | term term $\rightarrow$ id | number id $\rightarrow$ a | b | c number $\rightarrow [0-9]$ where relop is a relational ... 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
in
Compiler Design
Feb 15, 2017
20.0k
views
gatecse-2017-set1
compiler-design
parsing
normal
numerical-answers
14
votes
3
GATE CSE 2017 Set 1 | Question: GA-6
"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 ... filter of nationalism. Our colonial past never happened. Nationalism has to be both adequately and properly imagined.
answered
in
Verbal Aptitude
Feb 14, 2017
3.8k
views
gatecse-2017-set1
general-aptitude
verbal-aptitude
passage-reading
4
votes
4
GATE CSE 2017 Set 1 | Question: 6
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
in
DS
Feb 14, 2017
16.6k
views
gatecse-2017-set1
data-structures
binary-search-tree
easy
11
votes
5
GATE CSE 2017 Set 1 | Question: GA-7
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 $2$ $3$ $4$ Cannot be determined
answered
in
Analytical Aptitude
Feb 14, 2017
7.9k
views
gatecse-2017-set1
analytical-aptitude
round-table-arrangement
3
votes
6
GATE CSE 2017 Set 1 | Question: GA-4
Find the smallest number $y$ such that $y \times 162$ is a perfect cube. $24$ $27$ $32$ $36$
answered
in
Quantitative Aptitude
Feb 14, 2017
5.0k
views
gatecse-2017-set1
general-aptitude
quantitative-aptitude
numerical-computation
7
votes
7
GATE CSE 2017 Set 1 | Question: GA-2
Research in the workplace reveals that people work for many reasons _______________ . money beside beside money money besides besides money
answered
in
Verbal Aptitude
Feb 14, 2017
4.4k
views
gatecse-2017-set1
general-aptitude
verbal-aptitude
english-grammar
46
votes
8
GATE CSE 2017 Set 1 | Question: 08
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 ... 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
in
DS
Feb 14, 2017
25.3k
views
gatecse-2017-set1
data-structures
linked-list
normal
11
votes
9
GATE CSE 2017 Set 1 | Question: 04
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$ ... $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
answered
in
Algorithms
Feb 14, 2017
17.5k
views
gatecse-2017-set1
algorithms
asymptotic-notation
normal
5
votes
10
GATE CSE 2017 Set 1 | Question: 02
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty 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
in
Mathematical Logic
Feb 14, 2017
17.0k
views
gatecse-2017-set1
mathematical-logic
first-order-logic
61
votes
11
GATE CSE 2017 Set 1 | Question: 21
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 )$ ... available. The above logic is implemented using $2$-input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .
answered
in
Digital Logic
Feb 14, 2017
14.0k
views
gatecse-2017-set1
digital-logic
k-map
numerical-answers
normal
8
votes
12
GATE CSE 2017 Set 1 | Question: 7
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 $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
in
Digital Logic
Feb 14, 2017
16.4k
views
gatecse-2017-set1
digital-logic
number-representation
fixed-point-representation
5
votes
13
GATE CSE 2017 Set 2 | Question: 52
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
in
Linear Algebra
Feb 14, 2017
15.3k
views
gatecse-2017-set2
engineering-mathematics
linear-algebra
numerical-answers
eigen-value
38
votes
14
GATE CSE 2017 Set 2 | Question: 39
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
answered
in
Theory of Computation
Feb 14, 2017
28.0k
views
gatecse-2017-set2
theory-of-computation
finite-automata
14
votes
15
GATE CSE 2017 Set 1 | Question: 7
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 $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
in
Digital Logic
Feb 14, 2017
16.4k
views
gatecse-2017-set1
digital-logic
number-representation
fixed-point-representation
0
votes
16
GATE CSE 2017 Set 1 | Question: GA-1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. was wishing is wishing wished had wished
answered
in
Verbal Aptitude
Feb 14, 2017
7.4k
views
gatecse-2017-set1
general-aptitude
verbal-aptitude
tenses
english-grammar
normal
4
votes
17
GATE CSE 2017 Set 1 | Question: 6
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
in
DS
Feb 14, 2017
16.6k
views
gatecse-2017-set1
data-structures
binary-search-tree
easy
37
votes
18
GATE CSE 2017 Set 2 | Question: 14
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
in
Programming in C
Feb 14, 2017
9.5k
views
gatecse-2017-set2
programming-in-c
identify-function
pointers
0
votes
19
GATE CSE 2017 Set 1 | Question: 2178751948
answered
in
Quantitative Aptitude
Feb 14, 2017
497
views
quantitative-aptitude
1
vote
20
GATE CSE 2017 Set 1 | Question: 2178751946
answered
in
Verbal Aptitude
Feb 14, 2017
754
views
6
votes
21
GATE CSE 2017 Set 1 | Question: 21
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 )$ ... available. The above logic is implemented using $2$-input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .
answered
in
Digital Logic
Feb 14, 2017
14.0k
views
gatecse-2017-set1
digital-logic
k-map
numerical-answers
normal
5
votes
22
GATE CSE 2017 Set 2 | Question: 03
Match the algorithms with their time complexities: ... $P\rightarrow (iv) \quad Q \rightarrow(iii)\quad r \rightarrow(ii) \quad S\rightarrow(i)$
answered
in
Algorithms
Feb 14, 2017
6.8k
views
gatecse-2017-set2
algorithms
time-complexity
match-the-following
easy
0
votes
23
GATE CSE 2017 Set 1 | Question: 2178751942
answered
in
Verbal Aptitude
Feb 14, 2017
496
views
2
votes
24
GATE CSE 2017 Set 1 | Question: 2178751944
answered
in
Quantitative Aptitude
Feb 14, 2017
427
views
6
votes
25
GATE CSE 2017 Set 1 | Question: 04
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$ ... $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
answered
in
Algorithms
Feb 14, 2017
17.5k
views
gatecse-2017-set1
algorithms
asymptotic-notation
normal
21
votes
26
GATE CSE 2017 Set 2 | Question: 15
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
in
Algorithms
Feb 14, 2017
7.9k
views
gatecse-2017-set2
algorithms
graph-algorithms
graph-search
2
votes
27
GATE CSE 2017 Set 1 | Question: 53
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); } ... in $string.h$ as returning a value of type $size\_t$, which is an unsigned int. The output of the program is __________ .
answered
in
Programming in C
Feb 14, 2017
24.5k
views
gatecse-2017-set1
programming
programming-in-c
normal
numerical-answers
8
votes
28
GATE CSE 2017 Set 2 | Question: 09
Consider the following statements about the routing protocols. Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) in an $\textsf{IPv4}$ network. RIP uses distance vector routing RIP packets are sent using UDP OSPF packets are sent using TCP OSPF operation ... are CORRECT? I and IV only I, II and III only I, II and IV only II, III and IV only
answered
in
Computer Networks
Feb 14, 2017
12.2k
views
gatecse-2017-set2
computer-networks
routing
44
votes
29
GATE CSE 2017 Set 2 | Question: 08
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
in
Operating System
Feb 14, 2017
12.9k
views
gatecse-2017-set2
operating-system
file-system
normal
31
votes
30
GATE CSE 2017 Set 2 | Question: 03
Match the algorithms with their time complexities: ... $P\rightarrow (iv) \quad Q \rightarrow(iii)\quad r \rightarrow(ii) \quad S\rightarrow(i)$
answered
in
Algorithms
Feb 14, 2017
6.8k
views
gatecse-2017-set2
algorithms
time-complexity
match-the-following
easy
Page:
1
2
3
4
5
6
...
8
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation