Showing posts with label SE COMP. Show all posts
Showing posts with label SE COMP. Show all posts
Jan 24, 2010
Computer Organization
Download Computer Organization notes
210252: COMPUTER ORGANIZATION
Teaching Scheme Examination Scheme
Lectures: 3 Hrs/Week Theory: 100 Marks
Pre requisites: Digital Electronics and Logic Design (Subject Code: 210243)
Learning Objectives
1. To understand the structure, function and characteristics of computer systems
2. To understand the design of the various functional units of digital computers
3. To learn basics of Parallel Computer Architecture.
210252: COMPUTER ORGANIZATION
Teaching Scheme Examination Scheme
Lectures: 3 Hrs/Week Theory: 100 Marks
Pre requisites: Digital Electronics and Logic Design (Subject Code: 210243)
Learning Objectives
1. To understand the structure, function and characteristics of computer systems
2. To understand the design of the various functional units of digital computers
3. To learn basics of Parallel Computer Architecture.
UNIT I
Computer Evolution & Arithmetic
A Brief History of computers, Designing for Performance, Von Neumann
Architecture, Computer Components, Interconnection Structures, Bus Interconnection,
Scalar Data Types, Fixed and Floating point numbers, Signed numbers, Integer
Arithmetic, 2’s Complement method for multiplication, Booths Algorithm, Hardware
Implementation, Division, Restoring and Non Restoring algorithms, Floating point
representations, IEEE standards, Floating point arithmetic. (8 Hrs)
UNIT II
The Central Processing Unit
Machine Instruction charactertics, types of operands, types of operations, Addressing,
Instuction formats, Processor organization, Register Organization, Instruction cycles,
Instruction pipelining, ALU – Combinational ALUs and Sequential ALUs. (6 Hrs)
UNIT III
The Control Unit
Single Bus Organization, Control Unit Operations: Instruction sequencing, Micro
operations and Register Transfer. Hardwired Control: Design methods – State table
and classical method, Design Examples - Multiplier CU. Micro-programmed Control:
Basic concepts, Microinstructions and micro- program sequencing
. (6 Hrs)
UNIT IV
Memory Organization
Characteristics of memory systems, Internal and External Memory, Types of
memories: ROM: PROM, EPROM, EEPROM, RAM: SRAM, DRAM, SDRAM,
RDRAM High-Speed Memories: Cache Memory, Organization and Mapping
Techniques, Replacement Algorithms, Cache Coherence, MESI protocol. Virtual
Memory: Main Memory allocation, Segmentation, Paging, Address Translation.
Secondary Storage: Magnetic Disk, Tape, DAT, RAID, Optical memory,
CDROM, DVD (6 Hrs)
UNIT V
I/O Organization: Input/Output Systems, Programmed I/O, Interrupt Driven I/O, I/O
channels, Direct Memory Access (DMA), Buses and standard Interfaces:
Synchronous, Asynchronous, Parallel, Serial, PCI, SCSI, USB Ports Working
mechanisms of Peripherals: Keyboard, Mouse, Scanners, Video Displays, Touch
Screen panel, Dot Matrix, Desk-jet and Laser Printers. OS Support: OS Overview,
Scheduling and Memory Management (6 Hrs)
UNIT VI
Parallel Organizations
Superscalar Processors, Multiple Processor Organizations, Symmetric
Multiprocessors, Clusters, Nonuniform Memory Access, Vector Computations, Bus
allocation Schemes.
RISC: Instruction execution characteristics, use of large register file, compiler based
register optimization, RISC architecture and pipelining. RISC Vs CISC (8 Hrs)
Text Books:
1. W. Stallings, “Computer Organization and Architecture: Designing for
performance”, 6th Edition, Prentice Hall of India, 2003, ISBN 81 – 203 – 2103 – 0
2. C. Hamacher, V. Zvonko, S. Zaky, “Computer Organization”, McGraw Hill, 2002
Reference Books:
1. J. Hays, “Computer Architecture and Organization”, 2nd Edition, McGraw-Hill,
1988 ISBN 0 – 07 – 100479 – 3
2. W. Stallings William, “Computer Organization and Architecture: principles of
structure and function”, 2nd Ed, Maxwell Macmillan Editions, 1990 ISBN 0 – 02 –
946297 – 5 (Chapter: 2,3,4,5,7,8,9,10,11,12,13,14).
3. A. Tanenbaum, “Structured Computer Organization”, 4th Ed, Prentice Hall of
India, 1991 ISBN 81 – 203 – 1553 – 7 (Chapter: 1,4,5,6,8).
4. G. George, “Computer Organization: Hardware and Software”, 2nd Edition,
Prentice Hall of India, 1986 (Chapter: 3,4,5).
5. D. Paterson, J. Hennesy, “Computer Organization and Design: The Hardware
Software Interface”, 2nd Edition, Morgan Kauffman, 2000 ISBN 981 – 4033 – 588.
Computer Graphics
Download Computer Graphic Lab Manual
Download Computer Graphic Oral Question
Download OOP Programming lab manual
Download CG program
Unit I - Basic Concepts
Graphics Primitives: Introduction to computer graphics, Basics of Graphics systems,
Raster scan & random scan displays, display processor, display file structure,
algorithms and display file interpreter.
Display devices, Interactive devices: Tablets, touch panels, mouse, joysticks, track
balls, light pen etc., Data generating devices: Scanners and digitizers, primitive
operations, display file structure, algorithms and display file interpreter, Text and line
styles.
Scan conversions, lines, line segments, vectors, pixels and frame buffers, vector
generation, DDA and Bresenham’s line and circle drawing algorithms*, initialising,
thick lines, character generation: Stroke Principle, Starburst Principle, Bit map method,
display of frame buffer.
(* Scan conversion algorithms should be given mathematical treatment) (6 Hrs)
Unit II - Polygons
Introduction, representation, entering Polygons, Polygon filling: Seed fill, Edge fill,
scan conversion algorithm, filling with patterns.
Windowing and Clipping
Introduction, viewing transforms, 2D clipping, Cohen-Sutherland outcode algorithm,
Polygon Clipping, Sutherland-Hodgman algorithm, Generalized clipping. (6 Hrs)
Unit III- Geometric Transformations
2D Transformations
Introduction, matrices, Scaling, Rotation, homogeneous coordinates & matrix
representation of 2D transformation, Translation, Co-ordinate transformation, rotation
about an arbitrary point, inverse transforms and shear transforms.
3-D Transformations
Introduction, 3-D geometry, primitives, 3D transformations & matrix representation
of 2D transformation, Rotation about an arbitrary axis, Concept of parallel and
perspective projections, Viewing parameters, 3D clipping, 3D viewing
transformations. (6 Hrs)
Unit – IV
Segments
Introduction, segment table, segment creation, deletion, renaming. Image
transformations, raster techniques.
Animation
Conventional and computer based animation, Methods of Controlling Animations,
Basic guidelines of animation, Animation languages. (6 Hrs)
Unit V - Hidden Surfaces and Lines
Introduction, Back-face removal algorithm, Z buffers, scan-line, Painters algorithm,
Warnock algorithm, hidden line methods, binary space partition.
Light, Color and Shading
Introduction, Diffused illumination, point source illumination, shading algorithm,
reflections, shadows, ray tracing, Colour models and tables, shading algorithm,
transparency (6 Hrs)
Unit VI- Curves and Fractals
Introduction, Curve generation, Interpolation, interpolating algorithms, interpolating
polygons, B-Splines and corners, Bezier curves, Fractals, fractal lines and
surfaces(With complete mathematical treatment of this unit)
Interactive Graphics & usage of at least two tools of computer graphics
(3D studio, Maya, Similar tools) (6 Hrs)
Text Books:
1. S. Harrington, “Computer Graphics”, 2nd Edition, McGraw-Hill Publications,
1987, ISBN 0 – 07 – 100472 – 6.
2. D. Rogers, “Procedural Elements for Computer Graphics”, 2nd Edition, Tata
McGraw-Hill Publication, 2001, ISBN 0 – 07 – 047371 – 4.
Reference Books:
1. J. Foley, V. Dam, S. Feiner, J. Hughes, “Computer Graphics Principles and
Practice”, 2nd Edition, Pearson Education, 2003, ISBN 81 – 7808 – 038 – 9.
2. D. Hearn, M. Baker, “Computer Graphics – C Version”, 2nd Edition, Pearson
Education, 2002, ISBN 81 – 7808 – 794 – 4.
3. D. Rogers, J. Adams, “Mathematical Elements for Computer Graphics”, 2nd
Edition, Tata McGraw-Hill Publication, 2002, ISBN 0 – 07 – 048677 – 8.
* - To be removed fro theory only to include during Practicals.
Download Computer Graphic Oral Question
Download OOP Programming lab manual
Download CG program
210251: COMPUTER GRAPHICS
Teaching Scheme Examination Scheme
Lectures: 3 Hrs/week Theory: 100 Marks
Prerequisite: Knowledge of C Programming and Basic Data Structures &
Mathematics
Learning Objectives
1. To understand basics of computer graphics
2. To give more emphasis on implementation aspect of Computer Graphics
Algorithm.
3. To prepare the student for advance courses like multimedia / Computer Vision.
Teaching aid
Faculties should use LCD to demonstrate the concept of Graphics.
Teaching Scheme Examination Scheme
Lectures: 3 Hrs/week Theory: 100 Marks
Prerequisite: Knowledge of C Programming and Basic Data Structures &
Mathematics
Learning Objectives
1. To understand basics of computer graphics
2. To give more emphasis on implementation aspect of Computer Graphics
Algorithm.
3. To prepare the student for advance courses like multimedia / Computer Vision.
Teaching aid
Faculties should use LCD to demonstrate the concept of Graphics.
Unit I - Basic Concepts
Graphics Primitives: Introduction to computer graphics, Basics of Graphics systems,
Raster scan & random scan displays, display processor, display file structure,
algorithms and display file interpreter.
Display devices, Interactive devices: Tablets, touch panels, mouse, joysticks, track
balls, light pen etc., Data generating devices: Scanners and digitizers, primitive
operations, display file structure, algorithms and display file interpreter, Text and line
styles.
Scan conversions, lines, line segments, vectors, pixels and frame buffers, vector
generation, DDA and Bresenham’s line and circle drawing algorithms*, initialising,
thick lines, character generation: Stroke Principle, Starburst Principle, Bit map method,
display of frame buffer.
(* Scan conversion algorithms should be given mathematical treatment) (6 Hrs)
Unit II - Polygons
Introduction, representation, entering Polygons, Polygon filling: Seed fill, Edge fill,
scan conversion algorithm, filling with patterns.
Windowing and Clipping
Introduction, viewing transforms, 2D clipping, Cohen-Sutherland outcode algorithm,
Polygon Clipping, Sutherland-Hodgman algorithm, Generalized clipping. (6 Hrs)
Unit III- Geometric Transformations
2D Transformations
Introduction, matrices, Scaling, Rotation, homogeneous coordinates & matrix
representation of 2D transformation, Translation, Co-ordinate transformation, rotation
about an arbitrary point, inverse transforms and shear transforms.
3-D Transformations
Introduction, 3-D geometry, primitives, 3D transformations & matrix representation
of 2D transformation, Rotation about an arbitrary axis, Concept of parallel and
perspective projections, Viewing parameters, 3D clipping, 3D viewing
transformations. (6 Hrs)
Unit – IV
Segments
Introduction, segment table, segment creation, deletion, renaming. Image
transformations, raster techniques.
Animation
Conventional and computer based animation, Methods of Controlling Animations,
Basic guidelines of animation, Animation languages. (6 Hrs)
Unit V - Hidden Surfaces and Lines
Introduction, Back-face removal algorithm, Z buffers, scan-line, Painters algorithm,
Warnock algorithm, hidden line methods, binary space partition.
Light, Color and Shading
Introduction, Diffused illumination, point source illumination, shading algorithm,
reflections, shadows, ray tracing, Colour models and tables, shading algorithm,
transparency (6 Hrs)
Unit VI- Curves and Fractals
Introduction, Curve generation, Interpolation, interpolating algorithms, interpolating
polygons, B-Splines and corners, Bezier curves, Fractals, fractal lines and
surfaces(With complete mathematical treatment of this unit)
Interactive Graphics & usage of at least two tools of computer graphics
(3D studio, Maya, Similar tools) (6 Hrs)
Text Books:
1. S. Harrington, “Computer Graphics”, 2nd Edition, McGraw-Hill Publications,
1987, ISBN 0 – 07 – 100472 – 6.
2. D. Rogers, “Procedural Elements for Computer Graphics”, 2nd Edition, Tata
McGraw-Hill Publication, 2001, ISBN 0 – 07 – 047371 – 4.
Reference Books:
1. J. Foley, V. Dam, S. Feiner, J. Hughes, “Computer Graphics Principles and
Practice”, 2nd Edition, Pearson Education, 2003, ISBN 81 – 7808 – 038 – 9.
2. D. Hearn, M. Baker, “Computer Graphics – C Version”, 2nd Edition, Pearson
Education, 2002, ISBN 81 – 7808 – 794 – 4.
3. D. Rogers, J. Adams, “Mathematical Elements for Computer Graphics”, 2nd
Edition, Tata McGraw-Hill Publication, 2002, ISBN 0 – 07 – 048677 – 8.
* - To be removed fro theory only to include during Practicals.
Microprocessors and Interfacing Techniques
210249: Microprocessor and Interfacing Techniques
Teaching Scheme Examination Scheme
Lectures: 4 Hrs/week Theory: 100 Marks
Prerequisites: Digital Electronics and Logic Design (Subject Code: 210243)
Learning Objectives:
1. To learn the architecture and assembly language programming 0f 8086
Microprocessor.
2. To learn peripherals and their interfacing with 8086 Microprocessor.
3. To study the DOS Internals.
4. To Study NDP and Design of Microprocessor based System.
Teaching Scheme Examination Scheme
Lectures: 4 Hrs/week Theory: 100 Marks
Prerequisites: Digital Electronics and Logic Design (Subject Code: 210243)
Learning Objectives:
1. To learn the architecture and assembly language programming 0f 8086
Microprocessor.
2. To learn peripherals and their interfacing with 8086 Microprocessor.
3. To study the DOS Internals.
4. To Study NDP and Design of Microprocessor based System.
Unit I
Introduction to 16 bit microprocessor, Architecture and Pin diagram of 8086,
Programmers model of 8086 (Registers), Segmentation, logical to physical address
translation, even and odd memory banks, Read write cycle timing diagrams, Address
mapping and decoding, I/O: memory mapped I/O & I/O Mapped I/O. (8 Hrs)
Unit II
Addressing modes, Instruction set of 8086 in detail, Instruction Formats, Stacks,
Assembly Language Programming, Assembler, Linker, Debugger (Turbo debugger),
Directives, Procedures (Near & Far), Macros, Loop constructs, 8086 Programming
examples. (8 Hrs)
Unit III
8086 Interrupt Structure, Interrupt Vector Table (IVT), ISR, Hardware and software
Interrupts Internals of DOS, DOS loading, DOS memory map, Internal and external
commands of DOS, BIOS & DOS Interrupts. Concepts of PSP, .EXE & .COM files,
Concepts of TSR, 8259 (Programmable Interrupt Controller): Features, Block
Diagram, Control & status registers, Interfacing & Programming (8 Hrs)
Unit IV
Study of Peripheral chips:
8255 (Programmable Peripheral Interface), Serial Communication- Synchronous &
Asynchronous, 8251(USART): Features, Block Diagram, Control & status registers,
Operating modes, Interfacing & Programming (8255 and 8251)
Concept of ADC -Successive Approximation & Interfacing, Concept of DAC R-2R
(ladder) & Interfacing, Introduction to Sensors & Transducers, Keyboard Display &
Centronics Printer Parallel Interfacing using 8255. (9 Hrs)
Unit V
8279 Keyboard and Display Controller, 8253 (Programmable Interval Timer):
Features, Block Diagram, Control & status registers, Operating modes, Interfacing &
Programming
Concept of DMA, 8237 DMA Controller: Features, Block Diagram (7 Hrs)
Unit VI
Minimum & Maximum mode of 8086, Support chips 8282,8284,8286,8288
8087(NDP) - Features, Block Diagram, Control & status registers, typical Instruction
Set & Programming
Detail Design of 8086 based minimum system with EPROM, SRAM & Peripherals
such as 8255,8253,8251,8279 with keyboard & seven segments Display. (8 Hrs)
Text Books:
1. Douglas Hall, “Microprocessors & Interfacing”, McGraw Hill, Revised 2nd
Edition, 2006 ISBN 0-07-100462-9
2. John Uffenbeck,” The 8086/88 Family: Design, Programming & Interfacing”,
PHI,
3. A.Ray, K.Bhurchandi, ”Advanced Microprocessors and peripherals: Arch,
Programming & Interfacing”,Tata McGraw Hill,2004 ISBN 0-07-463841-6
References Books:
1. Liu, Gibson, “Microcomputer Systems: The 8086/88 Family”, 2nd Edition,
PHI,2005
2. Kenneth Ayala, “The 8086 Microprocessor: Programming & Interfacing the
PC”, Cengage Learning, Indian Edition, 2008
Ray Dunkon, “Advanced MSDOS Programming”, 2nd Edition, BPB
Publication.
3. Kip Irvine, ”Assembly language for IBM PC”, PHI, 2nd Edition, 1993
4. Peter Abel, ”Assembly language programming”, Pearson Edu,5th Edition,2002
5. Intel Microprocessor and peripheral Handbook: Volume 1
6. Yashwant Kanitkar, “TSR through C”, BPB Publication, 1995, ISBN 81-
7029-520-3.
Eng. Maths – III
207003 ENGINEERING MATHEMATICS – III (2008 Course)
Teaching Scheme: Examination Scheme:
Lectures: 4 hrs./week Paper: 100 marks
Duration: 3 hrs.
SECTION I
Unit I: Linear Differential Equations (LDE) (09 Hours)
Solution of nth order LDE with Constant Coefficients, Method of Variation of Parameters, Cauchy’s &
Legendre’s DE, Solution of Simultaneous & Symmetric Simultaneous DE, Modeling of Electrical
Circuits.
Unit II: Complex Variables (09 Hours)
Functions of Complex Variables, Analytic Functions, C-R Equations, Conformal Mapping, Bilinear
Transformation, Cauchy’s Theorem, Cauchy’s Integral Formula, Laurent’s Series, Residue Theorem
Unit III: Transforms (09 Hours)
Fourier Transform (FT): Complex Exponential Form of Fourier Series, Fourier Integral Theorem, Sine
& Cosine Integrals, Fourier Transform, Fourier Sine and Cosine Transform and their Inverses,
Application to Wave Equation.
Introductory Z-Transform (ZT): Definition, Standard Properties, ZT of Standard Sequences and their
Inverses. Solution of Simple Difference Equations.
SECTION II
Unit IV: Statistics and Probability (09 Hours)
Measures of Central Tendency, Standard Deviation, Coefficient of Variation, Moments, Skewness and
Kurtosis, Correlation and Regression, Reliability of Regression Estimates
Theorems and Properties of Probability, Probability Density Function, Probability Distributions:
Binomial, Poisson, Normal and Hypergometric; Test of Hypothesis: Chi-Square test.
Unit V: Vector Differential Calculus (09 Hours)
Physical Interpretation of Vector Differentiation, Vector Differential Operator, Gradient, Divergence
and Curl, Directional Derivative, Solenoidal, Irrotational and Conservative Fields, Scalar Potential,
Vector Identities.
Unit VI: Vector Integral Calculus (09 Hours)
Line, Surface and Volume integrals, Work-done, Green’s Lemma, Gauss’s Divergence Theorem,
Stoke’s Theorem, Applications to Problems in Electro-Magnetic Fields.
Text Books:
1. Advanced Engineering Mathematics by Peter V. O'Neil (Cengage Learning).
2. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Eastern Ltd.).
Reference Books:
1. Engineering Mathematics by B.V. Raman (Tata McGraw-Hill).
2. Advanced Engineering Mathematics, 2e, by M. D. Greenberg (Pearson Education).
3. Advanced Engineering Mathematics, Wylie C.R. & Barrett L.C. (McGraw-Hill, Inc.)
4. Higher Engineering Mathematics by B. S. Grewal (Khanna Publication, Delhi).
5. Applied Mathematics (Volumes I and II) by P. N. Wartikar & J. N. Wartikar
(Pune Vidyarthi Griha Prakashan, Pune).
6. Advanced Engineering Mathematics with MATLAB, 2e, by Thomas L. Harman, James Dabney
and Norman Richert (Brooks/Cole, Thomson Learning).
Teaching Scheme: Examination Scheme:
Lectures: 4 hrs./week Paper: 100 marks
Duration: 3 hrs.
SECTION I
Unit I: Linear Differential Equations (LDE) (09 Hours)
Solution of nth order LDE with Constant Coefficients, Method of Variation of Parameters, Cauchy’s &
Legendre’s DE, Solution of Simultaneous & Symmetric Simultaneous DE, Modeling of Electrical
Circuits.
Unit II: Complex Variables (09 Hours)
Functions of Complex Variables, Analytic Functions, C-R Equations, Conformal Mapping, Bilinear
Transformation, Cauchy’s Theorem, Cauchy’s Integral Formula, Laurent’s Series, Residue Theorem
Unit III: Transforms (09 Hours)
Fourier Transform (FT): Complex Exponential Form of Fourier Series, Fourier Integral Theorem, Sine
& Cosine Integrals, Fourier Transform, Fourier Sine and Cosine Transform and their Inverses,
Application to Wave Equation.
Introductory Z-Transform (ZT): Definition, Standard Properties, ZT of Standard Sequences and their
Inverses. Solution of Simple Difference Equations.
SECTION II
Unit IV: Statistics and Probability (09 Hours)
Measures of Central Tendency, Standard Deviation, Coefficient of Variation, Moments, Skewness and
Kurtosis, Correlation and Regression, Reliability of Regression Estimates
Theorems and Properties of Probability, Probability Density Function, Probability Distributions:
Binomial, Poisson, Normal and Hypergometric; Test of Hypothesis: Chi-Square test.
Unit V: Vector Differential Calculus (09 Hours)
Physical Interpretation of Vector Differentiation, Vector Differential Operator, Gradient, Divergence
and Curl, Directional Derivative, Solenoidal, Irrotational and Conservative Fields, Scalar Potential,
Vector Identities.
Unit VI: Vector Integral Calculus (09 Hours)
Line, Surface and Volume integrals, Work-done, Green’s Lemma, Gauss’s Divergence Theorem,
Stoke’s Theorem, Applications to Problems in Electro-Magnetic Fields.
Text Books:
1. Advanced Engineering Mathematics by Peter V. O'Neil (Cengage Learning).
2. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Eastern Ltd.).
Reference Books:
1. Engineering Mathematics by B.V. Raman (Tata McGraw-Hill).
2. Advanced Engineering Mathematics, 2e, by M. D. Greenberg (Pearson Education).
3. Advanced Engineering Mathematics, Wylie C.R. & Barrett L.C. (McGraw-Hill, Inc.)
4. Higher Engineering Mathematics by B. S. Grewal (Khanna Publication, Delhi).
5. Applied Mathematics (Volumes I and II) by P. N. Wartikar & J. N. Wartikar
(Pune Vidyarthi Griha Prakashan, Pune).
6. Advanced Engineering Mathematics with MATLAB, 2e, by Thomas L. Harman, James Dabney
and Norman Richert (Brooks/Cole, Thomson Learning).
Humanities and Social science
207005: HUMANITIES AND SOCIAL SCIENCES
Teaching Scheme Examination Scheme
Lectures: 3 Hrs/week Theory: 100 Marks
Learning Objectives
This course will lead to the learning of
1. Human and social development;
2. Contemporary national and international affairs;
3. Emergence of Indian society and Economics,
4. Sectoral development and Economic development and related issues (such
as international economics, WTO, RBI, etc).
Outcome
Making engineering and technology students aware of the various issues concerning
man and society. These issues will help to sensitize students to be broader towards the
social, cultural, economic and human issues, involved in social changes.
Methodologies
1. Suitable case studies should be discussed
2. Student group discussion activity.
3. Social Networking activity.
Unit I: Indian Society (6 hrs)
Structure of Indian Society, Indian Social Demography– Social and Cultural,
Differentiations: caste, class, gender and tribe; Institutions of marriage, family and
kinship- Secularization –Social Movements and Regionalism- Panchayatraj
Institutions; Indian constitution; Affirmative Action Programme of the Governmentvarious
reservations and commissions.
Unit II : Social Development (6 hrs)
Scientific approach to the study of human beings. Evolution of human kind, social
change and evolution. Industrial revolution. National policy on education, health and
health care and human development.
Unit III: Sectoral Development (6 hrs)
Agriculture : Technology changes , Green revolutions , Employment Rural & Urban ,
Government Schemes .
Industrial Development : Strategies , Public & Private Sectors, Categories ,
infrastructure , transport & communication , Consumer Awareness.
Unit IV: Environment & Ecology (6 hrs)
Ecosystems: Structure, Working, components.
Pollution: Water & Air Pollution, Global Warming, Control Strategies, International
Treaties.
Energy Sources: Renewable & Non Renewable, Hydro power, Biomass, Ocean,
Geothermal & Tidal.
Global Environmental Issues: Population Growth, Soil Degradation, Loss of
Biodiversity.
Unit V: Economic Development (6 hrs)
Need for planned economic development – Law of demand and supply. Planning
objectives, five year plans, priorities and problems. Population and development.
Indian Economics – basic features, natural recourses population size and composition,
national income concepts, micro economics of India, inflation.
Unit VI : Banking & Trades (6 hrs)
Financial Analysis, Ratios, Cost Analysis,, financial Institutions, Finance
Commissions, Budget Analysis.
Indian Banking, Role of Reserve bank of India
International Economy, WTO, International aid for economic growth.
Reference Books:
1. Krugman, International Economics, Pearson Education.
2. Prakash, The Indian Economy, Pearson Education.
3. Thursen Gerald, Engineering Economics, Prentice Hall.
4. C.S. Rao, Environmental Pollution Control Engineering, New Age
International Pvt. Ltd.
5. Rangarajan, Environmental Issues in India, Pearson Education.
6. University of Delhi, The Individual & Society, Pearson Education.
7. Wikipedia.org / wiki /social studies.
8. M. N. Srinivas, Social change in modern India, 1991, Orient Longman.
9. David Mandelbaum, Society in India, 1990, Popular.
10. David Newman,”Exporing the architecture of everday life”, Pine Forge Press,
7th edition.
Teaching Scheme Examination Scheme
Lectures: 3 Hrs/week Theory: 100 Marks
Learning Objectives
This course will lead to the learning of
1. Human and social development;
2. Contemporary national and international affairs;
3. Emergence of Indian society and Economics,
4. Sectoral development and Economic development and related issues (such
as international economics, WTO, RBI, etc).
Outcome
Making engineering and technology students aware of the various issues concerning
man and society. These issues will help to sensitize students to be broader towards the
social, cultural, economic and human issues, involved in social changes.
Methodologies
1. Suitable case studies should be discussed
2. Student group discussion activity.
3. Social Networking activity.
Unit I: Indian Society (6 hrs)
Structure of Indian Society, Indian Social Demography– Social and Cultural,
Differentiations: caste, class, gender and tribe; Institutions of marriage, family and
kinship- Secularization –Social Movements and Regionalism- Panchayatraj
Institutions; Indian constitution; Affirmative Action Programme of the Governmentvarious
reservations and commissions.
Unit II : Social Development (6 hrs)
Scientific approach to the study of human beings. Evolution of human kind, social
change and evolution. Industrial revolution. National policy on education, health and
health care and human development.
Unit III: Sectoral Development (6 hrs)
Agriculture : Technology changes , Green revolutions , Employment Rural & Urban ,
Government Schemes .
Industrial Development : Strategies , Public & Private Sectors, Categories ,
infrastructure , transport & communication , Consumer Awareness.
Unit IV: Environment & Ecology (6 hrs)
Ecosystems: Structure, Working, components.
Pollution: Water & Air Pollution, Global Warming, Control Strategies, International
Treaties.
Energy Sources: Renewable & Non Renewable, Hydro power, Biomass, Ocean,
Geothermal & Tidal.
Global Environmental Issues: Population Growth, Soil Degradation, Loss of
Biodiversity.
Unit V: Economic Development (6 hrs)
Need for planned economic development – Law of demand and supply. Planning
objectives, five year plans, priorities and problems. Population and development.
Indian Economics – basic features, natural recourses population size and composition,
national income concepts, micro economics of India, inflation.
Unit VI : Banking & Trades (6 hrs)
Financial Analysis, Ratios, Cost Analysis,, financial Institutions, Finance
Commissions, Budget Analysis.
Indian Banking, Role of Reserve bank of India
International Economy, WTO, International aid for economic growth.
Reference Books:
1. Krugman, International Economics, Pearson Education.
2. Prakash, The Indian Economy, Pearson Education.
3. Thursen Gerald, Engineering Economics, Prentice Hall.
4. C.S. Rao, Environmental Pollution Control Engineering, New Age
International Pvt. Ltd.
5. Rangarajan, Environmental Issues in India, Pearson Education.
6. University of Delhi, The Individual & Society, Pearson Education.
7. Wikipedia.org / wiki /social studies.
8. M. N. Srinivas, Social change in modern India, 1991, Orient Longman.
9. David Mandelbaum, Society in India, 1990, Popular.
10. David Newman,”Exporing the architecture of everday life”, Pine Forge Press,
7th edition.
Data Structures and Algorithms
Download Data Structures Lab Manual
Data Structures and Algorithms Oral Question
Download PL Program
Download This Book
Lectures: 4 Hrs/week Theory: 100 Marks
Prerequisite: Fundamentals of Programming Languages (Subject Code: 110013).
· To understand the different ways of data representation.
· To define high level of abstraction of the needed linear data structure and
algorithm.
· To develop the ability to synthesize and analyze algorithms
· To study the representation, implementation and applications of linear
data structures
UNIT I: Review of 'C' [7 Hrs]
Arrays, Pointers: arrays & pointers.
Functions: Parameter passing call by value and call by reference, scope rules,
functions and pointers, function returning pointer and pointer to function, String
manipulations using arrays,pointer to pointer.
Structure and Union: Passing and returning structure as parameter for
function ,structure and pointer.
Recursion: Definition, writing recursive functions & how recursion works.
File handling using C.
UNIT II: [TB 2] [7 Hrs]
Introduction to Algorithm, Data structures & Analysis of algorithms:
Introduction to Data Structures: Concept of data, Data object, Data structure,
Abstract Data Types (ADT), realization of ADT in ‘C’.
Concept of Primitive and non primitive, linear and Non-linear, static and dynamic
,persistent and ephemeral data structures.
Analysis of algorithm: frequency count and its importance in analysis of an
algorithm, Time complexity & Space complexity of an algorithm, Big ‘O’, ‘W’ and
‘q’ notations, Best, Worst and Average case analysis of an algorithm.
UNIT III:[TB 1] [8 Hrs]
Linear Data Structures using Sequential Organization:
Concept of sequential organization, Concept of Linear data structures, arrays as ADT,
Storage representation of array – Row major and Column major & their address
calculation, Multidimensional arrays, Concept of ordered list.
Applications : Polynomial representation using array, Concept of Sparse Matrix, it’s
usage & representation using arrays, Algorithms for sparse matrix operations like
addition, simple transpose, fast transpose & multiplication.
Analysis of the algorithms used.
Unit IV:[TB 1 & TB 2] [8 Hrs]
Sorting and searching techniques:
Need of sorting and searching, sorting order & stability in sorting.
Sorting Techniques: Algorithms for Bubble sort, Selection sort, Insertion sort, Shell
sort, Radix sort, Quick sort and Merge sort.
Analysis of each sorting technique for best, worst and average case, Concept of
Internal & External sorting.
Searching Techniques: Algorithms for Sequential search, Binary search, Fibonacci
search & concept of Index Sequential search, analysis of each searching technique for
best, worst and average case.
UNIT V:[TB 1] [9 Hrs]
Linear Data Structures using Linked Organization:
Limitations of static memory allocation. Dynamic memory allocation in C.
Concept of linked organization, Singly linked list, Doubly linked list, Circular linked
list. Operations like insertion, deletion, traversal & other operations on these data
structures.
Applications: Representation & manipulation of polynomials using circular linked
lists, Application of doubly linked list in dynamic storage management, garbage
collection and compaction. Representation of polynomial using generalized linked list
(implementation not expected), Concept of skip list.
Analysis of the algorithms used.
UNIT VI:[TB 1 & TB 2] [9 Hrs]
Stacks and Queues:
Stacks: Concept of stack as ADT, Representation and implementation of stack using
sequential & linked organization.
Applications: Examples using implicit stack, Simulating recursion using explicit
stack, Arithmetic expression conversion & evaluation, reversing a string, parsing :
well- formed parenthesis checking, concept of multi-stack & it’s representation.
Analysis of the algorithms used.
Queues: Concept of queue as ADT, Representation and implementation of linear
queue & circular queue using sequential & linked organization.
Applications: Josephus problem, Job scheduling, Queue simulation, Categorizing
data, Double ended queue, Multi-queue and Priority queue. Analysis of the algorithms
used.(Implementation not expected)
Text Books (TB):
1. R. Gilberg, B. Forouzan, “Data Structures: A pseudo code approach with C”,
Cenage Learning, ISBN 9788131503140.
2. E. Horowitz , S.Sahani, S.Anderson-Freed ““Fundamentals of Data Structures in
C”, Universities Press ,2008 ,ISBN 10:8173716056
Reference Books(RB):
1. A. Aho, J. Hopcroft, J. Ulman, “Data Structures and Algorithms”, Pearson
Education, 1998, ISBN-0-201-43578-0
2. Y. Langsam, M. Augenstin and A. Tannenbaum, “Data Structures using C and
C++”, 2nd Edition, Prentice Hall of India, 2002, ISBN-81-203-1177-9
3. J. Tremblay, P. Soresan, “An introduction to data structures with Applications”,
2nd edition, Tata McGraw-Hill International Editions, 1984, ISBN-0-07-462471-7.
Data Structures and Algorithms Oral Question
Download PL Program
210244: DATA STRUCTURES AND ALGORITHMS
Teaching Scheme ExaminationSchemeLectures: 4 Hrs/week Theory: 100 Marks
Prerequisite: Fundamentals of Programming Languages (Subject Code: 110013).
· To understand the different ways of data representation.
· To define high level of abstraction of the needed linear data structure and
algorithm.
· To develop the ability to synthesize and analyze algorithms
· To study the representation, implementation and applications of linear
data structures
UNIT I: Review of 'C' [7 Hrs]
Arrays, Pointers: arrays & pointers.
Functions: Parameter passing call by value and call by reference, scope rules,
functions and pointers, function returning pointer and pointer to function, String
manipulations using arrays,pointer to pointer.
Structure and Union: Passing and returning structure as parameter for
function ,structure and pointer.
Recursion: Definition, writing recursive functions & how recursion works.
File handling using C.
UNIT II: [TB 2] [7 Hrs]
Introduction to Algorithm, Data structures & Analysis of algorithms:
Introduction to Data Structures: Concept of data, Data object, Data structure,
Abstract Data Types (ADT), realization of ADT in ‘C’.
Concept of Primitive and non primitive, linear and Non-linear, static and dynamic
,persistent and ephemeral data structures.
Analysis of algorithm: frequency count and its importance in analysis of an
algorithm, Time complexity & Space complexity of an algorithm, Big ‘O’, ‘W’ and
‘q’ notations, Best, Worst and Average case analysis of an algorithm.
UNIT III:[TB 1] [8 Hrs]
Linear Data Structures using Sequential Organization:
Concept of sequential organization, Concept of Linear data structures, arrays as ADT,
Storage representation of array – Row major and Column major & their address
calculation, Multidimensional arrays, Concept of ordered list.
Applications : Polynomial representation using array, Concept of Sparse Matrix, it’s
usage & representation using arrays, Algorithms for sparse matrix operations like
addition, simple transpose, fast transpose & multiplication.
Analysis of the algorithms used.
Unit IV:[TB 1 & TB 2] [8 Hrs]
Sorting and searching techniques:
Need of sorting and searching, sorting order & stability in sorting.
Sorting Techniques: Algorithms for Bubble sort, Selection sort, Insertion sort, Shell
sort, Radix sort, Quick sort and Merge sort.
Analysis of each sorting technique for best, worst and average case, Concept of
Internal & External sorting.
Searching Techniques: Algorithms for Sequential search, Binary search, Fibonacci
search & concept of Index Sequential search, analysis of each searching technique for
best, worst and average case.
UNIT V:[TB 1] [9 Hrs]
Linear Data Structures using Linked Organization:
Limitations of static memory allocation. Dynamic memory allocation in C.
Concept of linked organization, Singly linked list, Doubly linked list, Circular linked
list. Operations like insertion, deletion, traversal & other operations on these data
structures.
Applications: Representation & manipulation of polynomials using circular linked
lists, Application of doubly linked list in dynamic storage management, garbage
collection and compaction. Representation of polynomial using generalized linked list
(implementation not expected), Concept of skip list.
Analysis of the algorithms used.
UNIT VI:[TB 1 & TB 2] [9 Hrs]
Stacks and Queues:
Stacks: Concept of stack as ADT, Representation and implementation of stack using
sequential & linked organization.
Applications: Examples using implicit stack, Simulating recursion using explicit
stack, Arithmetic expression conversion & evaluation, reversing a string, parsing :
well- formed parenthesis checking, concept of multi-stack & it’s representation.
Analysis of the algorithms used.
Queues: Concept of queue as ADT, Representation and implementation of linear
queue & circular queue using sequential & linked organization.
Applications: Josephus problem, Job scheduling, Queue simulation, Categorizing
data, Double ended queue, Multi-queue and Priority queue. Analysis of the algorithms
used.(Implementation not expected)
Text Books (TB):
1. R. Gilberg, B. Forouzan, “Data Structures: A pseudo code approach with C”,
Cenage Learning, ISBN 9788131503140.
2. E. Horowitz , S.Sahani, S.Anderson-Freed ““Fundamentals of Data Structures in
C”, Universities Press ,2008 ,ISBN 10:8173716056
Reference Books(RB):
1. A. Aho, J. Hopcroft, J. Ulman, “Data Structures and Algorithms”, Pearson
Education, 1998, ISBN-0-201-43578-0
2. Y. Langsam, M. Augenstin and A. Tannenbaum, “Data Structures using C and
C++”, 2nd Edition, Prentice Hall of India, 2002, ISBN-81-203-1177-9
3. J. Tremblay, P. Soresan, “An introduction to data structures with Applications”,
2nd edition, Tata McGraw-Hill International Editions, 1984, ISBN-0-07-462471-7.
Programming & problem solving
210242: PROGRAMMING & PROBLEM SOLVING
Teaching scheme: Examination Scheme:
Lectures: 4 Hrs/Week Theory: 100 Marks
UNIT I (8 Hrs)
General Problem Solving Concepts-Types of problems, problems solving with
computers, difficulties with problem solving, Problem Solving Aspects, Problem
Solving Concepts for computer- constants and variables, data types, functions,
operators, expressions and equations, Programming Concepts – communicating with
computers, organizing the problem, using the tools, testing the solution, coding the
program, Top down design
UNIT II (8 Hrs)
Introduction to programming structure, pointer for structuring the program, modules
and their function cohesion & Coupling, Local and global variable, parameters, return
values, variable names and data dictionaries, Problem solving with sequential logic
structure, Solution development, Problem solving with decision- Logic structure,
multiple if-then-else using straight through logic using positive & negative logic,
logic conversion, decision tables
UNIT III (8 Hrs)
Fundamental algorithm - Exchanging Values of two variables, Counting, summation
of set of numbers , factorial computation, sine function computation, Fibonacci series,
reverse of digit, BCD conversion , Char to number conversion), Factoring methods -
Square root of number, smallest divisor, GCD of two number, prime number, prime
factors of integer, pseudo random number generation, raising the number to a large
power
UNIT IV (8 Hrs)
Processing Array - One dimensional, multidimensional arrays, table lookup technique,
the pointer technique, Array Techniques - Array order reversals, array counting, and
finding maximum number in a set, Partitioning of array, finding smallest element,
searching an array for a range
UNIT V (6 Hrs)
Text processing Technique -Text Line Length Adjustment, Left and right justification
of text, keyword searching in text, text line editing,
Pattern searching -linear pattern search, sub linear pattern search
UNIT VI (10 Hrs)
Concept of object oriented programming – objects, classes, Methods, Abstraction,
Inheritance, Encapsulation, Understanding public, private, protected access,
Constructor, Destructor, Implementation of above concepts using of C++
Text book
1. “How to Solve it by Computer”, R G Dromey ISBN 978-81-317-0562-9
2. “Problem Solving and Programming Concepts”, Maureen Spankle, ISBN81-
317-0711-3
Reference book
1. “Programming Logic and Design” by Joyce Farrell ISBN 978-81-315-0263-1
2. Balaguruswamy, “Object-oriented Programming with C++”
Teaching scheme: Examination Scheme:
Lectures: 4 Hrs/Week Theory: 100 Marks
UNIT I (8 Hrs)
General Problem Solving Concepts-Types of problems, problems solving with
computers, difficulties with problem solving, Problem Solving Aspects, Problem
Solving Concepts for computer- constants and variables, data types, functions,
operators, expressions and equations, Programming Concepts – communicating with
computers, organizing the problem, using the tools, testing the solution, coding the
program, Top down design
UNIT II (8 Hrs)
Introduction to programming structure, pointer for structuring the program, modules
and their function cohesion & Coupling, Local and global variable, parameters, return
values, variable names and data dictionaries, Problem solving with sequential logic
structure, Solution development, Problem solving with decision- Logic structure,
multiple if-then-else using straight through logic using positive & negative logic,
logic conversion, decision tables
UNIT III (8 Hrs)
Fundamental algorithm - Exchanging Values of two variables, Counting, summation
of set of numbers , factorial computation, sine function computation, Fibonacci series,
reverse of digit, BCD conversion , Char to number conversion), Factoring methods -
Square root of number, smallest divisor, GCD of two number, prime number, prime
factors of integer, pseudo random number generation, raising the number to a large
power
UNIT IV (8 Hrs)
Processing Array - One dimensional, multidimensional arrays, table lookup technique,
the pointer technique, Array Techniques - Array order reversals, array counting, and
finding maximum number in a set, Partitioning of array, finding smallest element,
searching an array for a range
UNIT V (6 Hrs)
Text processing Technique -Text Line Length Adjustment, Left and right justification
of text, keyword searching in text, text line editing,
Pattern searching -linear pattern search, sub linear pattern search
UNIT VI (10 Hrs)
Concept of object oriented programming – objects, classes, Methods, Abstraction,
Inheritance, Encapsulation, Understanding public, private, protected access,
Constructor, Destructor, Implementation of above concepts using of C++
Text book
1. “How to Solve it by Computer”, R G Dromey ISBN 978-81-317-0562-9
2. “Problem Solving and Programming Concepts”, Maureen Spankle, ISBN81-
317-0711-3
Reference book
1. “Programming Logic and Design” by Joyce Farrell ISBN 978-81-315-0263-1
2. Balaguruswamy, “Object-oriented Programming with C++”
Digital Electronics and Logic Design
Download Del Program
210243: Digital Electronics & Logic Design
Teaching Scheme: Examination Scheme:
4 Hrs/ week Theory: 100 Marks
Prerequisites: Basic Electronics Engineering
Learning Objectives
1. To learn and understand basic digital design techniques.
2. To learn and understand design and construction of combinational and
sequential circuits.
3. To introduce basic components of microprocessors
UNIT I 8 Hrs.(TB-1: Ch- 2, RB-1)
Number System & Logic Design Minimization Techniques:
Introduction: Binary, Hexadecimal numbers, octal numbers and number conversion.
Signed Binary number representation: Signed Magnitude, 1’s complement and 2’s
complement representation.
Binary, Octal, Hexadecimal Arithmetic: 2’s complement arithmetic.
Algebra for logic circuits: Logic variables, Logic functions -NOT, AND, NOR,
XOR, OR, XNOR, NAND
Boolean algebra: Truth tables and Boolean algebra. Idealized logic gates and
symbols. DeMorgan's rules Axiomatic definition of Boolean algebra, Basic theorems
and properties of Boolean algebra
Logic minimization: Representation of truth-table, SOP form, POS form,
Simplification of logical functions, Minimization of SOP and POS forms, Don’t care
conditions
Reduction techniques: K-Maps up to 4 variables and Quine-McClusky technique
UNIT II 6 Hrs. (TB-1: Ch-3, 4, RB- 2)
Logic Families:
TTL: Standard TTL characteristics- Speed, power dissipation, fan-in, fan-out, current
and voltage parameters, noise margin, operating temperature etc. Operation of TTL
NAND gate. TTL Configurations- Active pull-up, Wired AND, totem pole, open
collector.
CMOS: CMOS Inverter, CMOS characteristics, CMOS configurations- Wired Logic,
Open drain outputs
Interfacing: TTL to CMOS and CMOS to TTL
UNIT III 9 Hrs.( TB-1: Ch-5,6, RB- 1, 3)
Combinational Logic:
Codes:- BCD, Excess-3, Gray code , Binary Code and their conversion
Arithmetic Operations: - Binary Addition, Subtraction, Multiplication, Division,
BCD Addition
Circuits: - Half- Adder, Full Adder, Half Subtract or, Full Sub tractor, BCD adder
using and subtract using 7483, look ahead and carry, parity generator and checker
using 74180, magnitude comparator using 7485.
Multiplexers (MUX):- Working of MUX, Implementation of expression using MUX
(IC 74153, 74151).
Demultiplexers (DEMUX):- Implementation of expression using DEMUX, Decoder.
(IC 74138).
UNIT IV 8 Hrs.( TB-1: Ch-12, TB2: Ch-13, RB-1)
Sequential Logic:
Introduction: Sequential Circuits. Difference between combinational circuits and
sequential circuits
Flip- flop: SR, JK, D, T; Preset & Clear, Master and Slave Flip Flops their truth
tables and excitation tables, Conversion from one type to another type of Flip Flop.
Application of Flip-flops: Bounce Elimination Switch, registers, counters.
Registers: Buffer register; shift register;
Counters: Asynchronous counter. Synchronous counter, ring counters, BCD
Counter, Johnson Counter, Modulus of the counter (IC 7490), Pseudo Random Binary
Sequence Generator, Sequence generator and detector
UNIT V 9 Hrs.( TB-2: Ch-6,7, Appendix-A, RB-4)
ASM & VHDL :
Algorithmic State Machines: ASM charts, notations, design of simple controller,
multiplexer controller method
Examples: Sequence Generator, Types of Counter
VHDL: Introduction to HDL, VHDL- Library, Entity, Architecture, Modeling Styles,
Concurrent and Sequential Statements, Data Objects & Data Types, Attributes.
VHDL for
Sequential Circuits-Synchronous and Asynchronous Counter
UNIT VI 8 Hrs.( TB-1: Ch-13 (13.1 to 13.9))
PLDs & Introduction to Microprocessor :
PLD: PLA- Input, Output Buffers, AND, OR, Invert/ Non-Invert Matrix.
Design Example: Any 4 Variables SOP function using PLDs, Study of basic
architecture of FPGA.
Introduction to Microprocessor: Introduction of Ideal Microprocessor, Data Bus,
Address Bus, Control Bus, Microprocessor Based System- Basic Operation,
Microprocessor Operation, Microprocessor Architecture, Instruction Set
Text Books
1. R. Jain, “Modern Digital Electronics”, 3rd Edition, Tata McGraw-Hill, 2003, ISBN
0 – 07 – 049492 – 4
2. Stephen Brown, Zvonko Vranesic “ Fundamentals of Digital Logic with VHDL
Design” Mcgraw-Hill
Reference Books
1. John Yarbrough, “Digital Logic applications and Design” Thomson
2. Flyod “Digital Principles”, Pearson Education
3. Malvino, D.Leach “ Digital Principles and Applications”, 5th edition, Tata Mc-
Graw Hill
4. J.Bhaskar “VHDL Primer” 3rd Edition, Pearson Edition
210243: Digital Electronics & Logic Design
Teaching Scheme: Examination Scheme:
4 Hrs/ week Theory: 100 Marks
Prerequisites: Basic Electronics Engineering
Learning Objectives
1. To learn and understand basic digital design techniques.
2. To learn and understand design and construction of combinational and
sequential circuits.
3. To introduce basic components of microprocessors
UNIT I 8 Hrs.(TB-1: Ch- 2, RB-1)
Number System & Logic Design Minimization Techniques:
Introduction: Binary, Hexadecimal numbers, octal numbers and number conversion.
Signed Binary number representation: Signed Magnitude, 1’s complement and 2’s
complement representation.
Binary, Octal, Hexadecimal Arithmetic: 2’s complement arithmetic.
Algebra for logic circuits: Logic variables, Logic functions -NOT, AND, NOR,
XOR, OR, XNOR, NAND
Boolean algebra: Truth tables and Boolean algebra. Idealized logic gates and
symbols. DeMorgan's rules Axiomatic definition of Boolean algebra, Basic theorems
and properties of Boolean algebra
Logic minimization: Representation of truth-table, SOP form, POS form,
Simplification of logical functions, Minimization of SOP and POS forms, Don’t care
conditions
Reduction techniques: K-Maps up to 4 variables and Quine-McClusky technique
UNIT II 6 Hrs. (TB-1: Ch-3, 4, RB- 2)
Logic Families:
TTL: Standard TTL characteristics- Speed, power dissipation, fan-in, fan-out, current
and voltage parameters, noise margin, operating temperature etc. Operation of TTL
NAND gate. TTL Configurations- Active pull-up, Wired AND, totem pole, open
collector.
CMOS: CMOS Inverter, CMOS characteristics, CMOS configurations- Wired Logic,
Open drain outputs
Interfacing: TTL to CMOS and CMOS to TTL
UNIT III 9 Hrs.( TB-1: Ch-5,6, RB- 1, 3)
Combinational Logic:
Codes:- BCD, Excess-3, Gray code , Binary Code and their conversion
Arithmetic Operations: - Binary Addition, Subtraction, Multiplication, Division,
BCD Addition
Circuits: - Half- Adder, Full Adder, Half Subtract or, Full Sub tractor, BCD adder
using and subtract using 7483, look ahead and carry, parity generator and checker
using 74180, magnitude comparator using 7485.
Multiplexers (MUX):- Working of MUX, Implementation of expression using MUX
(IC 74153, 74151).
Demultiplexers (DEMUX):- Implementation of expression using DEMUX, Decoder.
(IC 74138).
UNIT IV 8 Hrs.( TB-1: Ch-12, TB2: Ch-13, RB-1)
Sequential Logic:
Introduction: Sequential Circuits. Difference between combinational circuits and
sequential circuits
Flip- flop: SR, JK, D, T; Preset & Clear, Master and Slave Flip Flops their truth
tables and excitation tables, Conversion from one type to another type of Flip Flop.
Application of Flip-flops: Bounce Elimination Switch, registers, counters.
Registers: Buffer register; shift register;
Counters: Asynchronous counter. Synchronous counter, ring counters, BCD
Counter, Johnson Counter, Modulus of the counter (IC 7490), Pseudo Random Binary
Sequence Generator, Sequence generator and detector
UNIT V 9 Hrs.( TB-2: Ch-6,7, Appendix-A, RB-4)
ASM & VHDL :
Algorithmic State Machines: ASM charts, notations, design of simple controller,
multiplexer controller method
Examples: Sequence Generator, Types of Counter
VHDL: Introduction to HDL, VHDL- Library, Entity, Architecture, Modeling Styles,
Concurrent and Sequential Statements, Data Objects & Data Types, Attributes.
VHDL for
Sequential Circuits-Synchronous and Asynchronous Counter
UNIT VI 8 Hrs.( TB-1: Ch-13 (13.1 to 13.9))
PLDs & Introduction to Microprocessor :
PLD: PLA- Input, Output Buffers, AND, OR, Invert/ Non-Invert Matrix.
Design Example: Any 4 Variables SOP function using PLDs, Study of basic
architecture of FPGA.
Introduction to Microprocessor: Introduction of Ideal Microprocessor, Data Bus,
Address Bus, Control Bus, Microprocessor Based System- Basic Operation,
Microprocessor Operation, Microprocessor Architecture, Instruction Set
Text Books
1. R. Jain, “Modern Digital Electronics”, 3rd Edition, Tata McGraw-Hill, 2003, ISBN
0 – 07 – 049492 – 4
2. Stephen Brown, Zvonko Vranesic “ Fundamentals of Digital Logic with VHDL
Design” Mcgraw-Hill
Reference Books
1. John Yarbrough, “Digital Logic applications and Design” Thomson
2. Flyod “Digital Principles”, Pearson Education
3. Malvino, D.Leach “ Digital Principles and Applications”, 5th edition, Tata Mc-
Graw Hill
4. J.Bhaskar “VHDL Primer” 3rd Edition, Pearson Edition
Discrete Structures
210241: DISCRETE STRUCTURES
Teaching Scheme Examination Scheme
Lectures: 4 Hrs/week Theory: 100 Marks
Discrete mathematics- the mathematics of integers and of collections of object –
underlies the operation of digital computer, and is used widely in all fields of
computer science for reasoning about data structures algorithms and complexity. The
primary objective of subject is to prepare students mathematically for the study of
computer engineering. Topics covered in the course include proof techniques, logic
and sets, functions, relations, counting techniques, probability and recurrences. By the
end of the course, students should be able to formulate problems precisely, solve the
problems, apply formal proof techniques, and explain their reasoning clearly.
Prerequisite: Basic Mathematics
Learning objectives: … the student will be able to
· Use appropriate set, function, or relation models to analyze practical
examples, interpret the associated operations and terminology in context.
· Determine number of logical possibilities and probability of events
· Learn logic and proof techniques to expand mathematical maturity
· Formulate problems precisely, solve the problems, apply formal proof
techniques, and explain their reasoning clearly.
Unit I
Sets and Propositions
Sets, Combination of sets, Finite and Infinite sets, Un-countably infinite sets, Principle of
inclusion and exclusion, multisets.
Propositions, Conditional Propositions, Logical Connectivity, Propositional calculus,
Universal and Existential Quantifiers, Normal forms, methods of proofs, Mathematical
Induction (8 Hrs)
Unit II
Groups and Rings
Algebraic Systems, Groups, Semi Groups, Monoid, Subgroups, Permutation Groups, Codes
and Group codes, Isomorphism and Automorphisms, Homomorphism and Normal Subgroups,
Ring, Integral Domain, Field, Ring Homomorphism, Polynomial Rings and Cyclic Codes
(8 Hrs)
Unit III
Relations and Functions
Properties of Binary Relations, Closure of relations, Warshall’s algorithm, Equivalence
Relations and partitions, Partial ordering relations and lattices, Chains and Anti chains.
Functions, Composition of functions, Invertible functions, Pigeonhole Principle, Discrete
Numeric functions and Generating functions, Job scheduling Problem.
Recurrence Relations
Recurrence Relation, Linear Recurrence Relations With constant Coefficients, Homogeneous
Solutions, Total solutions, solutions by the method of generating functions (10 Hrs)
Unit IV
Graphs
Basic terminology, multi graphs and weighted graphs, paths and circuits, shortest path in
weighted graph, Hamiltonian and Euler paths and circuits, factors of a graph, planer graph
and Travelling salesman problem. (8 Hrs)
Unit V
Trees
Trees, rooted trees, path length in rooted trees, prefix codes, binary search trees, spanning
trees and cut set, minimal spanning trees, Kruskal’s and Prim’s algorithms for minimal
spanning tree, The Max flow –Min cut theorem (transport network). (8 Hrs)
Unit VI
Permutations, Combinations and Discrete Probability
Permutations and Combinations: rule of sum and product, Permutations, Combinations,
Algorithms for generation of Permutations and Combinations. Discrete Probability,
Conditional Probability, Bayes’ Theorem, Information and Mutual Information
(8 Hrs)
Text Books:
1. C. L. Liu and D. P. Mohapatra, “Elements of Discrete Mathematics”, SiE Edition,
TataMcGraw-Hill, 2008, ISBN 10:0-07-066913-9
2. R. Johnsonbaugh, “Discrete Mathematics”, 5th Edition, Pearson Education, 2001
ISBN 81 – 7808 – 279 - 9 (Recommended for Unit I and Unit II)
Reference Books:
1. N. Biggs, “Discrete Mathematics”, 3rd Edition, Oxford University Press, ISBN 0 –19 –
850717 - 8
2. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, 6th edition, McGraw-
Hill, 2007. ISBN 978-0-07-288008-3
3. E. Goodaire and M. Parmenter, “Discrete Mathematics with Graph Theory”, 2nd edition,
Pearson Education, 2003 ISBN 81 – 7808 – 827 – 4
4. Semyour Lipschutz & Marc Lipson, “ Discrete Mathematics”, McGraw-Hill, 3rd
Special Indian Edition, ISBN-13 : 978-0-07-060174-1
5. B. Kolman, R. Busby and S. Ross, “Discrete Mathematical Structures”, 4th Edition,
Pearson Education, 2002, ISBN 81-7808-556-9
6. N. Deo, “Graph Theory with application to Engineering and Computer Science”,
Prentice Hall of India, 1990, 0 – 87692 – 145 – 4
Teaching Scheme Examination Scheme
Lectures: 4 Hrs/week Theory: 100 Marks
Discrete mathematics- the mathematics of integers and of collections of object –
underlies the operation of digital computer, and is used widely in all fields of
computer science for reasoning about data structures algorithms and complexity. The
primary objective of subject is to prepare students mathematically for the study of
computer engineering. Topics covered in the course include proof techniques, logic
and sets, functions, relations, counting techniques, probability and recurrences. By the
end of the course, students should be able to formulate problems precisely, solve the
problems, apply formal proof techniques, and explain their reasoning clearly.
Prerequisite: Basic Mathematics
Learning objectives: … the student will be able to
· Use appropriate set, function, or relation models to analyze practical
examples, interpret the associated operations and terminology in context.
· Determine number of logical possibilities and probability of events
· Learn logic and proof techniques to expand mathematical maturity
· Formulate problems precisely, solve the problems, apply formal proof
techniques, and explain their reasoning clearly.
Unit I
Sets and Propositions
Sets, Combination of sets, Finite and Infinite sets, Un-countably infinite sets, Principle of
inclusion and exclusion, multisets.
Propositions, Conditional Propositions, Logical Connectivity, Propositional calculus,
Universal and Existential Quantifiers, Normal forms, methods of proofs, Mathematical
Induction (8 Hrs)
Unit II
Groups and Rings
Algebraic Systems, Groups, Semi Groups, Monoid, Subgroups, Permutation Groups, Codes
and Group codes, Isomorphism and Automorphisms, Homomorphism and Normal Subgroups,
Ring, Integral Domain, Field, Ring Homomorphism, Polynomial Rings and Cyclic Codes
(8 Hrs)
Unit III
Relations and Functions
Properties of Binary Relations, Closure of relations, Warshall’s algorithm, Equivalence
Relations and partitions, Partial ordering relations and lattices, Chains and Anti chains.
Functions, Composition of functions, Invertible functions, Pigeonhole Principle, Discrete
Numeric functions and Generating functions, Job scheduling Problem.
Recurrence Relations
Recurrence Relation, Linear Recurrence Relations With constant Coefficients, Homogeneous
Solutions, Total solutions, solutions by the method of generating functions (10 Hrs)
Unit IV
Graphs
Basic terminology, multi graphs and weighted graphs, paths and circuits, shortest path in
weighted graph, Hamiltonian and Euler paths and circuits, factors of a graph, planer graph
and Travelling salesman problem. (8 Hrs)
Unit V
Trees
Trees, rooted trees, path length in rooted trees, prefix codes, binary search trees, spanning
trees and cut set, minimal spanning trees, Kruskal’s and Prim’s algorithms for minimal
spanning tree, The Max flow –Min cut theorem (transport network). (8 Hrs)
Unit VI
Permutations, Combinations and Discrete Probability
Permutations and Combinations: rule of sum and product, Permutations, Combinations,
Algorithms for generation of Permutations and Combinations. Discrete Probability,
Conditional Probability, Bayes’ Theorem, Information and Mutual Information
(8 Hrs)
Text Books:
1. C. L. Liu and D. P. Mohapatra, “Elements of Discrete Mathematics”, SiE Edition,
TataMcGraw-Hill, 2008, ISBN 10:0-07-066913-9
2. R. Johnsonbaugh, “Discrete Mathematics”, 5th Edition, Pearson Education, 2001
ISBN 81 – 7808 – 279 - 9 (Recommended for Unit I and Unit II)
Reference Books:
1. N. Biggs, “Discrete Mathematics”, 3rd Edition, Oxford University Press, ISBN 0 –19 –
850717 - 8
2. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, 6th edition, McGraw-
Hill, 2007. ISBN 978-0-07-288008-3
3. E. Goodaire and M. Parmenter, “Discrete Mathematics with Graph Theory”, 2nd edition,
Pearson Education, 2003 ISBN 81 – 7808 – 827 – 4
4. Semyour Lipschutz & Marc Lipson, “ Discrete Mathematics”, McGraw-Hill, 3rd
Special Indian Edition, ISBN-13 : 978-0-07-060174-1
5. B. Kolman, R. Busby and S. Ross, “Discrete Mathematical Structures”, 4th Edition,
Pearson Education, 2002, ISBN 81-7808-556-9
6. N. Deo, “Graph Theory with application to Engineering and Computer Science”,
Prentice Hall of India, 1990, 0 – 87692 – 145 – 4
Subscribe to:
Posts (Atom)