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 radha gogia
User radha gogia
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User radha gogia
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+6
votes
1
Discrete mathematics **** imp
Prove the validity of the following argument " If I get the job and work hard,then I'll get promoted. If I get promoted then i'll be happy. I will not be happy. Therefore either i will not get the job or i will not work hard."
answered
Jul 7, 2016
in
Mathematical Logic

427
views
+1
vote
2
How to manipulate the given linked list in the following manner in O(n) time ?
If we are given a linked list then we have to manipulate such that even indexed node are arranged together and odd indexed nodes are arranged together after even indexed nodes for instance the given linked list is 1>2>3>4>5>6 , so the op should be 2>4>6>1>3>5
answered
Apr 9, 2016
in
Algorithms

218
views
linkedlists
placementquestions
descriptive
+9
votes
3
MadeEasy Test Series: Mathematical Logic  First Order Logic
Match the following Lists ListI A. There are atmost two apples. B. There are exactly two apples. C. There is atmost one apple. D. There is exactly one apple. ListII 1. ... D (a) 1 2 3 4 (b) 3 2 1 4 (c) 1 3 2 4 (d) 3 1 2 4 $a$ $b$ $c$ $d$
answered
Feb 29, 2016
in
Mathematical Logic

486
views
madeeasytestseries
engineeringmathematics
discretemathematics
mathematicallogic
firstorderlogic
+2
votes
4
IITM2012
What will be printed by following statement : printf(“%d”,scanf(“%d”,&n));
answered
Feb 23, 2016
in
Written Exam

170
views
+1
vote
5
Functional Dependency
Lets say their is R(A,B,C) and FD : A⟶B, AB⟶C and A is key. Is it in 3NF? Explain
answered
Feb 21, 2016
in
Databases

115
views
+3
votes
6
Extraneous Attribute
Let FD: AB>C , A>C .Is B extraneous ?if yes, then how can we determine B.
answered
Feb 21, 2016
in
Databases

392
views
0
votes
7
integration
Please solve the following integration problem $\int_{0}^{\infty}{ y^{\frac{1}{2} }}e^{y^3}dx$ I want full explanation. please help me ?
answered
Feb 9, 2016
in
Calculus

520
views
0
votes
8
How to find how many linearly independent eigen vectors are possible of a matrix?
answered
Feb 9, 2016
in
Linear Algebra

278
views
+2
votes
9
View serializable
S: r1(x),r2(x),w1(x),w2(x) it is view serializable or not
answered
Feb 1, 2016
in
Databases

370
views
view_serializable
+4
votes
10
Ace Test Series: Programming & DS  Programming In C
answered
Feb 1, 2016
in
Programming

208
views
acetestseries
programming
programminginc
+1
vote
11
View serializable
With the help of blind write how we know that given schedule is view serializable
answered
Feb 1, 2016
in
Databases

338
views
view_serializable
0
votes
12
Given two positive functions f(n) and g(n).If f(n)/g(n)=c , for some constant c >=0 , which of the stmts are true ?
answered
Jan 31, 2016
in
Algorithms

288
views
asymptoticnotations
+3
votes
13
Whether w wr x where w,x belongs to {a,b}* Regular?
L = {wwrx where w,x belongs to {a,b}*} is Regular definitely as w can always be considered to be Epislon. So, this just becomes (a+b)* language. What about this one: Whether L={wwrx where w,x belongs to {a,b}+} Regular ?
answered
Jan 30, 2016
in
Theory of Computation

816
views
theoryofcomputation
regularlanguages
pumpinglemma
+3
votes
14
Ace Test Series: Linear Algebra  Eigen Value
Answer should be A. But they gave D. Their Explanation: Corresponding to each distinct eigen value, we have atleast one independent eigen vector.
answered
Jan 30, 2016
in
Linear Algebra

1.1k
views
acetestseries
engineeringmathematics
linearalgebra
eigenvalue
+3
votes
15
Minimal FA
What is the number of states in a minimal FA which accepts all strings over (0,1)* where every string starts with 100 and the length of the string is congruent to 1(mod4) I am getting 11 states. Ans given is 8. While doing the cross product , is it ensured that , I will get the minimal DFA ? or do I have to minimise after the cross product ?
answered
Jan 17, 2016
in
Theory of Computation

199
views
theoryofcomputation
compoundautomata
+2
votes
16
regular or context free ?
(a+b)^* a^n b^n n>=1
answered
Jan 17, 2016
in
Theory of Computation

122
views
theoryofcomputation
identifyclasslanguage
+3
votes
17
limits
Find the value of: $\lim_{\theta \to \pi/2} \left ( 1  5 \cot\theta \right )^{\tan\theta}$ $e^{5}$ $e^{5}$ $e^{1/5}$ $e^{1/5}$
answered
Jan 17, 2016
in
Calculus

208
views
limits
+1
vote
18
Is it possible to delete intermediate node/number in Heap?
Is it possible to delete intermediate node/number in Heap? Not a root or last.
answered
Dec 26, 2015
in
Algorithms

90
views
algorithms
+1
vote
19
complexity of algo for detection of universal sink in directed graph
minimum running time of algo that determines universal sink in a directed graph G={V,E}  a vertex with indegree V1 and outdegree 0, given an adjacency matrix for G is: omega(V^2) O(V) O(V+E) none
answered
Dec 26, 2015
in
Algorithms

