Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
gate2006..topic digital logic
[closed]
gabbar
asked
in
Digital Logic
Oct 7, 2016
closed
Oct 7, 2016
by
sourav.
812
views
0
votes
0
votes
closed as a duplicate of:
GATE CSE 2006 | Question: 40
consider numbers represented in 4bit graycode. let h3h2h1h0 be the graycode representation of a number n and let g3g2g1g0 be the graycode of (n+1)modulo16) value of the number?
digital-logic
gabbar
asked
in
Digital Logic
Oct 7, 2016
closed
Oct 7, 2016
by
sourav.
by
gabbar
812
views
comment
Follow
share this
share
1 comment
by
gabbar
commented
Oct 7, 2016
reply
Follow
share this
thnx but still not getting how matching is done
0
0
Please
log in
or
register
to add a comment.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
99Monish
asked
in
Digital Logic
Dec 18, 2021
3,864
views
Topic - Number Systems (Digital Logic)
What is the difference between 2’s complement and 2’s complement representation of a number? Please can you do 2’s complement of (43) and (-43) and also represent 43 and (-43) in two’s complement form. Also, write binary of 43 and (-43).
99Monish
asked
in
Digital Logic
Dec 18, 2021
by
99Monish
3.9k
views
number-representation
number-system
digital-logic
0
votes
0
votes
0
answers
2
adil.wadood
asked
in
Digital Logic
Jul 3, 2018
530
views
General Topic Doubt Digital Logic: Min No Gates
What are the minimum number of nand or nor gates required for 2 bit adder ( ie. 4 input A,B,C,D) ?
adil.wadood
asked
in
Digital Logic
Jul 3, 2018
by
adil.wadood
530
views
digital-logic
parallel-adder
combinational-circuit
digital-circuits
general-topic-doubt
0
votes
0
votes
1
answer
3
saumya mishra
asked
in
Digital Logic
May 31, 2018
1,843
views
General Topic Doubt Digital Logic: Min No Gates
Consider a $3-bit$ number $A$ and $2 bit$ number $B$ are given to a multiplier. The output of multiplier is realized using $AND$ gate and one-bit full adders. If the minimum number of $AND$ gates required are $X$ and one-bit full adders required are Y, then $X+Y = $ _______
saumya mishra
asked
in
Digital Logic
May 31, 2018
by
saumya mishra
1.8k
views
digital-logic
digital-circuits
general-topic-doubt
combinational-circuit
1
vote
1
vote
1
answer
4
Prince Sindhiya
asked
in
Digital Logic
Oct 7, 2018
456
views
Digital topic test
Here i didn't understand the statement 1 just explain it only
Prince Sindhiya
asked
in
Digital Logic
Oct 7, 2018
by
Prince Sindhiya
456
views
digital-logic
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
