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
Questions by srestha
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+3
votes
1
answer
1
Mathematical Logic Ques:Self doubt
“Not every satisfiable logic is valid” Representation of it will be $1)\sim \left ( \forall S(x)\rightarrow V(x) \right )$ or $2)\sim \left ( \forall S(x)\vee V(x) \right )$ Among $1)$ and $2)$, which one is correct? and why?
asked
Jun 4
in
Mathematical Logic

162
views
discretemathematics
mathematicallogic
0
votes
0
answers
2
Doubt on a math question
Chk this question https://gateoverflow.in/100202/testseriescounting $1)$Can someone verify this ans?? See if $\left ( _{0}^{6}\textrm{C} \right )$ in one set, other set will contain $\left ( _{6}^{6}\textrm{C} \right )$ elements. right?? Now why do we again need $2^{n}$ ... meaning of it?? $2)$ How $\sum_{I=0}^{n}\left ( _{i}^{n}\textrm{C} \right ).2^{ni}=3^{n}$??
asked
Jun 4
in
Set Theory & Algebra

45
views
discretemathematics
settheory&algebra
+2
votes
1
answer
3
Mathematics: GATE2017 EC222
Consider the random process: $X\left ( t \right )=U+Vt$ where $U$ is zeromean Gaussian random variable and $V$ is a random variable uniformly distributed between $0$ and $2.$ Assume $U$ and $V$ statistically independent. The mean value of random process at $t=2$ is ___________
asked
Jun 3
in
Probability

135
views
gate2017ec2
probability
+1
vote
0
answers
4
Aptitude Self Doubt
If altitude of equilateral triangle is given, then what is formula to find area of it??
asked
Jun 2
in
Numerical Ability

82
views
numericalability
0
votes
1
answer
5
Doubt on Bipartite Graph
What is T.C. to find maximum number of edges to be added to a tree so that it stays as a bipartite graph? Now my question is, why do we need to add edges to make a tree bipartite? A tree is already bipartite graph. Right?? Again how do we add edges in it?? Is BFS or DFS do any improvement in such a tree?? How to think such a question??
asked
Jun 2
in
Algorithms

74
views
graphtheory
algorithms
0
votes
1
answer
6
GATE 2019:EC
The value of integral $\int_{0}^{\pi }\int_{y}^{\pi }\frac{\sin x}{x}dxdy$ is equal to_________
asked
Jun 2
in
Linear Algebra

81
views
discretemathematics
0
votes
2
answers
7
GATE 2017:EC
Consider the $5\times 5$ matrix: $\begin{bmatrix} 1 & 2 &3 & 4 &5 \\ 5 &1 &2 & 3 &4 \\ 4& 5 &1 &2 &3 \\ 3& 4 & 5 & 1 &2 \\ 2&3 & 4 & 5 & 1 \end{bmatrix}$ It is given $A$ has only one real eigen value. Then the real eigen value of $A$ is ________
asked
Jun 2
in
Linear Algebra

177
views
discretemathematics
linearalgebra
matrix
matrices
+2
votes
4
answers
8
GATE2017 EC
The rank of the matrix $\begin{bmatrix} 1 & 1 & 0 &0 & 0\\ 0 & 0 & 1 &1 &0 \\ 0 &1 &1 &0 &0 \\ 1 & 0 &0 & 0 &1 \\ 0&0 & 0 & 1 & 1 \end{bmatrix}$ is ________. Ans 5?
asked
Jun 1
in
Linear Algebra

233
views
discretemathematics
matrix
+2
votes
1
answer
9
Doubt on GATE Question
Read the statements: All women are entrepreneurs. Some women are doctors. Which of the following conclusions can be logically inferred from the above statements? All women are doctors All doctors are entrepreneurs All entrepreneurs are women Some entrepreneurs are doctors ... Is it because , if we make set of doctor as 0, then All doctors are entrepreneurs is meaningless.
asked
Jun 1
in
Mathematical Logic

