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 Gabbar
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
maximum weight of minimum spanning tree??
commented
45 minutes
ago
in
Algorithms

36
views
algorithms
minimumspanningtrees
0
answers
2
Discrete Maths # Counting
How many ways we can distribut 12 similar items into 5 different boxes so that first two box will contain only even number of items and next three must contain more than 2 and less than 6 items ??
commented
9 hours
ago
in
Mathematical Logic

40
views
1
answer
3
#digital#counter
I have read somewhere that JK flipflop used as divide by 2 frequency counter is it true ?? if not how to solve given problem??
comment edited
10 hours
ago
in
Digital Logic

48
views
0
answers
4
Discrete Maths
I have solved it by some legacy method ! i want to know how to solve using combinatorics ??
commented
1 day
ago
in
Mathematical Logic

37
views
1
answer
5
Discrete Maths
How many one to one functions are possible from A to B where A =4 and B = 6 such that ith element of A can not match with ith element of B.??
commented
1 day
ago
in
Set Theory & Algebra

87
views
2
answers
6
GATE200424
Consider the binary relation: $S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$ The reflexive transitive closure is $S$ is $\left\{\left(x, y\right) \mid y >x \text{ and } x, y \in \left\{0, 1, 2\right ... } \right\}$ $\left\{\left(x, y\right) \mid y \leq x \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$
answer edited
3 days
ago
in
Set Theory & Algebra

228
views
gate2004
settheory&algebra
easy
1
answer
7
multilevel paging
can some one provide me procedure to solve this que?
commented
3 days
ago
in
Operating System

41
views
2
answers
8
hoe many different choices for classes does we have? ________
answered
3 days
ago
in
Combinatory

65
views
combinations
permutation
1
answer
9
CIDR notation
answer selected
3 days
ago
in
Computer Networks

44
views
3
answers
10
TIFR2013B6
Let $L$ and $L'$ be languages over the alphabet $\Sigma $. The left quotient of $L$ by $L'$ is $L/L'\overset{\underset{\mathrm{}}{def}}{=} \left\{w ∈ \Sigma^* : wx ∈ L\text{ for some }x ∈ L'\right\}$ Which of the ... L'$ is regular then $L$ is regular. $L/L'$ is a subset of $L$. If $L/L'$ and $L'$ are regular, then $L$ is regular.
answer selected
4 days
ago
in
Theory of Computation

172
views
tifr2013
theoryofcomputation
regularset
2
answers
11
Binary Search tree
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data structure the T will be A. O(log n) B. O(n) C. O(n logn) D. O(n2)
commented
4 days
ago
in
Algorithms

86
views
algorithms
binarysearchtree
datastructure
bst
2
answers
12
TIFR2014B13
Let $L$ be a given contextfree language over the alphabet $\left\{a, b\right\}$. Construct $L_{1},L_{2}$ as follows. Let $L_{1}= L  \left\{xyx\mid x, y \in \left\{a, b\right\}^*\right\}$, and $L_{2} = L \cdot L$. Then, Both $L_ ... $ is context free. $L_{1}$ and $L_{2}$ both may not be context free. $L_{1}$ is regular but $L_{2}$ may not be context free.
commented
4 days
ago
in
Theory of Computation

267
views
tifr2014
theoryofcomputation
identifyclasslanguage
2
answers
13
Deadlocks
Consider a system with processes P0, P1,P2, . . . . P99, P100, each process requires maximum of 4 resources. System has allocated 2 resources to each process. The minimum number of resources should release such that above system is deadlock free is _____
commented
4 days
ago
in
Operating System

36
views
resourceallocation
operatingsystem
3
answers
14
GATE2004IT40
Let M = (K, Σ, Г, Δ, s, F) be a pushdown automaton, where K = (s, f), F = {f}, Σ = {a, b}, Г = {a} and Δ = {((s, a, ε), (s, a)), ((s, b, ε), (s, a)), (( s, a, ε), (f, ε)), ((f, a, a), (f, ε)), ((f, b, a), (f, ε))}. Which one of the following strings is not a member of L(M)? aaa aabab baaba bab
answer selected
4 days
ago
in
Theory of Computation

