Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by smartmeet
0
votes
2
answers
31
If L=(a+b)* and R=a*b*a* then L intersection R=?
We know, here R subset L so by formula R intersection L= R, but for any string R=L( both language are same) R intersection L can be R or L? Correct me!
We know, here R subset L so by formula R intersection L= R, but for any string R=L( both language are same) R intersection L can be R or L?Correct me!
2.9k
views
asked
Jan 12, 2017
Theory of Computation
theory-of-computation
regular-language
set-theory&algebra
+
–
0
votes
1
answer
32
Virtual Gate Test Series: Theory Of Computation - Languages
For $A,B\subseteq \Sigma ^{*},$ define $A/B=\{x\in\Sigma^{*}\mid \exists y\in B,xy\in A\}$ If $L$ is a $\text{CFL}$ and $R$ is $\text{Regular},$ then $L/R$ is$?$ Regular CFL but not Regular Recursive but not CFL None of the above
For $A,B\subseteq \Sigma ^{*},$ define$A/B=\{x\in\Sigma^{*}\mid \exists y\in B,xy\in A\}$If $L$ is a $\text{CFL}$ and $R$ is $\text{Regular},$ then $L/R$ is$?$RegularCFL ...
784
views
asked
Jan 12, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-language
context-free-language
virtual-gate-test-series
+
–
0
votes
0
answers
33
In COA's sums of hit and miss ratios What configuration we should take, if nothing given in the question?
Hierarchical or Strict Hierarchical
241
views
asked
Jan 11, 2017
CO and Architecture
general
co-and-architecture
+
–
2
votes
2
answers
34
#Chromatic number , Planarity
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number of G) a) 2 b) 3 c) 4 d) None of these PS : (Explain: "every face is bordered by exactly 3 edges. ")
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number...
1.4k
views
asked
Jan 11, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-coloring
+
–
2
votes
2
answers
35
Virtual Gate Test Series: Digital Logic - Counter
670
views
asked
Jan 10, 2017
Digital Logic
digital-logic
flip-flop
digital-counter
virtual-gate-test-series
+
–
0
votes
2
answers
36
Subtraction from Hex to Binary
(012.25)16 - (101110.101)2 = (__)2 = (__)10
(012.25)16 - (101110.101)2 = (__)2 = (__)10
540
views
asked
Jan 10, 2017
Digital Logic
digital-logic
number-representation
+
–
0
votes
2
answers
37
What we should consider NFA or DFA while they ask 'Finite Autpmata' in question?
333
views
asked
Jan 9, 2017
Theory of Computation
general
finite-automata
+
–
5
votes
1
answer
38
Number of Boolean function possible
Number of boolean function with 3 boolean variable such that the function contain exactly 2 or 7 min term in their canonical SOP? Please explain the logic!
Number of boolean function with 3 boolean variable such that the function contain exactly 2 or 7 min term in their canonical SOP?Please explain the logic!
3.6k
views
asked
Jan 8, 2017
Digital Logic
combinatory
min-sum-of-products-form
+
–
3
votes
1
answer
39
Mean Value Theorem Question(Explain the concept)
A rail engine accelerates from its stationary position for 8 seconds and travels a distance of 280m. According to the Mean Value Theorem, the speedometer at a certain time during acceleration must read exactly. (A) 0km/h (B) 8km (C) 75km/h (D) 126km/h
A rail engine accelerates from its stationary position for 8 seconds and travels a distance of 280m. According to the Mean Value Theorem, the speedometer at a certain tim...
3.2k
views
asked
Dec 29, 2016
Calculus
calculus
mean-value-theorem
engineering-mathematics
+
–
1
votes
0
answers
40
Gateforum TOC Assessment test
I want to know logic behind this,thanks in advance.
I want to know logic behind this,thanks in advance.
378
views
asked
Dec 9, 2016
Theory of Computation
gateforum-test-series
theory-of-computation
context-free-language
+
–
0
votes
1
answer
41
GF TOC Assessment test
382
views
asked
Dec 9, 2016
Theory of Computation
gateforum-test-series
theory-of-computation
closure-property
identify-class-language
+
–
2
votes
3
answers
42
Virtual Gate Test Series: Theory Of Computation - Regular Languages
The language given is $\text{$L = \{ w | w $ contains an equal no of occurrences of substrings '$ab'$ and $'ba' \}.$ }$ $L$ is regular $?$ Note$:-$ $aba ∈ L $since $'aba'$ contains $1$ occurrence of $'ab'$ and $1$ occurrence of $'ba'$ but $ abab ∉ L$
The language given is $\text{$L = \{ w | w $ contains an equal no of occurrences of substrings '$ab'$ and $'ba' \}.$ }$ $L$ is regular $?$Note$:-$ $aba ∈ L $since $'a...
4.3k
views
asked
Dec 8, 2016
Theory of Computation
theory-of-computation
finite-automata
regular-language
virtual-gate-test-series
+
–
3
votes
4
answers
43
Gateforum DBMS assesment test(Relational Algebra)(see the image below)
883
views
asked
Dec 6, 2016
Databases
gateforum-test-series
databases
relational-algebra
+
–
10
votes
1
answer
44
GateForum DBMS Assessment test(see the image below)
The $\text{ER}$ diagram shown below depicts a relation between an $\text{EMPLOYEE}$ and its Dependent. When the above $\text{ER}$ diagram mapped to a relational model, then number of attributes of employee entity and dependent entity which remain non- ... Dependent: $1$ Employee: $2\: \&$ Dependent: $1$ Employee: $2\: \&$ Dependent: $2$
The $\text{ER}$ diagram shown below depicts a relation between an $\text{EMPLOYEE}$ and its Dependent.When the above $\text{ER}$ diagram mapped to a relational model, the...
1.2k
views
asked
Dec 3, 2016
Databases
databases
gateforum-test-series
er-diagram
relations
+
–
5
votes
2
answers
45
Virtual Gate Test Series: Databases - Recover Schedule
Assume there are n transactions$:T_{1},T_{2},.,T_{n}.$ Every transaction writes value of $X$ that is read by its successive transaction like $T_{1}$ writes value of $X$ that is read by $T_{2}, T_{2}$ writes a value of ... $X$ that is read by Tn. Now,if $T_{1}$ fails,then total how many transaction rollbacks are required to recover the schedule?
Assume there are n transactions$:T_{1},T_{2},.,T_{n}.$ Every transaction writes value of $X$ that is read by its successive transaction like $T_{1}$ writes value of $X$ t...
1.0k
views
asked
Nov 30, 2016
Databases
databases
transaction-and-concurrency
virtual-gate-test-series
+
–
2
votes
3
answers
46
Remove Left Recursion from given grammar, if any?
2.1k
views
asked
Nov 14, 2016
Compiler Design
compiler-design
parsing
grammar
left-recursion
test-series
+
–
3
votes
1
answer
47
Are descendants and children same for Binary Tree?
Please make me clear about Descendants in Binary Trees.thanks in advance
Please make me clear about Descendants in Binary Trees.thanks in advance
503
views
asked
Jul 29, 2016
DS
binary-tree
algorithms
+
–
2
votes
1
answer
48
who are GATE 2015 CSE top 50 students?What marks and score they got?In which college they got admission?
1.6k
views
asked
Jan 19, 2016
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
