The Gateway to Computer Science Excellence
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. For hardcopy of previous year questions please see
here
Recent activity by air1ankit
User air1ankit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User air1ankit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
GATE19962.4
Which one of the following is false? The set of all bijective functions on a finite set forms a group under function composition. The set $\{1, 2, \dots p1\}$ forms a group under multiplication mod $p$, where $p$ is a prime number. The set of all strings over a finite alphabet ... group $\langle G, * \rangle$ if and only if for any pair of elements $a, b \in S, a * b^{1} \in S$.
commented
Aug 8
in
Set Theory & Algebra

1.4k
views
gate1996
settheory&algebra
normal
sets
groups
4
answers
2
GATE19943.9
Every subset of a countable set is countable. State whether the above statement is true or false with reason.
answer edited
Aug 8
in
Set Theory & Algebra

383
views
gate1994
settheory&algebra
normal
sets
descriptive
3
answers
3
GATE19943.8
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$
answered
Aug 8
in
Set Theory & Algebra

528
views
gate1994
settheory&algebra
normal
sets
descriptive
9
answers
4
GATE200933
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using testandset instruction as follows: void enter_CS(X) { while(testandset(X)); } void leave_CS(X) { X = 0; } In the above solution, $X$ is a memory location associated with ... $CS$ at the same time Which of the above statements are TRUE? (I) only (I) and (II) (II) and (III) (IV) only
commented
Aug 5
in
Operating System

4.2k
views
gate2009
operatingsystem
processsynchronization
normal
0
answers
5
Discrete mathematics
every sublattice of a distributive lattice is also a distributive lattice? explain above line if possible then take an example..!
asked
Aug 3
in
Mathematical Logic

