SlideShare a Scribd company logo
1 of 3
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
ASSIGNMENT
PROGRAM BCA
SEMESTER 1
SUBJECT CODE & NAME BCA1040/IMC1040- DIGITAL LOGIC
CREDIT 4
BK ID B0948
MAX.MARKS 60
Note: Answer all questions. Kindly note that answers for 10 marks questions should be
approximately of 400 words. Each question is followed by evaluation scheme.
1 Solve each of the following 4-bit subtraction problems using 2’s complement representation.
1. (00110)2 – (00101)2
2. (0111)2 – (0001)2
Answer: The circuit has a Mode switch that allows you to choose between adding (M=0) and
subtracting (M=1). To understand why this circuit works, let’s review binary addition and binary
subtraction. We use 4-bit numbers in the examples because the main interactive circuit is a 4-bit
adder–subtractor.
Binary addition is certainly easier than
2 What is difference between minterm and maxterm? Express the following function
F(x,y,z) = (x+z) y in form of minterm and maxterm?
Answer:Minterm and maxterm: Each row of a truth table can be associated with a minterm, which
is a product (AND) of all variables in the function, in direct or complemented form. A minterm has
the property that it is equal to 1 on exactly one row of the truth table.
3 Draw truth table for following Boolean function
1. a) F(x,y) =(x+z)y
2. b) F(x,y) = xy +xy’
Answer: Mathematics normally works with a two-valued logic: Every statement is either True or
False.Youcan use truth tablestodetermine the truthorfalsityof a complicatedstatementbasedon
the truth or falsity of its simple components.
A statementinsentential logicisbuiltfromsimplestatementsusingthe logical connectives ~ , v,^,-,.
I'll construct tables which show how the truth or falsity of a statement built with these connective
depends on the truth or falsity of its components.
4 Simplify the following Boolean function using k map.
F(A, B, C, D) = ∑m(0,2,3,5,6,7,8,10,11,14,15)
Answer:
3-variable Karnaugh maps:
Above we, place the 1's in the K-map for each of the product terms, identify a group of two, then
write a p-term (product term) for the sole group as our simplified result.
5. Whatare sequential circuits?Explaindifferencesbetweensequential circuits and combinational
circuits.
Answer:Sequential circuits:- In digital circuittheory,sequential logicisa type of logic circuit whose
outputdependsnotonlyonthe presentvalue of itsinputsignalsbutonthe past historyof itsinputs.
Thisis incontrast to combinational logic,whose output is a function of only the present input. That
is, sequential logic has state (memory) while combinational logic does not. Or, in other words,
sequential logic is combinational logic with memory.
Sequential logic is used to construct
6. What is difference between Ring counter and Johson counter?
Answer : Ring counter
A ring counter is a type of counter composed of a circular shift register. If the output of a shift
register is fed back to the input a ring counter results. There are two types of ring counters:
 A straightringcounteror Over beckcounterconnectsthe output of the last shift register to the first
shift register input and circulates a single one (or zero) bit around the ring. For example, in a 4-
register one-hot counter, with initial
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601

More Related Content

What's hot

Bca spring driveassignments (1)
Bca spring driveassignments (1)Bca spring driveassignments (1)
Bca spring driveassignments (1)solved_assignments
 
Technical aptitude questions_e_book1
Technical aptitude questions_e_book1Technical aptitude questions_e_book1
Technical aptitude questions_e_book1Sateesh Allu
 
Smu bscit sem 1 summer 2015 assignemnts
Smu bscit sem 1 summer 2015 assignemntsSmu bscit sem 1 summer 2015 assignemnts
Smu bscit sem 1 summer 2015 assignemntssolved_assignments
 
Image recogonization
Image recogonizationImage recogonization
Image recogonizationSANTOSH RATH
 
Ijarcet vol-2-issue-7-2230-2231
Ijarcet vol-2-issue-7-2230-2231Ijarcet vol-2-issue-7-2230-2231
Ijarcet vol-2-issue-7-2230-2231Editor IJARCET
 
Linear block coding
Linear block codingLinear block coding
Linear block codingjknm
 
An Efficient Multiplierless Transform algorithm for Video Coding
An Efficient Multiplierless Transform algorithm for Video CodingAn Efficient Multiplierless Transform algorithm for Video Coding
An Efficient Multiplierless Transform algorithm for Video CodingCSCJournals
 
FPGA based BCH Decoder
FPGA based BCH DecoderFPGA based BCH Decoder
FPGA based BCH Decoderijsrd.com
 
Sem 1 mca fall 2014 solved assignments
Sem 1 mca fall 2014 solved assignmentsSem 1 mca fall 2014 solved assignments
Sem 1 mca fall 2014 solved assignmentssmumbahelp
 
