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
Hasse diagram
How come D66 is boolean algebra. Explain it through hasse diagram.
answered
2 hours
ago
in
Set Theory & Algebra

6
views
1
answer
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
1
answer
3
Galvin 4.5
Can a multithreaded solution using multiple userlevel threads achieve betterperformance on amultiprocessor system than on a singleprocessor system?
commented
2 days
ago
in
Operating System

29
views
threads
1
answer
4
gate 2013
The number of elements that can be sorted in Θ(logn) time using heap sort is A) Θ(1) (B) Θ(sqrt(logn)) (C) Θ(Log n/(Log Log n)) (d) Θ(Log n)
commented
3 days
ago
in
Algorithms

32
views
2
answers
5
GATE200581b
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } } Suppose we modify the above function foo() and stores the value ... time complexity for function foo() is significantly reduced. The space complexity of the modified function would be: $O(1)$ $O(n)$ $O(n^2)$ $n!$
commented
Jun 18
in
Algorithms

455
views
gate2005
algorithms
spacecomplexity
normal
2
answers
6
DMA operation
A) Consider $1$mbps harddisk is interfaced to the processor in a cycle stealing mode of DMA whenever $64$ bytes of data is available in the buffer,then it is transferred to main memory (1 word = $64$ bits) and machine cycle time is $2$ ... time consumed for DMA operation is ? B) Percentage of CPU time consumed for DMA operation, if burst mode is used ?
commented
Jun 11
in
CO & Architecture

827
views
dma
co&architecture
1
answer
7
Series Summation
Series summation of $S_n$ in closed form? $\begin{align*} &S_n = \frac{1}{1.2.3.4} + \frac{1}{2.3.4.5} + \frac{1}{3.4.5.6} + \dots + \frac{1}{n.(n+1).(n+2).(n+3)} \end{align*}$
answer selected
Jun 11
in
Set Theory & Algebra

40
views
numbertheory
summation
discretemathematics
7
answers
8
GATE2017108
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p>next != NULL) { p = p>next; } p>next = m; } Assuming that m and n ... the end of list n. (C) cause a null pointer dereference for all inputs. (D) append list n to the end of list m for all inputs.
answer edited
Jun 10
in
Programming

2.4k
views
gate20171
datastructure
linkedlists
programming
normal
1
answer
9
Placing rooks in nXn chess board
answer edited
Jun 9
in
Algorithms

83
views
nongate
recursion
game
combinatory
0
answers
10
sheldon ross, chapter 2, question 17
commented
Jun 9
in
Probability

46
views
probability
discretemathematics
2
answers
11
3 D array with pointers
answered
Jun 3
in
Programming

48
views
0
answers
12
Rosen example ( generating function)
commented
Jun 3
in
Combinatory

28
views
generatingfunctions
1
answer
13
Generating function , closed form
answered
Jun 3
in
Combinatory

27
views
generatingfunctions
0
answers
14
Recursive fork()
The pid_t data type is a signed integer type which is capable of representing a process ID. getpid() returns the process ID of the current process The wait() system call suspends execution of the calling process until one of its children ... : some of the system call and macro definitions are simplified for the sake of the QS as well as for simplicity.
commented
Jun 2
in
Operating System

105
views
fork
operatingsystem
4
answers
15
LEARNING LINUX Beginner's Guide to linux
answer edited
Jun 2
in
Others

1.1k
views
linux
gettingtoiits
1
answer
16
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*}$
commented
May 28
in
Algorithm Challenges

114
views
algorithms
timecomplexity
0
answers
17
Tower of Hanoi
how to Write a program in C which implements tower of Hanoi using recursion? and please explain lines of code if possible. It 'll be a great help.
comment moved
May 27
in
Algorithms

46
views
recursion
towersofhanoi
2
answers
18
ISBN9780070681880  Exercise 5.3  Problem 35 (Kenneth Rosen 7ed SIE)
answered
May 27
in
Mathematical Logic

60
views
kennethrosen
discretemathematics
combinatory
counting
0
answers
19
Probbility puzzles
Three men  conveniently named A, B, and C  are fighting a duel with pistols. It's A's turn to shoot. The rules of this duel are rather peculiar: the duelists do not all shoot simultaneously, but instead take turns. A fires at ... a better shot, and hits with probability 0.75  all shots are independent. What's the probability that A wins the duel?
commented
May 23
in
Probability