12
views
discretemathematics
kennethrosen
3
answers
6
self doubt
what is the output of printf("%d",printf("gate19")?
commented
Aug 3
in
Programming

31
views
4
answers
7
GATE20001.11
The following C declarations: struct node { int i: float j; }; struct node *s[10]; define s to be: An array, each element of which is a pointer to a structure of type node A structure of $2$ fields, each field being a pointer to an array of $10$ ... structure of $3$ fields: an integer, a float, and an array of $10$ elements An array, each element of which is a structure of type node
answered
Jul 19
in
Programming

1.4k
views
gate2000
programming
programminginc
easy
4
answers
8
GATE2016237
Consider the following program: int f (int * p, int n) { if (n <= 1) return 0; else return max (f (p+1, n1), p[0]  p[1]); } int main () { int a[] = {3, 5, 2, 6, 4}; print f(" %d", f(a, 5)); } Note: $max (x, y)$ returns the maximum of $x$ and $y$. The value printed by this program is ________.
commented
Jul 19
in
Programming

2.9k
views
gate20162
programminginc
normal
numericalanswers
1
answer
9
Extended Master's Theorem $T(n)=n^{1/2}T(n^{1/2})+n$
commented
Jul 19
in
Algorithms

146
views
timecomplexity
algorithms
mastertheorem
asymptoticnotations
recurrence
1
answer
10
Masters theorem
Solve by using master's theorem
commented
Jul 19
in
Algorithms

79
views
timecomplexity
mastertheorem
algorithms
asymptoticnotations
recurrence
0
answers
11
Doubt
Can we solve it by master Theorem T(n)=T(n/3)+T(n/4)+6n
commented
Jul 19
in
Algorithms

101
views
timecomplexity
1
answer
12
doubt_programming
#include<stdio.h> int main() { int i=10; register *a=&i; printf("%d",*a); return 0; } ........................................................................................ ... ; printf("%d",*a); return 0; } my question is register and static both are storage classes so by using register program is executing but why not using static please explain ?
asked
Jul 13
in
Programming

49
views
datastructure
programminginc
programming
0
answers
13
programming and data structure
queStudy the following program written in a block structured language. var p, q : integer; begin p:= p+q; q:= p−q; p:= p−q; end; (a) exchanges (p) and (q) (b) doubles (p) and stored in (q) (c) doubles (q) and stores in (p) (d) leaves (p) and (q) unchanged
commented
Jul 13
in
Programming

59
views
programminginc
datastructure
algorithms
1
answer
14
array
anyone please explain me how to find loc in lower triangular matrix , i am getting little bit confuse suppose matrix is 1 2 3 4 1 a11 a12 a13 a14 2 a21 a22 a23 a24 3 a31 a32 a33 a34 4 a41 a42 a43 a44 now i have to find location of a[4] b[3]: given BA=1000 C=1 =1000+ [(41) * ((3)(4))/2 +(31)]*1 by this way i we get answer but something wrong please exolplain
commented
Jul 13
in
Programming

36
views
algorithms
data
datastructure
3
answers
15
Algorithm substitution method
How to find log n base2+ log n base 3+ log n base4+........log n base n?
commented
Jul 4
in
Algorithms

113
views
1
answer
16
graph_doubt
"edge disjoint spanning tree" means ?
answer selected
Jul 4
in
Algorithms

37
views
graphalgorithms
algorithms
3
answers
17
Of the following which best describes the growth of f(x) as a function of x?
commented
Jun 30
in
Algorithms

738
views
4
answers
18
GATE2016238
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.
commented
Jun 29
in
Algorithms

3.4k
views
gate20162
dynamicprogramming
algorithms
normal
numericalanswers
2
answers
19
GATE19961.11
Which of the following is false? $100n \log n=O(\frac{n\log n}{100})$ $\sqrt{\log n} = O(\log\log n)$ If $0 < x < y \text{ then } n^x = O\left(n^y\right)$ $2^n \neq O\left(nk\right)$
commented
Jun 14
in
Algorithms

2.4k
views
gate1996
algorithms
asymptoticnotations
normal
1
answer
20
What will be the time complexity of recurrence relation T(n)=c+T(n1) using substitution method?
commented
Jun 3
in
Algorithms

322
views
timecomplexity
algorithms
2
answers
21
Solve this equation T(n) = 7T(n/2) + n^2
commented
Jun 2
in
Algorithms

2.5k
views
recurrence
algorithms
recursion
algorithms
3
answers
22
Solve Recurrence Equation T(n) = 2T(n/4) + √3
answered
Jun 2
in
Algorithms

846
views
algorithms
recurrence
recursion
algorithms
timecomplexity
1
answer
23
T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??
answered
Jun 2
in
Algorithms

417
views
algorithms
mastertheorem
recurrence
timecomplexity
recursion
1
answer
24
SELF_DOUBT(MST)
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
commented
Apr 29
in
Algorithms

47
views
algorithms
mst
graphconnectivity
2
answers
25
What is the Generating function G(z) for the sequence of Fibonacci numbers?
commented
Apr 16
in
Algorithms

946
views
3
answers
26
GATE201839
In a system, there are three types of resources: $E, F$ and $G$. Four processes $P_0$, $P_1$, $P_2$ and $P_3$ execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, ... of $F$ were available The system is not in $safe$ state, but would be $safe$ if one more instance of $G$ were available
answered
Feb 15
in
Operating System

1.4k
views
gate2018
operatingsystem
deadlockpreventionavoidancedetection
normal
1
answer
27
ISRO 2018 CSE
As per various sites, syllabus and pattern of GATE and ISRO are similar. For someone who has prepared for GATE, how to start preparations for ISRO CSE exam to be held on 22 april 2018?
commented
Feb 11
in
ISRO

2.2k
views
isro
preparation
3
answers
28
GATE19971.5
The correct matching for the following pairs is All pairs shortest path Greedy Quick Sort DepthFirst Search Minimum weight spanning tree Dynamic Programming Connected Components Divide and Conquer $\text{A2 B4 C1 D3}$ $\text{A3 B4 C1 D2}$ $\text{A3 B4 C2 D1}$ $\text{A4 B1 C2 D3}$
answered
Feb 7
in
Algorithms

940
views
gate1997
algorithms
normal
algorithmdesigntechniques
4
answers
29
GATE20187
The set of all recursively enumerable languages is: closed under complementation closed under intersection a subset of the set of all recursive languages an uncountable set
answered
Feb 6
in
Theory of Computation

1.6k
views
gate2018
theoryofcomputation
closureproperty
easy
4
answers
30
GATE201820
The postorder traversal of a binary tree is $\text{8, 9, 6, 7, 4, 5, 2, 3, 1}$. The inorder traversal of the same tree is $text{8, 6, 9, 4, 7, 2, 5, 1, 3}$. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is _____
commented
Feb 5
in
DS

1.5k
views
gate2018
datastructure
binarytree
numericalanswers
6
answers
31
GATE20181
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1x)^2}$ $\frac{3x}{(1x)^2}$ $\frac{2x}{(1x)^2}$ $\frac{3x}{(1x)^2}$
commented
Feb 4
in
Combinatory