314
views
0
votes
20
Reference to a formal list of Tokens in C
How many tokens are there in each > int *ptr = &x; ++a >= != x += 10; Token should be counted before preprocessing or after it? from my experience only, I'm able to identify what are considered as tokens are and what ... all tokens are there in C. Does a token depends on what compiler is in use? Create a standard list of tokens for GATE exam.
answered
Dec 6, 2015
in
Compiler Design

350
views
programminginc
compilerdesign
+2
votes
21
Dangling else problem
The dangling else problem in the construct If (E) sales S  is (E) S  a can be resolved IN SDTS by (A) Using the associative & precedence of operating & the 'exe' munch principle (B) By change the grammar to an unambiguous one (C) Cannot be removed as It Is undecidable (D) None of the above
answered
Dec 5, 2015
in
Compiler Design

634
views
compilerdesign
0
votes
22
SDT
in top down parsing while constructing parse tree , semantic actions are considered as child of Variable (ie part of production on RHS) how we can decide this as the right child or left child in parse tree ? if not getting my question ? explain sdt using top down parsing ?
answered
Dec 5, 2015
in
Compiler Design

303
views
0
votes
23
How to calculate virtual address space in below question ?
If we are given PAGE SIZE=4KB, PAGE TABLE ENTRY SIZE=4B OUTER PAGE TABLE SIZE=4KB and levels of Paging=3 ,so how to go about calculating the virtual address space .
answered
Oct 19, 2015
in
Operating System

516
views
+4
votes
24
GATE201129
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$
answered
Oct 18, 2015
in
DS

6.7k
views
gate2011
binarytree
normal
+1
vote
25
what is the output of the following program code?
void myfunc(int X){ if(X > 0) myfunc( X ); printf("%d", X); } int main(){ myfunc(5); return 0; } 0,0,1,2,3,4 4,3,2,1,0 4,3,2,1,0,0 0,1,2,3,4
answered
Oct 18, 2015
in
Programming

497
views
programminginc
+2
votes
26
Hashing
Let $H$ be a finite collection of hash functions that map a universe $U$ of keys to $\{0,1,2, \ldots ,m1\}$. $H$ is said to be universal if for each pair of distinct keys, $(k, i) \in U$, the number of hash functions $h\in H$ for which $h(k)=n(i)$ is at most ________ $\dfrac{∣H∣}{m^2}$ $\dfrac{1}{m^2 \log m}$ $\dfrac{∣H∣}{m^2}$ $\dfrac{∣H∣}{m}$
answered
Oct 18, 2015
in
DS

677
views
hashing
0
votes
27
What is the output of the following C code?
int main (){ int a=5,b=3; printf("%d", a+++++b); // 5 +'s } Please Explain.
answered
Oct 15, 2015
in
Programming

364
views
programminginc
0
votes
28
What is the criteria for distinguishing data structure in terms of linear and nonlinear ?
answered
Oct 14, 2015
in
DS

434
views
datastructure
+3
votes
29
ISRO201569
If n has 3, then the statement a[++n]=n++; assigns 3 to a[5] assigns 4 to a[5] assigns 4 to a[4] what is assigned is compiler dependent
answered
Oct 14, 2015
in
Programming

3.2k
views
isro2015
programminginc
nongate
+3
votes
30
ISRO201575
The for loop for (i=0; i<10; ++i) printf("%d", i&1); prints 0101010101 0111111111 0000000000 1111111111
answered
Oct 14, 2015
in
Programming

3k
views
isro2015
programminginc
+3
votes
31
ISRO201568
Consider the following program fragment if(a > b) if(b > c) s1; else s2; s2 will be executed if a <= b b > c b >= c and a <= b a > b and b <= c
answered
Oct 14, 2015
in
Programming

1.9k
views
isro2015
programming
programminginc
+7
votes
32
ISRO201111
How many distinct binary search trees can be created out of 4 distinct keys? 5 14 24 35
answered
Oct 5, 2015
in
Combinatory

4k
views
isro2011
permutationandcombination
binarysearchtree
+3
votes
33
Let a, b be two positive integers, which of the following options correctly relates / and %?
answered
Oct 5, 2015
in
Programming

1.1k
views
programming
programminginc
+8
votes
34
GATE2015325
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
answered
Oct 1, 2015
in
DS

4.2k
views
gate20153
datastructure
binarytree
normal
numericalanswers
+2
votes
35
ISRO201451
Which of the following is NOT represented in a subroutine's activation record frame for a stackbased programming language? Values of local variables Return address Heap area Information needed to access non local variables
answered
Sep 26, 2015
in
Programming

1.8k
views
isro2014
programming
activationrecords
+1
vote
36
Pointers
Now I suppose if i have a statement like *P++ then it is broken down as first (P++) and then *p (because both are unary operator and associtivity is right to left ) and if we have statement like a=*p++ then it is broken down into a=*p and then p is incremented !! Am i right ?
answered
Jul 23, 2015
in
Programming

212
views
pointers
programminginc
+1
vote
37
How to do this program?
int main() { int i = 255; char *p; p = &i; printf("%d", *p); return 0; }
answered
Jul 18, 2015
in
Programming

249
views
programminginc
programming
nongate
50,645
questions
56,597
answers
195,839
comments
102,146
users