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.
Questions 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
0
votes
2
answers
1
Discrete math
The following is a sequence of formula, $$\begin{align*} \begin{matrix} & 9*1+2 &= &11 \\ & 9*12+3 &= &111 \\ & 9*123+4 &= &1111 \\ & 9*1234+5 &= &11111 \\ \end{matrix} \\ ... align*}$$ Here numbers are in base $10$. (a) Establish a formula in $\sum$ notation. (b) Generalize that formula in for any base $b$..
asked
1 day
ago
in
Set Theory & Algebra

36
views
discretemathematics
descriptive
nongate
+1
vote
2
answers
2
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*}$$
asked
2 days
ago
in
Combinatory

79
views
discretemathematics
summation
0
votes
2
answers
3
Discrete Math
Prove or disprove: $\begin{align*} \log_8x = \frac{1}{2}.\log_{2}x \end{align*}$.
asked
2 days
ago
in
Set Theory & Algebra

52
views
discretemathematics
descriptive
nongate
0
votes
0
answers
4
Discrete math
Let $w \in \sum$$*$ be a string, with $\sum$ being the alphabet. Let $w^R$ be the reversal of string $w$, using induction prove that $(w^R)(w^R). . .(\text{for k times}) = (ww . . .(\text{for k times}))^R.$
asked
5 days
ago
in
Set Theory & Algebra

36
views
descriptive
iitg_math
discretemathematics
0
votes
2
answers
5
Discrete Math
Prove or disprove the following: for finite sets A and B, $\overline{(A  B) \cup (B  A)} = A \cap B$ . If the proposition is incorrect, do minimal modifications to the same and prove.
asked
5 days
ago
in
Set Theory & Algebra

52
views
discretemathematics
iitg_math
nongate
descriptive
0
votes
0
answers
6
Discrete math
Prove the following: $3 \;  \;\left ( a^2+b^2 \right )$ if and only if $3 \;  \;a$ and $3 \;  \;b$.
asked
5 days
ago
in
Set Theory & Algebra

60
views
discretemathematics
iitg_math
descriptive
nongate
+1
vote
2
answers
7
Stable sorting algorithms
Show that any comparison based sorting algorithm can be made stable without increasing its complexity beyond a constant factor.
asked
6 days
ago
in
Algorithms

65
views
algorithms
descriptive
timecomplexity
nongate
+2
votes
1
answer
8
C programming
int a[20]; unsigned int m; // global variable int foo(int a[]) { int i=0,count = 0; while(i < 20) m = 1<<(a[i++]1); i = (sizeof(int)<<3)1; while(i>=0) if(m&(1<<(i))) count++; return ... in a[] which are more than $20$ B No of distinct elements in a[] which less than $20$ C No of distinct elements in a[] D None of these
asked
Feb 18
in
Programming

93
views
programminginc
cprogramming
output
+2
votes
1
answer
9
Probability
Three $N$ bit binary strings $S_1$,$S_2$,$S_3$ are selected in random. What is the probability that result of bitwise XOR among them contains $k$ $1$'s.i.e. $S_1\oplus S_2\oplus S_3$ = $S$ , No of set bits in $S$ = $k$ is it $\binom{n}{k}\left ( \frac{1}{2} \right )^k\left ( \frac{1}{2} \right )^{nk}$ ??
asked
Feb 8
in
Probability

85
views
probability
+3
votes
1
answer
10
Balanced tree Minimum no of nodes for height h
asked
Feb 8
in
Algorithms

113
views
algorithms
+1
vote
1
answer
11
dfa gatebook QS
asked
Feb 7
in
Theory of Computation

46
views
theoryofcomputation
dfa
+1
vote
1
answer
12
Asynchronous counter circuit with feedback input GATEBOOK QS
asked
Feb 7
in
Digital Logic

122
views
counter
digitallogic
#digitalcounter
+1
vote
2
answers
13
C programming
char *x[5] = {"abc","def","ghi","jkl","mno"}; char *y[5] = {"123","456","789","101","102"}; struct hcode { char *word; }hcodes[5]; struct key { int id; char *word; ... ; return 0; } $A.$ 456,hi,01,no $B.$ 456,ghi,101,mno $C.$ 56,hi,01,no $D.$ 456,ef,01,no
asked
Feb 3
in
Programming

97
views
programminginc
cprogramming
output
pointers
+3
votes
2
answers
14
Higher normal form decomposition
asked
Feb 1
in
Databases

182
views
databasenormalization
databases
decomposition
ermodel
0
votes
0
answers
15
Encoding manchester and differential manchester
asked
Jan 27
in
Computer Networks

42
views
manchesterencoding
computernetworks
+4
votes
0
answers
16
Evaluation order in return statement
asked
Jan 21
in
Programming

213
views
programminginc
+2
votes
0
answers
17
quick sort
If we use quicksort algorithm to sort the elements: $16, 13, 14, 12, 21, 16, 23$ and $15$ in ascending order, what is the output after the first pass of quicksort? (Assume pivot element is beginning of an array)
asked
Jan 20
in
Algorithms