SMU BSC IT FALL / SUMMER 2013 SOLVED ASSIGNMENTS
SMU BSC IT FALL / SUMMER 2013 SOLVED ASSIGNMENTSSMU BSC IT FALL / SUMMER 2013 SOLVED ASSIGNMENTS
SMU BSC IT FALL / SUMMER 2013 SOLVED ASSIGNMENTSsmumbahelp
 
Ijcatr03051008Implementation of Matrix based Mapping Method Using Elliptic Cu...
Ijcatr03051008Implementation of Matrix based Mapping Method Using Elliptic Cu...Ijcatr03051008Implementation of Matrix based Mapping Method Using Elliptic Cu...
Ijcatr03051008Implementation of Matrix based Mapping Method Using Elliptic Cu...Editor IJCATR
 
Linear Block Codes
Linear Block CodesLinear Block Codes
Linear Block CodesNilaNila16
 
A Comparison of Loss Function on Deep Embedding
A Comparison of Loss Function on Deep EmbeddingA Comparison of Loss Function on Deep Embedding
A Comparison of Loss Function on Deep EmbeddingCenk Bircanoğlu
 
Reed_Solomon_Implementation
Reed_Solomon_ImplementationReed_Solomon_Implementation
Reed_Solomon_Implementationramya c b
 
Information Theory and Coding Question Bank
Information Theory and Coding Question BankInformation Theory and Coding Question Bank
Information Theory and Coding Question Bankmiraclebabu
 

What's hot (20)

Bca spring driveassignments (1)
Bca spring driveassignments (1)Bca spring driveassignments (1)
Bca spring driveassignments (1)
 
Technical aptitude questions_e_book1
Technical aptitude questions_e_book1Technical aptitude questions_e_book1
Technical aptitude questions_e_book1
 
Smu bscit sem 1 summer 2015 assignemnts
Smu bscit sem 1 summer 2015 assignemntsSmu bscit sem 1 summer 2015 assignemnts
Smu bscit sem 1 summer 2015 assignemnts
 
Image recogonization
Image recogonizationImage recogonization
Image recogonization
 
Ijarcet vol-2-issue-7-2230-2231
Ijarcet vol-2-issue-7-2230-2231Ijarcet vol-2-issue-7-2230-2231
Ijarcet vol-2-issue-7-2230-2231
 
Linear block coding
Linear block codingLinear block coding
Linear block coding
 
An Efficient Multiplierless Transform algorithm for Video Coding
An Efficient Multiplierless Transform algorithm for Video CodingAn Efficient Multiplierless Transform algorithm for Video Coding
An Efficient Multiplierless Transform algorithm for Video Coding
 
FPGA based BCH Decoder
FPGA based BCH DecoderFPGA based BCH Decoder
FPGA based BCH Decoder
 
Sem 1 mca fall 2014 solved assignments
Sem 1 mca fall 2014 solved assignmentsSem 1 mca fall 2014 solved assignments
Sem 1 mca fall 2014 solved assignments
 
SMU BSC IT FALL / SUMMER 2013 SOLVED ASSIGNMENTS
SMU BSC IT FALL / SUMMER 2013 SOLVED ASSIGNMENTSSMU BSC IT FALL / SUMMER 2013 SOLVED ASSIGNMENTS
SMU BSC IT FALL / SUMMER 2013 SOLVED ASSIGNMENTS
 
Ijcatr03051008Implementation of Matrix based Mapping Method Using Elliptic Cu...
Ijcatr03051008Implementation of Matrix based Mapping Method Using Elliptic Cu...Ijcatr03051008Implementation of Matrix based Mapping Method Using Elliptic Cu...
Ijcatr03051008Implementation of Matrix based Mapping Method Using Elliptic Cu...
 
Lesson 2 1
Lesson 2 1Lesson 2 1
Lesson 2 1
 
Linear Block Codes
Linear Block CodesLinear Block Codes
Linear Block Codes
 
5 linear block codes
5 linear block codes5 linear block codes
5 linear block codes
 
A Comparison of Loss Function on Deep Embedding
A Comparison of Loss Function on Deep EmbeddingA Comparison of Loss Function on Deep Embedding
A Comparison of Loss Function on Deep Embedding
 
G029037043
G029037043G029037043
G029037043
 
Machine Learning Basics
Machine Learning BasicsMachine Learning Basics
Machine Learning Basics
 
Reed_Solomon_Implementation
Reed_Solomon_ImplementationReed_Solomon_Implementation
Reed_Solomon_Implementation
 
Bscit winter 2013
Bscit winter 2013Bscit winter 2013
Bscit winter 2013
 
