GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Answers by Debashish Deka
User Debashish Deka
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Debashish Deka
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
Hasse diagram
How come D66 is boolean algebra. Explain it through hasse diagram.
answered
2 hours
ago
in
Set Theory & Algebra

6
views
+1
vote
2
Probability
P( A union B)=.6 P( A intersection B)=.25 Find P(A`) +P(B`) ? where P(A`) means probability of A complement.
answered
5 hours
ago
in
Mathematical Logic

18
views
probability
engineeringmathematics
+3
votes
3
3 D array with pointers
answered
Jun 3
in
Programming

48
views
+2
votes
4
Generating function , closed form
answered
Jun 3
in
Combinatory

27
views
generatingfunctions
+2
votes
5
LEARNING LINUX Beginner's Guide to linux
answered
Jun 1
in
Others

1.1k
views
linux
gettingtoiits
+3
votes
6
Finding best time complexity
$\begin{align*} & a[n] = \{x_1,x_2,x_3,x_4,....,x_n\} \text{ is an array of integers where } n,x_i > 0. \\ & A = \left [ \text{min}\left ( x_i,x_j \right ) \right ] \cdot \left ( ji \right ) \text{ where } j ... } i,j \leq n \\ & \text{What is the best time complexity to find out the value of } A_{\bf max} \; ? \end{align*}$
answered
May 28
in
Algorithm Challenges

114
views
algorithms
timecomplexity
+2
votes
7
ISBN9780070681880  Exercise 5.3  Problem 35 (Kenneth Rosen 7ed SIE)
answered
May 27
in
Mathematical Logic

60
views
kennethrosen
discretemathematics
combinatory
counting
+3
votes
8
#PROG
Predict the output of following program. Assume that the numbers are stored in 2's complement form. #include<stdio.h> int main() { unsigned int x = 1; int y = ~0; if (x == y) printf("same"); else printf("not same"); return 0; } 1.SAME 2.NOT SAME
answered
May 17
in
Programming

38
views
programminginc
+3
votes
9
GATE20006
Let $S$ be a set of $n$ elements $\left\{1, 2,....., n\right\}$ and $G$ a graph with 2$^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertices are adjacent iff the symmetric difference of the ... Every vertex in $G$ has the same degree. What is the degree of a vertex in $G$? How many connected components does $G$ have?
answered
May 12
in
Set Theory & Algebra

479
views
gate2000
settheory&algebra
normal
descriptive
sets
+1
vote
10
ISI 2016 PCB C5
What will be the output of the following C program? If you think it will give a runtime error, you need to mention it. In either case, your answer must include proper justifications without which no credit will be given. #include<stdio.h> main() { unsigned char i, j, a[] = ... j != 0) a[0] += n; printf("j = %d, a[0] = %d\n", j, a[0]); }
answered
May 9
in
Others

66
views
programminginc
output
0
votes
11
MIT assignment Doubt
How the worst case of merge sort is O(n^2) according to the given MIT assignment pdf: explain ?
answered
May 9
in
Algorithms

87
views
algorithms
timecomplexity
+5
votes
12
ISRO201763
What does the following program do when the input is unsigned 16 bit integer? #include<stdio.h> main(){ unsigned int num; int i; scanf("%u", &num); for(i=0;i<16;i++){ printf("%d", (num<<i&1< ... } } It prints all even bits from num It prints all odd bits from num It prints binary equivalent of num None of above
answered
May 7
in
Programming

981
views
isro2017
programminginc
+8
votes
13
ISRO201780
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
answered
May 7
in
Algorithms

1.1k
views
isro2017
relations
algorithms
timecomplexity
0
votes
14
Placing rooks in nXn chess board
answered
May 6
in
Algorithms

83
views
nongate
recursion
game
combinatory
0
votes
15
linked list
I think option should be a) but given is c.here head pointer point the first node whereas tail pointer point the last node And if want to delete the first element then element will be deleted but head pointer will be free.then how to head pointer point the first node/element.Pls tell what is correct??
answered
May 1
in
DS

65
views
+1
vote
16
PGEE 2017
$\int_{3}^{3} \left  X+1 \right dx$
answered
Apr 30
in
Calculus

59
views
iiithpgee
calculus
+1
vote
17
ISI 2014
Read the C code given below. What would be the output of the following program? Justify your answer. #include <stdio.h> int myrecurse(int a, int b){ return (b == 1 ? a: myrecurse(a, b1) + a); } main() { int ... log n)$ algorithm to determine whether the given sequence $S$ has a subsequence whose sum is zero, and justify the correctness of the algorithm.
answered
Apr 26
in
Written Exam

80
views
isi2014
programminginc
algorithms
+3
votes
18
what is difference between "int * const ptr=&i" and const int *ptr;;
answered
Apr 21
in
Programming

97
views
programminginc
+1
vote
19
Generate atleast 3 solutions for 5 x 5 queen problem
answered
Apr 20
in
Algorithms

56
views
queenproblem
backtracking
algorithms
+4
votes
20
theory of computation
How many of them below are equivalent to (a+b)* ? A) (a*b)*a* B) (b*a)*b* C) a*(ba*)* D) b*(ab*)*
answered
Apr 15
in
Theory of Computation

64
views
theoryofcomputation
regularexpressions
+2
votes
21
Timothy Williams Question
The machine pictured in fig a)complements a given bit pattern b)finds 2's complement c)increments a given bit pattern by 1 d)changes the sign bit
answered
Apr 15
in
Theory of Computation

64
views
+1
vote
22
c pointers
main() { char *p1="name"; char *p2; p2=(char*)malloc(20); memset(p2,0,20); while(*p2++=*p1++); printf("%s\n",p2); }
answered
Apr 14
in
Programming

69
views
+1
vote
23
Rosen chapter6 (counting)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
answered
Apr 14
in
Combinatory

166
views
discretemathematics
kennethrosen
+1
vote
24
Probability Exercise
The chess club of two school consists of 8 and 9 players.4 member from each club are randomly chosen to participate in a competition of two school.chosen player from one team are then randomly paired against chosen players of another team ... will be paired 2.Rebecca and Elise will be chosen to play but they will NOT be paired against Each Other
answered
Apr 11
in
Probability

105
views
probability
+2
votes
25
GATEBOOK TEST
1 +2(1/2) +3(1/4)+ 4(1/8)+ .............. = ? getting 2 please check
answered
Apr 10
in
Numerical Ability

92
views
+3
votes
26
C programming
answered
Apr 9
in
Programming

122
views
programminginc
+4
votes
27
ISI 2004 MIII
Q23 If $\textit{f}(x)=x^{2}$ and g(x)=x sinx +cosx then A) f and g agree at no point B) f and g agree at exactly one point C) f and g agree at exactly two point D) f and g agree at more then two point
answered
Apr 7
in
Calculus

60
views
isi2004
engineeringmathematics
functions
0
votes
28
logic
can somebody explain the intution behind this ...? i am not able to get ....and i dont want to byheart ....
answered
Apr 7
in
Mathematical Logic

117
views
discretemathematics
propositionallogic
engineeringmathematics
mathematicallogic
+3
votes
29
Gate math book
Find the sum of n terms of the series $log a+ log \frac{a^{2}}{b} + log \frac{a^{3}}{b^{2}}+ ...$ to n terms
answered
Apr 5
in
Mathematical Logic

61
views
engineeringmathematics
+2
votes
30
Dynamic declaration of 2D array
answered
Apr 5
in
Programming

67
views
programminginc
+3
votes
31
theory of computation
Is the language given below regular or not ? I feel it is regular. The equivalent language is, L = {anblak ; n>=1,l>=1,k>=1 }  { a1b1a1 , a1b1a2 , a1b1a3 , a1b2a1 , a1b2a2 , a1b3a1 and few more strings (but ... is regular ... QUESTION TAKEN FROM PETER LINZ TEXTBOOK AND ANSWER WAS NOT GIVEN. So please verify whether i am correct ...???
answered
Apr 4
in
Theory of Computation

55
views
theoryofcomputation
finiteautomata
0
votes
32
ISI 2004 MIII
Q14 The inequality $\frac{2gx+x^{2}}{1x+x^{2}}\leq 3$ is true for all the value of x if and only if A) $1\leq g\leq 7$ B) $1\leq g\leq 1$ C) $6\leq g\leq 7$ D) $1\leq g\leq 7$
answered
Apr 4
in
Set Theory & Algebra

83
views
isi2004
inequality
+1
vote
33
CIL 2017
Which of the following operators can be used if a portion of a given bit patterns needs to be copied to a new word,while the remainder of the new word is filled with 0s? 1. Bitwise AND 2. Bitwise OR 3. Bitwise XOR 4. Bitwise AND
answered
Apr 2
in
Digital Logic

67
views
cil2017
+7
votes
34
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, ... > c); } jungle, n, 8, nclastor etter, u, 6, ungle cetter, k, 6, jungle etter, u, 8, ncestor
answered
Apr 1
in
Programming

1.1k
views
gate2006it
programming
programminginc
normal
+2
votes
35
Ravi asked his neighbor to water a delicate plant while he is away.
answered
Mar 27
in
Probability

74
views
probability
+1
vote
36
A bit string is called legitimate if it contains no consecutive zeros, e.g., 0101110 is legitimate,
answered
Mar 27
in
Combinatory

70
views
combinatory
+1
vote
37
complexity
Let there are n elements in array and number of sorted subarray is log n of size n/ log n each then what is the time complexity to sort given array
answered
Mar 26
in
Algorithms

58
views
+2
votes
38
context free grammar
Construct contextfree grammars to accept the following languages. $$\begin{align*} \large L = \left \{ 0^i1^j2^k \;\;  \;\; i \neq j \;\; or \;\; j \neq k \right \} \end{align*}$$
answered
Mar 25
in
Theory of Computation

49
views
cfg
contextfree
theoryofcomputation
Page:
1
2
3
4
5
6
...
10
next »
23,361
questions
30,068
answers
67,376
comments
28,385
users