83
views
algorithms
quicksort
sorting
0
votes
1
answer
18
Tree BFS
int func(Node root) { int x = 0; int y = 0; queue Q; Q.push(root); while(!Q.empty()) { Node u = Q.top(); Q.pop(); if(u>left == NULL && u>right == NULL) x++; if(u>left != NULL) { y++; Q.push(u> ... != NULL) { y++; Q.push(u>right); } } return x+y; } Above code segment is executed on the following rooted tree: What will be the output?
asked
Jan 13
in
Programming

90
views
bfs
programminginc
binarytree
+2
votes
2
answers
19
Tree DFS
int func(Node root) { if(root == NULL) return 0; else if(root>left == NULL && root>right == NULL) return 2; else return(3 + func(root>left) + func(root>right)); } Above code is executed on the following rooted tree. What will be the output?
asked
Jan 13
in
Programming

116
views
dfs
algorithms
datastructure
binarytree
+5
votes
2
answers
20
C programming
int i=0; char *a = "abcde\0efgh"; while(a[++i]) printf("%d",*++a  'a'); the output of the above c code segment?
asked
Jan 10
in
Programming

172
views
programminginc
cprogramming
output
pointers
+5
votes
1
answer
21
Counting possible no of subsets from a set of numbers S
asked
Jan 9
in
Combinatory

151
views
combinatory
permutation
counting
+3
votes
1
answer
22
Operand forwarding in pipeline
A $5$ stage pipelined processor has the following stages: $IF$ : instruction fetch $ID$ : instruction decode $EX$ : execute $MA$ : memory access $WB$ : write back $$\large\color{red}{IF \rightarrow ID\rightarrow EX\rightarrow MA\ ... R_4\;\;R_5 \\ \end{matrix}$ No. of cycles needed to execute these instructions using operand forwarding?
asked
Jan 8
in
CO & Architecture

621
views
pipeline
co&architecture
operandforwarding
+2
votes
0
answers
23
necessarily Context free ??
Suppose that L is Context free and R is Regular. $A$) $L – R$ is necessarily Context free $B$) $R – L$ is necessarily Context free Which of the above statement/s is/are true?
asked
Jan 7
in
Theory of Computation

81
views
contextfree
theoryofcomputation
identifyclasslanguage
+4
votes
0
answers
24
cache memory access time with interleaved memory modules
asked
Jan 6
in
CO & Architecture

187
views
cachememory
#computerorganisationandarchitecture
+1
vote
1
answer
25
cache and main memory
Assume the following performance characteristics on a cache read miss: one clock cycle to send an address to main memory and four clock cycles to access a 32bit word from main memory and transfer it to the processor and cache. ... transfer? What would be the answer if memory is not interleaved and word access is done sequentially from main memory?
asked
Jan 6
in
CO & Architecture

115
views
co&architecture
cachememory
#computerorganisationandarchitecture
+3
votes
0
answers
26
Relations and Combinatorics
$\begin{align*} &S = \left \{ G_i \;\;  \; G_i \in \text{ lebeled trees with 4 vertices} \right \} \\ &\text{Relation } \quad R = \left \{ {\color{red}{\left ( G_i,G_j \right )}} \;  G_i,G_j \in S \;\; \text ... ;\; G_i,G_j \;\; \text{are} \;\; \text{isomorphic to each other} \right \} \end{align*}$ No of equivalent classes of $R$ ?
asked
Jan 6
in
Combinatory

102
views
discretemathematics
combinatorics
relations
graphtheory
0
votes
1
answer
27
TCP slow start
Suppose TCP’s additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with $4$ MSS and threshold at start of first transmission is $16$ MSS. Assume that a timeout occurs during $6$th transmission, what will be the congestion window at $10$th transmission.
asked
Jan 3
in
Computer Networks

152
views
congestioncontrol
computernetworks
tcp
+2
votes
1
answer
28
split horizon
Assume that network shown in below diagram uses distance vector routing with forwarding tables at each node. If each node periodically announces their vectors to the neighbour using the splithorizon strategy, what is the distance vector routing advertised from A to B after stabilization?
asked
Jan 3
in
Computer Networks

127
views
computernetworks
routing
+1
vote
0
answers
29
GBN Question
Compare $GBN$, $SR$, and $TCP$ (no delayed $ACK$). Assume that the timeout values for all three protocols are sufficiently long such that $5$ consecutive data segments and their corresponding $ACK$s can be received (if not lost in the channel) by ... GBN and SR with possible answer. link ftp://ftp.cs.sjtu.edu.cn:990/shenlp/assign3/assign35100309313.pdf
asked
Jan 2
in
Computer Networks

47
views
computernetworks
+3
votes
1
answer
30
TCP Network
In a connection, the value of cwnd is $3000$ and the value of rwnd is $5000$. The host has sent $2000$ bytes which has not been acknowledged. How many more bytes can be sent?
asked
Jan 2
in
Computer Networks

78
views
computernetworks
congestioncontrol
tcp
network
Page:
1
2
3
4
5
next »
20,933
questions
26,054
answers
59,785
comments
22,209
users