95
views
probability
conditionalprobability
3
answers
20
what is difference between "int * const ptr=&i" and const int *ptr;;
answer selected
May 20
in
Programming

97
views
programminginc
1
answer
21
$a_n = 4^n + 6^n$
If $a_n = 4^n + 6^n$ Find the value of $a_{40} \text { mod } 25$
commented
May 20
in
Set Theory & Algebra

45
views
binomialdistribution
1
answer
22
2  connected graph
For a regular graph how much large the value of degree (for each vertices) should be such that the graph is $2$  connected. (vertex wise). I did in this way : $\begin{align*} &\quad \kappa(G) \leq \frac{2\cdot e}{n} \ ... regular and not 2 connected although $d \geq 2$ is satisfied. Why this $d \geq 2$ is trivial and not working in some cases ?
commented
May 19
in
Graph Theory

106
views
graphtheory
graphconnectivity
1
answer
23
off topic
How to stop procrastinating ?
commented
May 19
in
Others

196
views
1
answer
24
#PROG
Assume that the size of char is 1 byte and negatives are stored in 2's complement form #include<stdio.h> int main() { char c = 125; c = c+10; printf("%d", c); return 0; } 1.135 2.+INF 3.121 4.8
commented
May 17
in
Programming

45
views
1
answer
25
#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
answers
26
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?
comment edited
May 14
in
Set Theory & Algebra

479
views
gate2000
settheory&algebra
normal
descriptive
sets
1
answer
27
Non CS student requesting for tips!!
commented
May 11
in
GATE

77
views
1
answer
28
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
1
answer
29
MIT assignment Doubt
How the worst case of merge sort is O(n^2) according to the given MIT assignment pdf: explain ?
commented
May 9
in
Algorithms

87
views
algorithms
timecomplexity
1
answer
30
ISRO201772
The Linux command mknod myfifo b 4 16 will create a character device if user is root will create a named pipe FIFO if user is root will create a block device if user is root None of these
commented
May 8
in
Operating System

873
views
isro2017
operatingsystem
unix
nongate
2
answers
31
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
edited
May 7
in
Programming

981
views
isro2017
programminginc
3
answers
32
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
answers
33
IIITH  PGEE 2017
main() { int c=0,x,i,y; for(i=0;i<N;i++) { x=random();y=random(); if((x2+y2)<1) c++; } print(c); } random() is a function which returns random number between $0$ or $1$, $N$ is a large number what is the output of the program?
commented
May 3
in
Programming

263
views
programminginc
iiithpgee
6
answers
34
GATE200580
The ALU, the bus and all the registers in the data path are of identical size. All operations including incrementation of the PC and the GPRs are to be carried out in the ALU. Two clock cycles are needed for memory read operation – ... M[PC]; The minimum number of CPU clock cycles needed during the execution cycle of this instruction is: 2 3 4 5
answer edited
May 2
in
CO & Architecture

1.1k
views
co&architecture
normal
gate2005
datapath
machineinstructions
3
answers
35
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
answer
36
GATE2017139
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ which given an input $x ... $L_{f}$ is recursive, but not conversely. (D) If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.
commented
May 1
in
Theory of Computation

1.3k
views
gate20171
theoryofcomputation
decidability
difficult
1
answer
37
C programming  Output ?
Assume sizeof int as 4 #include <stdio.h> unsigned int L = (sizeof(unsigned int)) << 3; int foo(unsigned int m,unsigned int start,unsigned int length) { length = length >> 1; if(!length) { return m&(1<<start)?1:0; } ... length,length); return n1+n2; } } int main() { int m = 100; printf("%d\n",foo(m,0,L)); }
commented
May 1
in
Programming

206
views
programminginc
output
2
answers
38
PGEE 2017
$\int_{3}^{3} \left  X+1 \right dx$
answered
Apr 30
in
Calculus

59
views
iiithpgee
calculus
2
answers
39
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); }
answer edited
Apr 29
in
Programming

1.3k
views
gate20171
programming
programminginc
normal
numericalanswers
5
answers
40
GATE20172GA10
An air pressure contour line joins locations in a region having the same atmospheric pressure. The following is an air pressure contour plot of a geographical religion. Contour lines are shown at 0.05 bar intervals in this plot. If the possibility ... or drops over a region, which of the following regions is most likely to have a thunderstorm? P Q R S
comment edited
Apr 29
in
Numerical Ability

1.1k
views
gate20172
numericalability
datainterpretation
23,361
questions
30,068
answers
67,376
comments
28,385
users