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
Lists
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
GATE2016216
The number of states in the minimum sized DFA that accepts the language defined by the regular expression. $(0+1)^{*} (0+1) (0+1)^{*}$ is ________.
commented
16 hours
ago
in
Theory of Computation

1.9k
views
gate20162
theoryofcomputation
finiteautomata
normal
numericalanswers
0
answers
2
Discrete mathematics recurrence relation
commented
1 day
ago
in
Combinatory

21
views
0
answers
3
Operating system
Consider 3 processes P0 ,P1, P2 to be scheduled as per the SRTF algorithm. the process P0 is known to be scheduled first ad and when P0 is running 5 units of time, the process P2 has arrived. When the process P2 has run 2 units of time , the process P1 has arrived ... ............(in units). Given answer is 12 .. I think it should be 10 pls verify what should be correct answer..
commented
1 day
ago
in
Operating System

23
views
operatingsystem
cpuscheduling
1
answer
4
Recurrence Relation
Let $T(n) = T(n1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $ $A) O(n^{2})$ $B) O(logn)$ $C) O(nlogn)$ $D) O(n^{2}logn)$
commented
Oct 12
in
Combinatory

45
views
discretemathematics
recurrence
relations
recurrenceeqation
5
answers
5
GATE20105
What is the value of $\lim_{n \to \infty}\left(1  \frac{1}{n}\right)^{2n}$ ? 0 $e^{2}$ $e^{1/2}$ 1
answered
Oct 8
in
Calculus

1.4k
views
gate2010
calculus
limits
normal
2
answers
6
GATE199017a
Express $T(n)$ in terms of the harmonic number $H_{n}= \sum_{t=1}^{n} 1/i, n \geq 1$, where $T(n)$ satisfies the recurrence relation, $T(n)=\frac{n+1}{n} T(n  1)+1$, for $n \geq \sum$ and $T(1) = 1$ What is the asymptotic behaviour of $T(n)$ as a function of $n$ ?
commented
Oct 6
in
Algorithms

596
views
gate1990
descriptive
algorithms
recurrence
3
answers
7
T.C of T(n)=2T(n1)+n,n >1 ,T(1)=1 ?
T.C of T(n)=2T(n1)+n,n > 1 ,T(1)=1 ?
commented
Oct 6
in
Algorithms

2.6k
views
timecomplexity
2
answers
8
GATE200549
What are the eigenvalues of the following $2\times 2$ matrix? $$\left( \begin{array}{cc} 2 & 1\\ 4 & 5\end{array}\right)$$ $1$ and $1$ $1$ and $6$ $2$ and $5$ $4$ and $1$
commented
Oct 5
in
Linear Algebra

548
views
gate2005
linearalgebra
eigenvalue
easy
4
answers
9
GATE20025a
Obtain the eigen values of the matrix $$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & 2 & 104 \\ 0 & 0 & 0 & 1 \end{bmatrix}$$
answered
Oct 5
in
Linear Algebra

548
views
gate2002
linearalgebra
eigenvalue
normal
descriptive
2
answers
10
GATE2016206
Suppose that the eigenvalues of matrix $A$ are $1, 2, 4$. The determinant of $\left(A^{1}\right)^{T}$ is _________.
commented
Oct 5
in
Linear Algebra

2.2k
views
gate20162
linearalgebra
eigenvalue
normal
numericalanswers
4
answers
11
GATE2005IT3
The determinant of the matrix given below is $$\begin{bmatrix} 0 &1 &0 &2 \\ 1& 1& 1& 3\\ 0&0 &0 & 1\\ 1& 2& 0& 1 \end{bmatrix}$$ $1$ $0$ $1$ $2$
commented
Oct 5
in
Linear Algebra

1.2k
views
gate2005it
linearalgebra
normal
determinant
1
answer
12
GATE199204b
A priority encoder accepts three input signals $\text{(A, B and C)}$ and produces a twobit output $(X1, X0 )$ corresponding to the highest priority active input signal. Assume $A$ has the highest priority followed by $B$ and $C$ has the lowest ... If none of the inputs are active the output should be $00$, design the priority encoder using $4:1$ multiplexers as the main components.
commented
Sep 27
in
Digital Logic

