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 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
+51
votes
1
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

7.1k
views
gate2006it
programming
programminginc
normal
+46
votes
2
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

5.6k
views
gate20153
programming
programminginc
normal
numericalanswers
+3
votes
3
idea of this passage
answered
Jan 10, 2016
in
Verbal Ability

94
views
verbalability
0
votes
4
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

251
views
graphalgorithms
dfs
0
votes
5
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.
answered
Sep 2, 2015
in
Mathematical Logic

1.1k
views
+6
votes
6
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

927
views
gate1993
mathematicallogic
normal
propositionallogic
proof
descriptive
0
votes
7
maths_mocktest1_12
A. 1 B. 2 C. 3 D. 4
answered
Aug 6, 2015
in
Calculus

503
views
calculus
0
votes
8
limit
limx>0 (cot x)1/logx ? ans: 0(m getting 1/e)
answered
Aug 5, 2015
in
Calculus

1.2k
views
+4
votes
9
calculate limit
$\lim_{x\rightarrow \infty }\left(4^{x}+5^{x}\right)^{1/x}$
answered
Aug 4, 2015
in
Calculus

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

215
views
calculus
limits
+3
votes
11
calculate limit
$\lim_{x\rightarrow \frac{\pi}{4}} (\tan x)^{\tan 2x}$
answered
Aug 4, 2015
in
Calculus

132
views
calculus
limits
50,833
questions
57,738
answers
199,467
comments
108,002
users