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 akash.dinkar12
User akash.dinkar12
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User akash.dinkar12
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE2017119
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $max\left ( X,0 \right )$ where $max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
commented
7 hours
ago
in
Probability

1.1k
views
gate20171
probability
randomvariable
numericalanswers
1
answer
2
TOC peter linz (6 edition)
Find DFA for the following language $L=\left \{ ba^n : n>=1,n!=4 \right \}$
commented
13 hours
ago
in
Theory of Computation

44
views
theoryofcomputation
peterlinz
1
answer
3
generating function
Let p be an odd prime number. Find the number of subsets A of the set {1, 2, …, 2p} such that (i) A has exactly p elements, and (ii) the sum of all the elements in A is divisible by p.
commented
1 day
ago
in
Combinatory

24
views
1
answer
4
Mathematical Logic question
Which among them are valid? How to approach such questions ?
commented
1 day
ago
in
Mathematical Logic

45
views
mathematicallogic
discretemathematics
1
answer
5
UGCNETjune2009ii13
The octal equivalent of hexadecimal (A.B)16 is: (A) 47.21 (B) 12.74 (C) 12.71 (D) 17.21
commented
2 days
ago
in
Digital Logic

25
views
ugcnetjune2009ii
0
answers
6
UGCNETjune2009ii19
Suppose it takes 100 ns to access a page table and 20 ns to access associative memory with a 90% hit rate, the average access time equals: (A) 20 ns (B) 28 ns (C) 90 ns (D) 100 ns
commented
2 days
ago
in
CO & Architecture

16
views
ugcnetjune2009ii
0
answers
7
UGCNETjune2009ii33
In which addressing mode the operand is given explicitly in the instruction itself? (A) Absolute mode (B) Immediate mode (C) Indirect mode (D) Index mode
commented
2 days
ago
in
CO & Architecture

21
views
ugcnetjune2009ii
0
answers
8
back off algo
Assume X and Y are the only two stations on ethernet.Each has a steady queue of frames to send.Both X and Y attempt to tranmit a frame,they wait to get the control of the channel using binary exponential algo.The prob that both were ... allowed to send the frame on 5th round(assuming everytime both X and Y will collide in back off race till 4th round)
commented
2 days
ago
in
Computer Networks

28
views
0
answers
9
UGCNETjune2009ii11
Assertion(A): Bit maps are not often used in memory management. Reason(R): Searching a bitmap for a run of given length is a slow operation. (A) Both (A) and (R) are true and (R) is correct explanation for (A) (B) Both(A) and (R) are true but (R) is not correct explanation for (A) (C) (A) is true (R) is false (D) (A) is false (R) is true
commented
2 days
ago
in
Others

8
views
ugcnetjune2009ii
0
answers
10
GATE 2017 MATHEMATICS PROBABILITY QUESTION
commented
2 days
ago
in
Others

16
views
1
answer
11
Minimum tables required
1.Minimum number of tables required which satisfies 1NF ? 2.Minimum number of tables required which satisfies 3NF ?
commented
4 days
ago
in
Databases

38
views
databases
erdiagram
0
answers
12
Concurrent transactions
Number of concurrent transactions that can be formed with 3 transactions having 3,2 and 1 operations respectively. Here should the answer be 60 or 54 ? Should we include serial transactions also in the answer or should we subtract it?
commented
4 days
ago
in
Databases

30
views
databases
1
answer
13
compiler doubt
int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0; I<N; I++); /*Line 3 */ } what type of error will be caused by this code?? LEXICAL SEMANTIC SYNTACTIC NO COMPILE ERROR
commented
4 days
ago
in
Compiler Design

33
views
compilerdesign
compiler
parsing
0
answers
14
cogestion window
commented
5 days
ago
in
Computer Networks

27
views
congestioncontrol
2
answers
15
Random Doubt, Candidate Key, DBMS
commented
5 days
ago
in
Databases

47
views
candidatekeys
databases
functionaldependencies
key
0
answers
16
Maths: functions: is given function bijective?
commented
5 days
ago
in
Set Theory & Algebra

47
views
discretemathematics
kennethrosen
functions
1
answer
17
LL(1) and LR(0)
The LL(1) and LR(0) techniques, 1)are both having the same power. 2)both simulate the reverse of a leftmost derivation. 3)are incomparable. 4)both simulate the reverse of a rightmost derivation. I am unable to find the correct answer in given choices. What is the best choice among 4?
answered
5 days
ago
in
Compiler Design

54
views
compilerdesign
lrparser
ll1
1
answer
18
Bit rate vs Baud rate
Pick the correct statement A. Bit rate can never be less than Baud rate B. Baud rate can never be less than Bit rate C. Bit rate and Baud rate are always samr. D. None of the above
commented
5 days
ago
in
Computer Networks

36
views
1
answer
19
Digital Logic  Write out the boolean expression and draw the circuit that implements the function
commented
5 days
ago
in
Digital Logic

34
views
digitallogic
booleanexpressions
digital
digitalcircuits
logic
1
answer
20
asymptotic notation
a) T(n) = √n T(√n) + n b) T(n) = 4T(n/2) + n2 √(2)
commented
6 days
ago
in
Algorithms

