Page 32 - B.Tech IT Curriculum and Syllabus R2017 - REC

Department of IT, REC

1. Students will be able to use Boolean simplification techniques to design a combinational
hardware circuit.
2. Ability to Design and Implement combinational and sequential circuits.
3. Students will be able to analyze a given digital circuit – combinational and sequential.
4. Ability to design the different functional units in a digital computer system
5. Students will be able to design and Implement a simple digital system.

LABORATORY REQUIREMENTS FOR BATCH OF 30 STUDENTS HARDWARE:
1. Digital trainer kits 30
2. Digital ICs required for the experiments in sufficient numbers
SOFTWARE:
1. HDL simulator.

SEMESTER III

MA17354 DISCRETE MATHEMATICS L T P C
3 2 0 4
OBJECTIVES:
 To extend student‘s Logical and Mathematical maturity and ability to deal with abstraction.
 To introduce most of the basic terminologies used in computer science courses and
application of ideas to solve practical problems.

UNIT I MATHEMATICAL LOGIC 15
Propositional Logic – Propositional equivalences – Rules of inference – normal forms.

UNIT II PREDICATE CALCULUS 15
Predicates and quantifiers-Nested Quantifiers-Rules of inference-introduction to Proofs-Proof
Methods and strategy.

UNIT III COMBINATORICS 15
Mathematical inductions-Strong induction -The basics of counting-The pigeonhole principle –
Permutations and combinations-Recurrence relations-Solving Linear recurrence relations-generating
functions-inclusion and exclusion principle and applications.

UNIT IV GRAPHS 15
Graphs -Graph terminology and special types of graphs-Representation of graphs - graph
isomorphism -connectivity-Euler and Hamilton paths.

UNIT V GROUPS AND BOOLEAN ALGEBRA 15
Algebraic systems-Groups-Subgroups and homomorphisms-Cosets and Lagrange‘s theorem- Posets-
Lattices-Boolean Algebra.

TOTAL : 75 PERIODS

OUTCOMES:
On completion of the course students will be able to
1. Apply the concepts of logic to test the validity of a program.
2. Arrive at inferences on logical structures.
3. Use the counting principles in implementing various programmes.
4. Handle a class of functions which transform a finite set into another finite set which relates to
input and output functions in computer science.

Curriculum and Syllabus | B.Tech. Information Technology | R2017 Page 32