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
Coacache memory.
Cache size = 512KB ; Tag size = 7, Find out main memory size and tag directory. Given it is 8way set associative .
answer selected
1 day
ago
in
CO & Architecture

38
views
co&architecture
1
answer
2
Find the output of C program
What will be the output of the program? #include<stdio.h> int addmult(int ii, int jj) { int kk, ll; kk = ii + jj; ll = ii * jj; return (kk, ll); } int main() { int i=3, j=4, k, l; k = addmult(i, j); l = addmult(i, j); printf("%d %d\n", k, l); return 0; }
commented
2 days
ago
in
Programming

33
views
programminginc
functions
2
answers
3
GATE Overflow Youtube Channel
GO YouTube channel had 78 subscribers but yet no videos :) Some years ago many stuffs were freely available online like free practice tests and quality lectures. But gradually the paid mafia succeeded in removing ... attracting juniors :) https://www.youtube.com/channel/UC8hEQ4b3_oYGrLPuw_T6Zlg/playlists?shelf_id=0&view=1&sort=dd
commented
2 days
ago
in
Others

378
views
gateoverflow
youtubechannel
0
answers
4
How we decide address bit to select bit from one row?
commented
3 days
ago
in
CO & Architecture

23
views
co&architecture
1
answer
5
C programming
int main() { int n = 3,i,count=0; for(i=0;i<1<<n;i++) { int p = i; while(p) { int k = p & p; p = p  k; count++; } } } The value of count variable after execution of the above code? The value of count variable when $n = m$ ? [EDITED]
commented
4 days
ago
in
Programming

52
views
programminginc
#bitwise
2
answers
6
c doubt
The maximum number of dimesions in array are ....................................... in c language.
edited
5 days
ago
in
Programming

36
views
programminginc
3
answers
7
what is difference between "int * const ptr=&i" and const int *ptr;;
answered
5 days
ago
in
Programming

52
views
programminginc
1
answer
8
Generate atleast 3 solutions for 5 x 5 queen problem
answer edited
5 days
ago
in
Algorithms

41
views
queenproblem
backtracking
algorithms
1
answer
9
How to find size of integer on your system in C programming
commented
Apr 18
in
Programming

38
views
programminginc
2
answers
10
What is the expected length of the cycle containing vertex 1?
comment reshown
Apr 17
in
Graph Theory

260
views
expectation
graphtheory
engineeringmathematics
2
answers
11
A 1TB Disk with 4KB blocks require 32MB to store its bit map?
edited
Apr 17
in
Operating System

97
views
memorymanagement
operatingsystem
bitmap
gate
1
answer
12
Is this decidable or undecidable
commented
Apr 16
in
Theory of Computation

49
views
theoryofcomputation
decidability
turingmachine
1
answer
13
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*)*
commented
Apr 15
in
Theory of Computation

43
views
theoryofcomputation
toc
#regularexpressions
1
answer
14
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
comment edited
Apr 15
in
Theory of Computation

58
views
1
answer
15
GENERAL DOUBT C
void main() { char *p="cprogramming"; } I know the string literal "cprogramming" is stored in read only data segment. But where will the pointer p be stored, in stack or readwrite data segment ?
edited
Apr 15
in
Programming

105
views
programminginc
2
answers
16
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

59
views
4
answers
17
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 ?
commented
Apr 14
in
Combinatory

112
views
discretemathematics
kennethrosen
1
answer
18
COutput
what is the output of the following program ??
commented
Apr 12
in
Programming

66
views
4
answers
19
C programming  Output ?
#include <stdio.h> int main() { unsigned char a = 5; a = (1<<((sizeof(char)<<3)1)); char b = a; printf("%d %d\n",b,a); printf("%u %u\n",b,a); } If the size of a char datatype is 1 Byte, then what will be the output? [Edited]
commented
Apr 12
in
Programming

148
views
programminginc
1
answer
20
Algorithms Basic Question
commented
Apr 12
in
Algorithms

52
views
2
answers
21
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

70
views
probability
0
answers
22
Tanenbaum
A datagram network allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and ... (a) hops a packet makes per transmission? (b) transmissions a packet makes? (c) hops required per received packet?
edited
Apr 10
in
Computer Networks

61
views
computernetworks
tanenbaum
networklayering
2
answers
23
GATEBOOK TEST
1 +2(1/2) +3(1/4)+ 4(1/8)+ .............. = ? getting 2 please check
answer edited
Apr 10
in
Numerical Ability

77
views
1
answer
24
C programming
commented
Apr 10
in
Programming

105
views
programminginc
3
answers
25
CIL17
commented
Apr 10
in
DS

326
views
2
answers
26
How to take inputs for a string ?
edited
Apr 9
in
Programming

50
views
programminginc
1
answer
27
Bipartite Graph
Is DFS can be applied to check that a graph is bipartite or not?
answer selected
Apr 9
in
DS

221
views
graphtheory
algorithms
1
answer
28
First Order Logic
Can some explain the basics of First Order Logic like what various terms means, what are various properties ?
commented
Apr 7
in
Study Resources

55
views
firstorderlogic
discretemathematics
mathematicallogic
1
answer
29
Bellman Ford
If there is a negative edge cycle present in a graph, we all know that Bellman Ford has the capability to detect it. My doubt is that, even after the presence of a negative weighted cycle, will Bellman Ford Algorithm give the correct answer or it will simply say NO..shortest path cannot be computed!?
commented
Apr 7
in
Algorithms

37
views
shortestpath
bellmanford
algorithms
1
answer
30
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

43
views
isi2004
engineeringmathematics
1
answer
31
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

104
views
discretemathematics
propositionallogic
engineeringmathematics
mathematicallogic
0
answers
32
ISI 2004 MIII
Let X be an nonempty set and let P(X) denote the collection of all subset of X. Define $\textit{f}:\textit{X*P(X)}\rightarrow \mathbb{R}$ by f(x,A) = $\left\{\begin{matrix} 1 if x \epsilon A & \\ 0 if x\not\epsilon A & \end{matrix}\right.$ Then $f\left ( x,A\cup B ... 1 C) f(x,A)+f(x,B)  f(x,A).f(x,B). D) f(x,A)+ $\left  f(x,A)f(x,B) \right $
commented
Apr 5
in
Mathematical Logic

28
views
isi2004
discretemathematics
3
answers
33
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
commented
Apr 5
in
Mathematical Logic

53
views
engineeringmathematics
2
answers
34
Dynamic declaration of 2D array
edited
Apr 5
in
Programming

56
views
programminginc
1
answer
35
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$
commented
Apr 4
in
Set Theory & Algebra

80
views
isi2004
inequality
3
answers
36
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

44
views
theoryofcomputation
toc
#finiteautomata
2
answers
37
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

58
views
cil2017
1
answer
38
K&R BOOK
I have learnt that order of function call of f1() and f2() is compiler dependent from K&R book.Why precedence and associavity does not work in this case ?? Please clarify in details . #include<stdio.h> int x = 0; int f1() { x = 5; return x; } int f2() { x = 10; return x; } int main() { int p = f1() + f2(); printf("%d ", x); return 0; }
commented
Apr 2
in
Programming

127
views
programminginc
7
answers
39
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
commented
Apr 1
in
Programming

1k
views
gate2006it
programming
programminginc
normal
7
answers
40
GATE2017148
Let $A$ be an array of 31 numbers consisting of a sequence of 0's followed by a sequence of 1's. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is 1 by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
commented
Mar 31
in
Algorithms

1.2k
views
gate20171
algorithms
normal
numericalanswers
22,100
questions
28,082
answers
63,368
comments
24,203
users