43
views
recurrence
2
answers
21
GATE1996_13
Let $Q=\left( \left\{q_1,q_2 \right\}, \left\{a,b\right \}, \left\{a,b,\bot \right\}, \delta, \bot, \phi \right)$ be a pushdown automaton accepting by empty stack for the language which is the set of all nonempty even palindromes over the set $\ ... delta(q_2,b,b) = \left\{(q_2, \epsilon)\right\}$ $\delta(q_2,\epsilon,\bot) = \left\{(q_2, \epsilon)\right\}$
commented
Sep 16
in
Theory of Computation

291
views
gate1996
theoryofcomputation
pushdownautomata
normal
1
answer
22
Previous GATE papers
L1 is a Recursive Lang. and L2 is Recursively Enumerable but not Recursive. Which one is true? a) (L1 Complement) is recursive and (L2 Complement) is Recursively Enumerable b) (L1 Complement) is recursive and (L2 Complement ... and (L2 Complement) is not Recursively Enumerable d) (L1 Complement) is recursive and (L2 Complement) is Recursive
commented
Sep 14
in
Theory of Computation

30
views
theoryofcomputation
1
answer
23
BCNF form
consider the relation R(ABCDE) and functional dependency F={AB>C , C>D , D>E ,E>A} if we convert the given relation in BCNF then given answer =>R(EA) R(ED) R(CD) R(ABC) my answer =>R(EA) R(ED) R(CD) R(BC) if mine is wrong please explain the right one
commented
Sep 10
in
Databases

39
views
0
answers
24
Process Synchronization
Consider Three binary Semaphore P = R = 1 , S = 0; Process P1: P(Q); P(R); /* CRITICAL SECTION */ V(Q); V(R); Process P2: P(R); P(Q); /* CRITICAL SECTION */ V(Q); V(R); Process P3: P(S); / ... OF TIME then process P2 is also trying to enter into critical section, 1. then Bounded Wait is satisfied or not. 2. then Starvation is satisfied or not.
commented
Sep 9
in
Operating System

73
views
processsynchronization
operatingsystem
criticalsection
deadlock
2
answers
25
DBMS (2nd Ed.) By RaghuramKrishnan #Page no:128 and 129
commented
Sep 8
in
Databases

66
views
databases
sql
0
answers
26
toc doubt how to solve this
commented
Sep 3
in
Theory of Computation

21
views
3
answers
27
functional dependency
Let the relation R(X, Y, Z, A, B) with given functional dependencies X > YZ Z > A A > B AZ > X The number of super keys possible__________ ? Please answer with an explanation.
answered
Aug 29
in
Databases

73
views
functionaldependencies
databases
superkey
1
answer
28
MADE EASY
A minimum state deterministic finite automaton accepting the language L={w∣w∈{0,1}} where fifth symbol from the right is 0 has how many states?
commented
Aug 29
in
Theory of Computation

104
views
theoryofcomputation
dfa
finiteautomata
1
answer
29
OS: UNIX I node
Consider the organization of a UNIX file as represented by the inode Assume that there are 12 direct block pointers, and a singly, doubly, and triply indirect pointer in each inode. Further, assume that the system block size and the disk ... is already in main mem ory, how many disk accesses are required to access the byte in position 13,423,956?
commented
Aug 26
in
Operating System

56
views
operatingsystem
unix
inode
filesystem
1
answer
30
Logic gate
let f = Σ(5,6,13) and f1 = Σ(0,1,2,3,5,6,8,9,10,11,13) and f= f1.f2',where f,f1,f2 are function of A,B,C,D 1) the number of possible expression for f2 is:_______??? 2) minimal value of f² is: a) A b) A'+C c) B' d) none
commented
Aug 23
in
Digital Logic

48
views
numericalanswers
digitallogic
1
answer
31
NET Aug 16 paperIII Q 55
commented
Aug 23
in
Theory of Computation

39
views
1
answer
32
what is the num of superkey can we get from a1,a2...a n attributes?
commented
Aug 23
in
Databases

69
views
databases
keys
10
answers
33
GATE2017122
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet {a,b}. The smallest number of states needed in a deterministic finitestate automaton (DFA) accepting $L$ is ___________ .
commented
Aug 23
in
Theory of Computation

2k
views
gate20171
theoryofcomputation
finiteautomata
numericalanswers
4
answers
34
linear algebra
commented
Aug 23
in
Linear Algebra

52
views
engineeringmathematics
linearalgebra
1
answer
35
Regular Languages
Choose the correct statement: a) For every regular language, there is right linear and left linear grammar. b) For every regular language, there is right linear or left linear grammar but not both. c) Transpose of a regular language is regular. d) both a and c
commented
Aug 21
in
Theory of Computation

58
views
theoryofcomputation
regularlanguages
1
answer
36
c programming
#define A 10+10 main () { int a; a=A*A; printf (%d, a); } a) 100 b) 200 c) 120 d) 400
commented
Aug 21
in
Programming

43
views
1
answer
37
Virtual Gate Programming Question
commented
Aug 21
in
Programming

76
views
virtualgate
testseries
programminginc
datastructure
1
answer
38
c programming
answered
Aug 20
in
Programming

36
views
2
answers
39
Infix to prefix
Convert (A  B^C + H)*D + E^5. Is the answer +*+A^BCHD^E5 ?
answered
Aug 20
in
Programming

73
views
datastructure
5
answers
40
Regular expression for given FA
comment reshown
Aug 16
in
Theory of Computation

280
views
theoryofcomputation
regularexpressions
finiteautomata
26,239
questions
33,805
answers
80,214
comments
31,159
users