64
views
discretemathematics
mathematicallogic
+1
vote
1
answer
10
Mathematical Logic: Doubt on meaning of statement
The notation $\exists ! x P(x)$ denotes the proposition there exists a unique $x$ such that $P(x)$ ... What will be answer here?? Is the assumption only for left hand side and not right hand side??
asked
May 31
in
Mathematical Logic

83
views
mathematicallogic
discretemathematics
0
votes
1
answer
11
Agarwal AptitudeC.I.
What is the difference between the compound interests on $Rs.5000$ for $1\frac{1}{2}$ years at $4$% per annum compounded yearly and halfyearly? See we know formula for compound interest $P\left ( 1+\frac{R}{100} \right )^{n}$ But when they calculating compound ... Do we need to calculate fraction power like this?
asked
May 28
in
Numerical Ability

50
views
generalaptitude
0
votes
0
answers
12
TrigonometryDoubt
$1)$What is the value of $\sin 15^{o}$ $\sin 15^{o}=\sin \left ( 60^{o}45^{o} \right )$ $=\sin 60^{o}.\cos 45^{o}\cos 60^{o}.\sin 45^{o}$ ... $=\frac{\sqrt{3}1}{2\sqrt{2}}=0.258$ Is it correct? $2)$ $\sin 80^{o}$ value=_____________ Is it possible to do?
asked
May 28
in
Numerical Ability

57
views
generalaptitude
0
votes
0
answers
13
Aptitude(Recruitment Ques)
The value of $\sin 120^{o}+\sin 780^{o}\cos 360^{o}$ $=(\sin (90^{o}\times 2)60^{o})+\left ( \sin \left ( 90^{o}\times 8 \right )+60^{o} \right )\left ( \cos (90^{o}\times 4)+0^{o} \right )$ $=\frac{\sqrt{3}}{2}+\frac{\sqrt{3}}{2}1=0.73$ right??
asked
May 28
in
Numerical Ability

44
views
generalaptitude
+1
vote
1
answer
14
Aptitude(recruitment exam)
The expression $\left ( 11.98\times 11.98+11.98\times a+0.02\times 0.02 \right )$ will be a perfect square for $’a’$ equal to _________ $a)0.02$ $b)0.2$ $c)0.04$ $d)0.4$
asked
May 28
in
Numerical Ability

47
views
generalaptitude
0
votes
1
answer
15
SelfDoubt: Diagonalizable Matrix
$1)$ How to find a matrix is diagonalizable or not? Suppose a matrix is $A=\begin{bmatrix} \cos \Theta &\sin \Theta \\ \sin\Theta & \cos\Theta \end{bmatrix}$ Is it diagonalizable? $2)$ What is it’s eigen spaces?
asked
May 27
in
Linear Algebra

145
views
engineeringmathematics
linearalgebra
matrices
0
votes
1
answer
16
Probability question of CLRS
In a restaurant each of $n$ customer gives a hat to the hat check person. The hat check person gives the hat back to the customer in a random order. What is expected number of customer who get back their own hat?
asked
May 27
in
Probability

112
views
algorithms
probability
0
votes
3
answers
17
Self DoubtCombinatory
In how many ways we can put $n$ distinct balls in $k$ dintinct bins?? Will it be $n^{k}$ or $k^{n}$?? Taking example will be easy way to remove this doubt or some other ways possible??
asked
May 25
in
Combinatory

103
views
discretemathematics
permutationandcombination
+1
vote
0
answers
18
Allen Career Institute:Circular Queue
$1)$How circular queue can be implemented? $2)$ For which data structure circular queue cannot be implemented? $(A)$Array $(B)$ Singly Linked List $(C)$ Doubly Linked List $(D)$ Stack
asked
May 24
in
DS

205
views
datastructure
circularqueue
+1
vote
1
answer
19
Made easy Test Series:Graph Theory+Automata
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n1}$, where each $a_{i}$ is $0$ or $1$ ... and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________
asked
May 23
in
Graph Theory

129
views
madeeasytestseries
graphtheory
theoryofcomputation
+1
vote
2
answers
20
Made Easy Test Series:Binary Trees
Consider the following function height, to which pointer to the root node of a binary tree shown below is passed Note that max(a,b) defined by #define max(a,b) (a>b)?a:b. int height(Node *root) The output of the above code will be _________________
asked
May 22
in
DS

