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
+1
vote
1
Average access time in cache memory along with hard disk
answered
Jul 9
in
CO & Architecture

272
views
cachememory
multilevelcache
+4
votes
2
precedence graph
please explain the concept of precedence graph in operating system concurrent processes.
answered
Jul 8
in
Operating System

86
views
self
doubt
+6
votes
3
MIN Resource requirement for deadlock
answered
Jul 8
in
Operating System

235
views
deadlock
operatingsystem
+2
votes
4
fork system call
Consider the following code snippet: if(fork()&& fork()) { fork(); } if(fork()fork()) { fork(); fork(); } printf("GATE 2017"); How many times GATE $2017$ printed? How to solve this using tree diagram?
answered
Jul 7
in
Operating System

460
views
operatingsystem
fork
+6
votes
5
programming
#include <stdio.h> int main() { int x=1,y=0,z=5; int a=x && y && z++; printf("%d",z); } The output is 5, can someone explain how?
answered
Jul 7
in
Programming

67
views
programminginc
+5
votes
6
working of fork() system call
How many times "hello" gets printed? main() { fork(); fork(); printf("hello"); }
answered
Jul 7
in
Operating System

283
views
fork
operatingsystem
+4
votes
7
Multidimensional array
int b[10][10]; int *a[10]; //How b[2][3] and a[2][3] will work??
answered
Jul 3
in
Programming

209
views
+1
vote
8
C programming
How can we print this alphabetical pattern using c? ABCDE BCDE CDE DE ABCD BCD CD D ABC BC C AB B A
answered
Jun 28
in
Programming

50
views
0
votes
9
Recursive function
int fun(int n) { int s=0,i; if(n<=1) return 1; for(i=1; i*i<n; i++) s+=n; return fun(n/4)+fun(n/4)+s; } what will be the time complexity, returning value and no. of recursive calls of the abovegiven code?
answered
Jun 28
in
Algorithms

99
views
algorithms
+1
vote
10
let us c
#include<stdio.h> int main() { int i = 0x1 << sizeof(int)*81; printf("\n%x",i); i = i >> sizeof(int)*81; printf("%d",i); } Find the output ?
answered
Jun 26
in
Programming

60
views
programminginc
+2
votes
11
SSelf
The value returned by the following function for foo(10) is ____ int foo(int x) { if(x < 1) return 1; int sum = 0; for(i = 1; i <= x; i++) { sum += foo(xi); } return sum; }
answered
Jun 26
in
Programming

49
views
programminginc
programming
+2
votes
12
LEARNING LINUX Beginner's Guide to linux
answered
Jun 25
in
Others

1.2k
views
linux
gettingtoiits
+3
votes
13
GATE200784
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. How many distinct paths are ... point (10,10) starting from the initial position (0,0)? $^{20}\mathrm{C}_{10}$ $2^{20}$ $2^{10}$ None of the above.
answered
Jun 25
in
Combinatory

1.2k
views
gate2007
permutationsandcombinations
+2
votes
14
Hasse diagram
How come D66 is boolean algebra. Explain it through hasse diagram.
answered
Jun 25
in
Set Theory & Algebra

34
views
+2
votes
15
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
Jun 25
in
Mathematical Logic

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

66
views
+3
votes
17
Generating function , closed form
answered
Jun 3
in
Combinatory

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

1.2k
views
linux
gettingtoiits
+3
votes
19
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

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

94
views
kennethrosen
discretemathematics
permutationsandcombinations
counting
+3
votes
21
#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

54
views
programminginc
+6
votes
22
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

550
views
gate2000
settheory&algebra
normal
descriptive
sets
+1
vote
23
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

77
views
programminginc
output
0
votes
24
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

109
views
algorithms
timecomplexity
+5
votes
25
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

1k
views
isro2017
programminginc
+8
votes
26
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.2k
views
isro2017
relations
algorithms
timecomplexity
0
votes
27
Placing rooks in nXn chess board
answered
May 6
in
Algorithms

99
views
nongate
recursion
game
permutationsandcombinations
0
votes
28
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

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

72
views
iiithpgee
calculus
+1
vote
30
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

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

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

107
views
queenproblem
backtracking
algorithms
+4
votes
33
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

94
views
theoryofcomputation
regularexpressions
+2
votes
34
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

81
views
+1
vote
35
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

86
views
+1
vote
36
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

222
views
discretemathematics
kennethrosen
+1
vote
37
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

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

140
views
Page:
1
2
3
4
5
6
...
10
next »
25,065
questions
32,220
answers
75,085
comments
30,231
users