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.
Recent activity 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
answer
1
Algo: Time complexity
T(n) = 4T(n/2) + n2.$\sqrt{2}$ In thetha notation?
commented
4 days
ago
in
Algorithms

49
views
timecomplexity
algorithms
asymptoticnotations
2
answers
2
mock test
Considering size of int as 2 Bytes and size of char as 1 Byte what will be the output int main() { int a=300; char *b=(char *)&a; *==b=2; printf("%d",a); return 0; }
commented
Sep 21
in
Programming

40
views
0
answers
3
DFA  Linz 2.1 d
$\sum$ = $\left \{ a,b \right \}$ All strings with at least 1 a and exactly 2 b's.
commented
Aug 16
in
Theory of Computation

126
views
finiteautomata
theoryofcomputation
dfa
minimalstateautomata
1
answer
4
linear algebra
Rank of matrix : 1) Rank is equal to the number of linearly independent rows or columns in the matrix 2)Rank is equal to the number of non zero rows in ECHLON FORM of matrix ARE BOTH the things same pls explain ?
commented
Jul 30
in
Mathematical Logic

71
views
self
selfdoubt
engineeringmathematics
linearalgebra
1
answer
5
Rosen
$0,1,0,0,1,0,0,1,.......$ The answer is $f(x) = \frac{x}{1x^3}$ ?
edited
Jul 30
in
Mathematical Logic

57
views
1
answer
6
speedup
Assume we have a computer where the cycles per instruction (CPI) is 1.0 when all memory accesses hit in the cache.The only data accesses are loads and stores, and these total 50% of the instructions. If the miss penalty is 25 clock cycles and the miss rate is 2%, how much faster would the computer be if all instructions were cache hits? 1.5 0.7 2.75 1.75
commented
Jul 29
in
CO & Architecture

339
views
pipelining
co&architecture
2
answers
7
Data Type
#include<stdio.h> int main() { char c = 125; c = c+10; printf("%d", c); return 0; } what will be the output , explain with logic(size of char 1 byte)
commented
Jul 26
in
Programming

201
views
programminginc
0
answers
8
Easy but tricky!
a.) int main() { int i=10; i=i++; printf("%d",i); } b.) int main() { int i=10; printf("%d %d %d",i,i++,++i); } Question: a) In part (a) i want to know that once the i value is assigned to i ... gives the output 12,11,12 and i have no idea y it is printing like this , Pls give me the explanation of both parts! Thanks in advance :)
commented
Jul 22
in
Programming

106
views
2
answers
9
GATE2017155
The output of executing the following C program is _______________ . #include<stdio.h> int total(int v) { static int count = 0; while(v) { count += v&1; v >>= 1; } return count; } void main() { static int x=0; int i=5; for(; i>0; i) { x = x + total(i); } printf("%d\n", x); }
commented
Jul 20
in
Programming

1.9k
views
gate20171
programming
programminginc
normal
numericalanswers
1
answer
10
[Co] hierarchical vs simultaneous memory organization
commented
Jul 10
in
CO & Architecture

663
views
co&architecture
1
answer
11
cache memory access time with interleaved memory modules
commented
Jul 9
in
CO & Architecture

424
views
cachememory
co&architecture
3
answers
12
Average access time in cache memory along with hard disk
edited
Jul 9
in
CO & Architecture

295
views
cachememory
multilevelcache
0
answers
13
Generating Functions Topic Query
commented
Jul 9
in
Mathematical Logic

43
views
permutationsandcombinations
discretemathematics
kennethrosen
1
answer
14
gatebook
How many bit strings of length $6$ have more no of zeros than ones?? We can solve this drawing tree but it takes so much time Is there any other way??
answer selected
Jul 9
in
Combinatory

54
views
permutationsandcombinations
counting
discretemathematics
3
answers
15
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?
commented
Jul 9
in
Operating System

658
views
operatingsystem
fork
0
answers
16
Computer network
Token bucket mechanism is used for congestion control at router . Bucket capacity is 700 bytes (initially full), token arrival rate is 200 bytes/sec and maximum output rate is 300 bytes/sec. The amount of time in sec required to transmit 3000 bytes ... = 4.5sec therefore 7sec + 4.5sec = 11.5sec ANSWER = 11.5 sec CAN someone help with the correct one
commented
Jul 9
in
Computer Networks

71
views
1
answer
17
Gatebook
I am not able to understand the last component in square brackets we have to minus from all combinations the combinations with that dotted line but intersection part i didn't get
commented
Jul 9
in
Combinatory

