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 Salman
User Salman
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Salman
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
GATE201235
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, $REAR = FRONT = 0$. The conditions to detect queue full ... empty: $(REAR+1) \mod n == FRONT$ full: $(FRONT+1) \mod n == REAR$ empty: $REAR == FRONT$
commented
Feb 4, 2016
in
DS

5.1k
views
gate2012
datastructure
queues
normal
5
answers
2
GATE20043
A single array $A[1 .. MAXSIZE]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top < top 2)$ point to the location of the topmost element in each of the stacks. If the space is to be used efficiently, the ... $top1 + top2 = MAXSIZE$ $(top1 = MAXSIZE / 2)$ or $(top2 = MAXSIZE)$ $top1 = top2  1$
commented
Feb 4, 2016
in
DS

4.6k
views
gate2004
datastructure
stack
easy
3
answers
3
GATE2006IT50
Which one of the choices given below would be printed when the following program is executed? #include <stdio.h> void swap (int *x, int *y) { static int *temp; temp = x; x = y; y = temp; } void printab () { static int i, a = 3, b = 6; i = 0; while (i <= 4) { if ((i++)%2 == 1) continue; ... $a = 12, b = 9$ $a = 3, b = 6$ $a = 3, b = 6$ $a = 6, b = 3$ $a = 15, b = 12$
comment edited
Jan 24, 2016
in
Programming

5.3k
views
gate2006it
programming
programminginc
normal
7
answers
4
GATE2006IT49
Which one of the choices given below would be printed when the following program is executed ? #include <stdio.h> struct test { int i; char *c; }st[] = {5, "become", 4, "better", 6, "jungle", 8, "ancestor", 7, "brother"}; ... $\text{etter, u, 6, ungle}$ $\text{cetter, k, 6, jungle}$ $\text{etter, u, 8, ncestor}$
answered
Jan 24, 2016
in
Programming

6.3k
views
gate2006it
programming
programminginc
normal
5
answers
5
GATE2015326
Consider the following C program #include<stdio.h> int main() { static int a[] = {10, 20, 30, 40, 50}; static int *p[] = {a, a+3, a+4, a+1, a+2}; int **ptr = p; ptr++; printf("%d%d", ptrp, **ptr); } The output of the program is _______.
answered
Jan 23, 2016
in
Programming

5k
views
gate20153
programming
programminginc
normal
numericalanswers
5
answers
6
GATE2014245
The value of a $\text{float}$ type variable is represented using the singleprecision $\text{32bit}$ floating point format of $IEEE754$ standard that uses $1$ $\text{bit}$ for sign, $\text{8 bits}$ ... is assigned the decimal value of $−14.25$. The representation of $X$ in hexadecimal notation is $C1640000H$ $416C0000H$ $41640000H$ $C16C0000H$
commented
Jan 10, 2016
in
Digital Logic

2.7k
views
gate20142
digitallogic
numberrepresentation
normal
ieeerepresentation
3
answers
7
GATE2011 AG: GA9
The fuel consumed by a motorcycle during a journey while traveling at various speeds is indicated in the graph below. The distances covered during four laps of the journey are listed in the table below ... the given data, we can conclude that the fuel consumed per kilometre was least during the lap $P$ $Q$ $R$ $S$
commented
Jan 10, 2016
in
Numerical Ability

137
views
generalaptitude
numericalability
gate2011ag
datainterpretation
graphicaldata
1
answer
8
idea of this passage
answered
Jan 10, 2016
in
Verbal Ability

90
views
verbalability
1
answer
9
Edge type in Undirected Graphs on Depth First Tree
Assume WHITE vertices that are yet to be discovered, BLACK vertices are finished vertices and GRAY vertices are frontier betweeen WHITE and BLACK in Depth First Search. Now, What are the various edge types like TREEEDGE and BACKEDGE possible between ... edge type between WHITE and GRAY type vertices. [ CLRS (3rd Edition) : 223:1; Page # 610 ]
answered
Oct 22, 2015
in
Algorithms

243
views
graphalgorithms
dfs
4
answers
10
logic
Translate each of these statements into logical expressions using predicates, quantifiers, and logical connectives. a) No one is perfect. b) Not everyone is perfect. c) All your friends are perfect. d) At least one of your friends is perfect.
commented
Sep 2, 2015
in
Mathematical Logic

1.1k
views
3
answers
11
GATE199318
Show that proposition $C$ is a logical consequence of the formula$A\wedge \left(A \to \left(B \vee C\right)\right) \wedge \left( B \to \neg A\right)$using truth tables.
answered
Sep 1, 2015
in
Mathematical Logic

846
views
gate1993
mathematicallogic
normal
propositionallogic
proof
descriptive
2
answers
12
maths_mocktest1_12
A. 1 B. 2 C. 3 D. 4
answered
Aug 6, 2015
in
Calculus

498
views
calculus
4
answers
13
Limits
What is $\lim_{ x \to 0} (1x)^{\frac{1}{x}}$ ? Also please explain the result?
commented
Aug 6, 2015
in
Calculus

1.5k
views
calculus
limits
3
answers
14
limit
limx>0 (cot x)1/logx ? ans: 0(m getting 1/e)
answered
Aug 5, 2015
in
Calculus

1.1k
views
3
answers
15
Calculate the limit
$\lim_{x \to 0} \frac{\cos(x)\log(1+x)1+x}{\sin^2x} = ? $ Please explain the steps also
commented
Aug 5, 2015
in
Calculus

379
views
calculus
limits
3
answers
16
calculate limit
$\lim_{x\rightarrow \infty }\left(4^{x}+5^{x}\right)^{1/x}$
commented
Aug 4, 2015
in
Calculus

168
views
calculus
limits
3
answers
17
calculate limit
$\lim_{x\rightarrow \frac{\pi}{2}}{( \sin x)}^{\tan x}$
answered
Aug 4, 2015
in
Calculus

205
views
calculus
limits
2
answers
18
calculate limit
$\lim_{x\rightarrow \frac{\pi}{4}} (\tan x)^{\tan 2x}$
answered
Aug 4, 2015
in
Calculus

126
views
calculus
limits
50,666
questions
56,157
answers
193,767
comments
93,749
users