menu
Answers by Praveen Saini
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Answers by Praveen Saini
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Prev
Blogs
New Blog
Exams
Answers by Praveen Saini
Filter
User Praveen Saini
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
31
votes
1
GATE CSE 2001 | Question: 11
A sequential circuit takes an input stream of $0's$ and $1's$ and produces an output stream of $0's$ and $1's.$ Initially it replicates the input on its output until two consecutive $0's$ are encountered on the input. From then onward, it ... diagram Give the minimized sum-of-product expression for $\text{J}$ and $\text{K}$ inputs of one of its state flip-flops
answered
in
Digital Logic
Jun 29, 2018
3.1k
views
gate2001-cse
digital-logic
normal
descriptive
flip-flop
23
votes
2
GATE CSE 2006 | Question: 85
The grammar $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \epsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$ generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In this grammar what is the length of the derivation (number of steps starting from $S$) to generate ... $l\neq m$ $\max (l,m) + 2$ $l + m + 2$ $l + m + 3$ $\max (l,m) + 3$
answered
in
Compiler Design
Jun 24, 2018
4.8k
views
gate2006-cse
compiler-design
grammar
normal
88
votes
3
GATE CSE 2018 | Question: 52
Given a language $L$, define $L^i$ as follows:$L^0 = \{ \varepsilon \}$$L^i = L^{i-1} \bullet L \text{ for all } I >0$The order of a language $L$ is defined as the smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1 ($over alphabet $0)$ accepted by the following automaton. The order of $L_1$ is ________.
answered
in
Theory of Computation
Feb 14, 2018
14.5k
views
gate2018-cse
theory-of-computation
numerical-answers
regular-languages
3
votes
4
For even no a's RE (b*ab*ab*)* + b* correct or (b*ab*ab*)*.b* or both are equal
answered
in
Theory of Computation
Aug 14, 2017
1.5k
views
theory-of-computation
finite-automata
regular-expressions
5
votes
5
Regular expression describe the same set of string as Grammar
Consider the following Grammar S -> Ax/By A->By/Cw B->x/Bw which of the regular expression describe the same set of strings as the grammar? The option are: (a) xw* y + xw* yx +ywx (b) xwy + xw* xy +ywx (c) xw* y + xw X yx +ywx (d) xw xy + xww* y +ywx
answered
in
Theory of Computation
May 7, 2017
1.9k
views
theory-of-computation
regular-expressions
2
votes
6
Finite Automata
How to convert Regular Grammar to Deterministic Finite Automata directly?
answered
in
Theory of Computation
Apr 28, 2017
431
views
theory-of-computation
4
votes
7
The regular expression corresponding to the finite automata given below is
The regular expression corresponding to the finite automata given below is (ab*(a+b)+ϵ)* (ϵ+a(a+b)b*a)* ((ϵ+(a+b)ab*)a)* (ab*(a+b)a+a)*(ab*(a+b)+ε)
answered
in
Theory of Computation
Dec 2, 2016
1.3k
views
5
votes
8
r's complement
I have little confusion about r's complement. See the following examples: eg1) calculate F's compl. of (2BFD) is? Solution : here we are calculating as FFFF - 2BFD= D402. eg 2) Given that (E0B)16−(ABF)16=Y. The radix 8's compliment of Y is ? Solution: (EOB)16 - ( ... r's complement - N(as mentioned in example 1 ) (b) when we use (r-1)'s compl + 1 (as mentioned in above example 2 )?
answered
in
Digital Logic
Aug 31, 2016
1.2k
views
digital-logic
number-representation
4
votes
9
Q. about regular language
Let L be a regular language Is the language L2={y: there exist x and z such that |x|=|z| and xyz belons to L} regular?
answered
in
Theory of Computation
Aug 9, 2016
353
views
5
votes
10
UGCNET-June2014-II: 10
The regular grammar for the language L= { $w\mid n_{a}$(w) and $n_{b} (w)$ are both even, $w \in \left\{a, b\right\}$ * } is given by : (Assume, $p, q, r$ and $s$ ... $p$ is both initial and final states.
answered
in
Theory of Computation
Jun 24, 2016
1.9k
views
ugcnetjune2014ii
theory-of-computation
regular-grammar
11
votes
11
Which of following features cannot be captured by CFG?
Which of the following features cannot be captured by CFG Syntax of if then else statements Syntax of recursive procedures Whether a variable is declared before its use Matching nested parenthesis
answered
in
Compiler Design
Jun 21, 2016
7.2k
views
compiler-design
3
votes
12
Language of FA
answered
in
Theory of Computation
Jun 7, 2016
221
views
6
votes
13
Automata Language PDA
If a given CFL Language is L= {a^n b^n ;n>=0} then how can we determine the value of L^2 .Explain with an example .
answered
in
Theory of Computation
Jun 7, 2016
591
views
theory-of-computation
pushdown-automata
context-free-languages
5
votes
14
CMI2010-A-01
Over the alphabet $\{0, 1\}$, consider the language $L = \{ w | \: w \text{ does not contain the substring } 0011\}$ Which of the following is true about $L$. $L$ is not context free $L$ is regular $L$ is not regular but it is context free $L$ is context free but not recursively enumerable
answered
in
Theory of Computation
May 19, 2016
804
views
cmi2010
theory-of-computation
identify-class-language
5
votes
15
CYK algo
what is CYK algo and use the CYK algo to determine whether the strings aabb,aabba,abbbb are in the language generated by following grammar S->AB A->BB|a B->AB|b
answered
in
Theory of Computation
May 17, 2016
1.9k
views
cyk-algorithm
2
votes
16
ternary tree
a full 3-ary tre with 100 vertices have a)57 leaves b) 67 leaves c)77 leaves d) 87 leaves
answered
in
Programming
May 10, 2016
951
views
7
votes
17
right quotient
let L1=L(a*baa*) and L2=(aba*) . find L1/L2
answered
in
Theory of Computation
May 9, 2016
2.0k
views
15
votes
18
GATE CSE 1998 | Question: 14
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ ... $5$ production rules. Is $L_2$ inherently ambiguous?
answered
in
Compiler Design
May 4, 2016
3.0k
views
gate1998
compiler-design
grammar
descriptive
0
votes
19
Digital ---- Prime Implicant
Is there any method to find the prime implicants without using the tabular method (Quine-McCluskey method) . As an example the prime implicant for the function F(w,x,y,z) = Σ( 1, 4,6,7,8,9,10,11,15 ) are 6 in numbers i.e. x'y'z , w'xz ... given function 4 or 6 .... If it is 6 then Is there any method other than Tabular method to find prime implicants of the function...
answered
in
Digital Logic
May 4, 2016
569
views
17
votes
20
GATE2015 ME-3: GA-8
In the given figure angle $Q$ is a right angle, $PS:QS = 3:1, RT:QT = 5:2$ and $PU:UR = 1:1. $ If area of triangle $QTS$ is $20cm^{2},$ then the area of triangle $PQR$ in $cm^{2}$ is ______
answered
in
Quantitative Aptitude
May 2, 2016
2.3k
views
gate2015-me-3
quantitative-aptitude
numerical-answers
triangles
14
votes
21
ISRO-2013-30
In a three stage counter, using $RS$ flip flops what will be the value of the counter after giving $9$ pulses to its input ? Assume that the value of counter before giving any pulses is $1$ : $1$ $2$ $9$ $10$
answered
in
Digital Logic
Apr 27, 2016
4.4k
views
isro2013
digital-logic
flip-flop
11
votes
22
ISRO-2013-32
Which of the following number of nodes can form a full binary tree? 8 15 14 13
answered
in
DS
Apr 27, 2016
4.1k
views
isro2013
binary-tree
15
votes
23
ISRO-2013-28
The most simplified form of the Boolean function $x (A, B, C, D) = \sum (7, 8, 9, 10, 11, 12, 13, 14, 15)$ (expressed in sum of minterms) is? A + A'BCD AB + CD A + BCD ABC + D
answered
in
Digital Logic
Apr 27, 2016
3.5k
views
isro2013
digital-logic
canonical-normal-form
5
votes
24
What language does this FA represent ? And what is the regular expression for this FA ?
answered
in
Theory of Computation
Apr 21, 2016
569
views
regular-expressions
theory-of-computation
finite-automata
28
votes
25
GATE CSE 2011 | Question: 51
Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration. If all the flip-flops were reset to $0$ at power on, what is the total number of distinct outputs (states) represented by $PQR$ generated by the counter? $3$ $4$ $5$ $6$
answered
in
Digital Logic
Apr 21, 2016
5.2k
views
gate2011-cse
digital-logic
circuit-output
normal
Page:
1
2
3
4
5
6
...
11
next »
Ask a Question
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
My Experience at IIIT Allahabad after 1 year of M.Tech and few tips
COAP Responses | GATE CSE 2022
IIT Delhi Mtech CSE Interview
Journey of GO
Honouring the Contributors to GATE Overflow
Categories
All categories
General Aptitude
(2.3k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.1k)
Programming and DS
(5.4k)
Algorithms
(4.7k)
Theory of Computation
(6.4k)
Compiler Design
(2.3k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.1k)
Admissions
(637)
Exam Queries
(857)
Tier 1 Placement Questions
(18)
Job Queries
(72)
Projects
(9)
Unknown Category
(1.1k)
Follow @gateoverflow
GATE Overflow
Recent Blog Comments
Thanks to all those who added the response. It is...
@
[email protected]
[email protected]
# CLRS is the...
@Chaitrasj In interviews you were quite...
nice sir
No new books for 2023:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Search GATE Overflow for GATE CSE