44
views
2
answers
18
Manipulation of sum
Prove the identity: $$\begin{align*} &\sum_{i=0}^{n}\sum_{j=0}^{i} a_ia_j = \frac{1}{2}\left ( \left ( \sum_{i=0}^{n}a_i \right )^2 + \left ( \sum_{i=0}^{n}a_i^2 \right )\right ) \end{align*}$$
answer selected
Jul 8
in
Combinatory

139
views
discretemathematics
summation
2
answers
19
probability
In a bag,there are 4 fair coins and 3 unfair coins.The probability of getting a head in those unfair coins is 1/3 and tail is 2/3.Now if 2 coins are taken from the bag and flipped.What is the probability of getting both as heads ?
answer selected
Jul 8
in
Numerical Ability

115
views
probability
engineeringmathematics
discretemathematics
1
answer
20
Please suggest material for graph theory .
recategorized
Jul 8
in
Graph Theory

80
views
suggestion
2
answers
21
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
answer selected
Jul 8
in
Digital Logic

84
views
cil2017
2
answers
22
A bit string is called legitimate if it contains no consecutive zeros, e.g., 0101110 is legitimate,
answer selected
Jul 8
in
Combinatory

81
views
permutationsandcombinations
1
answer
23
Generate atleast 3 solutions for 5 x 5 queen problem
answer selected
Jul 8
in
Algorithms

179
views
queenproblem
backtracking
algorithms
3
answers
24
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??
answer selected
Jul 8
in
DS

83
views
1
answer
25
Placing rooks in nXn chess board
answer selected
Jul 8
in
Algorithms

115
views
nongate
recursion
game
permutationsandcombinations
1
answer
26
#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
answer selected
Jul 8
in
Programming

56
views
programminginc
1
answer
27
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
answer selected
Jul 8
in
Theory of Computation

90
views
2
answers
28
c pointers
main() { char *p1="name"; char *p2; p2=(char*)malloc(20); memset(p2,0,20); while(*p2++=*p1++); printf("%s\n",p2); }
answer selected
Jul 8
in
Programming

97
views
1
answer
29
pointers
char ** array [12][12][12] what is valid initialization of p ? ANS = char * * * * *p=array; but i feel it should be char * * * * * *p =array; please help
answer selected
Jul 8
in
Programming

357
views
programminginc
pointers
2
answers
30
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?
answer selected
Jul 8
in
Programming

98
views
programminginc
1
answer
31
Program
#include<stdio.h> struct X { int a; int b; int c; }; int main(void) { printf("%zu",sizeof(struct X)); } What is output of the program and why?
commented
Jul 8
in
Programming

61
views
programminginc
1
answer
32
precedence graph
please explain the concept of precedence graph in operating system concurrent processes.
answered
Jul 8
in
Operating System

118
views
self
doubt
3
answers
33
MIN Resource requirement for deadlock
edited
Jul 8
in
Operating System

295
views
deadlock
operatingsystem
1
answer
34
what will be the output and why?
commented
Jul 7
in
Programming

59
views
programminginc
2
answers
35
working of fork() system call
How many times "hello" gets printed? main() { fork(); fork(); printf("hello"); }
answer edited
Jul 7
in
Operating System

367
views
fork
operatingsystem
0
answers
36
Graph Degree sequence : Bondy and Murty : $1.1.16$
asked
Jul 5
in
Graph Theory

116
views
graphtheory
nongate
proof
0
answers
37
Graph Theory : BondyMurty $1.1.20$
asked
Jul 5
in
Graph Theory

81
views
graphtheory
nongate
proof
0
answers
38
Graphic Sequence condition
A sequence $d = (d_1,d_2,\dots , d_n)$ is graphic if there is a simple graph with degree sequence $d$ If $d = (d_1,d_2,d_3, \dots d_n)$ is graphic and $d_1 \geq d_2 \geq d_3 \geq \dots \geq d_n$ , then show that $\sum_{i=1}^{n}d_i$ is even and $$\sum_ ... \leq \left [ k(k1) + \sum_{i=k+1}^{n} \min\{k,d_i\} \right ] \quad ,1 \leq k \leq n$$.
edited
Jul 5
in
Graph Theory

82
views
nongate
graphtheory
proof
1
answer
39
Discrete Mathematics for Computer Scientists and Mathematicians , Chapter 2 , Exercise 2.2, Question4
commented
Jul 3
in
Combinatory

94
views
permutationsandcombinations
discretemathematics
2
answers
40
Multidimensional array
int b[10][10]; int *a[10]; //How b[2][3] and a[2][3] will work??
answered
Jul 3
in
Programming

246
views
27,422
questions
35,273
answers
84,587
comments
33,511
users