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.
Answers by rahul sharma 5
User rahul sharma 5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User rahul sharma 5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
Propositional function doubt
The Number of nvariable propositional function ? a. 2^2^n. b.2^n^2 c.2^n d. n^2 Can any one please explain the what should be the answer and how to get it?
answered
3 days
ago
in
Mathematical Logic

18
views
+1
vote
2
Consider the following graph L and find the bridges, if any
answered
3 days
ago
in
DS

31
views
graph
bridges
+2
votes
3
Recursive and Recursively Enumerable
answered
3 days
ago
in
Theory of Computation

28
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+2
votes
4
TOC Question
Consider any arbitrary DFA M of your choice and Let the language accepted by some DFA M be L. Let L1 be the language accepted by the DFA M1 obtained by changing the accepting state of M to a nonaccepting state and by changing the nonaccepting states of M to accepting states. Which of the following statements is true? L1={0,1}∗−L L1={0,1}∗ L1⊆L L1=L
answered
5 days
ago
in
Theory of Computation

37
views
theoryofcomputation
but
finiteautomata
+1
vote
5
Closure
Contextfree grammar is closed over intersection true/false.
answered
5 days
ago
in
CO & Architecture

17
views
theoryofcomputation
closureproperty
+1
vote
6
Peter Linz toc chapter 3 ex3.3 question 13b(page no 97)
answered
5 days
ago
in
Theory of Computation

26
views
theoryofcomputation
regulargrammar
dfa
0
votes
7
GATE2004IT85
onsider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability p = 0.2 in every slot. There is no backoff and one frame can be transmitted in one slot. If more than one host transmits in the ... can support, if each host has to be provided a minimum through put of 0.16 frames per time slot? 1 2 3 4
answered
Aug 14
in
Computer Networks

1.4k
views
gate2004it
computernetworks
congestioncontrol
macprotocol
normal
+1
vote
8
Relational algebra gateforum sample questions
answered
Aug 14
in
Databases

47
views
relationalalgebra
databases
0
votes
9
Is following sql query valid?
Can a sql query be like this: SELECT name AS instructor from instructor; The attributes' name can be renamed to table name or not?
answered
Aug 14
in
Databases

26
views
sql
databases
0
votes
10
ERMODEL
I think there is one to one relation and participation from professor and course side is partial.
answered
Aug 14
in
Databases

31
views
erdiagram
+1
vote
11
Probability Gate EE 2016
Candidates were asked to come to an interview with 3 pens each. Black, blue, green and red were the permitted pen colours that the candidate could bring. The probability that a candidate comes with all 3 pens having the same colour is _________.
answered
Aug 14
in
Probability

112
views
probability
engineeringmathematics
0
votes
12
introduction to engineering mathematics volume 3 by h.k. dass
answered
Aug 13
in
Probability

24
views
+2
votes
13
doubt
All ambiguous grammars can be converted to unambiguous grammar or oonly some ambiguos grammar can be converted to unambiguous
answered
Aug 13
in
Theory of Computation

14
views
+1
vote
14
Relational algebra
Gateforum sample questions http://gateoverflow.in/?qa=blob&qa_blobid=6152944108530932179
answered
Aug 13
in
Databases

17
views
+2
votes
15
Prime attribute
Primary key cannot be NULL . But is there any constraint on prime attributes also? Can they be NULL?
answered
Aug 12
in
Databases

26
views
+1
vote
16
equivalence relation: rosen exercise question
answered
Aug 11
in
Mathematical Logic

25
views
kennethrosen
0
votes
17
TOC doubt
Intersection of two Recursive enumerable language or two recursive language or two CSL is undecidable then how it can be said that it is closed under intersection?? Thank You
answered
Aug 11
in
Theory of Computation

16
views
+1
vote
18
J P TREMBLAY R MANOHAR EXCERCISE12.11
answered
Aug 7
in
Mathematical Logic

36
views
0
votes
19
GATE2008IT78
A CFG G is given with the following productions where S is the start symbol, A is a nonterminal and a and b are terminals. $$S → aS \mid A \\ A → aAb \mid bAa \mid \epsilon$$ Which of the following strings is generated by the grammar above? aabbaba aabaaba abababb aabbaab
answered
Aug 7
in
Theory of Computation

682
views
gate2008it
theoryofcomputation
normal
contextfreelanguage
+1
vote
20
TOC Question
Please refer this Question  here How in that Question  (0+1)*(0+1)(0+1)* = (0+1)(0+1)* = (0+1)*(0+1) = (0+1)+
answered
Aug 5
in
Theory of Computation

25
views
theoryofcomputation
finiteautomata
0
votes
21
GATE Exam
Can any any one tell me where I Can find the Previous year papers of GATE Exam. Recently I reached http://recruitmentresult.com/gateexam/ this website has provided best information but I am unable to download the papers.
answered
Aug 4
in
Interview Questions