Information Theory and Coding Question Bank
Information Theory and Coding Question BankInformation Theory and Coding Question Bank
Information Theory and Coding Question Bank
 

Similar to Bca1040 digital logic

Bca1040 digital logic
Bca1040  digital logicBca1040  digital logic
Bca1040 digital logicsmumbahelp
 
Bt0064 logic design
Bt0064  logic designBt0064  logic design
Bt0064 logic designsmumbahelp
 
Digital electronics k map comparators and their function
Digital electronics k map comparators and their functionDigital electronics k map comparators and their function
Digital electronics k map comparators and their functionkumarankit06875
 
Ec2203 digital electronics questions anna university by www.annaunivedu.org
Ec2203 digital electronics questions anna university by www.annaunivedu.orgEc2203 digital electronics questions anna university by www.annaunivedu.org
Ec2203 digital electronics questions anna university by www.annaunivedu.organnaunivedu
 
Module 2 logic gates
Module 2  logic gatesModule 2  logic gates
Module 2 logic gatesDeepak John
 
Bt0064 logic design-de
Bt0064 logic design-deBt0064 logic design-de
Bt0064 logic design-desmumbahelp
 
Bt0064 logic design-de
Bt0064 logic design-deBt0064 logic design-de
Bt0064 logic design-desmumbahelp
 
Bt0064 logic design
Bt0064 logic designBt0064 logic design
Bt0064 logic designsmumbahelp
 
Iisrt z swati sharma
Iisrt z swati sharmaIisrt z swati sharma
Iisrt z swati sharmaIISRT
 
Smu bsc it sem 1 fall 2014 solved assignments
Smu bsc it sem  1 fall 2014 solved assignmentsSmu bsc it sem  1 fall 2014 solved assignments
Smu bsc it sem 1 fall 2014 solved assignmentssmumbahelp
 
Alg1 power points_-_unit_7_-_exponents_and_exponential_functions
Alg1 power points_-_unit_7_-_exponents_and_exponential_functionsAlg1 power points_-_unit_7_-_exponents_and_exponential_functions
Alg1 power points_-_unit_7_-_exponents_and_exponential_functionsCuteanimeboyWithhood
 
Final Project Report
Final Project ReportFinal Project Report
Final Project ReportRiddhi Shah
 
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptxECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptxMdJubayerFaisalEmon
 
ECE 2103_L6 Boolean Algebra Canonical Forms.pptx
ECE 2103_L6 Boolean Algebra Canonical Forms.pptxECE 2103_L6 Boolean Algebra Canonical Forms.pptx
ECE 2103_L6 Boolean Algebra Canonical Forms.pptxMdJubayerFaisalEmon
 
Efficient realization-of-an-adfe-with-a-new-adaptive-algorithm
Efficient realization-of-an-adfe-with-a-new-adaptive-algorithmEfficient realization-of-an-adfe-with-a-new-adaptive-algorithm
Efficient realization-of-an-adfe-with-a-new-adaptive-algorithmCemal Ardil
 
Qubit data structures for
Qubit data structures forQubit data structures for
Qubit data structures forcsandit
 

Similar to Bca1040 digital logic (20)

Bca1040 digital logic
Bca1040  digital logicBca1040  digital logic
Bca1040 digital logic
 
Bt0064 logic design
Bt0064  logic designBt0064  logic design
Bt0064 logic design
 
Digital electronics k map comparators and their function
Digital electronics k map comparators and their functionDigital electronics k map comparators and their function
Digital electronics k map comparators and their function
 
Chapter 4: Combinational Logic
Chapter 4: Combinational LogicChapter 4: Combinational Logic
Chapter 4: Combinational Logic
 
Ec2203 digital electronics questions anna university by www.annaunivedu.org
Ec2203 digital electronics questions anna university by www.annaunivedu.orgEc2203 digital electronics questions anna university by www.annaunivedu.org
Ec2203 digital electronics questions anna university by www.annaunivedu.org
 
Module 2 logic gates
Module 2  logic gatesModule 2  logic gates
Module 2 logic gates
 
Bt0064 logic design-de
Bt0064 logic design-deBt0064 logic design-de
Bt0064 logic design-de
 
cs 3351 dpco
cs 3351 dpcocs 3351 dpco
cs 3351 dpco
 
Bt0064 logic design-de
Bt0064 logic design-deBt0064 logic design-de
Bt0064 logic design-de
 
Bt0064 logic design
Bt0064 logic designBt0064 logic design
Bt0064 logic design
 
Iisrt z swati sharma
Iisrt z swati sharmaIisrt z swati sharma
Iisrt z swati sharma
 
