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
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
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
0
answers
1
made_easy_test_2019 (Algorithms)
explain how to solve the above question !
commented
44 minutes
ago
in
Algorithms

35
views
algorithms
sorting
0
answers
2
Madeeasytestseries
Do we count the return type of main as 1 token? Answer given is 29 if we don't count it.
commented
2 hours
ago
in
Compiler Design

28
views
1
answer
3
Online and Offline Sorting Algorithms
How to know that whether a sorting algorithm is online or offline ? For example , Insertion sort is online but Merge Sort is offline..Please explain ..
commented
3 hours
ago
in
Algorithms

144
views
algorithms
sorting
3
answers
4
GATE2004IT26
A subnet has been assigned a subnet mask of $255.255.255.192$. What is the maximum number of hosts that can belong to this subnet? $14$ $30$ $62$ $126$
commented
10 hours
ago
in
Computer Networks

1.4k
views
gate2004it
computernetworks
subnetting
normal
4
answers
5
GATE200651, ISRO201634
Consider the following recurrence: $ T(n)=2T\left ( \sqrt{n}\right )+1,$ $T(1)=1$ Which one of the following is true? $ T(n)=\Theta (\log\log n)$ $ T(n)=\Theta (\log n)$ $ T(n)=\Theta (\sqrt{n})$ $ T(n)=\Theta (n)$
commented
2 days
ago
in
Algorithms

7.5k
views
algorithms
recurrence
isro2016
gate2006
3
answers
6
GATE 2015 Aptitude Set 4 Q5
Five teams have to compete in a league, with every team playing every other team exactly once, before going to the next round. How many matches will have to be held to complete the league round of matches? (A) 20 (B) 10 (C) 8 (D) 5
commented
Nov 30
in
Numerical Ability

812
views
gate2015aptiset4
numericalability
permutationsandcombinations
1
answer
7
Ace TestSeries
What is the time complexity of T(n) = T(n/3) + T(n/9) +n?
commented
Nov 30
in
Algorithms

51
views
algorithms
testseries
timecomplexity
acetestseries
2
answers
8
GATE20143GA4
Which number does not belong in the series below? $2, 5, 10, 17, 26, 37, 50, 64$ $17$ $37$ $64$ $26$
answered
Nov 30
in
Numerical Ability

724
views
gate20143
numericalability
numberseries
easy
5
answers
9
GATE201358
What will be the maximum sum of $44, 42, 40, \dots$ ? $502$ $504$ $506$ $500$
answered
Nov 30
in
Numerical Ability

1.3k
views
gate2013
numericalability
easy
numberseries
1
answer
10
GATE200647
Consider the following graph: Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal’s algorithm? $(ab),(df),(bf),(dc),(de)$ $(ab),(df),(dc),(bf),(de)$ $(df),(ab),(dc),(bf),(de)$ $(df),(ab),(bf),(de),(dc)$
commented
Nov 27
in
Algorithms

1.2k
views
gate2006
algorithms
graphalgorithms
spanningtree
normal
4
answers
11
GATE19941.23
Consider the following two functions: $g_1(n) = \begin{cases} n^3 \text{ for } 0 \leq n \leq 10,000 \\ n^2 \text{ for } n \geq 10,000 \end{cases}$ $g_2(n) = \begin{cases} n \text{ for } 0 \leq n \leq 100 \\ n^3 \text{ for } n > 100 \end{cases}$ Which of the following is true? ... $g_1(n) \text{ is } O(n^3)$ $g_2(n) \text{ is } O(g_1(n))$ $g_2(n) \text{ is } O(n)$
commented
Nov 25
in
Algorithms

1.9k
views
gate1994
algorithms
asymptoticnotations
normal
2
answers
12
GATE20022.2
Consider the following multiplexer where $I0, I1, I2, I3$ are four data input lines selected by two address line combinations $A1A0=00,01,10,11$ respectively and $f$ is the output of the multiplexor. EN is the Enable input. The function $f(x,y,z)$ implemented by the above circuit is $xyz'$ $xy + z$ $x + y$ None of the above
commented
Nov 22
in
Digital Logic