19
views
gate
exam
syllabus
admission
0
votes
22
Conditional Probability
If the occurrence of some events are dependent on the occurrence of an event A then sum of all the joint probabilities in which the occurrence of event A is considered gives the a) Subjective probability of event A b) ... ) Conditional probability of event A d) Marginal Probability of event A e) Relative frequency of occurrence of event A
answered
Aug 1
in
Probability

60
views
engineeringmathematics
probability
conditionalprobability
0
votes
23
database
answered
Jul 26
in
Databases

34
views
databases
+3
votes
24
group theory
suppose that G IS cycliic group of order 10 with generator "a" belongs to G , order of $a^{8}$ will be ?
answered
Jul 18
in
Set Theory & Algebra

60
views
0
votes
25
Sheldon Ross Chapter 1 Example 3c
answered
Jul 2
in
Combinatory

25
views
probability
discretemathematics
permutationsandcombinations
0
votes
26
gate CSE discrete mathematics
we have to check whether the statement is equivalent or not. For that we try to find a true false case and if it exists then that will imply that it is not equivalent. Now for creating True in LHS we say that there exists an x such ... (x) and Q(x) to be true simultaneously and any one of them being true at a time can do the job. Thanks
answered
Jun 30
in
Mathematical Logic

16
views
+3
votes
27
Theory of Computation Closure Properties
answered
Jun 30
in
Theory of Computation

135
views
theoryofcomputation
closureproperty
+1
vote
28
Cache in CO
For associative mapping, MM size = 16GB Block size = 4KB Tag bit size = 10 What will be the cache size?
answered
Jun 26
in
CO & Architecture

81
views
co&architecture
cachememory
0
votes
29
Gatebook  predicate Logic  negating
answered
Jun 10
in
Mathematical Logic

59
views
mathematicallogic
firstorderlogic
predicatelogic
0
votes
30
Book Name
I am preparing the subjects watching NPTEL videos, but which book shall i use for practicing GATE questions.
answered
Jun 10
in
Study Resources

34
views
0
votes
31
Mathematical Logic
What is the difference between =>, <=> and >? Are => and > used in the same way? => is logical implication and <=> is equivalence right? Then why does in some questions, => and <=> is read as 'if then'? '>' symbol is for if then right? Refer to this: http://gateoverflow.in/3454/gate2007it21
answered
Jun 10
in
Mathematical Logic

34
views
mathematicallogic
discretemathematics
+1
vote
32
array address
answered
Jun 10
in
Programming

30
views
+1
vote
33
GATE20012.13
Consider the following data path of a simple nonpipelined CPU. The registers A, B, A1, A2, MDR, the bus and the ALU are 8bit wide. SP and MAR are 16bit registers. The MUX is of size $8 \times (2:1)$ and the DEMUX is of size $8 \times ... M[SP] ← r SP ← SP  1 How many CPU clock cycles are required to execute the "push r" instruction? 2 3 4 5
answered
May 28
in
CO & Architecture

1.7k
views
gate2001
co&architecture
datapath
machineinstructions
normal
+2
votes
34
structure
Which option is correct? & why?
answered
May 16
in
Programming

43
views
+1
vote
35
basic aptitude
The letter of the word LABOUR are permuted in all possible ways and the words thus formed are arranged as in a dictionary. What is the rank of the word LABOUR? A. 275 B. 251 C. 240 D. 242 can someone give me proper way to solve ?
answered
May 15
in
Combinatory

63
views
+1
vote
36
Few doubts in compiler design
1. If a grammar is LL(1), then it has to be LALR(1).Is it correct?? 2. Is there anything called as LL(0)?? 3. Do every DCFL has LL(1) grammar?? 4. Do every DCFL has LR(1) grammar?? 5. Can someone please ... ), what can we say for CFL,CSL,Recursive and RE?? 6. What is the difference between parse tree, syntax tree and abstract syntax tree?
answered
Jan 20
in
Compiler Design

310
views
compilerdesign
dcfl
parsing
lrparser
llparser
0
votes
37
Doubt ?? confirmation
Q. which is True/False??? plz confirm ??? a) L is regular <> Êa DFA with single finite state . b) Êa Regular expression for L. c) Êa Regular expression with out * . d) some CFL can accept by FA but every CFL not accepted by FA.
answered
Jan 18
in
Theory of Computation

43
views
+1
vote
38
order of leaf node in b+ tree??
answered
Jan 15
in
Databases

138
views
databases
btree
tree
+1
vote
39
Directed acyclic graph
In questions like, when asked to find the edges or nodes in the DAG of following expression, a=a+b*c(a+b)+(b*c) do we also consider "=" as a node and its related edges?
answered
Jan 10
in
Compiler Design

186
views
compilerdesign
Page:
1
2
next »
25,009
questions
32,132
answers
74,803
comments
30,179
users