menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Feedback to GATE Overflow Test Takers
GATE 2021 – Online registration portal
IIT Madras MS CS Interview Experience - 2020
JEST TCS (Theoretical Computer Science) EXAM || Gateway of IISc other than GATE exam
Divisibility language and Minimum Number of States in a DFA accepting a binary number divisible by 'n'
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(1k)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Compilers, Architecture, HPC
(8)
Machine Learning
(8)
Distributed Systems
(0)
Big Data/Data Analytics
(1)
Pure Web Development
(2)
Unknown Category
(873)
Recent Blog Comments
In a hurry I took Ace and made easy test series...
What was you GATE score and rank? Did they ask...
Thanks for sharing this useful and informative...
hello mrinmoy brother , what was your rank in...
I got access to test series. Thank you.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Using karnaugh map ,show the expression Y='BC+B'C+BC
0
votes
117
views
asked
Mar 1, 2018
in
Compilers, Architecture, HPC
Kalu30
117
views
answer
comment
1
'BC doesn't make any sense
0
@Tesla!
This question is wrong?
0
Yes it is wrong
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
THIS QUERY IS WRONG BUT IF WE CAN TAKE 'B AS B' THEN WE CAN FIRSTLY FIND OUT ITS MIN-TERMS AND AFTER THAT WE CAN EASILY SOLVE IT BY K-MAPS
answered
Oct 16, 2019
tarunpro20
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
–1
vote
1
answer
1
88
views
Digital Karnaugh Map
asked
Jan 4, 2019
in
Digital Logic
Rackson
88
views
digital-logic
k-map
digital-circuits
1
vote
1
answer
2
90
views
Karnaugh map
what is the main reason behind using kmap??? it's used to reduced boolean expression or something else??
what is the main reason behind using kmap??? it's used to reduced boolean expression or something else??
asked
Aug 2, 2017
in
Digital Logic
Hira Thakur
90
views
4
votes
1
answer
3
373
views
Computation Theory - Show that the family of regular languages is closed under tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }
The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }. How do I show that the family of regular languages is closed under this operation.
asked
Oct 9, 2017
in
Theory of Computation
Garrett McClure
373
views
theory-of-computation
regular-languages
finite-automata
regular-expressions
0
votes
3
answers
4
2.6k
views
the boolean expression y=(a+b'+a'b)c' is given by
asked
Jun 12, 2016
in
Unknown Category
Isha Gupta
2.6k
views
...