2.6k
views
gate2002
digitallogic
circuitoutput
normal
2
answers
13
GATE2016218
Consider the following types of languages: $L_{1}$: Regular, $L_{2}$: Contextfree, $L_{3}$: Recursive, $L_{4}$: Recursively enumerable. Which of the following is/are TRUE ? $\bar{L_{3}} \cup L_{4}$ is recursively enumerable. $\bar{L_{2}} \cup L_{3}$ ... contextfree. $L_{1} \cup \bar{L_{2}}$ is contextfree. I only. I and III only. I and IV only. I, II and III only.
commented
Nov 20
in
Theory of Computation

2.3k
views
gate20162
theoryofcomputation
regularlanguages
contextfreelanguage
closureproperty
normal
1
answer
14
GATE200377
A uniprocessor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed ... scheduling Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$
commented
Nov 19
in
Operating System

3.9k
views
gate2003
operatingsystem
processschedule
normal
3
answers
15
ISRO200711, GATE20011.19
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? Round Robin Shortest job first Highest response ratio next first come first served
commented
Nov 19
in
Operating System

3.7k
views
isro2007
operatingsystem
processschedule
gate2001
6
answers
16
GATE2013ce10
Abhishek is elder to Savar. Savar is younger to Anshul. Which of the given conclusions is logically valid and is inferred from the above statements? Abhishek is elder to Anshul Anshul is elder to Abhishek Abhishek and Anshul are of the same age No conclusion follows
answered
Nov 19
in
Numerical Ability

419
views
gate2013ce
logicalreasoning
agerelation
1
answer
17
DBMS #DOUBT ...
correct???
answer selected
Nov 17
in
Databases

49
views
databases
functionaldependencies
2
answers
18
GATE199202,xix
02. Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: (xix) Contextfree languages are: closed under union closed under complementation closed under intersection closed under Kleene closure
commented
Oct 27
in
Theory of Computation

594
views
gate1992
contextfreelanguage
theoryofcomputation
normal
3
answers
19
GATE19872k
State whether the following statements are TRUE or FALSE: The intersection of two CFL's is also a CFL.
commented
Oct 27
in
Theory of Computation

354
views
gate1987
theoryofcomputation
contextfreelanguage
3
answers
20
GATE2016118
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$
comment edited
Oct 23
in
Theory of Computation

3.7k
views
gate20161
theoryofcomputation
regularexpressions
normal
2
answers
21
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
Oct 18
in
Theory of Computation

2k
views
gate20162
theoryofcomputation
finiteautomata
normal
numericalanswers
0
answers
22
Discrete mathematics recurrence relation
commented
Oct 17
in
Combinatory

32
views
0
answers
23
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
Oct 17
in
Operating System

52
views
operatingsystem
cpuscheduling
1
answer
24
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

72
views
discretemathematics
recurrence
relations
recurrenceeqation
5
answers
25
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.5k
views
gate2010
calculus
limits
normal
2
answers
26
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

655
views
gate1990
descriptive
algorithms
recurrence
3
answers
27
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.7k
views
timecomplexity
2
answers
28
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

600
views
gate2005
linearalgebra
eigenvalue
easy
4
answers
29
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

621
views
gate2002
linearalgebra
eigenvalue
normal
descriptive
2
answers
30
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.3k
views
gate20162
linearalgebra
eigenvalue
normal
numericalanswers
4
answers
31
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.4k
views
gate2005it
linearalgebra
normal
determinant
1
answer
32
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 ... 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

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

49
views
3
answers
34
Time complexity 14
commented
Sep 13
in
Algorithms

64
views
1
answer
35
TESTBOOK TEST SERIES
commented
Sep 13
in
Algorithms

74
views
timecomplexity
4
answers
36
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.2k
views
gate1995
databases
databasenormalization
normal
0
answers
37
Series
Could anyone pls help me to solve this series ?
commented
Sep 7
in
Algorithms

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

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

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

39
views
44,071
questions
49,594
answers
162,954
comments
65,786
users