1.1k
views
gate2004it
theoryofcomputation
pda
normal
1
answer
15
GATE2008IT36
Consider the following two finite automata. M1 accepts L1 and M2 accepts L2. Which one of the following is TRUE? L1 = L2 L1 ⊂ L2 L1 ∩ L2' = ∅ L1 ∪ L2 ≠ L1
commented
5 days
ago
in
Theory of Computation

456
views
gate2008it
theoryofcomputation
finiteautomata
normal
1
answer
16
MADEEASY
What is the functionality of above function Do ( ) ? a. Check whether string is odd palindrome b. Check whether the string is even palindrome c. Check whether the string is palindrome d. None of the above
commented
5 days
ago
in
Programming

41
views
madeeasytestseries
programminginc
2
answers
17
testbook
commented
5 days
ago
in
Programming

52
views
testbook
testseries
datastructure
dfs
1
answer
18
size of cache
A 2way set associative write back cache with true LRU replacement requires 15 * 29 bits to implement its tag store per set (including bits for valid, dirty and LRU). The cache is virtually indexed, physically tagged. The virtual address space is 1 MB, ... addressable. What is the maximum size of the data store of the cache in bytes? 9 KB 10 KB 12 KB 8 KB
commented
5 days
ago
in
CO & Architecture

125
views
cachememory
memorymanagement
co&architecture
0
answers
19
What should be answer 51 or 52?
commented
6 days
ago
in
Databases

39
views
1
answer
20
Peter linz, chapter 7 exercises
answered
6 days
ago
in
Theory of Computation

25
views
3
answers
21
GATE200373
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions. global int i=100, j=5; void P(x) { int i=10; print(x+10); i=200; j=20; print (x); } ... and call by need parameter passing mechanism, the values printed by the above program are 115, 220 25, 220 25, 15 115, 105
commented
6 days
ago
in
Programming

494
views
gate2003
programming
variablebinding
parameterpassing
normal
runtimeenvironments
2
answers
22
What is the type of the compliment of the given language
answer edited
Jan 9
in
Theory of Computation

107
views
contextfree
2
answers
23
REL
How to tell whether a language is recursively enumerable or not? Also answer the question with proper algorithm :)
answer selected
Jan 8
in
Theory of Computation

130
views
0
answers
24
Regular Expression
can anyone help me with regular expression for a)set of all strings with equal number of 0s and 1s such that no prefix has 2 more than 0s than 1s nor 2 more than 1's than 0's. b) set of all strings of 0s and 1s whose number of 0s is divisible by 5 and whose number of 1's is even.
comment moved
Jan 8
in
Theory of Computation

91
views
theoryofcomputation
regularexpressions
1
answer
25
GATE200582b
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight ... weighted spanning tree a weighted shortest path from $s$ to $t$ an Euler walk from $s$ to $t$ a Hamiltonian path from $s$ to $t$
commented
Jan 8
in
Algorithms

242
views
gate2005
algorithms
graphalgorithms
normal
2
answers
26
Hard disk
A certain hard disk rotates at 6000rpm. It has 1KB data per sector and 64 sectors per track and has seek time = 5sec. What is the time required to read data from 800 random sectors ?? Please solve this
answer selected
Jan 7
in
CO & Architecture

56
views
2
answers
27
how many solutions
How many solutions do the following equation have x1+x2+x3=11 where x1≥1, x2≥2, x3≥3 (A) C(7, 11) (B) C(11, 3) (C) C(14, 11) (D) C(7, 5)
answer selected
Jan 7
in
Set Theory & Algebra

174
views
2
answers
28
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?
answered
Jan 6
in
Set Theory & Algebra

293
views
gate2000
settheory&algebra
normal
descriptive
1
answer
29
TIFR2013A3
Three candidates, Amar, Birendra and Chanchal stand for the local election. Opinion polls are conducted and show that fraction $a$ of the voters prefer Amar to Birendra, fraction $b$ prefer Birendra to Chanchal and fraction $c$ prefer Chanchal to Amar. Which of the following is impossible? ... 68, 0.68);$ $(a, b, c) = (0.49, 0.49, 0.49);$ None of the above.
answer selected
Jan 6
in
Set Theory & Algebra

