subject title: discrete mathematical structures learn the fundamental concepts in discrete...
Post on 10-Mar-2020
Embed Size (px)
1. Learn the fundamental concepts in Discrete Mathematics and graph theory in view of its applications in
2. Solve problems by Applying concepts of mathematical logic, mathematical induction and set theory.
3. Illustrate the knowledge of counting techniques and Inclusion-Exclusion principle through problem
4. Apply the concepts graph, trees and cut-sets for problem solving.
SUBJECT TITLE: DISCRETE MATHEMATICAL STRUCTURES
SUBJECT CODE:18CS31 No. of Credits 4=4:0:0 No. of Lecture hours per
Exam Duration :3 hours CIE+Assignment+SEE
Total No. of contact
Syllabus Content No. of
1 Fundamentals Of Logic:
Propositions-Logical Connectives, Tautologies, Contradictions. Logic
Equivalence- Laws Of Logic, Duality, Inverse, Converse And Contrapositive,
Application To Switching Networks Logical Implication-Rules Of Inference.
Quantifiers-Types, Uses Of Quantifiers.
2 Set Theory:
Sets And Subsets, Set Operation, Laws Of Set Theory, Countable
And Uncountable Sets, Addition Principle, A First Word Of Probability.
Principle Of Counting:
Sum Rule, Product Rule, Permutation, Combination, Combination
3 Properties of Integer:
Mathematical Induction: The Well Ordering Principle, Induction
Principle, Method Of Mathematical Induction, Recursive Function.
Principle of Inclusion-Exclusion:
Principle Of Inclusion: Exclusion, Generalization, Derangement-
Nothing In Its Right Place, Rook Polynomial-N*N Board, Expansion Rule,
Statements Blooms Level
CO1 Demonstrate the knowledge of fundamental concepts in Discrete Mathematics and Graph theory.
CO2 Apply the concepts of logics, mathematical induction and set theory to solve the problems in Computer Science domain.
CO3 Analyze given problem and find solution by applying appropriate counting techniques and inclusion-exclusion principle.
CO4 Analyze given problem and solve by applying different graph algorithms and concepts of trees, cut-set.
PO’S PSO’S PO
CO1 2 1 1 1 1 2 2
CO2 3 3 2 1 1 1 2 2
CO3 2 3 1 1 1 1 1 2 2
CO4 2 3 2 1 1 1 1 2 2
Product Rule, Arrangement With Forbidden Position.
4 Graphs and Planar Graphs:
Basic Terminologies, Theorems, Isomorphism, Planar Graph,
Euler’s Formula, Elementary Reduction, Dual Of a Graph, Graph Coloring, Chromatic Polynomial, Decomposition Theorem, Multiplication Theorem.
5 Trees and Cut-Sets
Trees, Properties, Rooted Tree, Optimal Tree, Prefix Code,
Huffman’s Procedure, Spanning Tree, Minimal Spanning Tree, Prim’s Algorithm And Kruskal’s Algorithm, Dijkstra’s Algorithm, Cut-Set, Network Flow-Max Flow-Min Cut Theorem .
1. Ralph P. Grimaldi, B V Ramana: Graph Theory & Combinatorics, 5 th
Education (Listed Topics only from Unit-1, 8, 11, 12) .ISBN 978-81-7758-424-0.
2. J.P. Tremblay & R. Manohar: Discrete Mathematical Structure With Applications To
Computer Science Tata McGraw Hill Edition (Listed Topic only from Unit- 1, 2).ISBN 0-07-
1. C.L.Liu & D.P.Mohapatra: Elements Of Discrete Mathematics A Computer Oriented
Approach The McGraw-Hill Companies. ISBN-(13):978-0-07-066913-0
2. Kenneth H. Rosen: Discrete Mathematics & Its Applications, 6 th
Edition, Sixth reprint
2008, Tata –McGraw Hill. ISBN-(13):978-0-07-064824-1
3. Dr D S Chandrasekharaiah: Discrete Mathematical Structures, Prism Books PVT LTD.
FACULTY NAME: M S VINUTHA
1 Understand the basic digital principles and working of various logic gates, and different
techniques for simplification of Boolean function.
2. Design combinational logic circuits and describe their applications.
3. Analyze working of Flip Flops and sequential circuits.
4.Study the basic organization and architecture of digital computers such as CPU, memory, I/O,
5. Discussions of digital logic and microprogramming to understand the design and application
of computer systems and can be used as foundation for more advanced computer-related studies
SUBJECT TITLE: DIGITAL LOGIC AND COMPUTER DESIGN
Sub Code:18CS31 No. of Credits:4=4:0:1
hours/week : 4
Exam Duration : 3 hours CIE +Assignment +SEE =
45 + 5 + 50 =100
Total No. of Contact
Syllabus Content No. of
1 Combinational Logic Circuits:Binary Logic, Integrated Circuits, Boolean
Functions, Canonical And Standard Forms, The Map Method Two,Three,
Four -Variable Maps, Map Manipulation, Essential Prime
Implicants,Product-Of-Sums Optimization, Don’t-Care Conditions ,minimal sum and minimal product. The Tabulation Method, Determination Of Prime
Implicants, Combinational Logic Design Procedure, Adders, Subtractors,
Code Converter, Magnitude Comparator, Multilevel NAND –NOR Circuits.
2 Data processing circuits: Multiplexers, Demultiplexers, Decoder,
Encoders, Programmable logic devices, Read only memory, Programmable
Array Logic, Programmable Logic Arrays
3 Sequential Logic: Introduction,FLIP-Flops, Triggering Of Flip Flops, State
Reduction & Assignment, Excitation Tables, Design Procedure. Registers,
Shift Registers, Ripple Counter, Synchronous Counter, The Memory Unit...
1. M Morris Mano: Digital Logic and Computer Design, 14 th
Impression, Pearson, 2012.
1. M.Morris Mano and Charles Kime: Logic & Computer Design,Fundamentals,Pearson,2014
2. Andrew S Tenenbaum: Structured Computer Organization,Pearson,2006,
4 Processor Logic Design: Introduction, Processor Organization,Arithmetic
Logic Unit, Design Of Logic Circuit,Design Of Arithmetic Circuit, Status
Control logic design: Introduction, Control Organization, Hard Wired
Control, Micro Program Control, and Control of Processor Unit.
5 Computer Design: Introduction, System of Configuration, Computer
Instructions, Timing and Control, Execution of Instructions, Design of
Computer Register, Design of Control.
Microcomputer System Design:Introduction, Microcomputer
Organization, Microprocessor Organization, Instructions and Addressing
Modes, Memory Organization, Input Output Interface, Direct Memory
Statements Bloom’s Level
Demonstrate the various techniques like K-map, Quine-McCluskey
method for minimization of combinational functions. L3
Develop and Analyze different combinational and sequential circuits
using Logic gates, Multiplexers Decoders, PLA, Flip flops.
CO3 Describe the structure of CPU, memory and I/O unit L2
Discuss the design of logic circuits for arithmetic operation in
computer system L2
CO5 Illustrate the use of timing and control signal in the execution of
machine instructions of computer system L3
CO1 3 2 2 2 3 - - - - - - - 3 3 -
CO2 3 2 3 2 3 - - - - - - - 2 3 -
CO3 2 1 2 2 3 - - - - - - - 1 2 -
CO4 3 2 3 2 3 - - - - - - - 1 2 -
CO5 3 2 2 2 3 - - - - - - - 2 3 -
SREENIVASA A.H ARATHI P
Associate ProfessorAssistant Professor
The objectives of this course are to:
1. Understand the concept of pointers, arrays, structures and unions, dynamic memory
2. To analyse and implement some examples that comes under line