Discrete Mathematical Structures
Course Title:Discrete Mathematical
Structures
Course Code: :IS0401
Total Contact Hours: 4 Duration of SEE: 3 Hours
Semester End Examination Max. Marks:100 Continuous Internal Evaluation Max. Marks: 50
Lesson Plan Author: Pradeep kumar H SDate: 28/07/2017
Checked By: Date:
Course Outcomes:
On Successful Completion of the Course, the students will be able to:
1. Explain the fundamental principles of counting, permutation and combination theory.
2. Describe the basics of logic theory and its proofs.
3. Perform operations on Sets, Subsets and solve problems on probability.
4. Describe the discrete structures like functions and relations and apply the knowledge on
functions and its properties.
5. Apply the knowledge on relations and its properties.
6. Solve problems involving recurrence relations and Generating Functions.
UNIT 1: 7 Hrs
Fundamental Principles of Counting:
The Rules of Sum and Product, Permutations, Combinations – The Binomial Theorem.
Self Learning Exercise: Combinations with repetition.
UNIT 2: 9 Hrs
Fundamentals of Logic:
Basic Connectives and Truth Tables, Logical Equivalence: The Laws of Logic. Logical Implication: Rules of Inference, The Use of Quantifiers, Mathematical Induction.
Self Learning Exercise: Definitions, and the Proofs of Theorems.
UNIT 3: 9 Hrs
Set Theory:
Sets and Subsets. Set Operations and the Laws of Set Theory. Counting and Venn Diagrams. A First Word on Probability. The Axioms of Probability.
Self Learning Exercise: Conditional Probability: Independence.
UNIT 4: 9 Hrs
Functions:
Cartesian Products and Relations. Functions: Plain and One-to-One. Onto Functions: Stirling Numbers of the Second Kind, Special Functions, The Pigeonhole Principle.
Self Learning Exercise: Function Composition and Inverse Functions.
UNIT 5: 9 Hrs
Relations:
Properties of Relations. Computer Recognition: Zero-One Matrices and Directed Graphs. Partial Orders: Hasse Diagrams.
Self Learning Exercise: Equivalence Relations and Partitions
UNIT 6: 9 Hrs
Recurrence Relations:
First order linear recurrence relations, The Second order linear homogeneous recurrence relation with constant coefficients, Non Homogeneous recurrence relation.
Self Learning Exercise: Method of generating functions.
TEXT BOOK:
1. Discrete and Combinatorial Mathematics, Ralph.P.Grimaldi, Pearson Education. 5th Edition, 2004
REFERENCE BOOK:
1. Discreet Mathematical Structures with Applications to Computer Science J.P.Tremblay and Manohar , MCGraw-Hill International Edition.
2. A Treatise on Discrete Mathematical Structures, Jayant Ganguly, Sanguine- Pearson, 2010
3. Discrete Mathematics and its Applications, Kenneth H. Rosen: 7th Edition. McGraw Hill, 2010
E-BOOKS:
1. Discrete Mathematics: Schaum’s outline, Third Edition,Schaum’s Outline Series McGRAW-HILL
2. Applied Discrete Structures by Al Doerr, Ken Levasseur Publisher: Lulu.com 2013
MOOCs: 1. http://www.nptel.ac.in/courses/106106094/ 2. http://www.tutorialspoint.com/discrete_mathematics/
LOGIC DESIGN (4:0:0)
Sub Code : IS0402 CIE : 50% Marks
Hrs/Week : 04 SEE : 50% Marks
SEE Hrs : 03 Hrs Max. Marks : 100
Course Outcomes:
On Successful Completion of the Course, the students will be able to:
1. Understand the operation of basic gates and interpret basic Boolean laws, different methods of logic simplification. (Understand)
2. Determine output of data processing circuits, timer IC modes and operational amplifiers. (Analyze)
3. Understand different types of number system and operation of arithmetic building block. (Understand)
4. Describe operation of different types of Flip- Flops. (Understand)
5. Understand working of shift register and operation of synchronous, asynchronous and decade counter. (Understand)
6. Design of SequentialCircuits using moore and mealy model. (Create)
UNIT1: 9Hrs
DigitalLogic:
OverviewofBasicGates—NOT,OR,AND;UniversalLogic Gates—NOR,NAND;AND-OR-InvertGATES;Positiveand Negative Logic; Introduction to HDL
CombinationalLogicCircuits:
BooleanLawsAndTheorems;SOPMethod; TruthTabletoK-Map;Pairs,Quadsand Octets;KarnaughSimplifications; Don‘t-careConditions;POSMethod;POSSimplification; SimplificationbyQuine-McCluskyMethod, HDL Implementation Models
SelfLearningExercise: Conversion between SOP and POS.
UNIT2: 9Hrs
Data-ProcessingCircuits:
Multiplexers; Demultiplexers; BCD-to-decimal Decoders; Encoders; Ex-or GATES; Parity Generators and Checkers; HDL Implementation of Data Processing Circuits, Clocks and Timing Circuits- Clock Waveforms; Schmitt Trigger, 555 Timer- Astable, Monostable.
SelfLearningExercise:TTL Clock
UNIT3: 8Hrs
NumberSystemsandCodes:
Binary Number System; Binary-to-decimal Conversion; Hexadecimal Numbers; The ASCII Code; The Excess-3 Code; The Gray Code
ArithmeticCircuit:
Binary Addition; Binary Subtraction; 2‘S Complement Representation; 2‘S ComplementArithmetic;ArithmeticBuildingBlocks;TheAdder-subtracter,ArithmeticLogicUnit; Binary Multiplication and Division.
SelfLearningExercise:Unsigned Binary Numbers; Sign-magnitude Numbers;
UNIT4: 9Hrs
Flip-Flops:
RSFlip-flops;GatedFlip-flops;Edge-triggeredRSFlip-flops; Edge-triggeredDFlip-flops;Edge-triggeredJKFlip-flops Master-slave Flip-flops; Various RepresentationsofFlip-flops;ConversionofFlip-flops: A Synthesis Example
SelfLearningExercise: Flip-flop Timing; AnalysisofSequentialCircuits;
UNIT5: 8Hrs
RegistersandCounters:
TypesofRegisters;SerialIn–SerialOut;SerialIn–Parallel Out; Parallel In–Serial Out Parallel In–Parallel Out; Asynchronous Counters-Ripple counter mod 16, 3 bit up-down counter; Synchronous-mod 8 binary counter, parallel up-down Counters;Decade Counters- mod 5 counter.
SelfLearningExercise:Applications of Shift Registers; DecodingGates;
UNIT6: 9Hrs
DesignofSequentialCircuits:
ModelSelection;StateTransitionDiagram;StateSynthesisTable;DesignEquationsandCircuitDiagram;Implementation UsingReadOnlyMemory;AlgorithmicStateMachine;State ReductionTechnique
SelfLearningExercise:DesignofAsynchronousSequential Circuit.
TEXTBOOK:
1. Digital Principles and Applications, D P Leach, Albert Paul Malvino, G Saha, Tata McGraw-Hill, 7th Edition, 2011.
REFERENCEBOOK:
1. Logic and Computer Design Fundamentals, M. Morris Mano, Charles R.Kime, Pearson Edu.TMH, 2nd Edition 2013.
2. Fundamentals of Logic Design, Charle H Roth, Jr.,Thomson, 5th Edition, 2010.
3. FundamentalsofDigitalLogicwithVerilogDesign,Stephen Brown, VonkoVranesic, TMH, 2nd
Edition, 2010.
E-BOOKS:
1. http://nsdl.oercommons.org/courses/digital-logic
2. http://www.collegeopentextbooks.org/textbook listings/text- books -by-subject/computer science
3. http://nsdl.oercommons.org/courses/lab-2-introduction-to-vhdl/view
4. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science
MOOCs: http://oscar.iitb.ac.in/ComputerScience
DATA STRUCTURES (4:0:0)
Sub code : IS0403 CIE : 50% Marks
Hrs/week : 04 SEE : 50% Marks
SEE Hrs : 03 Hours Max. Marks: 100
Course Outcomes:
On Successful Completion of the Course, the students will be able to:
1. Apply the concept of pointers. 2. Explain the basic concepts of stacks. 3. Analyze and solve the problems using types of Queues. 4. Discuss linked list operations and its implementation. 5. Design and implement the circular list. 6. Construct the non – linear data structure – trees.
UNIT 1: 9 Hrs
Pointer: Understanding pointers, Pointer variables, Accessing address of a variable, Initialization of pointer variables, Accessing variables through pointers, Chain of pointers, Pointer expressions, Pointer Arithmetic and arrays, Array of pointers, Pointers as function argument, Function returning pointers, Pointers to function.malloc, free
Self Learning Exercise:Dynamic memory allocation –calloc, realloc,Similarity between pointers and subscripted variables.
UNIT 2: 9 Hrs
Abstract Data Types: Introduction. Stack: Definition and examples, Representing stacks in C, An example: Infix, Postfix, Prefix. Recursion: Recursive definition and processes. Recursion in C, Writing recursive programs
Self Learning Exercise:Application ofstacks
UNIT 3: 8 Hrs
Queue: The Queue and its representation and implementation, Circular Queue implementation.
Self Learning Exercise:Priority Queue
UNIT 4: 9 Hrs
Linked Lists1: Inserting and Removing nodes from a list, Implementation of stacks, getnode and freenode operations, Linked implementation of queues, Linked list as a data structure, Example of list operations, Header nodes, List in C. Allocating and freeing dynamic variables. Linked lists using dynamic variables.
Self Learning Exercise:Comparison of lists and arrays with respect to insertion, deletion and storage.
UNIT 5: 9 Hrs
Linked Lists2: Queues as lists in C, Examples of list operations in C, Circular lists, Stack as a circular lists, Queue as a circular list, Primitive operations on circular lists.Double linked list
Self Learning Exercise:Need for a header node
UNIT 6: 8 Hrs
Binary tree: Operations on binary trees, Application of binary trees, Node representation of binary trees, Internal and external nodes, Implicit array representation of binary trees, Choosing a binary tree representation, Binary tree traversal in C.
Self Learning Exercise:Threaded binary trees
TEXT BOOK:
1. Data Structures using C, Aaron M Tenenbaum, YedidyahLangsam and Moshe J Augenstein, 2009, Pearson education, low price edition.
REFERENCE BOOKS:
1. Programming in ANSI C, E Balagurusamy, Fifth Edition, 2011, Tata McGraw-Hill(for Unit – 1) 2. Data Structures, A Pseudocode Approach with C,Richar F Gilberg and BehronzAForouzan,
Thomson, 2005. 3. Computer Science, A Structured Programming Approach using C,Richar F Gilberg and
Behronz a Forouzan, Thomson, second edition, 2003. 4. Fundamentals of Data Structures in C, Horowitz, Sahni, Anderson-Freed, 2nd Edition,
Universities Press 2007.
ONLINE RESOURCES:
1. A Tool for Data Structure Visualization is available at https://www.cs.usfca.edu/~galles/visualization/Algorithms.html
2. In this paper, a software application that features the visualization of commonly used data structures and their associated insertion and deletion operations is introduced. In addition, this software can be used to animate user-defined algorithms. www1bpt.bridgeport.edu/~risc/pdf/jp29.pdf
OBJECT ORIENTED PROGRAMMING
Course Outcomes:
On Successful Completion of the Course, the students will be able to:
1. Explain the various principles of Object Oriented Programming. 2. Formulate the Objects and classes in the real world application 3. Discuss the concepts of references, dynamic allocation, function overloading and copy
constructors. 4. Apply the concepts of Operator overloading and inheritance. 5. Apply Virtual functions, Templates and exception handling. 6. Use the basic I/O operations and file I/O operations in C++.
UNIT 1: 6Hrs
Principles of Object-Oriented Programming:
Software crisis, software evolution ,A Look at Procedure-Oriented Programming, Object Oriented programming paradigm, Basic Concepts of Object-Oriented Programming, Benefits of OOP, Object-Oriented Languages, Applications of OOP.
Beginning with C++:
What is C++? , Applications of C++, A Simple C++ Program, More C++ Statements.An Example with Class, Structure of C++ Program
Self Learning Exercise: C++ program for simple problems
UNIT 2: 09Hrs
Tokens, Expressions and Control Structures:
Introduction, Tokens, Keywords, Identifiers and Constants, Basic Data Types, User-Defined Data Types, Derived Data Types, Symbolic Constants, Type Compatibility, Declaration of Variables, Dynamic Initialization of variables, Reference variables, Operators in C++, Scope Resolution Operator, Member Dereferencing Operators, Memory Management Operators, Manipulators, Type Cast Operator, Expressions and their Types, Special Assignment Expressions, Implicit Conversions, Operator Overloading, Operator Precedence, Control Structures, C++ Keywords.
Functions: main function , function prototyping , call by reference , return by reference , inline function , default arguments.
Classes and Objects:
Introduction , C Structures revisited , specifying a class, defining member functions , C++ program with class, making an outside function inline, nesting of member functions, private member functions, arrays with in a class, memory allocation for objects , arrays of objects , objects as function arguments , Friend Functions, returning objects , const member functions, pointers to members.
Self Learning Exercise: object Assignment : examples of Destructors
UNIT 3: 10Hrs
Arrays, pointers, References, and the Dynamic Allocation Operators:
Constructors , Parameterized Constructors , multiple constructors in a class, constructors with default arguments, dynamic initialization of objects, copy constructor , dynamic constructors and Destructors.Arrays of Objects- Creating Initialized vs. Uninitialized Arrays, pointers, pointer to Derived Types, Pointers to Class Members, References – Reference Parameters, Passing References to Objects and Returning References., C++’s Dynamic Allocation Operators- Initializing Allocated Memory, Allocating Arrays and Allocating Objects.
Function Overloading, Copy Constructors, and Default Arguments:
Function Overloading, Copy Constructors, Default Function Arguments – Default Argument vs. Overloading.
Self Learning Exercise: Using Default Arguments Correctly.
UNIT 4: 10Hrs
Operator Overloading:
Introduction , defining operator overloading , overloading unary operators, overloading binary operators, overloading binary operatorsusing friends , manipulation of strings using operators, examples , rule for overloading operators.
Inheritance:
Introduction , defining derived classes, single inheritance , making a private member inheritable , multilevel inheritance , multiple inheritance , hierarchical inheritance , hybrid inheritance , virtual base classes , abstract classes , constructors in derived classes.
Self Learning Exercise: Member Classes , Nesting of classes
UNIT 5: 09Hrs
Pointers ,Virtual Functions and Polymorphism:
Introduction , pointers, pointers to objects , this pointer , pointer to derived classes , virtual functions , pure virtual functions , virtual constructor and destructors.
Templates:
Introduction , class templates, class templates with multiple parameters , function templates , function templates with multiple parameters, overloading of templates functions, member function templates , nontype template arguments
Exception Handling:
Introduction , basics of exception handling , exception handling mechanism , throwing mechanism , catching mechanism , rethrowing an exception , specifying exceptions.
Self Learning Exercise: Exception in Constructors and Destructors.
UNIT 6: 8 Hrs
Managing console I/O operations
Introduction ,C++ Streams, The C++ Stream Classes, unformatted I/O operations , Formatted console I/O operations, - managing output with manipulators, working with files: classes for file stream operations , opening and closing a file , detecting end of file, more about open () , file pointers and their manipulators, sequential input and output operations , random access, erroe handling during file operations.
Manipulating strings:
Introduction , creating string objects, manipulating string objects, relational operations , string characteristics, accessing characters in strings , comparing and swaping.
Self Learning Exercise: command line arguments
TEXT BOOKS:
1. C++ The Complete Reference, Herbert Schildt, TMH, 4th Edition. 2. Object Oriented Programming with C++, E Balagurusamy, 6th Edition.
REFERENCE BOOKS:
1. The C++ programming language, Bjarne stroustrup, Pearson Education, 3rd Edition. 2. C++ Primer, Stanley B.Lippman and Josee Lajore, Addison Wesley, 3rd Edition.
E-Book: OOP: Learn Object Oriented Thinking and Programming by Rudolf Pecinovsky - Eva & Tomas Bruckner Publishing ,2013
MOOCs: www.indus.ac.in
http://www.studytonight.com/cpp/cpp-and-oops-concepts.php
LOGIC DESIGN LABORATORY (0:0:3)
Sub Code : IS0101 Max. Marks : 50
Hrs/Week : 03
CourseOutcomes: OnSuccessfulCompletionoftheCourse,thestudentswillbeableto:
1. Apply acquired knowledge to explore working ofbasicgates,data processingcircuitsflip-flopcircuits and shift registers.(Apply)
2. Demonstrate design and working of different types of counters, amplifiers, multivibratorand relate simulated result with the practical approach.( Apply)
Experiments are on the following topics:
1. Basic Gates and Universal gates 2. Multiplexers and De-multiplexers 3. Decoders 4. JK Master Slave flip flops 5. Shift Registers 6. Synchronous and Asynchronous counters
Experiments:
1. Understand the working of basic gates and implementation of basic gates using universalgates NAND and NOR.
2. Develop following dataprocessingcircuitsusing Basic gates / NAND gates and verify the truth table • 4:1 Multiplexer, • 1:4 Demultiplexer • 2:4 Decoder
3. Developfollowing Arithmetic Building Blocks using Basic gates / NAND gates and verify the truth table • Halfadder and Halfsubtractor • Full adder and Fullsubtractor
4. Develop JK Master Slave flip-flop circuits and realize Truth – Table
5. Verify following operations using Shift Registers • Serial in-Serial out • Serial in-Parallel out • Parallel in-Serial out • Parallelin-Parallel out
6. Design and implement a Mod-N Synchronous counters using JK flip-flop and verify truth
table.
7. Design and implement an Asynchronous counters using decade counter IC to count up from 0 to n (n ≤ 9).
8. Develop Ring counter and Johnson counter using IC 7495. Experiments using VHDL/Verilog:
9. Construct VHDL/Verilog code for basic gate, Multiplexer / De-multiplexer, simulate and verify its working.
10. Construct VHDL / Verilog code for Adder/ Subtractor, Counter simulate and verify its working.
TEXTBOOK:
1. LogicandComputerDesignFundamentals,M. MorrisMano,CharlesR.Kime,PearsonEdu.TMH, 2n dEdition 2013.
2. DigitalPrinciples and Applications, D P Leach, Albert Paul Malvino, Goutam saha, TataMcGraw-Hill, 7thEdition, 2011.
3. FundamentalsofDigitalLogicwith V H D L , Stephen Brown, ZvonkoVranesic, TMH, 3rd
Edition, 2015. REFERENCEBOOK:
1. Fundamentalsof Logic Design, Charle H Roth, Jr.,Thomson, 5thEdition,2010.
E-Content: 1. http://nsdl.oercommons.org/courses/lab-2-introduction-to-vhdl/view
MOOC’s:http://oscar.iitb.ac.in/ComputerScience Evaluation Pattern:
Continuous Internal Evaluation (CIE) - 25 Marks Session End Test (SET) -25 Marks
---------------- Total – 50 Marks
---------------- General Instructions
1. If a student completes the experiment of the day, faculty can conduct extra related experiments
to
improve the students experimental and lab skills.
2. Rules to get the minimum CIE, Attendance, eligibility to take up SET need to be followed.
3. In SET, change of experiment is allowed only once by deducting 3 marks in the Procedure.
IV SEMESTER
ENGINEERING MATHEMATICS – IV (4:0:0)
(ISE & CSE)
Sub Code : MA0410 CIE : 50% Marks
Hrs/Week : 04 SEE : 50% Marks
SEE Hrs : 03 Hrs Max. Marks : 100
Course Outcomes:
On Successful completion of the course, the students will be able to:
1. Use numerical techniques to solve ordinary and simultaneous differential equation with initial conditions.
2. Apply the concept of analytic functions to solve fluid flow problems and compute the images of certain plane curves under the given conformal transformation.
3. Compute complex line integrals using Cauchy’s theorem. 4. Apply the method of least square to predict the best fitting curve for a given data and solve
problems on correlation and regression 5. Solve problems associated with discrete and continuous probability distribution. 6. Solve problems associated with discrete joint distribution, Markov chain using transition
probability matrix and explain the concept of queuing theory.
UNIT 1: 9 Hrs
Numerical Methods:
Numerical solutions of first order and first degree ordinary differential equations – Taylor’s method, Modified Euler’s method, Runge-Kutta method of fourth order. Milne’s predictor and corrector method (no proof). Simultaneous differential equations using Taylor’s and RungeKutta methods. (SLE: Solution of second order ordinary differential equations using Taylor’s and Runge-Kutta methods).
UNIT 2: 9 Hrs
Complex Variables – 1:
Function of a complex variable – Limit, Continuity, Differentiability – Definitions. Analytic functions, Cauchy-Riemann equations in Cartesian and polar forms, Properties of analytic functions. Construction of analytic functions-Applications. Conformal Mapping – Definition. Discussion of w = z2, w = z + (a2 / z), z ≠0. [SLE: w = sinz, ez].
UNIT 3: 8 Hrs
Complex Variables – 2:
Bilinear transformations, Complex line integral, Cauchy’s theorem, Cauchy’s integral formula. Laurent series expansion, (SLE: problems on Laurent series) Poles, Residues, Problems on Cauchy’s residue theorem.
UNIT 4: 9 Hrs
Statistics:
Curve fitting by the method of least squares: straight line, parabola and exponential curve of the type y = abx and y = aebx (SLE: To fit curves of the type y = axb ) Correlation and Regression, Multiple correlation and Regression Analysis.
UNIT 5: 9 Hrs
Probability – 1:
Random variables: Discrete random variables, Binomial, Poisson distributions. Continuous random variables, Exponential and Normal distributions. (SLE: Mean and SD of Poisson & Normal distributions).
UNIT 6: 8 Hrs
Probability - II
Joint probability distribution (Discrete), Markov chains – probability vector, stochastic matrix, transition probability matrix. Concept of queuing – M/M/I and M/G/M queuing system. (SLE: Continuous joint probability distribution).
TEXT BOOK:
1. Higher Engineering Mathematics – Dr. B.S. Grewal, 42nd edition Khana Publications.
2. Advanced Engineering Mathematics - Erwin Kreyszig, wiley publications, 10th Edition.
REFERENCE BOOKS:
1. Advanced Engg. Mathematics – H. K. Dass (2008 edition), Chand Publications.
2. Higher Engg. Mathematics – B. V. Ramanna (2010 edition), Tata McGraw-Hill Publications.
3. Probability, Statistics and Random Processes-3rd Edition,Tata McGraw-Hill Publishing Company Limited,New Delhi,2008- T.Veerarajan.
GRAPH THEORY AND COMBINATORICS (4:0:0)
Sub Code : IS0405 CIE : 50% Marks
Hrs/Week : 04 SEE : 50% Marks
SEE Hrs : 03 Hrs Max. Marks : 100
Course Outcomes:
On Successful completion of the course, the students will be able to:
1. Explain the knowledge of fundamental concepts in graph theory, including properties and characterization of different types of graphs.
2. Understand additional concepts and terms in graph theory and illustrate with an example how to solve actual problem using graph theory
3. Discuss the significance of planarity and other concepts from theoretical and practical point of view.
4. Demonstrate the concept of Trees, its properties and types.
5. Apply the various Optimizing and Matching algorithms to solve real world problems.
6. Analyze the applications of Inclusion and Exclusion principle in combinatorial mathematics.
UNIT 1: 9 Hrs
Introduction to Graph Theory:
Definitions and Examples, Subgraphs, Complements and Graph Isomorphism, Vertex Degree
and Handshaking property
Self Learning Exercise: Operations on Graphs
UNIT 2: 9 Hrs
Paths and Circuits:
Walks, Paths, Circuits and Cycles, Connected graphs, disconnected graphs and components,
Euler Trails and circuits, Konigsberg Bridge Problem, Hamiltonian Paths and Cycles.
Self Learning Exercise: Traveling Salesman Problem.
UNIT 3: 9 Hrs
Planar Graphs :
Planar, Non-planar graphs, Bipartite and Complete Bipartite graphs, Kuratowski’s graphs,
Euler’s formula, Detection of planarity, Dual of a planar graph, Graph coloring and
Chromatic polynomials: Decomposition theorem, Multiplication theorem
Self Learning Exercise: Map Coloring
UNIT 4: 9 Hrs
Trees:
Definitions, Properties and Examples, Rooted Trees, Spanning trees, Trees and Sorting, Weighted Trees and Prefix Codes.
Self Learning Exercise: Biconnected Components and Articulation Points.
UNIT 5: 8 Hrs
Optimization and Matching :
Dijkstra’s Shortest Path Algorithm, Minimal Spanning Trees: The Algorithms of Kruskal and Prim,
Transport Networks: The Max Flow and Min-Cut Theorem
Self Learning Exercise: Matching Theory.
UNIT 6: 8 Hrs
The Principle of Inclusion and Exclusion: The Principle of Inclusion and Exclusion,
Generalizations of the Principle, Derangements – Nothing is in its Right Place, Rook Polynomials
Self Learning Exercise: Arrangements with forbidden positions
TEXT BOOKS:
1. Discrete and Combinatorial Mathematics by Ralph P. Grimaldi, PHI, 5th Edition, 2004.
2. Graph Theorywith Applications to Engineering and Computer Science by Narsingh Deo, Prentice-Hall, 2004
REFERENCE BOOKS:
1. Graph Theory and Combinatorics by D.S. Chandrasekharaiah: Prism, 2005.
2. Discrete Mathematics by Seymour Lipschutz and Marc Lipson, 2nd Edition.
EBOOKS:
1. http://ocw.mit.edu/courses/Mathematics for computer-science/Readings 2. http://ntcl.ac.in 3. http://www.iro.umontreal.ca/~hahn/IFT3545/GTWA.pdf
MOOC: For Animations - http://www.visualgo.net
COMPUTER ORGANIZATION (4:0:0)
Sub Code : IS0406 CIE : 50% Marks
Hrs/Week : 04 SEE : 50% Marks
SEE Hrs : 03 Hrs Max. Marks : 100
Course Outcomes:
On Successful completion of the course, the students will be able to:
1. Describe the instruction execution in a typical computer
2. Analyze a central processing unit (CPU) through its constituent parts like arithmetic logic unit (ALU), data path, buses and the controller unit using micro-programmed approach.
3. Apply the concept of microprogramming to add instructions to the instruction set by incorporating more micro-programs into the control memory.
4. Analyze various ways to speed up processor ( by incorporating instruction fetch unit, cache memory, pipelining and branch prediction)
5. Compare different Data paths (mic-1, mic-2, mic-3) with respect to cost and speed of execution.
6. Explain different addressing modes and expanding op-codes of an instruction.
UNIT 1: 8 Hrs
Computer systems organization : Organization of a simple Computer. Data path of atypical von neumam machine, Instruction Execution, An interpreter for a simple computer.
Primary Memory: Memory Addresses, byte ordering. General structure of a Memory chip. Address lines, Data lines, Chip select line, read write lines. Operation of a memory, read and write.
Secondary Memory: Memory Hierarchy (registers, cache, main memory, disk)
Clocks: division of the clock into sub-cycles (for providing timereferences for multiple events), generation of an asymmetric clock.
Self Learning Exercise: Need for cache Memory (exclude design of cache memory as it will be studied later).
UNIT 2: 9 Hrs
ALU: Logic diagram of a one-bit ALU. Getting a 32 bit ALU by using many bit slices.
Memory: Memory Organization, Logic diagram of a 4X3 memory (address selection, chipselect enabling, generating read, write, output-enable etc.). Memory Chips- using multiple memory chips to organize the required memory (required size and width may be more than size and width of available memory chips).
I/O interfacing: Creating input and output ports using latches and buffers.
Memory interfacing: interfacing single and multiple chips to CPU
Self Learning Exercise: Need for Chip select
UNIT 3: 9 Hrs
The microarchitecture level : An Example Microarchitecture ,the Data Path, ALU signals and functions performed,32 bit registersection, 32 bit ALU, 32 bit shifter, the precise timing of the data-path, timing diagram for one data path cycle- setting up of control signal, loading of registers, operating ALU and shifter, propagation of results. Memory operations:32-bit word-addressable memory port, 8-bit byte addressable memory port, MAR for word addressing, PC for byte addressing, Organizing the 4 GB byte oriented memory as 4-byte word and 1 byte word memory, sign extension of one byte data into a 32bit data. Microinstructions: signals for controlling the data-path, Micro-instruction format, Microinstruction Control, The Mic-1:the complete micro-architecture, Control store, Micro-program counter, Micro-instruction register etc. The operation of the micro-architecture: Mic-1.
Self Learning Exercise: Operations not possible in one Cycle.
UNIT 4: 9 Hrs
Instruction set ( ISA ) to be implemented by Mic-1: BIPUSH, DUP, GOTO, IADD, IFEQ, IF_ICMPEQ, IINC, ILOAD, IOR, ISTORE, NOP, POP, SWAP.
(Note: omit INVOKEVIRTUAL, IRETURN, LDC-W, WIDE).
Compiling a high level language to Mic-1 instruction set.
An Example Implementation: Microinstructions and Notation, Implementation of theinstruction set by Mic-1. (i.e., micro-programs for all the macro instructions mentioned above).
Self Learning Exercise: Implementation ofAND, ISUB,IFLT instructions.
UNIT 5: 9 Hrs
Design Of The Microarchitecture Level : Speed versus Cost, Reducing the Execution PathLength , merging the interpreter loop with microcode, going from a two bus architecture to a three bus architecture, Adding an instruction fetch unit (IFU) to Mic-1. A finite state machine for implementing the IFU.
A Design with Prefetching: The Mic-2 , The data path for Mic-2, Implementation of micro-programs for the instruction set in Mic-2.
Self Learning Exercise:A Pipelined Design: The Mic-3, mic-3 data-path (pipelined model), microstep
of mic-3,instruction execution on mic-3 (i.e., the execution of the pipe-line)
UNIT 6: 8 Hrs
Improving Performance Cache Memory, Design of Cache memory:Direct mapped cache: design, set associativecaches.
The instruction set architecture level: Expanding opcodes, addressing modes- immediateaddressing, direct addressing, Register addressing, register indirect addressing, indexed addressing, based-indexed addressing, orthogonality of opcodes and addressing modes.
Branch Prediction, Dynamic branch prediction, static branch prediction,
Self Learning Exercise: Advantages and Disadvantages of direct and set associative cache memory.
TEXT BOOKS:
1. Structured Computer Organization: Andrew S. Tannenbaum, 5thedition, 2005 (5thedition isavailable in Indian reprint Pearson/Prentice hall publication.)
REFERENCE BOOKS:
1. Douglas E. Comer “Computer Architecture”, Pearson publication 2007 (The book is an outcome of the author’s efforts to salvage an undergraduate computer organization course at PURDUE university (USA) which had suffered years of neglect as a result of being taught by a series of professors (mostly visitors) with little or no background in digital hardware!- read the first para of PREFACE of the book).
2. Malvino “Digital computer Electronics:An introduction to microcomputers, second edition(presently out of print- look for an old copy) . The author has come up with his own „educational computer called SAP--Simple As Possible--which has 3 generations, SAP-1,SAP-2 and SAP-3, which is a look-alike of 8085.
3. Patterson and Hennessy, “A quantitative approach to computer architecture” (a monumental book on computer architecture)
4. Williaum Stallings, “Computer organization and Architecture”, A general text on computer Architecture.
5. Morris mono, “Logic and computer design fundamentals” , A good reference for digital logic design, CPU design and I/O.
Online Resource:Mic IJVM Simulator
Mic IJVM simulator is a software which implements the IJVM on Mic-1 microarchitecture described in the book of Andrew S. Tanenbaum, Structured Computer Organization.
The software available here is designed to support instructors and students using this text.
http://www.supereasyfree.com/software/simulators/structured-computer-organization-tanenbaum/mic-1-ijvm-simulator/mic-ijvm-simulator.php
This simulator is used only for IJVM exercise
ANALYSIS AND DESIGN OF ALGORITHMS (4:0:0)
Sub Code : IS0407 CIE : 50% Marks
Hrs/Week : 04 SEE : 50% Marks
SEE Hrs : 03 Hrs Max. Marks : 100
Course Outcomes:
On Successful completion of the course, the students will be able to:
1. Explain the need for algorithms and the basic techniques of analyzing efficiency of the algorithms.
2. Explain the efficiencies of recursive and non-recursive algorithms.
3. Analyze and design algorithms using Divide and conquer techniques.
4. Apply and design algorithms using Dynamic Programming techniques.
5. Determine the efficiency and design the algorithms using greedy techniques
6. Classify the NP problems and explain the limitations of algorithm power.
UNIT 1: 9 Hrs
Analysis of algorithms:
Introduction, What is an algorithm?, Fundamentals of Algorithmic Problem Solving, Fundamentals of the Analysis of Algorithm Efficiency ,the Analysis Framework, Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of Non-recursive Algorithms, Mathematical Analysis of Recursive Algorithms
Self Learning Exercise: Exercise problems on Mathematical Analysis of Recursive Algorithms.
UNIT 2: 8 Hrs
Brute Force, Exhaustive Search:
Brute force :Selection Sort , Bubble Sort , Sequential Search and Brute-Force String. Matching, Exhaustive Search: Traveling Salesman Problem, Knapsack Problem, Depth-First Search and Breadth- First Search.
Self Learning Exercise: Solving Assignment problem using Exhaustive Search.
UNIT 3: 8 Hrs
Decrease-and-Conquer and Divide-and-Conquer
Decrease-and-Conquer: The method, Applications: Insertion Sort, Topological Sorting, Interpolation Search. Divide and Conquer: The method, Applications: Mergesort, Quicksort, and Strassen‘s Matrix Multiplication.
Self Learning Exercise: The Closest-Pair Problems.
UNIT 4: 9 Hrs
Greedy Technique and Transform-and-Conquer:
Greedy Technique: The method, Applications: Prim‘s Algorithm, Kruskal‘s Algorithm, Dijkstra‘s Algorithm, Huffman Trees and Codes. Balanced Search Trees: The method, Applications: AVL Trees, 2-3 Trees. Heaps and Heap-sort: Notion of the Heap, Heap-sort.
Self Learning Exercise: Problems on Heap Sort.
UNIT 5: 9 Hrs
Dynamic Programming and SPACE-TIME TRADEOFFS:
Dynamic Programming: The method, Applications: The Knapsack Problem and Memory Functions, Warshall‘s and Floyd‘s Algorithms Space-Time Tradeoffs: The method, Applications: Introduction, Sorting by Counting. Input Enhancement in String Matching using harspool’sSring matching.
Self Learning Exercise: Boyer moore’s String matching.
UNIT 6: 9 Hrs
Coping with the Limitations of Algorithm Power:
Backtracking: The method, Applications: n-Queens Problem, Hamiltonian circuit Problem, Subset-Sum Problem Branch-and-Bound: The method, Applications: Assignment Problem, Knapsack Problem.
Self Learning Exercise: Limitations of Algorithm Power P, NP, and NP-Complete Problems
TEXT BOOK:
1. Introduction to the Design & Analysis of Algorithms by Anany Levitin, 3rdEdition, 2011
2. Data structures, Algorithms and Applications in C++ by SartajSahni, TMH, 2nd Edition, 2004
REFERENCE BOOK:
1. Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein, 3rd Edition
Online resources:
1. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science for video lectures
2. www.nptel.com/algorithms for algorithm lecture notes
3. www.wikipedia.com/algorithms for primary information
FINITE AUTOMATA AND FORMAL LANGUAGES(3:2:0)
Sub Code : IS0408 CIE : 50% Marks
Hrs/Week : 05 SEE : 50% Marks
SEE Hrs : 03 Hrs Max. Marks : 100
Course Outcomes:
On Successful completion of the course, the students will be able to:
1. Analyze different concepts of Automata Theory.( Analyze)
2. Apply properties of regular language .( Apply)
3. Construct parse trees for CFG.(Apply))
4. Construct Push Down Automata .( Apply)
5. Construct Turing Machine .( Apply)
6. Describe properties of Context Free Language and undecidable problem. (Understand)
UNIT 1: 6 Hrs
Introduction to Finite Automata:
Introduction to Finite Automata, the central concepts of Automata theory, deterministic finite automata, non-deterministic finite automata, and application. Finite automata with Epsilon transition.
Self Learning Exercise: Extended transitions and Languages for Є- NFA.
UNIT 2: 7 Hrs
Regular Expressions and Languages, Properties of Regular Languages:
Regular Expression, Finite Automate and Regular Expressions, Proving languages not to be regular, Closure Properties of Regular Languages, Decision Properties of Regular Languages, Equivalence and minimization of automata.
Self Learning Exercise: Applications of Regular Expressions.
UNIT 3: 7 Hrs
Context-Free Grammars and Languages:
Context-free grammars, Parse trees, Applications, Ambiguity in grammars and languages.
Self Learning Exercise: Removing Ambiguity in grammars.
UNIT 4: 6 Hrs
Pushdown Automata:
Definition of the Pushdown automata, The languages of a PDA, Equivalence of PDA’s and CFG’s, Deterministic Pushdown Automata.
Self Learning Exercise: PDA to CFG
UNIT 5: 7 Hrs
Problems that computers cannot solve, The Turing Machine, Programming techniques for Turing machines, extension to the basic Turing machine, Restricted Turing Machine.
Self Learning Exercise: Turing Machine and Computers.
UNIT 6: 7 Hrs
Undecidability:
A Language that is not recursively enumerable, AN undecidable problem that is RE, Post’s Correspondance problem.
Properties of Context Free Languages
Normal forms for CFGs, The pumping lemma for CFGs.
Self Learning Exercise: Closure properties of CFLs.
TEXT BOOK:
1. Introduction to Automata Theory, Languages and Computation, J.P. Hopcroft, Rajeev Motwani, J.D. Ullman, Pearson Education, 3rd Edition, 2012.
REFERENCE BOOKS:
1. Introduction to Languages and Theory of Computation, John Martin, Tata McGraw Hill, 3rd Edition, 2014.
2. Introduction to Computer Theory, Daniel I.A., Cohen, John Wiley and Sons, Inc, 2nd Edition, 2011.
3. An Introduction to Formal Languages and Automata, Peter Linz, Narosa Publishing House, 5th Edition, 2011.
4. Introduction to the Theory of Computation, Michael Sipser, Course Technology, 2nd edition, 2013.
EBOOKS:
1. Finite Automata and Regular Expressions: Problems and Solutionsby Stefan Hollos, J. Richard Hollos, Abrazol Publishing, 2013.
MOOCs:
1. https://www.coursera.org/course/automata
DATABASE MANAGEMENT SYSTEMS (4:0:0)
Sub Code : IS0409 CIE : 50% Marks
Hrs/Week : 04 SEE : 50% Marks
SEE Hrs : 03 Hrs Max. Marks : 100
Course Outcomes:
On Successful completion of the course, the students will be able to:
1. Describe fundamental elements of a relational database management system
2. Design entity-relationship diagrams to represent simple database application scenarios.
3. Apply relational algebraic operations on a database model.
4. Formulate SQL queries on the databases.
5. Criticize a database design and improve the design by normalization.
6. Describe the various features of transaction processing and concurrency control.
UNIT 1: 9 Hrs
Databases and Database Users: Introduction, Example, Characteristics of the database approach, Actors on the scene, Workers behind the Scene, Advantages of using DBMS Approach, Implications of the Database Approach, When Not to Use a Database Management Systems. Database System Concepts and Architecture: Data Models, Schemas, and Instances, Three-schema Architecture and Data Independence, Database Languages and Interfaces. Self Learning Exercise: The Database System Environment, Classification of Database Management Systems. UNIT 2: 8Hrs
Data Modeling Using the Entity-Relationship (ER) Model:
Using High-Level Conceptual Data Models for Database Design, A Sample Database Application, Entity Types, Entity Sets, Attributes, and Keys, Relationship Types, Relationship Sets, Roles, and Structural Constraints, Weak Entity Types, ER Diagrams, Naming Conventions, and Design Issues. Self Learning Exercise: Subclasses, superclasses and inheritance UNIT 3: 9 Hrs
The Relational Data Model, Relational Database Constraints and Relational Algebra: Relational Model Concepts, Relational Model Constraints and Relational Database Schemas, Update Operations, Transactions and Dealing with Constraint Violations. Unary relational operations, Relational algebra from set theory, Binary Relational Operations, Examples of Queries in Relational Algebra
Self Learning Exercise: Relational Database Design Using ER-to-Relational Mapping.
UNIT 4: 9 Hrs
Basic SQL, Complex Queries, Views and Schema Modification: SQL Data Definition and Data types, Specifying Constraints, Basic retrieval Queries, Insert, Delete, and Update Statements in SQL, More Complex SQL retrieval Queries, Views (Virtual Tables) in SQL, SchemaChange Statements in SQL. Self Learning Exercise: Embedded SQL, Dynamic SQL.
UNIT 5: 8 Hrs
Functional Dependencies and Normalization for Relational Databases: Informal Design Guidelines for Relation Schemas, Functional Dependencies, Normal Forms Based on Primary Keys, General Definitions of Second and Third Normal Forms. Self Learning Exercise: Boyce-Codd Normal Form.
UNIT 6: 9Hrs
Transaction processing concepts: Introduction to transaction processing, Transaction and system concepts, desirable properties of transaction, characterizing schedules based on recoverability, characterizing schedules based on serializability, transaction support in SQL Concurrency control techniques: Two – phase locking techniques for concurrency control. Self Learning Exercise: Database recovery techniques: Deferred update, Immediate Update, Shadow Paging. TEXT BOOK:
1. Fundamentals of Database Systems, Ehmasri and Navathe: Pearson Education, Sixth Edition, 2013.
REFERENCE BOOKS:
1. Database System Concepts, Henry F Korth, Abraham Silberschatz, Sudarshan S, McGraw-Hill, 6th Edition, 2013.
2. Database Management Systems Raghu Ramakrishnan and Johannes Gehrke, McGraw Hill, Third Edition, 2013.
ANALYSIS AND DESIGN OF ALGORITHMS LAB (0:0:2)
Sub Code : IS0103 Max. Marks : 50
Hrs/Week : 02
Course Outcomes
On Successful completion of the course, the students will be able to:
1. Explain the meaning of space and time complexity of algorithms.
2. Gain practical experience in a variety of common algorithms and analyze these using asymptotic notations.
3. Explain different algorithm design techniques for solving wide range of problems.
4. Compare performances of different algorithms to solve the same problem.
List of Programs:
1. Implement the following problems using Brute Force technique and Repeat the experiment for different values of n, the number of elements in the list to be searched/ sorted.
a. Recursive linear search b. Selection sort
2. Implement the following problems using Divide & Conquer technique, and analyse their time complexity.
a. Merge sort b. Quick sort c. Recursive binary search
3. Implement the following problems using Decrease & Conquer technique, and analyse their time complexity.
a. Insertion sort b. Topological sorting using DFS c. Interpolation Search d. BFS
4. Problems using transform and conquer technique a. Heap sort
5. Problems using greedy technique a. Prim's algorithm b. Kruskal's algorithm c. Dijkstra's algorithm
6. Problems using dynamic programming technique a. Warshall's algorithm b. Floyd's algorithm
c. Knapsack algorithm
7. Problems using Backtracking technique. a. N queens problem
8. Problems using Branch & Bound technique. a. Travelling Salesperson Problem
TEXT BOOK:
1. Introduction to the Design & Analysis of Algorithms by Anany Levitin, 3rd Edition, 2011
2. Data structures, Algorithms and Applications in C++ by SartajSahni, TMH, 2nd Edition, 2004
DATABASE LAB (0:0:2)
Sub Code : IS0105 Max. Marks : 50
Hrs/Week : 02
Course Outcomes
On Successful completion of the course, the students will be able to:
1. Design a database schema for a given problem-domain
2. Solve queries of relational databaseusing the SQL.
PART – A
Exercise – 1
1. Create table ‘Dept’ with the following specification: COLUMN NAMES TYPE SIZE
Dept_no Number 2
Dept_name Char 30
Dept_location Char 20
2. Write the SQL command to view the structure of the above created table.
3. Add a record in the Depttable.
4. Write the SQL command to display all the columns of the Department table.
Exercise – 2 (Constraints on the table)
Column or Table level Constraints
1. Create a table Empwith certain data entry restrictions and specifications: - Emp_no should be a primary key
- Emp_name, Designation and Date_of_join should not be empty.
- Salary should be greater than 3000.
- Dno is a foreign key referencing the table Emp.
- Mgr is self referential integrity referring Emp_no
COLUMN NAMES TYPE SIZE
Emp_no Number 5
Emp_name Varchar2 30
Designation Char 10
Mgr Number 5
Date_of_join Date
Salary Number 9,2
Comm Number 6,2
Dno Number 2
Constraints on Existing tables
2. Write the SQL command to make Dept_no of Department table a primary key.
Foreign Key constraint
3. Write the SQL command to make Dno of Emp table referring Dept_no of table Dept.
4. Add records in the Emp table:
Exercise – 3 (Simple SELECT Command)
Give the SQL commands for the following:
1. Display all information in the tables EMP and DEPT.
2. Display only the join date and employee name for each employee.
3. Display the join date, name and department number for all clerks.
4. Display the names and salaries of all employees with a salary greater than 20000.
5. Display the names of all employees with an `A' in their name. 6. Display the names of all employees with exactly 5 letters in their name.
7. Display the names and join dates of all employees joined in 2000 or 2005
8. Display the names and dates of employees with the column headers \Name" and \Start Date"
9. Display the department numbers of all departments employing a clerk.
10. Display the names and salaries of all employees in reverse salary order.
Exercise – 4 (Group SELECT Command)
1. Display the maximum, minimum and average salary and commission earned.
2. Display the department number, total salary payout and total commission payout for each department.
3. Display the department number, total salary and total commission payout for each department that pays at least one employee commission.
4. Display the department number and number of clerks in each department.
5. Display the department number and total salary of employees in each department with four or more people.
6. Display the employee number of each employee who manages other employees with the number of people he or she manages.
Exercise – 5 (Join SELECT Command)
1. Display the name of each employee with his department name. 2. Display a list of all departments with the employees in each department.
3. Display all the departments with the manager for that department.
4. Display the names of each employee with the name of his/her boss.
5. Display the names of each employee where the manager is same as ‘JONES’
6. Display the employee number and name of each employee who manages other employees with the number of people he or she manages.
Exercise – 6 (SELECT with Sub-queries)
1. Display the names and job titles of all employees with the same job as Jones.
2. Display the names and department name of all employees working in the same city as Jones.
3. Display the name of the employee whose salary is the lowest.
4. Display the names of all employees except the lowest paid.
5. Display the names of all employees whose job title is the same as anyone in the sales dept. Exercise – 7 (Views)
1. Create a view called VIEWEMP which gives the same displays as Emp
2. Create a view called DEPTSUM with two columns called DEPARTMENT and SUMSAL containing the name of each department and the sum of the salaries for all employees in the department. Look at it using a SELECT command
3. Create a view called BOSS which has the name and number of each employee with the name and number of his or her manager (with blanks alongside any employee that has no manager). Give each column in the view a suitable name.
PART – B
Mini Project on DBMS:
To gain hands-on experience in designing and implementing a database-system application, select one of the application and then analyze the requirements, and design, implement, document and demonstrate a working database-system application. The result of your project should be a working implementation that uses SQL to access data stored in a relational database.
Groups:
The project is to be done in groups of 4 students. Each group is responsible for its own division of work, scheduling, etc. More than a group cannot work on the same application choice, and the applications will be distributed on the first-come-first-served basis.
Report Requirements:
The final report must contain:
♣ A short overview of the system including identification of the various types of users and user groups who will be accessing the system in various ways.
♣ A graphical schema of the database using the E-R model.
♣ A list of the attributes for each entity and relationship, identification of keys and a short description of the purpose of each entity set and relationship set.
♣ The DDL statements to create the relational schema in some appropriate Normal Form, identification and justification of which Normal Form the schema is in, and identification of primary and foreign keys.
♣ Example scenarios of how various types of users will interact with the system with example screen shots or listings obtained by spooling.
♣ A description of the system's limitations and the possibilities for improvements.
CONSTITUTION OF INDIA AND PROFESSIONAL ETHICS (2:0:0)
Sub Code : HS0101 CIE : 50% Marks
Hrs/Week : 02 SEE : 50% Marks
SEE Hrs : 02 Hrs Max. Marks : 100
Course Outcomes:
On successful completion of the course the students will be able to:
1. Preamble to the Constitution of India – Fundamental Rights under part III, details of exercise of Rights – limitations and impartment cases. Understand the significance of many provisions of the Constitution as well as to gain insight into their beck ground. They will also understand number of fundamental rights subject’s limitations in light of leading cases.
2. Relevance of Direct to Principals of State Policy under part IV They will study these as there are guidelines for the State as well as for the Citizens to be followed by the State in matter of administration as well as in making the laws. It also includes fundamental duties of the Indian Citizens in part IV A (Article 51A)
3. Union Executive – President – Vice President – Prime Minister, Parliament, Supreme Court of India. For the administration of a State, the doctrines of Separation of Power are there in this unit.
4. State Executive – Governors, Chief Minister, State legislature and High Court. The Students will be able to know how the State is administered at the State level and also the powers and functions of High Court.
5. Constitutional provisions for SCs/STs, Women and Children, Backward classes, Emergency provisions. Special provisions have been created for them with special reference to Women empowerment. For the stability and security of the Nation, Emergency Provision are Justified.
6. Electoral Process- Amendment procedure, 42nd, 44th, 74th, 76th, 86th, 91st Constitutional Amendments. It is an independent body with enormous power and functions to be followed both at the Union and State level. Amendments are necessary, only major few amendments have been included.
7. Scope and Aims of Engineering Ethics – responsibility of engineers – impediments to responsibility. The scope is very wide, it also includes responsibility of engineers must be considered in the light of social responsibility along with impediments.
8. Honesty – Integrity, Reliability, Risks, Safety, Liability in Engineering Ethics. As the engineers need to possess these qualities, which will make them full fledged professionals. The laws, codes of Ethics and morality determined the extend of ability in engineering.
UNIT 1: 4 Hrs
Preamble to the Constitution of India. Fundamental rights under Part III details of Exercise of Rights, Limitations and Important Leading cases.
UNIT 2: 3 Hrs
Relevance of Directive Principles of State Policy under Part-IV, IVA Fundamental duties.
UNIT 3: 3 Hrs
Union Executive - President, Vice-President, Prime Minister, Union Legislature - Parliament and Union Judiciary – Supreme Court of India.
UNIT 4: 3 Hrs
State Executive - Governors, Chief Minister, State Legislature and High Court.
UNIT 5: 4 Hrs
Constitutional Provisions for Scheduled Casters and Tribes, Women and Children and Backward Classes, Emergency Provisions.
UNIT 6: 3 Hrs
Electoral process, Amendment procedure, 42nd, 44th, 74th, 76th, 86th and 91st Constitutional amendments.
UNIT 7: 3 Hrs
Scope and aims of engineering ethics, responsibility of Engineers. Impediments to responsibility.
UNIT 8: 3 Hrs
Honesty, Integrity and reliability, risks, safety and liability in Engineering.
TEXT BOOK:
1. Durga Das Basu : "Introduction to the Constitution of India" (student edition) Prentice - Hall EEE, 19th /20th Edition, 2001.
2. "Engineering Ethics" by M.Govindarajan, S.Natarajan, V.S.Senthikumar, Prentice - Hall of India Pvt. Ltd., New Delhi, 2004
BRIDGE COURSE MATHEMATICS – II (2:0:0)
(For Diploma students during IV semester)
Sub Code : MA0202 CIE : 50% Marks
Hrs/Week : 02 SEE : 50% Marks
SEE Hrs : 02 Hrs Max. Marks : 50
Course Outcomes:
On Successful completion of the course, the students will be able to:
1. Compute double and triple integrals. 2. Compute certain improper integrals using Beta – Gamma functions. 3. Solve problems on vector differentiation. 4. Operate vector differential operator ‘del’ on scalar and vector point functions and solve
problems associated with it. 5. Operate Laplace transform on some functions. 6. Operate inverse Laplace transform on some functions and use it to solve differential
equations with initial conditions.
UNIT 1: 5 Hrs
Integral Calculus – 1:
Multiple integrals-double and triple integrals. Evaluation of double integral over a region.
(SLE: evaluation of double integrals by converting into polar form).
UNIT 2: 4 Hrs
Integral Calculus – 2:
Beta and Gamma functions – Definition, Properties, problems on relation between beta and gamma function (SLE: derivation of alternate definitions of Beta and Gamma functions).
UNIT 3: 4 Hrs
Vector Calculus – 1:
(SLE: Representation of a vector,dot and cross products, magnitude, unit vector). Differentiation of vectors, velocity, acceleration, components of velocity and acceleration.
UNIT 4: 4 Hrs
Vector Calculus – 2:
Vector differentiation -Gradient, Divergence, Curl and Laplacian ,Irrotational vectors. (SLE : Solenoidal vectors)
UNIT 5: 5 Hrs
Laplace Transforms:
Definition, Laplace transforms of standard functions (formulae). Shifting and Derivative of transform, properties – simple problems (SLE: Laplace transform of discontinuous functions). Unit step function- Problems.
UNIT 6: 4 Hrs
Inverse Laplace Transforms:
Inverse transforms – Method of completing square and partial fractions. Solution of ordinary differential equations using Laplace transform method (SLE: Solution of simultaneous differential equations using Laplace transform method).
TEXT / REFERENCE BOOK:
1. Higher Engineering Mathematics by Dr. B.S. Grewal, 42nd edition, Khanna publications. 2. Higher Engineering Mathematics by H.K.Dass , (2008 edition), Chand Publications.
ENGLISH ENHANCEMENT COURSE (2:0:0)
(For Diploma students during IV semester)
Sub Code : HS0201 CIE : 50% Marks
Hrs/Week : 02 SEE : 50% Marks
SEE Hrs : 02 Hrs Max. Marks : 50
Course Outcomes:
On Successful completion of the course, the students will be able to:
1. Understand, identify, analyse and apply the concepts for effective communication and give a good introduction for effective presentations
2. Hone listening skills and be able to interpret different accents, follow the directions given and work accordingly
3. Learn to send written messages appropriately 4. Seek information from various sources, assimilate, and voice their opinion effectively 5. Design and deliver a good presentation
UNIT 1: STAR 4 Hrs
S-T-A-R : ( Speak – Transcribe – Analyse - Record )
UNIT2: Communication and Grammar 10 Hrs
Basics of communication, its barriers, preparing a good introduction, using comprehensible accent and using proper grammar
Grammar concepts through common errors
UNIT3: 2 Hrs
Listening skills : listen to different accents and directions. Alternately – Recollect from the visual words, speech and visuals. Face to face and back to back communication
Email etiquette, conveying messages like acceptance or rejection of job offers, Requesting information of a product or service or follow ups to earlier correspondence, agreement and disagreement etc
UNIT4: Group Discussion and Seminar 10 Hrs
Group Discussion – Seek information on the given topic, assimilate and present / share opinions, facts, ideas etc within the given parameters. Topics will pertain to current issues for eg. Occupational disease and role of engineers to combat it (shop floor, operations area, silicosis etc), Elections in India – the new circus, Does India enjoy demographic advantage given its youth population, Start ups – the new employment agency
TEXT BOOKS :
1. A Mirror of Common Errors by Ashok Kumar Singh, Publisher – Students’ Friends 2. English Grammar by Wren and Martin
REFERENCES :
1. King’s English – The first encyclopedia of English Language, Publishers – Addone 2. Internet sources
Note:
Handouts, Questionnaires and materials will be provided