Smu bsc it sem 1 fall 2014 solved assignments
Smu bsc it sem  1 fall 2014 solved assignmentsSmu bsc it sem  1 fall 2014 solved assignments
Smu bsc it sem 1 fall 2014 solved assignments
 
Alg1 power points_-_unit_7_-_exponents_and_exponential_functions
Alg1 power points_-_unit_7_-_exponents_and_exponential_functionsAlg1 power points_-_unit_7_-_exponents_and_exponential_functions
Alg1 power points_-_unit_7_-_exponents_and_exponential_functions
 
Final Project Report
Final Project ReportFinal Project Report
Final Project Report
 
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptxECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
 
ECE 2103_L6 Boolean Algebra Canonical Forms.pptx
ECE 2103_L6 Boolean Algebra Canonical Forms.pptxECE 2103_L6 Boolean Algebra Canonical Forms.pptx
ECE 2103_L6 Boolean Algebra Canonical Forms.pptx
 
Mechanical Engineering Homework Help
Mechanical Engineering Homework HelpMechanical Engineering Homework Help
Mechanical Engineering Homework Help
 
Question bank digital electronics
Question bank digital electronicsQuestion bank digital electronics
Question bank digital electronics
 
Efficient realization-of-an-adfe-with-a-new-adaptive-algorithm
Efficient realization-of-an-adfe-with-a-new-adaptive-algorithmEfficient realization-of-an-adfe-with-a-new-adaptive-algorithm
Efficient realization-of-an-adfe-with-a-new-adaptive-algorithm
 
Qubit data structures for
Qubit data structures forQubit data structures for
Qubit data structures for
 

Bca1040 digital logic

  • 1. Dear students get fully solved assignments Send your semester & Specialization name to our mail id : “ help.mbaassignments@gmail.com ” or Call us at : 08263069601 ASSIGNMENT PROGRAM BCA SEMESTER 1 SUBJECT CODE & NAME BCA1040/IMC1040- DIGITAL LOGIC CREDIT 4 BK ID B0948 MAX.MARKS 60 Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme. 1 Solve each of the following 4-bit subtraction problems using 2’s complement representation. 1. (00110)2 – (00101)2 2. (0111)2 – (0001)2 Answer: The circuit has a Mode switch that allows you to choose between adding (M=0) and subtracting (M=1). To understand why this circuit works, let’s review binary addition and binary subtraction. We use 4-bit numbers in the examples because the main interactive circuit is a 4-bit adder–subtractor. Binary addition is certainly easier than 2 What is difference between minterm and maxterm? Express the following function F(x,y,z) = (x+z) y in form of minterm and maxterm? Answer:Minterm and maxterm: Each row of a truth table can be associated with a minterm, which is a product (AND) of all variables in the function, in direct or complemented form. A minterm has the property that it is equal to 1 on exactly one row of the truth table. 3 Draw truth table for following Boolean function 1. a) F(x,y) =(x+z)y 2. b) F(x,y) = xy +xy’
  • 2. Answer: Mathematics normally works with a two-valued logic: Every statement is either True or False.Youcan use truth tablestodetermine the truthorfalsityof a complicatedstatementbasedon the truth or falsity of its simple components. A statementinsentential logicisbuiltfromsimplestatementsusingthe logical connectives ~ , v,^,-,. I'll construct tables which show how the truth or falsity of a statement built with these connective depends on the truth or falsity of its components. 4 Simplify the following Boolean function using k map. F(A, B, C, D) = ∑m(0,2,3,5,6,7,8,10,11,14,15) Answer: 3-variable Karnaugh maps: Above we, place the 1's in the K-map for each of the product terms, identify a group of two, then write a p-term (product term) for the sole group as our simplified result. 5. Whatare sequential circuits?Explaindifferencesbetweensequential circuits and combinational circuits. Answer:Sequential circuits:- In digital circuittheory,sequential logicisa type of logic circuit whose outputdependsnotonlyonthe presentvalue of itsinputsignalsbutonthe past historyof itsinputs. Thisis incontrast to combinational logic,whose output is a function of only the present input. That is, sequential logic has state (memory) while combinational logic does not. Or, in other words, sequential logic is combinational logic with memory. Sequential logic is used to construct 6. What is difference between Ring counter and Johson counter? Answer : Ring counter A ring counter is a type of counter composed of a circular shift register. If the output of a shift register is fed back to the input a ring counter results. There are two types of ring counters:  A straightringcounteror Over beckcounterconnectsthe output of the last shift register to the first shift register input and circulates a single one (or zero) bit around the ring. For example, in a 4- register one-hot counter, with initial Dear students get fully solved assignments
  • 3. Send your semester & Specialization name to our mail id : “ help.mbaassignments@gmail.com ” or Call us at : 08263069601