150
views
madeeasytestseries
binarytree
+1
vote
0
answers
21
Made Easy Test Series:DatabasesTables
Number of tables required in above ER diagram will be _____________ Is $R_{1}$ create separate table or not?? and $R_{2}$ look like if we remove loop from it?? Answer given for table $E_{1}R_{1}$ Key will be $AC$ , with ... Entities. So, it will add one extra table. I already read https://gateoverflow.in/229580/madeeasytestseriesnumberoftablesrequired
asked
May 22
in
Databases

92
views
madeeasytestseries
databases
0
votes
1
answer
22
Made Easy Test Series:Aptitude
Chandan and Falguni work on alternet days. Chandan working on 1st day, Falguni on 2nd , then Chandan again by 3rd , followed by Falguni on 4th and so on. They can finish the work in $25$ days. The work done by chandan varies everyday. On a ... by Chandan on 1st day to done by Falguni on 2nd day$=1:4.$ The time require Falguni alone finish the work ____________ days
asked
May 22
in
Numerical Ability

71
views
madeeasytestseries
generalaptitude
numericalability
0
votes
0
answers
23
Made Easy Test Series: Stack Address
A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$ The instruction are as follows: $I_{1}:PUSH$ $500$ $I_{2}:PUSH$. $700$ ... execution of instruction. $C)$ Memory location $600$ contain $0XBF$ after execution of instruction. $D)$ Both $a)$ and $c)$
asked
May 22
in
DS

94
views
madeeasytestseries
datastructure
stack
0
votes
1
answer
24
Made Easy Test Series:General AptitudeCircle
In a right angle triangle $ABC$ with vertex $B$ being the right angle, the mutually perpendicular sides $AB$ and $BC$ are $p$ cm. and $q$ cm. long respectively. If the length of hypotenuse is $\left ( p+q6 \right )$ cm., then the radius of the largest possible circle that can be inscribe in the triangle is ____________
asked
May 21
in
Numerical Ability

69
views
generalaptitude
madeeasytestseries
numericalability
+1
vote
1
answer
25
Made Easy Test Series:Microprogramming
A hypothetical cpu supports $300$ instructions.each instruction takes $5$ cycle to accomplish the execution. the control unit is designed using vertical programming which has $130$ control signals $,64$ flags and $12$ branch conditions .$X$ and ... register$(CDR)$ respectively.value of $X+Y$ is ______? How to work with branch condition in micro programming :(
asked
May 20
in
CO and Architecture

138
views
madeeasytestseries
microprogramming
coandarchitecture
0
votes
1
answer
26
Made Easy Test Series:Lattice
The number of totally ordered set compatible to the given POSET are __________
asked
May 20
in
Set Theory & Algebra

76
views
madeeasytestseries
lattice
+1
vote
2
answers
27
Made Easy Test Series:Programming(FLT4)
#include<stdio.h> #include<iostream> int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(){ int x=foo(1000,1500); printf("%d",x); return 0; } Output of the program is ___________
asked
May 20
in
Programming

179
views
madeeasytestseries
programming
programminginc
0
votes
2
answers
28
Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain
asked
May 20
in
Operating System

219
views
madeeasytestseries
operatingsystem
processsynchronization
0
votes
1
answer
29
Made Easy Test Series:Programming in C
Consider the following $C$ implementation which when given $3$ numbers a,b,c as input, find the maximum of $3$ numbers $a,b,c.$ int kickstart(int a,int b,int c) { if(B1) return a; if(a>=b) return B2; return kickstart(c,a,b); } How the boxes filled up ... $a\geq c, B2:kickstart\left ( b,c,a \right );$ Is it $I) and II)$ or $I) and IV)$
asked
May 19
in
Programming

187
views
madeeasytestseries
programming
programminginc
+1
vote
0
answers
30
Recurrence RelationSelf Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??
asked
May 19
in
Algorithms

72
views
discretemathematics
recurrenceeqation
algorithms
Page:
1
2
3
4
5
6
...
24
next »
50,647
questions
56,496
answers
195,488
comments
100,794
users