2.6k
views
gate2018
generatingfunctions
normal
0
answers
32
r's complement practise
10's complement of $5690$ 10's complement of $(5690)_8$ 8's complement of $(6250)_8$ 8's complement of $(6250)_{16}$
commented
Feb 3
in
Digital Logic

172
views
digitallogic
numberrepresentation
3
answers
33
GATE198914a
Symbolize the expression "Every mother loves her children" in predicate logic.
commented
Feb 2
in
Mathematical Logic

493
views
gate1989
descriptive
firstorderlogic
mathematicallogic
7
answers
34
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, "brother"}; ... 8, nclastor}$ $\text{etter, u, 6, ungle}$ $\text{cetter, k, 6, jungle}$ $\text{etter, u, 8, ncestor}$
commented
Jan 30
in
Programming

3.7k
views
gate2006it
programming
programminginc
normal
2
answers
35
TEST SERIES
answered
Jan 30
in
Programming

95
views
5
answers
36
GATE2016229
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
commented
Jan 30
in
Combinatory

4.6k
views
gate20162
modulararithmetic
normal
numericalanswers
2
answers
37
GATE19943.3
State True or False with one line explanation A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
commented
Jan 29
in
Theory of Computation

2k
views
gate1994
theoryofcomputation
finiteautomata
normal
1
answer
38
GATE2007IT48
Consider the grammar given below: $S \rightarrow x \ B \mid y \ A$ $A \rightarrow x \mid x \ S \mid y \ A \ A$ $B \rightarrow y \mid y \ S \mid x \ B \ B$ Consider the following strings. $xxyyx$ $xxyyxy$ $xyxy$ $yxxy$ $yxx$ $xyx$ Which of the above strings are generated by the grammar ? i, ii and iii ii, v and vi ii, iii and iv i, iii and iv
commented
Jan 29
in
Theory of Computation

1.1k
views
gate2007it
theoryofcomputation
contextfreelanguage
normal
3
answers
39
GATE2016243
Consider the following languages: $L_{1}=\left\{a^{n}b^{m}c^{n+m}:m, n\geq 1\right\}$ $L_{2}=\left\{a^{n}b^{n}c^{2n} :n\geq 1\right\}$ Which one of the following is TRUE? Both $L_{1}$ and $L_{2}$ are contextfree. $L_{1}$ is contextfree while $L_{2}$ is not contextfree. $L_{2}$ is contextfree while $L_{1}$ is not contextfree. Neither $L_{1}$ nor $L_{2}$ is contextfree.
commented
Jan 28
in
Theory of Computation

2.3k
views
gate20162
theoryofcomputation
contextfreelanguage
normal
4
answers
40
GATE201317
Which of the following statements is/are FALSE? For every nondeterministic Turing machine, there exists an equivalent deterministic Turing machine. Turing recognizable languages are closed under union and complementation. Turing decidable languages are closed under intersection and ... languages are closed under union and intersection. 1 and 4 only 1 and 3 only 2 only 3 only
commented
Jan 28
in
Theory of Computation

2.2k
views
gate2013
theoryofcomputation
normal
closureproperty
38,102
questions
45,600
answers
132,203
comments
49,186
users