828
views
gate1994
digitallogic
multiplexer
1
answer
13
#Test series
commented
Sep 13
in
Programming

46
views
3
answers
14
Time complexity 14
commented
Sep 13
in
Algorithms

60
views
1
answer
15
TESTBOOK TEST SERIES
commented
Sep 13
in
Algorithms

66
views
timecomplexity
4
answers
16
GATE199526
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies: $A, B → C,$ $C → A$ Show that the scheme R is in $3NF$ but not in $\text{BCNF}$. Determine the minimal keys of relation $R$.
commented
Sep 13
in
Databases

1.1k
views
gate1995
databases
databasenormalization
normal
0
answers
17
Series
Could anyone pls help me to solve this series ?
commented
Sep 7
in
Algorithms

36
views
0
answers
18
Time complexity
commented
Sep 2
in
Algorithms

50
views
1
answer
19
Discrete mathematics
What is a discrete set?
answered
Sep 1
in
Mathematical Logic

17
views
2
answers
20
Normal Forms
If a relation has no functional dependency than what is the normal form of this relation???
answered
Sep 1
in
Databases

38
views
0
answers
21
Normal
Can anyone provide link for NPTEL vedios??
commented
Sep 1
in
GATE

27
views
2
answers
22
GATE19981.18
Which of the following devices should get higher priority in assigning interrupts? Hard disk Printer Keyboard Floppy disk
commented
Aug 28
in
Operating System

2.3k
views
gate1998
operatingsystem
interrupts
normal
5
answers
23
GATE19981.25, ISRO200841
In a resident – OS computer, which of the following systems must reside in the main memory under all situations? Assembler Linker Loader Compiler
answered
Aug 27
in
Compiler Design

2.9k
views
gate1998
compilerdesign
runtimeenvironments
normal
isro2008
5
answers
24
GATE19973.8
When an interrupt occurs, an operating system ignores the interrupt always changes state of interrupted process after processing the interrupt always resumes execution of interrupted process after processing the interrupt may change state of interrupted process to ‘blocked’ and schedule another process.
commented
Aug 26
in
Operating System

3.3k
views
gate1997
operatingsystem
interrupts
normal
1
answer
25
GATE19973.7
I/O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting $2$ programs through a pipe None of the above
commented
Aug 25
in
Operating System

1.8k
views
gate1997
operatingsystem
normal
interprocesscommunication
4
answers
26
GATE2004IT64
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); The number of new processes created is $n$ $((n(n + 1))/2)$ $2^n  1$ $3^n  1$
commented
Aug 25
in
Operating System

1.9k
views
gate2004it
operatingsystem
fork
easy
1
answer
27
GATE2016134
The following function computes the maximum value contained in an integer array $P[ \ ]$ of size $n$ $(n>=1)$. int max (int *p,int n) { int a = 0, b=n1; while (__________) { if (p[a]<= p[b]) {a = a+1;} else {b = b1;} } return p[a]; } The missing loop condition is: $a != n$ $b != 0$ $b>(a+1)$ $b != a$
commented
Aug 21
in
Programming

2.2k
views
gate20161
programminginc
normal
2
answers
28
GATE2016112
Consider the following "C" program. void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; ____________; // call to f() } Which one of the following expressions , when placed in the blank above, will NOT result in a type checking error? $f(s, *s)$ $i = f(i,s)$ $f(i, *s)$ $f(i, *p)$
commented
Aug 21
in
Programming

2.8k
views
gate20161
programminginc
easy
2
answers
29
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.5k
views
gate1996
settheory&algebra
normal
sets
groups
4
answers
30
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

405
views
gate1994
settheory&algebra
normal
sets
descriptive
3
answers
31
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

568
views
gate1994
settheory&algebra
normal
sets
descriptive
9
answers
32
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.6k
views
gate2009
operatingsystem
processsynchronization
normal
0
answers
33
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

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

33
views
4
answers
35
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
36
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

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

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

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

112
views
timecomplexity
1
answer
40
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

52
views
datastructure
programminginc
programming
40,903
questions
47,560
answers
146,294
comments
62,306
users