170
views
tifr2013
settheory&algebra
1
answer
30
UGCNETJune2015II36
A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cylinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at a cylinder 24. A seek takes 6 msec per ... How much seek time is needed for shortest seek time first (SSTF) algorithm? 0.984 sec 0.396 sec 0.738 sec 0.42 sec
answer selected
Jan 6
in
Others

55
views
ugcnetjune2015ii
2
answers
31
UGCNETJune2015III61
A context free grammar for $L=\{w \mid n_0 (w) > n_1 (w)\}$ is given by: $S \rightarrow 0 \mid 0S \mid 1 S S$ $S \rightarrow 0 S \mid 1 S \mid 0 S S \mid 1 S S \mid 0 \mid 1$ $S \rightarrow 0 \mid 0 S \mid 1 S S \mid S 1 S \mid S S 1$ $S \rightarrow 0 S \mid 1 S \mid 0 \mid 1$
answer selected
Jan 6
in
Theory of Computation

45
views
ugcnetjune2015iii
theoryofcomputation
1
answer
32
UGCNETJune2015III66
In a binary Hamming Code the number of check digits is r then number of message digits is equal to $2^r1$ $2^rr1$ $2^rr+1$ $2^r+r1$
answer selected
Jan 6
in
Others

42
views
ugcnetjune2015iii
1
answer
33
GATE1991_01,xiv
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
commented
Jan 5
in
Set Theory & Algebra

251
views
gate1991
settheory&algebra
partialorder
normal
2
answers
34
TIFR2014MathsB4
Let $H_{1}$, $H_{2}$ be two distinct subgroups of a finite group $G$, each of order $2$. Let $H$ be the smallest subgroup containing $H_{1}$ and $H_{2}$. Then the order of $H$ is Always 2 Always 4 Always 8 None of the above.
answer edited
Jan 5
in
Set Theory & Algebra

122
views
tifrmaths2014
settheory&algebra
groups
1
answer
35
APTITUDE
Let A can finish the task in 8 days and B can finish the same task in 10 days. How many days are required to finish the task if both are working alternate days.??  Ans ;;$8\frac{4}{5}$ days.
comment moved
Jan 5
in
Verbal Ability

46
views
1
answer
36
made easy test series Q29
Q29.
commented
Jan 5
in
CO & Architecture

33
views
1
answer
37
UGCNETJune2014III73
Given the following two grammars : $G_{1} : S \rightarrow AB  aaB$ $ A \rightarrow a  Aa$ $B \rightarrow b$ $G_{2} : S \rightarrow a S b S  b S a S  \lambda$ Which statement is correct ? $G_{1}$ is unambiguous and $G_{2}$ ... $G_{2}$ is ambiguous. $G_{1}$ is ambiguous and $G_{2}$ is unambiguous. $G_{1}$ is ambiguous and $G_{2}$ is ambiguous.
answer selected
Jan 5
in
Others

34
views
ugcnetjune2014iii
1
answer
38
UGCNETJune2014III75
Given the following two languages : $L_{1}=\left\{a^{n}b^{n}n\geq 1\right\} \cup \left\{a\right\}$ $L_{2}=\left\{w C w^{R}w \in \left\{a, b\right\}^{*}\right\}$ Which statement is correct ? Both $L_{1}$ ... and $L_{2}$ is deterministic. $L_{1}$ is deterministic and $L_{2}$ is not deterministic. Both $L_{1}$ and $L_{2}$ are deterministic.
answer selected
Jan 5
in
Others

48
views
ugcnetjune2014iii
0
answers
39
Test Series question
A 2way set associative write back cache with true LRU replacement requires 15 * 29 bits to implement its tag store per set (including bits for valid, dirty and LRU). The cache is virtually indexed, physically tagged. The virtual address space ... is 8 bytes and is byteaddressable. What is the maximum size of the data store of the cache in bytes?
commented
Jan 5
in
CO & Architecture

66
views
co&architecture
cachememory
0
answers
40
ip addressing
Every host in an IPv4 network has a 11second resolution realtime clock with battery backup. Each host needs to generate up to 1000 unique identifiers per second. Assume that each host has a globally unique IPv4 address. Design a ... globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?
commented
Jan 5
in
Computer Networks

18
views
18,810
questions
23,777
answers
51,413
comments
20,128
users