b. tech computer science engineering · b. tech computer science & engineering 2017-18 . 2 b....

1

B. TECH COMPUTER SCIENCE &

ENGINEERING

2017-18

2

B. Tech. (Computer Science and Engineering) (2017 Regulations)

(Minimum Credits to be earned: 190)

SEMESTER-I

Course

Code

Course Name Hours/week Maximum Marks

Lectur

e Tutorial

Practica

l Credits CA FE Total

17BTMT101 Linear Algebra and

Calculus 3 1 0 4 40 60 100

17BTPY102 Engineering Physics 3 0 0 3 40 60 100

17BTEG104 English Communication 2 1 0 3 50 -- 50

17BTCS105

Fundamentals of

Computer

Programming

3 0 0 3 40 60 100

17BTEC106 Basics of Electrical and

Electronics Engineering 3 1 0 4 40 60 100

17BTME10

7 Engineering Graphics 3 0 1 4 40 60 100

17BTPY111 Physics Laboratory 0 0 2 1 40 60** 100

17BTCS112 C Programming

Laboratory 0 0 4 2 40 60** 100

17BTME11

3 Engineering Practices 0 0 2 1 50 -- 50

Total 17 3 9 25 380 420 800

SEMESTER-II

Course

Code


Lecture

Tutoria

l

Practica

l Credits CA FE Total

17BTMT201

Differential Equation

and Advanced

Calculus

3 1 0 4 40 60 100

17BTCH202 Engineering Chemistry

3 0 0 3 40 60 100

17BTCE203

Materials Engineering 3 1 0 4 40 60 100

17BTCS204 Principles of Digital

Systems 3 1 0 4 40 60 100

17BTCS205 Object Oriented

Programming in C++ 3 0 0 3 40 60 100

17BTEG206 Professional

Communication 3 0 2 4 100 -- 100

17BTCH211 Chemistry Laboratory 0 0 2 1 40 60** 100

17BTCS212 C++ Programming

Laboratory 0 0 4 2 40 60** 100

Total 18 3 8 25 380 420 800

CA = Continuous Assessment, FE= Final Examination, **Final Lab exam will be conducted with viva-voce of the respective practical (50 exam +10 viva = 60)

3

SECOND YEAR ENGINEERING SCHEME

SEMESTER-III

Course

Code


Lectur

e Tutorial Practical Credits CA FE Total

17BTMT301 Integral Calculus &

Transform Techniques 3 1 0 4 40 60 100

17BTCS302 Data Structures 4 0 0 4 40 60 100

17BTCS303 Computer Organization

&Architecture 4 0 0 4 40 60 100

17BTCS304 Microprocessors and

Interfacing 4 0 0 4 40 60 100

17BTCS305 Discrete Mathematics 3 1 0 4 40 60 100

17BTCS311 Data Structures

Laboratory 0 0 2 1 40 60** 100

17BTCS312 Microprocessors and

Interfacing Laboratory 0 0 4 2 40 60** 100

17BTCS321 Mini Project –I 0 0 4 2 100 -- 100

Total 18 2 10 25 380 420 800

SEMESTER-IV

Course

Code


Lecture Tutorial Practical Credits CA FE Total

17BTCS401 Advanced Data

Structure & Algorithms 3 1 0 4 40 60 100

17BTMT402 Probability and

Queuing Theory 4 0 0 4 40 60 100

17BTCS403 Computer Graphics 4 0 0 4 40 60 100

17BTCS404 Theory of Computation 3 1 0 4 40 60 100

17BTCS405 Economics for

Engineers 3 1 0 4 40 60 100

17BTCS411 Advanced Data

Structure Lab 0 0 2 1 40 60** 100

17BTCS412 Computer Graphics

Lab 0 0 4 2 40 60** 100

17BTCS421 Mini Project-II 0 0 4 2 100 -- 100

Total 17 3 10 25 380 420 800


4

THIRD YEAR ENGINEERING SCHEME

SEMESTER-V

Course

Code


Lecture

Tutoria

l Practical

Credit

s CA FE Total

17BTCS501 Design and Analysis of

Algorithms 3 1 0 4 40 60 100

17BTCS502 Software Engineering

Methodology 3 1 0 4 40 60 100

17BTCS503 System Programming &

Operating Systems 4 0 0 4 40 60 100

17BTCS504 Database Management

Systems 4 0 0 4 40 60 100

17BTCS505 Data Communication 4 0 0 4 40 60 100

17BTCS511 Programming Laboratory

– I 0 0 2 1 40 60** 100


– II 0 0 4 2 40 60** 100

17BTCS521 Mini Project –III 0 0 4 2 100 -- 100

Total 18 2 10 25 380 420 800

SEMESTER-VI

Course

Code


Lecture Tutorial Practical

Credit

s CA FE Total

17BTCS601 Computer Networks 4 0 0 4 40 60 100

17BTCS602 Environmental

Engineering 3 1 0 4 40 60 100

17BTCS603 Principles of Compiler

Design 4 0 0 4 40 60 100

17BTCS604 Artificial Intelligence 3 1 0 4 40 60 100

17BTCS63_ Elective-I 3 0 0 3 40 60 100


– III 0 0 2 1 40 60** 100


– IV 0 0 4 2 40 60** 100

17BTCS621 Mini Project-IV 0 0 4 2 100 -- 100

Total 17 2 10 24 380 420 800


.

5

FINAL YEAR ENGINEERING SCHEME

SEMESTER-VII

Course

Code


Lecture

Tutoria

l Practical

Credit

s CA FE Total

17BTCS701 Information Security 4 0 0 4 40 60 100

17BTCS702 Internet of Things 3 1 0 4 40 60 100

17BTCS703 Cloud Computing

4 0 0 4 40 60 100

17BTCS73_ Elective-II 3 1 0 4 40 60 100

17BTCS73_ Elective-III 3 1 0 4 40 60 100

17BTCS711 Programming Laboratory –

V 0 0 4 2 40 60** 100

17BTCS712 Programming Laboratory –

VI 0 0 2 1 40 60** 100

17BTCS721 Project Phase-I 0 0 4 2 100 -- 100

Total 17 3 10 25 380 420 800

SEMESTER-VIII

Course Code Course Name Hours/week Maximum Marks

Lecture Tutorial Practical Credits CA FE Total

17BTCS83_ Elective-IV 3 0 0 3 40 60 100

17BTCS83_ Elective-V 3 0 0 3 40 60 100

17BTCS821 Project Phase-II 0 0 20 10 100 200 300

Total 6 0 20 16 180 320 500

CA = Continuous Assessment, FE= Final Examination, **Final Lab exam will be conducted with viva-voce of the respective practical (50 exam +10 viva = 60).

6

SEMESTER SEMES

TER 1

SEMEST

ER 2

SEMES

TER 3

SEMES

TER 4

SEMEST

ER 5

SEMEST

ER 6

SEMEST

ER 7

SEMEST

ER 8

CREDITS 25 25 25 25 25 24 25 16

TOTAL

CREDITS

190

Course

Code COMPUTER ELECTIVES

ELECTIVE I

17BTCS631 Software Testing and Quality Assurance

17BTCS632 Operation Research

17BTCS633 Digital Signal Processing

17BTCS634 Project Management and Entrepreneurship

ELECTIVE II

17BTCS731 Data Mining

17BTCS732 Software defined network

17BTCS733 Advanced Computer Graphics

17BTCS734 Open Elective

ELECTIVE III

17BTCS735 Design Thinking

17BTCS736 Block Chain Technology & Applications

17BTCS737 Embedded System Design


ELECTIVE IV

17BTCS831 Data Analytics using Python

17BTCS832 Introduction to Operations Research

17BTCS833 Entrepreneurship Essentials


ELECTIVE V

17BTCS834 Machine Learning

7

17BTCS835 Digital Forensics

17BTCS836 Patent Law for Engineers and scientists

17BTCS837

Open Elective

*Color codes indicates the respective domain/specialization

General subjects

Intelligent Systems

Networks and Security

Embedded and IoT

Open Elective

8

SEMESTER-I

17BTMT101: LINEAR ALGEBRA AND CALCULUS 3104

CA:40 Marks FE : 60 Marks No. of Total Lectures = 45 Hours

MATRICES 9

Rank, Normal Form, System of Linear Equations, linear Dependence and Independence And Orthogonal

Transformations, Eigen Vectors, Cayley – Hamilton Theorem , Application to problems in Engineering

(Translation and Rotation of Matrix

LINEAR ALGEBRA AND MAPPING 9

Basic concepts in linear algebra: vector spaces, Subspaces, linear independence and dependence of

vectors, bases, dimensions. Row and Column Linear mappings, representation by matrices, rank-nullity

theorem.

LIMIT, CONTINUITY AND DIFFERENTIATION OF UNIVARIATE FUNCTION 9

Limit, Continuity, indeterminate forms, L‟Hospital Rule, Evaluation of limits, Mean value Theorems,

Differential Calculus: Successive Differentiation, Leibnitz Theorem.

INFINITE SERIES &EXPANSION OF FUNCTIONS 9

Infinite Sequences, Infinite Series, Alternating Series, Test for Convergence, Absolute and Conditional

Convergence, range of Convergence, Taylor‟s series And McLaurin‟s Series

INTEGRAL CALCULUS AND FOURIER SERIES 9

Integral Calculus: Reduction Formula, Beta and Gamma Functions, Fourier Series: Definition,

Dirichlet‟s condition, Full range Fourier series Half range Fouries series , Harmonic analysis and

application to problem in Engineering

TEXT BOOKS

1. Erwin Kreyszig, “Advanced Engineering Mathematics”, Wiley Eastern Ltd, 10th edition .

2. Maurice D. Weir, Joel Hass, Frank R. Giordano, “Thomas‟ Calculus”, Pearson Education, 12th edition.

REFERENCES

1. Serge Lang, “Linear Algebra”, Springer, 3rd edition, .

2. Howard Anton and Chris Rorres, “Elementary Linear Algebra”, John Wiley and Sons, 10th edition, .

3. C.R. Wylie, “Advanced Engineering Mathematics”, McGraw Hill Publications, New Delhi, .

4. Peter V. O‟ Neil, Advanced Engineering Mathematics, Thomson Brooks/Cole, Singapore, 7th edition .

5. Shanti Narayan, “Differential Calculus”, S. Chand and Company, New Delhi, .

6. George Simmons, “Differential Equation with Applications”, , .

9

17BTPY102: ENGINEERING PHYSICS

3003

CA : 40 Marks

FE : 60 Marks

No. of Total Lectures = 45 Hours

ACOUSTICS & ULTRASONICS 9

Classification of sound - characteristics of musical sound - intensity - loudness - decibel - Reverberation - Reverberation time, Absorption coefficient and its determination - factors affecting acoustics of building (Optimum reverberation time, loudness, focusing, echo, echelon effect, resonance and noise) and their remedies.

Ultrasonics - production - Magnetostriction and Piezoelectric oscillator – properties- applications of

ultrasonics with particular reference to detection of flaws in metal (Non - Destructive testing NDT) -

SONAR.

WAVE OPTICS & APPLICATIONS 9

Interference – Interference in uniform and non-uniform thickness thin films, fringe width, formation of Newton‟s rings and its application (i) for the determination of wavelength of incident light or radius of curvature of a given palno-convex lens,(ii) for the determination of refractive index of a given liquid, Applications of interference (i) Testing of optical flatness of surfaces,(ii) Anti-reflection coating.

Diffraction – Fraunhofer diffraction at Single slit, plane diffraction grating, Conditions for maxima and minima.Polarization - Generation and Analysis of Plane polarized, circularly polarized and elliptically polarized light, LCD (as an example of polarization).

LASER & PHOTONICS 9

Principle of lasers - Stimulated absorption - Spontaneous emission, stimulated emission – metastable state-population inversion - pumping action - active medium - laser characteristics - Ruby laser – He:Ne laser - Semiconductor laser - applications

Optical fiber - fiber optic communication system- Photonics crystals-Photonics crystal fiber

QUANTUM MECHANICS &NANOTECHNOLOGY 9

Need and origin of quantum concept, Wave-particle duality, Uncertainty Principle, Illustration of it by electron diffraction at single slit, Significance & normalization of wave function, Schrodinger wave equation: time independent & dependent, Eigen functions & Eigen values, particle in a rigid box and non-rigid box .

10

Origin of Nanotechnology, Nanomaterials-Synthesis by physical, chemical, biological, mechanical method,

Optical-electrical-magnetic-structural-mechanical properties of nanomaterial, Applications of

Nanotechnology.

GREEN ENERGY PHYSICS 9

Introduction to Green energy – Solar energy: Energy conversion by photovoltaic principle – Solar cells – Wind

energy: Basic components and principle of wind energy conversion systems – Ocean energy: Wave energy

– Wave energy conversion devices – Tidal energy – Geothermal energy: Geothermal sources – Biomass: Biomass and bio-fuels – bio-energies from wastages – Fuel cells

TEXT BOOKS

1. ArtherBeiser, “Concepts of Modern Physics”, Tata Mcgraw Hill, 1994.

2. John Buck,“Fundamentals of Optical Fibers”, , 2004.

3. Avadhanulu M N and KshirSagar P G, “A Text Book of Engineering Physics”, 2010.

REFERENCES

1. Hecht E, “Optics”, Pearson Education, 2017.

2. Sulabha K. Kulkarni, “Nanotechnology: Principles and Practices”, Springer, 2015.

3. Godfrey Boyle, “A Renewable Energy: Power sustainable future”,Oxford University Press, UK, 2012.

3

http://www.amazon.in/s/ref=dp_byline_sr_book_1?ie=UTF8&field-author=Sulabha+K.+Kulkarni&search-alias=stripbooks

11

17BTEG104: ENGLISH COMMUNICATION

2103

CA : 50 Marks


ESSENTIALS OF EFFECTIVE ORAL COMMUNICATION 5

Introduction to the process of effective communication- developing confidence, self-concept, clarity of thought - audience analysis- overcoming barriers to communication- body language- paralanguage, presentation techniques, and short speeches.

READING COMPREHENSION 4

Developing reading skills like skimming and scanning for information, critical reading, inferential, cognition, and analytical skills- appropriate reading texts to be used from general, scientific, and literary genres - review of a short story.

PRINCIPLES OF CLEAR WRITING 6

The fundamental aspects of formal writing like objectivity, conciseness, clarity, simplicity, coherence, parallelism, unity, cohesion, and accuracy to be focused – descriptive writing - guidelines for writing expository, analytical, descriptive, and argumentative essays or articles –writing for focus: writing in different ways to create an emphasis and focus to be focused – samples from news items, creative articles, and reports to be used.

NOTE –MAKING, SUMMARIZING AND PARAPHRASING 1

Passages pertaining to general and science topics to be used to train students in note-making, summarizing and paraphrasing.

TECHNICAL WRITING 2

Technical style, mechanics, critical evaluation of different types of technical texts and different genres of technical writing – transcoding – interpretation of the information represented in graphical elements like graphs, tables, charts, and diagrams.

CLOZE TEST AND SPOTTING ERRORS 4

Passages with numbered gaps to be used to provide training in the use of vocabulary, syntax, and reading comprehension - spotting common errors in the use of language functions and guidelines for rectifying the same.

CORRESPONDENCE - Principles of official, social, and e-mail correspondence to be

focused. 3

GROUP COMMUNICATION - Group discussions and role-plays. 4

LISTENING - Exercises using language laboratory. 1

TEXTBOOK

12

1. Monograph prepared by the Faculty, Department of English, in 2012.

REFERENCE BOOKS

1. Dorothy E Zemach and Lynn Stafford Yilmaz, “Writers at Work: The Essay”, Cambridge University Press,

Cambridge,

2008.

2. AyshaViswamohan, “English for Technical Communication”, Tata Mc-Graw – Hill Publishing Company Ltd., New Delhi, 2008.

3. Mark Ibboston,”Cambridge English for Engineering”, Cambridge University Press, UK, 2011.

4. E. Suresh Kumar and P. Sreehari, “A Handbook for English Language Laboratories”, Osmania University, Hyderabad, 2011.

13

17BTCS105: FUNDAMENTALS OF COMPUTER PROGRAMMING

3003

CA : 40 Marks

FE : 60 Marks


INTRODUCTION TO COMPUTER 9

Block diagram of typical Computer, hardware, software. Introduction to System Software‟s- Operating System, Editor, Complier, Assembler, Linker, Loader. Problem solving using computers, Introduction to computer programming, Introduction to program planning tools- algorithm, flowcharts, pseudo codes, Software Development Life Cycle, Introduction to open source operating systems and programming languages, Introduction to program development environments: BOSS and GCC

INTRODUCTION TO C PROGRAMMING 9

Types of programming languages, Features of C, basic concepts, structure of a C program, declarations, variables, data types, expressions, conditional expressions. Operators- assignment, arithmetic, relational, logical, increment and decrement, precedence of operators, type conversions, scanf and printffunctions.decision control and blocks. Loop control. break&continue.

ARRAYS AND STRINGS 9

Concept and requirement of arrays, defining arrays –one, two and multi-dimensional. Important problems that use

arrays.

Strings, Concept, declaration, initialization and string manipulation functions, library functions.

FUNCTIONS AND RECURSION 9

Concept of subprogram applied to C, Declaration, Definition, Calling. Arguments, Local variables. Global and

Static variables.

Important problems using functions. Concept of recursion, essential components of a recursive program, recursion

v/s iteration.

Some important recursive algorithms.

POINTERS & STRUCTURES POINTERS 9

Pointers and addresses, Use of pointers for passing variables, Pointers and arrays, Dynamic allocation and its

application.

14

STRUCTURES AND FILE HANDLING STRUCTURES 9

Pointers and structures, Structures and Functions, Self-referential structures Introduction to linked lists and data

structures.

What is a file. Basics of file handling (Text files).

TEXT BOOKS

1. E. Balguruswamy, “Programming in ANSI C”, Tata Mc-Graw Hill

2. “Programming With C”, Schaum Series Reference Books

REFERENCE BOOKS

1. Stephen G. Krantz, “Problem Solving Techniques” , Universities Press.

2. Kernighan and Ritchie, “The „C‟ programming language”, Prentice Hall

3. V. Rajaraman, “Computer Programming in „C‟”, Prentice Hall

4. R.G. Dromey, “How to solve it by Computer”, Pearson Education.

15

17BTEC106: BASICS OF ELECTRICAL AND ELECTRONICS

ENGINEERING 3104

CA : 40 Marks FE : 60 Marks No. of Total Lectures = 45 Hours

D.C. CIRCUITS AND A.C. CIRCUITS 9

Classification of network, Ohm's law, KCL, KVL, network simplification using star-delta / delta-star transformations mesh analysis, network theorems (Superposition, Thevenin, Norton, Maximum power transfer theorems).

Generation of alternating voltages, fundamentals of ac circuits, behaviour of pure R, L, C in ac circuits, concept of phasor and its representation ,series RL, RC and RLC circuits and parallel circuits, series and parallel resonance, concept of Impedance and admittance, power triangle and power factor.

ELECTRICAL MACHINES 9

(a) Electromechanical energy conversion: Types of ac and dc motors,Characteristics and applications, ac generators.Single phase transformer: Construction, principle of working, emf equation, ratios, regulation, losses, efficiency, condition for maximum efficiency, O.C & S.C. test, introduction to instrument transformer and auto-transformer.

(b) Poly-Phase A.C. circuits: Concept of three phase supply, phase sequence, balanced and unbalanced load, voltages, currents and power relations in three phase balanced star and delta connected loads with phasor diagrams.

SEMICONDUCTOR, DIODES AND DIODE CIRCUITS 9

Metals, semiconductors and insulators, Mobility and conductivity, Intrinsic and extrinsic semiconductors and charge densities in semiconductors.

PN Junction diode : characteristic and analysis, Types of diodes – Zener diodes, Photodiodes, Light emitting diodes (LED‟s), Varactor diodes and tunnel diodes, BJT, characteristics and biasing circuits.

Rectifiers: Half wave, full wave and Bridge rectifier circuits and their analysis.

DIGITAL ELECTRONICS 9

Introduction, digital signals, Basic digital gates and universal gates: AND, OR, NOR, NOT, NAND, EX-OR, EX-

NOR, Boolean algebra, Optimized implementation of logic functions: K map, minimization of SOP, POS , Arithmetic circuits, Multiplexer, De-multiplexer, Flip flops: Basic latch, Gated SR, JK flip flop, D flip flop, T flip flop, Shift registers, Counters, Introduction to microprocessors and micro-controllers and their

16

applications.

TRANSDUCERS 9

Definition, classification, Selection criteria, Sources of error for parameter under measurement, Transducer specifications, test condition & operating conditions, Ultrasonic transducer, Temperature transducer, Linear variable differential transducer, Load cell, Flow measurement, Strain gauge, Elastic transducers. Application of transducers: Digital thermometer, Electronics weighing machine

REFERENCES

1. Vincent Del Toro, “Electrical Engineering Fundamentals", PHI, 2nd edition, 2011.

2. V. N. Mittal and Arvind Mittal “Basic Electrical Engineering” Tata McGraw Hill, (Revised Edition)

3. Edward Hughes “Electrical and Electrical Technology”, Pearson Education (Tenth edition)

4. Paul Horowitz, “Art of Electronics”, Cambridge LPE.

5. Allen Mottershed, “Electronics Devices and Circuit an Introduction”, PHI. 6. C.D.Jhonson, “Process control and instrumentation”, PHI (Fifth edition).

7. H. S. Kalsi, “Electronics Instrumentation” Tata McGraw Hill.

8. Nagrath And Kothari, “Electrical Machines”, Tata McGraw Hill.

17

17BTME107: ENGINEERING GRAPHICS 3014


ORTHOGRAPHIC PROJECTIONS &

ISOMETRIC PROJECTIONS 9

Reference planes, types of orthographic projections – First angle projections, Methods of obtaining orthographic views by First angle method,Sectional orthographic projection.

Isometric view, Isometric scale to draw Isometric projection, Non-Isometric lines, Construction of Isometric view from given orthographic views.

PROJECTIONS OF LINES & PLANES 9

Introduction of points, lines & planes of projection, Reference and auxiliary planes, projections of points and Lines in different quadrants, Types of line, traces, inclinations, and true lengths of the lines ,Introduction of perpendicular and oblique planes, Different cases of plane figures (of different shapes) making different angles with one or both reference planes, Obtaining true shape of the plane figure.

PROJECTION OF SOLIDS & DEVELOPMENT OF SOLID 9

Introduction of solids, different types of solids, Projection of solid inclined to one and both references plane, Simple cases when solid is placed in different positions, Axis, faces and lines lying on the faces of the solid making given angles, Development of all type of prisms, cylinders and cones.

18

CURVES USED IN ENGINEERING PRACTICE 9

Conic section- like ellipse, parabola & hyperbola by diretrix focus method rectangular Archimedean Spiral, Helix on cylinder, involutes of circle, Cycloid of circle.

DRAFTING TECHNOLOGY AND FREEHAND

SKETCHING 9

Layout of drawing sheets, sizes of drawing sheets Dimensioning – linear, angular, aligned system, unidirectional system, parallel dimensioning, chain dimensioning, location dimension and size dimension, Symbols used on drawing, surface finish symbols, welding symbols, Free hand sketching -- FV and TV of standard machine parts, Hexagonal headed nut and bolt, foundation bolts, shafts, keys, couplings, springs, screw thread forms, welded joints, riveted joints.

TERM WORK:

Five A2 (594X420mm) (Half imperial) size drawing sheet as detailed below: Sheet No. 1 : ORTHOGRAPHICS & ISOMETRIC VIEW : Two problems on orthographic view &

Isometric views. Sheet No. 2 : PROJECTIOINS OF LINES & PLANES :Two problems on lines & planes. Sheet No. 3 : PROJECTION OF SOLIDS : Two problems on solids. Sheet No. 4 : ENGINEERING CURVES: To draw any four curves mentioned in the detailed

syllabus. Sheet No. 5 : FREEHAND SKETCHING:Four problems on machine parts and joints

TEXT BOOKS

1. N. D. Bhatt, “Elementary Engineering Drawing”, Chartor Publishing house, Anand, India.

2. D. N. Johle, “Engineering Drawing”, Tata Mcgraw-hill Publishing Co. Ltd.

3. K. L. Narayana and P. Kannaiah,”Textbook on Engineering Drawing”,Scitech Pub, 2010.

REFERENCE BOOKS

1. P. S. Gill, “Engineering Graphics”, S K Kataria and Sons, Reprint 2013 edition (2013)

2. N. D. Bhatt, “Machine Drawing”, Chartor Publishing House, Anand, India.

3. Warren J. Luzzader, “Fundamentals of Engineering Drawing”, Prentice Hall of India, New

Delhi.

4. Fredderock E. Giesecke, Alva Mitchell & others, “Principles of Engineering Graphics”,

Maxwell McMillan Publishing.

19

17BTPY111: PHYSICS LABORATORY 0021

CA : 40 Marks FE : 60 Marks

No. of Total Lectures = 15

Hours

LIST OF EXPERIMENTS (ANY EIGHT EXPERIMENTS)

1. Determination of velocity of ultrasonic waves in liquid using ultrasonic interferometer 2. (a)Measurement of sound pressure level

(b)Determination of absorption coefficient of sound of given material

3. Determination of wavelength of monochromatic light source using Newton‟s Ring

4. Determination of wavelength of spectral lines by using a plane diffraction grating

5. Verification of Malus law for polarization of light

6. Determination of wavelength and beam divergence of He Ne laser beam

7. Study of V-I characteristics of Solar Cell

8. Determination of numerical aperture of an optical fiber

9. Working of a Fuel Cell.

20

17BTCS112: C PROGRAMMING LABORATORY 0042

CA : 40

Marks FE : 60 Marks


Hours

LIST OF EXPERIMENTS

GROUP A: Essential Prerequisites (Compulsory)

1. Use of Eclipse Editor for creating C projects. (1 hr)

2. Using Eclipse Write “Hello World” program in C. (1hr)

GROUP B: BASIC C Programming (At least 12)

1. Write a C program to accept the length of three sides of a triangle and to test and print the type of triangle as equilateral, isosceles or right angled or none. (2hrs)

2. Write a C program to reverse a given Integer. (1 hr)

3. Write a C program to check whether the given no. is palindrome. (1 hr)

4. Write a C program to display multiplication table of given no. (2 hrs)

5. Write a C program to compute GCD of two given integers. (2 hrs)

6. Write a C program to find maximum & minimum element from the array. (2 hrs) 7. Write a C program to compute addition, subtraction & multiplication of two matrices. (2 hrs)

8. Write a C program to compute the factorial of given positive integer using recursive function. (2hrs)

9. Write a C program to sort n integers using bubble sort. (2 hrs)

10. Write a C program to accept a string and to display the following :( 2 hrs)

a. Total number of characters in the string

b. Total number of vowels in the string c. Total number of occurrence of particular character in the string

11. Write a C program to carry out following operations on strings using library functions (2 hrs)

a. To concatenate a string S2 to string S1

b. To find the length of a given string

c. To compare two strings S1 and S2

d. To copy a string S2 to another string S1

12. Write a C program to accept a string and replace all the vowels in the string with *. (2 hrs)

13. Write a C program with function to swap values of two elements (call by reference). (2 hrs)

14. Write a C program to store information of 10 students using structure. (2 hrs)

15. Write a C program to merge two files. (2 hrs)

TEXTBOOK

1. Donald E. Knuth, “The Art of Computer Programming”, Vols. 1, Addison-Wesley, ISBN-13: 978-

0201485417,

ISBN-10: 0201485419

2. T. E. Bailey, “Program design with pseudo code”, Brooks/Cole Publisher, ISBN-10:0534055745, ISBN-

13:

21

978-0534055745

3. Brian W. Kernighan, Dennis M. Ritchie, “The C Programming Language”, Prentice Hall, ISBN

0131103628, Second Edition.

REFERENCE BOOKS

1. Lamey Robert, “Logical problem solving”, Prentice Hall, ISBN: 9780130618825

2. Herbert Schildt, “C/C++ Programmer's Reference”, McGraw-Hill, ISBN-13: 978-0072127065, ISBN-10: 0072127066

3. Henry Mullish , Herbert L. Cooper, “The Spirit of C”, Thomson Learning, ISBN 0314285008

4. Carlo Ghezi, Mehdi Jazayeri, “Programming Language Concepts”, John Wiley and Sons, ISBN

0471104264,

Third Edition

5. CDAC: BOSS GNU/Linux User's Manual

22

17BTME113: ENGINEERING PRACTICES 0021

CA : 50 Marks


Hours

JOB: ANY TWO JOBS OF THE FOLLOWINGS.

i. Carpentry shop Any marketable job involving at least one joint like T-Joint, Mortise and Tennon joint, Dovetail joint.

Assignment on

• Study of joints in door panels, wooden furniture

ii. Tin Smithy Shop Any one sheet metal manufacturing component like tray, scoop, funnel etc.

Assignment on :

• Write a procedure on manufacturing of any one job.

iii. Machine shop Simple turning operations on lathe machine at least six operations.

Turning - Facing, chamfering and step turning, Grooving, Taper turning and knurling

Assignment on

• Study of construction features of Head stock, Tail stock, Apron gear box.

iv. Welding shop Any two types of joints like T-Joint, but joint, lap joints etc.

Assignment on

• Study on types of joints used in Industrial trusses .

DEMONSTRATION ON

(a) Smithy operations like the production of „S‟ Type hook.

(b) Foundry operation like mould preparation for flange.

ASSIGNMENT

1. Safety in workshop e.g fire safety, electric shock, machine protection etc.

2. Write a procedure of any one job manufacturing.

3. To Study and practice the various operations that can be performed in Lathe, drilling, milling machines etc.

23

Semester- II

17BTMT201: DIFFERENTIAL EQUATIONS AND CALCULUS 3104



Hours

DIFFERENTIAL

EQUATIONS 9

Definition, Order and Degree of D.E. Formation of DE. Solution of variables separable DE. Exact DE. Linear and reducible to these types

APPLICATION OF DIFFERENTIAL EQUATION 9

Application of DE to Orthogonal trajectories. Newton‟s law of cooling , Kirchhoff‟s law of electrical circuits, Motion under gravity, Rectilinear motion, Simple Harmonic motions, One Dimensional conduction of heat , Chemical Problem.

PARTIAL DIFFERENTIATION AND APPLICATIONS 9

Partial Derivatives, Euler‟s Theorem on Homogeneous functions, Implicit Function, Total derivatives, Change of Independent Variables.Jacobian and their applications, Maxima and Minima of function of two variables, Lagrange‟s undermined multipliers.

INTEGRAL CALCULUS AND TRACING OF CURVES 9

Differentiation under integral sign, Error Function, Cartesian, polar and parametric curves. Rectification of curves.

MULTIPLE INTEGRATION 9

Double and triple Integrations, Applications to area, Volume, mean and root mean square values. Mass, centre of gravity and M.I.

TEXT BOOKS

1. Erwin Kreyszig, “Advanced Engineering Mathematics”, Wiley Eastern Ltd, 10th edition .

2. Maurice D. Weir, Joel Hass, Frank R. Giordano, “Thomas‟ Calculus”, Pearson Education, 12th edition, .

REFERENCES

24

1. Calculus for Scientists and Engineers by K.D Joshi, CRC Press.

2. A Course in Calculus and Real Analysis (1st edition) by SudhirGhorpade and BalmohanLimaye, Springer-Verlag, New York.

3. Advanced Engineering Mathematics by C.R. Wylie, McGraw Hill Publications, New Delhi.

4. Advanced Engineering Mathematics (7th edition) by Peter V. O‟ Neil, Thomson. Brooks / Cole,

Singapore.

5. Differential Calculus by Shanti Narayan, S. Chand and company, New Delhi

6. Differential Equation with Applications By George Simmons

25

17BTCH202: ENGINEERING CHEMISTRY 3003



Hours

WATER TREATMENT AND GREEN CHEMICAL PROCESSES 9

Water quality parameters -Hardness of water - estimation of hardness (EDTA method) COD/BOD –

determination Alkalinity - determination - disadvantages of using hard water in boilers: Scale, sludge

formation - prevention - Internal conditioning and External conditioning - desalination – reverse osmosis

and electro dialysis - domestic water treatment. Principles of green chemistry, environmentally benign

synthetic methods.

ORGANIC POLYMERS 9

Classification of polymers - types of polymerization reactions - mechanism of polymerization, properties

of polymers - strength, dissolution, elasticity and crystallinity -Preparation and properties of important

resins: Polystyrene, PVC, PMMA, Polyester, Teflon, Bakelite and Epoxy resins –Elastomers, Engineering

polymers, compounding of plastics -moulding methods - injection, extrusion, Fibre reinforced plastics.

FUELS AND COMBUSTION 9

Types of fuels, calorific value and its determination, Solid fuel-Proximate and ultimate analysis of coal,

Liquid fuel-Petroleum, power alcohol & biodiesel, Gaseous fuels, fuel cells & their types, Combustion

mechanism.

CORROSION AND ITS CONTROL 9

Dry and wet corrosion, mechanism of corrosion, control of corrosion-cathodic protection, anodic

protection, surface conversion techniques, Metallic and non-metallic coatings.

SOLID STATE CHEMISTRY 9

Introduction to solid state chemistry, Miller indices, Basic crystal structure, Bravais space lattices, unit

cell, Radius ratio, Calculation of density of unit cell, defects- Frenkel, Schottky, Bragg‟s law & X-ray

diffraction technique.

TEXTBOOKS

1. S. S. Dara, “A Textbook of Engineering Chemistry”, S.Chand& Company Ltd.,15th edition, New Delhi, . 2. O.P.Vermani&A.K.Narula, “Applied Chemistry Therory& Practical”,.

26

REFERENCES

1. H. V. Keer, “Principles of Solid State”, Wiley Publication, .

2. V. Gowarikar, N.V.Vishwanathan and JaydevShreedhar, “Polymer Science”, Wiley Publications.

3. H.H. Uhlig and R.W. Revie, “Corrosion and its Control”, Wiley Publications,4th Edition,.

4. A. I. Vogel, “A Textbook of Quantitative Inorganic Analysis”, Longman Publication Ltd, 4th Edition, 2000.

5. Shashi Chawla, “Essentials of Experimental Engineering Chemistry”, Dhanpat Rai & Co. Delhi, 2001.

27

17BTCE203 : MATERIALS ENGINEERING 3104


ELECTRONIC AND PHOTONIC MATERIALS 9

Electronic Materials: Fermi energy and Fermi–Dirac distribution function –Variation of Fermi level with

temperature in intrinsic and extrinsic semiconductors – Hall Effect – Superconducting Materials: Normal and

High temperature superconductivity – Applications. Photonic Materials: LED – LCD – Photo conducting

materials – Photo detectors

CRYSTAL STRUCTURE 9

Crystal geometry and Crystal Imperfections: Unit Cell, Crystal structure, Bravais lattice, atomic packing, coordination number, radius ratio, crystal structures of metallic elements, crystal directions and planes, Miller indices, Polymorphism or Allotropy. Crystal structure and correlated properties. Diffusion processes; Crystallization: Mechanism of crystallization

MAGNETIC AND DIELECTRIC MATERIALS 9

Magnetic Materials: Classification of magnetic materials based on spin – Hard and soft magnetic materials – Magnetic bubbles and their applications – Magnetic thin films

Dielectric Materials: Polarization mechanisms in dielectrics – Frequency and temperature dependence of polarization mechanism – Dielectric loss –Piezoelectric, pyro electric and ferroelectric materials and their applications.

MATERIALS CHARACTERIZATION 9

X-ray diffraction, Principles of Scanning Electron Microscope(SEM) , Tunnelling Electron Microscope (TEM),Atomic Force Microscopy(AFM),Fourier transform Infrared spectroscopy (FTIR) – Ultraviolet and visible spectroscopy (UV-Vis) – Thermo gravimetric Analysis (TGA) – Differential Thermal Analysis (DTA).

MODERN ENGINEERING MATERIALS 9

Modern Engineering Materials: Smart materials – Chromic materials (Thermo, Photo and Electro) – Rheological fluids – Metallic glasses – Ceramics

Bio-materials: Classification of bio-materials (based on tissue response) –Comparison of properties of some common biomaterials – Biosensor.

Nanomaterials: fullerenes – Graphene – Carbon nanotubes- Potential uses of nanomaterials in electronics, robotics, computers, sensors, sports equipment, Medical applications of nanomaterials.

28

TEXT BOOKS

1. William D Callister ,"Material Science and Engineering", John Wiley and sons, New York, 2013.

2. Thiruvadigal.J.D, Ponnusamy,S..Sudha.D. and Krishnamohan M., “Materials Sciences”, Vibrant

Publication,

Chennai, 2013.

3. Rajendran.V, “Materials Science”,Tata McGraw- Hill,New Delhi,2011.

REFERENCES

1. Rolf.E. Hummel, “Electronic Properties of Materials”, 4th ed., Springer, New York, 2011.

2. Dennis.W. Prather, “Photonic Crystals: Theory, Applications, and Fabrication”, John Wiley & Sons,

Hoboken, 2009.

3. James R. Janesick, “Scientific Charge-Coupled Devices”, Published by SPIE - The International Society for Optical Engineering, Bellingham, Washington, 2001.

4. SeverialDumitriu, “Polymeric Biomaterials” Marcel Dekker Inc, CRC Press, Canada 2001.

5. T.Pradeep, “A Text Book of Nanoscience and Nanotechnology”, Tata McGraw Hill, New Delhi, 2012.

6. Sam Zhang, “Materials Characterization Techniques”, CRC Press, 2008.

29

17BTCS204: PRINCIPLES OF DIGITAL SYSTEMS

3104


NUMBER SYSTEMS 9

Review of binary, decimal, octal and hexadecimal number systems – Interconversion between number systems-Number representations: signed, unsigned, fixed point, floating point numbers- One‟s complement - Two‟s complement addition, subtraction- Computer codes: BCD, Gray code - Error detection and correction codes - parity codes-Hamming codes.

COMBINATIONAL AND SEQUENTIAL CIRCUITS 9

Implementation of combinational circuits,Flip-flops- Types- latches - Level triggering, edge triggering- Master slave configuration – Counters: Asynchronous / Ripple, Synchronous , Modulo- n –Design procedure – Shift registers - Ring counter - Johnson counter.

LOGIC FAMILIES 9 Introduction

to different logic families; TTL inverter - circuit description and operation; CMOS inverter - circuit description and operation; Structure and operations of TTL and CMOS gates; Electrical characteristics of logic gates – logic levels and noise margins, fan-out, propagation delay, transition time, power consumption and power-delay product

INTRODUCTION TO COMPUTER ARCHITECTURE 9

Evolution of computer architecture, The Von Neumann Architecture, Harvard Architecture, Introduction to ALU, System Bus, Timing and Control Circuitry, I/O Devices.

MEMORY ORGANIZATION 9

Introduction, Classification and characteristics of memories–RAM organization–Write operation–Read operation– Memory decoding-ROM organization–Types of ROM.

TEXT BOOKS

1. Morris Mano M, “Digital Design ", Prentice-Hall of India, New Delhi, 2006.

2. Floyd T L, “Digital Fundamentals ", Pearson Education, Eighth Edition, New Delhi, 2009.

REFERENCES

1. Tokheim R L., “Digital Electronics - Principles and Applications ", Tata McGraw Hill Publishing Company, New Delhi, 2001.

2. William I Fletcher, “An Engineering Approach to Digital Design ", Prentice-Hall of India, New Delhi,

1996.

3. Morris Mano, “Computer System Architecture”, Prentice Hall of India, Third Edition, New Delhi, 2006.

30

17BTCS205: OBJECT ORIENTED PROGRAMMING IN

C++ 3003



Hours

INTRODUCTION 9

Introduction to Algorithms, Complexities and Flowchart, Introduction to Programming, Categories of Programming Languages, Program Design, Programming Paradigms, Characteristics or Concepts of

OOP, Procedure Oriented Programming VS object oriented Programming.

Introduction to C++: Character Set, Tokens, Precedence and Associativity, Flow chart, Program Structure, Data Types, Variables, Operators, Expressions, Statements and control structures,I/O operations.Objects interaction, Classes, Hierarchies of classes,Inheritance,Polymorphism,Abstract classes. Array, Functions Objects, Objects as software modules

PROGRAMMING IN C++ 9

Identifying objects and classes, Representation of objects, Modeling, objects and classes, Relationships.

Data Types: Properties of structured and non-structured data types and Objects, variables, constants,Derived and abstract data types, declaration, type checking. Binding and binding times, type

conversion,scalar data type, composite data types, Implementation and Storage representation of data types and control flow statement.Association between objects, aggregate components of objects. Storage

Management: Memoryallocation, Dynamic allocation,New and delete Operator.

OBJECT ORIENTED PROGRAMMING IN C++

9 Object oriented programming languages, Class declarations, Object declarations, Mandatory profiles, Message sending, Association, Recursive association, Many to many

association,Argumentpassing.Object& Classes, Scope Resolution Operator, Constructors & Destructors, Friend Functions, Inheritance: Types of Inheritance,Inherited methods, Redefined methods,The protected

interface, Abstract base classes, Public and protected properties, Private operations, Disinheritance, Multiple inheritance.Polymorphism, Overloading Functions & Operators,

VIRTUAL FUNCTION AND EXCEPTIONAL HANDLING 9

Virtual functions. Pointers to objects, „this‟ pointer, Pointers to derived class, virtual function, rules for virtual function, pure virtual function, abstract class, virtual destructors, early and late binding, container classes

Templates : Introduction, Function template and class template, overloading function template, Introduction

to

Standard Template Library (STL), containers, iterators and algorithms. Namespaces: Introduction, Rules of namespaces .Exception Handling: Introduction, Exception handling mechanism: try, catch and throw,

31

Multiple Exceptions, Exceptions with arguments

STUDY OF C++ 9

Study of C++ as object oriented programming language, Managing Console I/O Operations: Introduction, C++ streams, stream classes, unformatted I/O, formatted I/O and I/O manipulators File I/O: Introduction, Classes for file stream operations, file operations.

TEXT BOOKS

1. Deitel and Deitel, “C++ How to Program”, Sixth Edition, Prentice Hall,2007.(UNIT 1,2,3)

2. Herbert Schildt, “Java The complete reference”, Eighth Edition, McGraw Hill Professional, 2011.(UNIT

4,5)

REFERENCE BOOKS

1. Balagurusamy E., “Object oriented programming with C++”,Fifth Edition, Third Reprint, Tata

McGraw–Hill Education , 2011.

2. Ira Pohl, “Object Oriented Programming using C++”, Pearson Education, Second Edition, Reprint 2004.

3. Lippman S. B., JoseeLajoie, Barbara E. Moo, “C++ Primer ”, Fourth Edition, Pearson Education, 2005.

4. ISRD Group, “Introduction to Object–oriented programming throughJava”,Tata McGraw–Hill

Publishing Company Ltd., 2007.

32

17BTEG206: PROFESSIONAL COMMUNICATION 3024

CA : 100 Marks No. of Total Lectures = 45 Hours

LANGUAGE TRAINING, SOFT SKILLS (7+7+7+7)

Reading Comprehension: Critical, inferential, analytical, and interpretative Reading tasks – reading texts from different genres- assessment components modeled on IELTS, TOEFL, & GRE examinations.

Language Focus – Writing: Context based Syntax, vocabulary, and special language functions like idioms and phrases, connectives, style, Tone, and emphasis techniques- academic and professional writing- describing visual information like graph/table/chart/diagram- drafting letters, emails, mini- reports

Professional Communication –Oral Skills: Principles of group communication, interviewing, and making

presentations- group discussions, role plays, mock interviews- talking about some visual information- giving and receiving instructions.

Soft Skills: Intrapersonal communication- developing self-concept, handling Perceptual differences, Demonstrating Positive attitude, body language Interpersonal Skills- Team spirit, Body Language, Business etiquette, Negotiation skills.

SEMINAR PRESENTATION AND TECHNICAL REPORT WRITING (16+16)

Writing Coherent Project Report: Overview structure of reports, gathering informations - synopsis /

abstract – title – headings – table of contents – list of figures – list of tables – list of appendices – chapters –

structured paragraphs – inferences, conclusions – figures – tables – flow charts – complete design (headers

and footers).

Plagiarism.

Each student will be required to submit a technical report based on the guidelines provided by the

department.

Project Presentation: Each student will be required to make one technical presentation for minimum 15

minutes duration in this course. Individual topics will be assigned to the students by the department.

REFERENCE BOOKS

1. Monograph prepared by Faculty, Department of English, 2013.

2. Sureshkumar E. ,Sreehari P. and Savithri J. ,”Communication Skills and Soft Skills: An Integrated

Approach”,

Dorling Kindersley (India) Pvt. Ltd., India, 2011.

3. Roger Gower, “Real Writing with Answers”, Cambridge University Press, Cambridge, 2008.

4. Sheryl Lindell-Roberts, “Technical Writing for Dummies”, Hungry Mills, Inc, 2001.

5. Arora V. N. and Laxmi Chandra, “Improve Your Writing”, Oxford University Press, New Delhi,2008.

17BTCH211: CHEMISTRY LABORATORY 0021



Hours

LIST OF EXPERIMENTS (ANY EIGHT EXPERIMENTS)

1. To determine the hardness of water by EDTA Method.

2. To determine Chemical Oxygen Demand of a water sample.

3. To determine average molecular weight of a polymer by end-group analysis.

4. To synthesis and characterize polystyrene.

5. To perform proximate analysis of coal.

6. To determine gross calorific value of a fuel sample by calorimetry method.

7. To perform electroplating of nickel on copper.

8. To study the corrosion of a metal.

9. To perform volumetric analysis using a pH meter.

10. To determine density of a liquid fuel.

1

CS212: C++ PROGRAMMING LABORATORY 0042



Hours

LIST OF EXPERIMENTS

1. A) Write a C++ program to print the given number in reverse order. Use functions with return type and without return type for reversing the number. Ex: given number is 2345 , output should be 5432

B) Write a C++ program to find the sum of factorial of a given number using recursive

function.

2. The customers of the Maharashtra State Electricity Board are charged depending on the number of units consumed. The electricity tariff is calculated as follows:

In addition to above every person has to pay Rs75 as service charge per month. Write a program in C++ using control structures to calculate the Electricity bill.

3. Design a base class with name,date of birth,blood group and another base class consisting

of the data members such as height and weight.Design one more base class consisting of

the insurance policy number and contact address.The derived class contains the data

members‟ telephone numbers and driving license number. Write a menu driven program

to carry out the following things:

i. Build a master table

ii. Display

iii. Insert a new entry

iv. Delete entry

v. Edit vi. Search for a record

4. Write a C++ program to explain virtual function (polymorphism) by creating a base class c_polygon which has virtual function area(). Two classes c_rectangle and c_traingle derived from c_polygon and they have area() to calculate and return the area of rectangle and triangle respectively.

5. Write a program to explain class template by creating a template T for a class named pair having two data members of type T which are inputted by a constructor and a member

2

function get-max() return the greatest of two numbers to main. Note: the value of T depends upon the data type specified during object creation.

6. Write a C++ program that creates an output file, writes few records into it, closes the file

and open it again as an input file and read the information from the file.

7. Mini project : Design and Implement a real time application using the concepts of Object

oriented Programming

.

TEXTBOOKS

Deitel and Deitel, “C++ How to Program”, Sixth Edition, Prentice Hall, 2007.(UNIT 1,2,3)

3

17BTMT301: Integral Calculus & Transform Techniques 3 1 0 4


Linear Differential Equation (9)

Review of first order differential equations, linear differential equations, and homogeneous higher order

linear differential equations, non-homogeneous higher order linear differential Equations with constant

coefficients (method of undetermined coefficients and method of variation of parameters).

Vector Calculus (9)

Vector differentiation, gradient, divergence and curl, line and surface integrals, path Independence,

statements and illustrations of theorems of Green, Stokes and Gauss.

Transform Technique (9)

Fourier Transform-Definition and Problems, Inverse Fourier Transform, Fourier integral representation

Z Transform-Definition, standard properties, Transforms of standard sequence and their Inverses.

Solution of simple differential equation.

Complex Variables (9)

Function of complex variable, Analytic Functions, C-R equations, Conformal mapping, bilinear

transformation, Cauchy’s Theorem, Cauchy Integral formula.

Numerical Techniques (9)

Picard’s methods, Taylor series method, Euler’s method, modified Euler’s method. Runge- Kutta 4th

Order method. Predictor –Corrector methods-Milne’s method, Newton-Cortes Formula. Trapezoidal

Rule. Simpson One –Third Rule, Simpson Three-Eight Rule.

Text Books:

● Maurice D. Weir, Joel Hass, Frank R. Giordano, “Thomas’ Calculus (12th edition)”, Pearson

Education.

● Erwin Kreyszig, “Advanced Engineering Mathematics (10th edition)”, Wiley eastern Ltd.

● Ronald E, Walpole, Sharon L. Myers, Keying Ye, “Probability and Statistics for Engineers and

Scientists (8th Edition)”, Pearson Prentice Hall, 2007

Reference Books:

● K.D Joshi, “Calculus for Scientists and Engineers”, CRC Press.

● Sudhir Ghorpade and Balmohan Limaye, “A Course in Multivariate Calculus and Analysis”,

Springer Science and Business Media.

● George Simmons, “Differential Equations with Applications and Historical notes”, Tata Mc-

Graw Hill publishing company Ltd, New Delhi.

● C.R. Wylie, “Advanced Engineering Mathematics”, McGraw Hill Publications, New Delhi.

● Peter V. O’ Neil, “Advanced Engineering Mathematics (7th edition )”, Thomson.Brooks /Cole,

Singapore.

● Michael D. Greenberg, “Advanced Engineering Mathematics (2nd edition)”, Pearson

Education

● S. P. Gupta, “Statistical Methods”, S. Chand & Sons, 37th revised edition, 2008

● William W. Hines, Douglas C. Montgomery, David M. Goldsman, “Probability and Statistics

for Engineering”, (4th Edition), Willey Student edition, 2006.

4

17BTCS302: Data Structures 4 0 0 4


I. INTRODUCTION TO ALGORITHM AND DATA STRUCTURES 12

Algorithms- Problem Solving, Introduction to Algorithms, Characteristics of algorithms, Algorithm

design tools: Pseudo code and flowchart, Analysis of Algorithms, Complexity of algorithms- Space

complexity, Time complexity, Asymptotic notation- Big-O, Theta and Omega, standard measures of

efficiency. Data Structures- Data structure, Abstract Data Types (ADT), Concept of linear and Non-

linear, static and dynamic, persistent and ephemeral data structures, and relationship among data, data

structures, and algorithms, From Problem to Program, Algorithmic Strategies- Introduction to algorithm

design strategies- Divide and Conquer, and Greedy strategy.

II. LINEAR DATA STRUCTURES USING SEQUENTIAL ORGANIZATION 12

Sequential Organization, Linear Data Structure Using Sequential Organization, Array as an Abstract

Data Type, Memory Representation and Address Calculation, Inserting an element into an array,

Deleting an element, Multidimensional Arrays, Two-dimensional arrays, n- dimensional arrays,

Concept of Ordered List, Single Variable Polynomial, Representation using arrays, Polynomial as array

of structure, Polynomial addition, Polynomial multiplication, Sparse Matrix, Sparse matrix

representation, Sparse matrix addition, Transpose of sparse matrix, String Manipulation Using Array,

Case Study- Use of sparse matrix in Social Networks and Maps.

III. LINKED LISTS 12

Concept, Comparison of sequential and linked organizations, Primitive operations, Realization of

Linked Lists, Realization of linked list using arrays, Dynamic Memory Management, Linked list using

dynamic memory management, Linked List Abstract Data Type, Linked list operations, Head pointer

and header node, Types of linked list- Linear and circular linked lists, Doubly Linked List and

operations, Circular Linked List, Singly circular linked list, Doubly circular linked list, Polynomial

Manipulations - Polynomial addition, Multiplication of two polynomials using linked list. Generalized

Linked List (GLL) concept, representation of polynomial and sets using GLL. Case Study- Garbage

Collection.

IV. STACKS & QUEUES 12

Stacks- concept, Primitive operations, Stack Abstract Data Type, Representation of Stacks Using

Sequential Organization, stack operations, Multiple Stacks, Applications of Stack- Expression

Evaluation and Conversion, Polish notation and expression conversion, Need for prefix and postfix

expressions, Postfix expression evaluation, Linked Stack and Operations. Recursion- concept, variants

of recursion- direct, indirect, tail and tree, Backtracking algorithmic strategy, use of stack in

backtracking, Case Study Concept, Queue as Abstract Data Type, Realization of Queues Using Arrays,

Circular Queue, Advantages of using circular queues, Multi-queues, Deque, Priority Queue, Array

implementation of priority queue, Linked Queue and operations, Case study- Priority queue in

bandwidth management, 4 Queens problem, Android multiple tasks/multiple activities and back stack.

V. SEARCHING AND SORTING 12

Searching- Search Techniques, Sequential search, variant of sequential search- sentinel search, Binary

search, Fibonacci search, Case Study- Use of Fibonacci search in non-uniform access memory storage

and in Optimization of Unimodal Functions, Sorting- Types of sorting-Internal and external sorting,

General sort concepts-sort order, stability, efficiency, number of passes, Bubble sort, Insertion sort,

Selection sort, Quick sort, Shell sort, Bucket sort, Radix sort, Comparison of All Sorting Methods, Case

Study- Timsort as a hybrid stable sorting algorithm.

5

TEXT BOOKS

1. Brassard &Bratley, ―Fundamentals of Algorithmics‖, Prentice Hall India/Pearson Education,

ISBN 13-9788120311312.

2. Horowitz and Sahani, ―Fundamentals of Data Structures in C++‖, University Press, ISBN

10:0716782928

3. Goodrich, Tamassia, Goldwasser, ―Data Structures and Algorithms in C++‖, Wiley

publication,ISBN-978-81-265-1260-7

REFERENCES

1. R. Gillberg, B. Forouzn, ―Data Structures: A Pseudo code approach with C‖, Cenage Learning,

ISBN 9788131503140

2. Horowitz, Sahani and Rajshekaran, ―Fundamentals of Computer Algorithms‖, University Press,

ISBN-13, 9788175152571.

3. Yedidyah Langsam, Moshe J Augenstein, Aron M Tenenbaum, ―Data Structures using C and C++‖

Pearson Education, ISBN 81-317-0328-2.

4. A Michael Berman, ―Data Structures via C++: Objects by Evolution‖, Oxford University

Press,ISBN:0-19-510843-4

5. M. Weiss, ―Data Structures and Algorithm Analysis in C++‖, 2nd edition, Pearson Education,

2002,ISBN-81-7808-670-0

6

17BTCS303: Computer Organization & Architecture 4 0 0 4


I. COMPUTER EVOLUTION 12

Evolution (a brief history) of computers ,Designing for performance, System Architectures –

Microprocessor, Micro controller and parallel processing, Von-Neumann Architecture, Data flow

architecture, Computer Components, Interconnection Structures, Bus Interconnection, Floating point

representation and operations- IEEE standard, arithmetic operation, Booths multiplication, Division

algorithm: restoring and non-restoring division.

II. PROCESSOR ORGANIZATION 12 Processor Basics: CPU organization, CPU Bus Organization: Central BUS, Buses on periphery,

Additional features: RISC and CISC types representative commercial , Coprocessors , Instruction set –

Addressing modes formats Machine Instruction characteristics, types of operands, types of operations,

Instruction formats, Processor organization, Register Organization, Case study- 8086 microprocessors,

III. MEMORY ORGANIZATION 12 Internal memory: Concept of memory, size, unit, and its organization, computer memory systems

overview, hierarchy of memory in computer, memory device characteristics, random access memory,

serial access memory, multilevel memories, address translation, memory allocation, advanced DRAM

organization.

Cache memory: – concept of cache, performance of cache, types of cache architectures, memory

mapping techniques, and page replacement policies. Case Study- Pentium 5 cache organization.

External memory: Construction and working principles of magnetic memories, magnetic disk, hard

disk, magnetic tape, optical memory.

IV. I/O ORGANIZATION 12 I/O Devices: Role of I/O devices in computer, overview of commonly used I/O devices such as

keyboard, VDU, mouse. External devices, I/O module and its organization, various data transfer

techniques – Programmed I/O, Interrupt driven I/O, Direct memory access (DMA), I/O channels and

I/O Processors, mapped I/O and I/O mapped I/O, Case Study- DMA Controller.

V. ALU AND CONTROL DESIGN ORGANIZATION 12

Data path design: Concept of data processing unit, Designing aspects related to arithmetic operations,

combinational ALU and sequential ALU, advanced ALU, Pipeline processing, Case study of Intel

Nehalem organization Control Circuit Design: Basic concepts related to control unit, types and design

of control circuit such as micro-programmed control unit, and hard wired control unit, microinstruction

formats, microinstruction sequencing, microinstruction execution, applications of microprogramming.

TEXT BOOKS

1. Computer Architecture and Organization, John P Hays, 3nd Edition, McGraw-Hill Publication,

2001,ISBN 0071004793

2. W. Stallings, ―Computer Organization and Architecture: Designing for performance‖, Pearson

Education/ Prentice Hall of India, 2003, ISBN 978-93-325-1870-4, 7th Edition.

REFERENCES

1. Zaky S, Hamacher, “Computer Organization”, 5nd Edition, McGraw-Hill Publications, 2001,

ISBN 0071122184.

2. Miles Murdocca and Vincent Heuring, ―Computer Architecture and Organization- an

integrated approach, Wiley India Pvt. Ltd, ISBN:978-81-265-1198-3, 2nd Edition

3. A. Tanenbaum, ―Structured Computer Organization‖, Prentice Hall of India, 1991 ISBN: 81 –

203 – 1553 – 7, 4th Edition

7

4. Patterson and Hennessy, ―Computer Organization and Design‖, Morgan Kaufmann Publishers

In, ISBN 978-0-12-374750-1, 4th Edition.

5. Computer Architecture and Organization Lecture Notes PDF

http://ece.eng.wayne.edu/~gchen/ece4680/lecture-notes/lecture-notes.html

8

17BTCS304 Microprocessors and Interfacing 4 0 0 4



I. INTRODUCTION TO MICROPROCESSORS 12

Basics of 8086 and 80386(Architecture and Register Set, Descriptor Tables), Addressing Modes,

Memory management- Case Study of 80386, operating modes of 80386, Interrupts

II. ASSEMBLY LANGUAGE PROGRAMMING & PIPELINING ARCHITECTURE 12

Non-pipelined and pipelined machine cycle (8086), Assembler directives, simple examples;

Subroutines, parameter, Instruction Formats- instruction length, allocation of bits, variable length

instructions, Case Study- 80386 instruction Set

III. PERIPHERALS IC AND APPLICATIONS 12

Block diagram, Pin description and Interfacing of 8255(PPI), Interfacing of keyboard, display (8279),

ADC and DAC, Brief description and application of 8259 PIC

IV. SERIAL AND PARALLEL COMMUNICATION & INTERFACING PERIPHERALS 12

Brief description and application of 8253 PIT, 8251USART, Support chips 8282,8284,8286,8288

V. MICROCONTROLLERS 12

Case Study- DMA Controller Intel 8237A-study in brief, I/O channels and processors- evolution and

characteristics, Math Co-processor 8087, 8051 Microcontroller and Case Study

TEXT BOOKS

1. A.Ray, K.Bhurchandi, ”Advanced Microprocessors and peripherals: Arch, Programming

&Interfacing”,Tata McGraw Hill,2004 ISBN 0-07-463841-6

2. Douglas Hall, “Microprocessors & Interfacing”, McGraw Hill, Revised 2nd Edition, 2006 ISBN 0-

07-100462-9

REFERENCES

1. Microprocessor Architecture, Programming, and Applications with the 8085, Ramesh S. Gaonkar

Pub: Penram International Serge Lang, “Linear Algebra”, Springer, 3rd edition,.

2. Introduction to 64 bit Intel Assembly Language Programming for Linux, 2nd Edition, Ray Seyfarth,

ISBN10: 1478119209,

3. Intel 80386 Programmer's Reference Manual 1986, Intel Corporation, Order no.: 231630-011,

December 1995.

4. James Turley, ―Advanced 80386 Programming Techniques‖, McGraw-Hill, ISBN: 10:

0078813425, 13: 978-0078813429

9

17BTCS305 Discrete Mathematics 3 1 0 4


I. SETS AND PROPOSITIONS 12

Sets, Combination of sets, Finite and Infinite sets, Uncountably infinite sets, Principle of inclusion and

exclusion, multi-sets, Mathematical Induction.

Propositions, Conditional Propositions, Logical Connectivity, Prepositional calculus, Universal and

Existential Quantifiers, Normal forms, Rules of inference, Predicate calculus, methods of proofs.

II. PERMUTATIONS, COMBINATIONS AND DISCRETE PROBABILITY

12

Permutations and Combinations: rule of sum and product, Permutations, Combinations, Algorithms for

generation of Permutations and Combinations, binomial theorem, Discrete Probability, Conditional

Probability, Bayes’ Theorem, Information and Mutual Information

III. RELATIONS AND FUNCTIONS 12

A relational model for data bases, Properties of Binary Relations, Closure of relations, Warshall’s

algorithm, Equivalence relations and partitions, Partial ordering relations and lattices, Chains and Anti

chains, Compatible relations.

Functions, Composition of functions, Invertible functions, Pigeonhole Principle, Recursive function.

IV. GRAPH THEORY 12

Basic terminology, multi-graphs and weighted graphs, representation of graphs, Subgraphs, Isomorphic

graphs, Complete, regular and bipartite graphs, operations on graph, paths and circuits, graph traversals,

Hamiltonian and Euler paths and circuits, shortest path in weighted graphs (Dijkstra’s algorithm),

factors of a graph, planer graph and Traveling salesman problem, Graph Coloring.

V. TREES AND CUT SETS 12

Basic terminology and characterization of trees, rooted trees, path lengths in rooted trees, Prefix codes

and optimal prefix codes, binary search trees, Tree traversal, Spanning trees, Fundamental Trees and

cut sets, Minimal Spanning trees, Kruskal’s and Prim’s algorithms for minimal spanning trees, The Max

flow-Min Cut Theorem (Transport network).

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. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, 7th edition, McGraw-Hill,

2007, ISBN ISBN 978-0-07-338309-5

3. Lipschutz−Lipson: Schaum’s Outline of Theory and Problems of

Discrete Math, 2/e, Tata McGraw-Hill, 2004.

10

17BTCS321 Mini Project –I 0 0 4 2

CA : 100 Marks No. of Total hours = 30

Mini Project-I includes two parts

1. Python Programming

● Write a Python program to get the factorial of a non-negative integer.

● Write a Python program to solve the Fibonacci sequence using recursion.

● Write a Python program to find the greatest common divisor (gcd) of two

integers.

● Write a Python program to converting an Integer to a string in any base.

● Write python program for string operations- copy, concatenate, check substring,

equal, reverse and length

● Write a program in Python – to implement following operations on text file :-

create , Read, calculate the frequency of each vowel, Count the words, characters,

lines, white space & special characters, Write all the results into another text file

2. Student can select problem statement in a group of 4 students to implement, using

concept of data structures in Python.

TEXT BOOKS

1. Learning Python, Mark Lutz, O’Really Publication

2. Beginning Python: From Novice to Professional , Magnus Lie Hetland, PaperBack

3. Python in a Nutshell, Alex Martelli, O’Really Publication

REFERENCES

1. https://www.tutorialspoint.com/python/

2. https://www.learnpython.org/

11

17BTCS311 Data Structures Laboratory 0 0 2 1

CA : 40 Marks FE : 60 Marks Total number of hours: 15

List of Assignments

1. A Vegetable and Fruit Mall wants to organize its vegetables and fruit products in a

combination of purchase pattern of customers. Solve the problem by suggesting appropriate

data structures. Design necessary class.

2. An m x n matrix is said to have a saddle point if some entry a[i][j] is the smallest value in row

i and the largest value in j. Write C/ C++ function that determines the location of a saddle

point if one exists.

3. Set A=(1,3, a, s, t, i} represent alphanumeric characters permitted to set the password of length

4. Write C/C++ program to generate all possible passwords.

4. Write C/C++ program for storing matrix. Write functions for

a) Check whether given matrix is upper triangular or not

b) Compute summation of diagonal elements

c) Compute transpose of matrix

d) Add, subtract and multiply two matrices

5. Write C++ program with class for String. Write the following functions:

i. frequency(): that determines the frequency of occurrence of particular character in the

string.

ii. delete(): that accepts two integers, start and length. The function computes a new string

that is equivalent to the original string, except that length characters being at start have

been removed.

iii. chardelete(): that accepts a character c. The function returns the string with all

occurrences of c removed.

iv. replace(): to make an in-place replacement of a substring w of a string by the string x.

note that w may not be of same size of x palindrome to check whether given string is

palindrome or not

6. Write a C++ program to realize polynomial equation and perform operations. Write the

following functions:

a) To input and output polynomials represented as bmxem+ bm-1xem-1 +….. +b0xe0.

Your functions should overload the << and >> operators.

b) To evaluates a polynomial at given value of x

c) To add two polynomials

d) To multiply two polynomials

7. Department of Computer Engineering has student's club named 'Pinnacle Club'. Students of

Second, third and final year of department can be granted membership on request. Similarly

one may cancel the membership of club. First node is reserved for president of club and last

node is reserved for secretary of club. Write C++ program to maintain club member‘s

12

information using singly linked list. Store student PRN and Name. Write functions to

a) Add and delete the members as well as president or even secretary.

b) Compute total number of members of club

c) Display members

d) Display list in reverse order using recursion

e) Two linked lists exists for two divisions. Concatenate two lists.

8. The ticket booking system of Cinemax theater has to be implemented using C++ program.

There are 10 rows and 7 seats in each row. Doubly circular linked list has to be maintained to

keep track of free seats at rows. Assume some random booking to start with. Use array to

store pointers (Head pointer) to each row. On demand

a) The list of available seats is to be displayed

b) The seats are to be booked

c) The booking can be cancelled

9. Write C++ program for storing binary number using doubly linked lists. Write functions

a) to compute 1‘s and 2‘s complement

b) add two binary numbers

10. Implement C++ program for expression conversion as infix to postfix and its evaluation

using stack based on given conditions

i. Operands and operator, both must be single character.

ii. Input Postfix expression must be in a desired format.

iii. Only '+', '-', '*' and '/ ' operators are expected

11. Implement C++ program for expression conversion-

a) infix to prefix, b)prefix to postfix,

c) prefix to infix, d) postfix to infix and e) postfix to prefix.

12. Write a program to implement stack and queue as an ADT.add job and delete job from

queue.

13. Write a modular program using object oriented programming features to implement

different sorting methods(quick, merge, radix, shell, insertion sort)

14. Write C++ program to store roll numbers of student in array who attended training program

in random order. Write function for searching whether particular student attended training

program or not using linear search and sentinel search.

b) Write C++ program to store roll numbers of student array who attended training program in sorted

order. Write function for searching whether particular student attended training program or

not using binary search and Fibonacci search.

15. Write C++ program to maintain club members, sort on roll numbers in ascending order.

Write function ‗Ternary_Search‘ to search whether particular student is member of club or

not. Ternary search is modified binary search that divides array into 3 halves instead of two.

13

TEXT BOOKS

1. Brassard &Bratley, ―Fundamentals of Algorithmics‖, Prentice Hall India/Pearson Education,

ISBN 13-9788120311312.

2. Horowitz and Sahani, ―Fundamentals of Data Structures in C++‖, University Press, ISBN

10:0716782928

3. Goodrich, Tamassia, Goldwasser, ―Data Structures and Algorithms in C++‖, Wiley

publication,ISBN-978-81-265-1260-7

REFERENCES

1. R. Gillberg, B. Forouzn, ―Data Structures: A Pseudo code approach with C‖, Cenage Learning,

ISBN 9788131503140

2. Horowitz, Sahani and Rajshekaran, ―Fundamentals of Computer Algorithms‖, University Press,

ISBN-13, 9788175152571.

3. YedidyahLangsam, Moshe J Augenstein, Aron M Tenenbaum, ―Data Structures using C and

C++‖,Pearson Education, ISBN 81-317-0328-2.

4. A Michael Berman, ―Data Structures via C++: Objects by Evolution‖, Oxford University

Press,ISBN:0-19-510843-4

5. M. Weiss, ―Data Structures and Algorithm Analysis in C++‖, 2nd edition, Pearson Education,

2002,ISBN-81-7808-670-0

14

17BTCS312 Microprocessors Interfacing Lab 0 0 4 2

CA : 40 Marks FE : 60 Marks Total number of hours: 30

Suggested List of Assignments

1. Write X86/64 Assembly language program (ALP) to add array of N hexadecimal numbers stored in

the memory. Accept input from the user.

2.

Write X86/64 ALP to perform non-overlapped and overlapped block transfer (with and without string

specific instructions). Block containing data can be defined in the data segment.

3.

Write 64 bit ALP to convert 4-digit Hex number into its equivalent BCD number and 5-digit BCD

number into its equivalent HEX number. Make your program user friendly to accept the choice from

user for:

a) HEX to BCD

b) BCD to HEX

c) EXIT.

Display proper strings to prompt the user while accepting the input and displaying the result. (use 64-

bit registers)

4.

Write X86/64 ALP for the following operations on the string entered by the user. (use 64-bit registers)

a) Enter the string

b) Calculate Length of the string

c) Reverse the string

d) Check whether the string is palindrome

e) Number of vowels and consonants in string

Display appropriate messages to prompt the user while accepting the input and displaying the result

5.

Write 8086 ALP to perform string manipulation. The strings to be accepted from the user is to be stored

in data segment of program_l and write FAR PROCEDURES in code segment program_2 for

following operations on the string:

a) Concatenation of two strings

b) Number of occurrences of a sub-string in the given string

c) Number of spaces in the given string.

Use PUBLIC and EXTERN directive. Create .OBJ files of both the modules and link them to create

an EXE file.

6.

Write X86/64 ALP to perform multiplication of two 8-bit hexadecimal numbers. Use successive

addition and add and shift method. Accept input from the user. (use 64-bit registers)

7. Write 8087ALP to obtain:

15

i) Mean

ii) Variance

iii) Standard Deviation

For a given set of data elements defined in data segment. Also display result.

8.

1.8255 I/O interface

a) Write 8086 ALP to convert an analog signal in the range of 0V to 5V to its corresponding digital

signal using successive approximation ADC.

9. b) Write 8086 ALP to interface DAC and generate following waveforms on oscilloscope,

(i) Square wave (ii) Ramp wave (iii) Trapezoidal wave (iv) Stair case wave

10.

2. 8253 counter

Write 8086 ALP to program 8253 in Mode 0, modify the program for hardware retrigger able Mono

shot mode. Generate a square wave with a pulse of 1 ms. Comment on the difference between Hardware

Triggered and software triggered strobe mode. Observe the waveform at GATE & out pin of 1C 8253

on CRO

11.

3.8279 seven segment display

Write 8086 ALP to initialize 8279 and to display characters in right entry mode. Provide also the facility

to display

a) Character in left entry mode.

b) Character in right entry mode.

c) Rolling display.

d) Flashing display

12.

4. 8251 USART

Perform an experiment to establish communication between two 8251 systems A and B. Program 8251

system A in asynchronous transmitter mode and 8251 system B in asynchronous receiver mode. Write

an ALP to transmit the data from system A and receive the data at system B

13.

TSR Program

Write a TSR program in 8086 ALP to implement Real Time Clock (RTC). Read the Real Time from

CMOS chip by suitable INT and FUNCTION and display the RTC at the bottom right corner on the

screen. Access the video RAM directly in your routine.

14.

TSR Program

Write a TSR program in 8086 ALP to implement Screen Saver. Screen Saver should get activated if

the keyboard is idle for 7 seconds. Access the video RAM directly in your routine.

15.

Study of Intel i5 Motherboard Block Diagram, Peripheral Connectors Pin Diagrams and functioning

of I/O Hub, DDR-3 memory BUS

16

TEXT BOOKS

1. A.Ray, K.Bhurchandi, ”Advanced Microprocessors and peripherals: Arch, Programming

&Interfacing”,Tata McGraw Hill,2004 ISBN 0-07-463841-6

2. Douglas Hall, “Microprocessors & Interfacing”, McGraw Hill, Revised 2nd Edition, 2006 ISBN 0-

07-100462-9

REFERENCES

1. Microprocessor Architecture, Programming, and Applications with the 8085, Ramesh S. Gaonkar

Pub: Penram International Serge Lang, “Linear Algebra”, Springer, 3rd edition,.

2. Introduction to 64 bit Intel Assembly Language Programming for Linux, 2nd Edition, Ray Seyfarth,

ISBN10: 1478119209,

3. Intel 80386 Programmer's Reference Manual 1986, Intel Corporation, Order no.: 231630-011,

December 1995.

4. James Turley, ―Advanced 80386 Programming Techniques‖, McGraw-Hill, ISBN: 10:

0078813425, 13: 978-0078813429

17

Semester - IV

17BTMT401: Probability and Queuing Theory 3 1 0 4


I. RANDOM VARIABLES 12 Discrete and continuous random variables - Moments - Moment generating functions and their

properties, Binomial, Poisson, Geometric, Negative binomial, Uniform, Exponential, Gamma, Normal

and Weibull distributions.

II. TWO DIMENSIONAL RANDOM VARIABLES 12 Joint distributions - Marginal and conditional distributions – Covariance - Correlation and regression -

Transformation of random variables - Central limit theorem

III. MARKOV PROCESS AND MARKOV CHAINS 12 Classification - Stationary process - Markov process- Poisson process, Discrete parameter - Markov

chains - Transition probabilities, Chapman Kolmogorov equations - Limiting distributions

IV. QUEUEING THEORY 12 Markovian models – Birth and Death Queuing models- Steady state results: Single and multiple server

queuing models- queues with finite waiting rooms-Queues with impatient customers: Balking and

reneging

V. NON-MARKOVIAN QUEUES AND QUEUE NETWORKS 12

Finite source models- Little’s Formula, M/G/1 queue- Pollaczek- Khintchine formula as special cases,

series queues- open and closed networks

TEXT BOOK

1. O.C. Ibe, “Fundamentals of Applied Probability and Random Processes”, Elsevier, 1st Indian

Reprint,2007

2. D. Gross and C.M. Harris, “Fundamentals of Queueing Theory”, Wiley Student edition, 2004

REFERENCES

1. A.O. Allen, “Probability, Statistics and Queueing Theory with Computer Applications”, Elsevier,

2nd edition, 2005.

2. H.A. Taha, “Operations Research”, Pearson Education, Asia, 8th edition, 2007.

3. K.S. Trivedi, “Probability and Statistics with Reliability, Queueing and Computer Science

Applications”, John Wiley and Sons, 2nd edition, 2002.

18

17BTCS402: Advanced Data Structures and Algorithms 4 0 0 4

CA : 40 Marks FE : 60 Marks No. of Total Lectures: 60 Hours

I. TREES 12

Tree- basic terminology, General tree and its representation, representation using sequential and linked

organization, Binary tree- properties, converting tree to binary tree, binary tree traversals in-order, pre-

order, post order, level wise -depth first and breadth first, Operations on binary tree. Binary Search Tree

(BST), BST operations, Threaded binary tree- concepts, threading, insertion and deletion of nodes in

in-order threaded binary tree, in order traversal of in-order threaded binary tree. Case Study- Use of

binary tree in expression tree-evaluation and Huffman's coding

II. GRAPHS 12

Basic Concepts, Storage representation, Adjacency matrix, adjacency list, adjacency multi list, inverse

adjacency list. Traversals-depth first and breadth first, Introduction to Greedy Strategy, Minimum

spanning Tree, Greedy algorithms for computing minimum spanning tree- Prim’s and Kruskal’s

Algorithms, Dikjtra's Single Source shortest path, Topological ordering. Case study- Data structure used

in Webgraph and Google map.

III. HASHING 12

Hash Table- Concepts-hash table, hash function, bucket, collision, probe, synonym, overflow, open

hashing, closed hashing, perfect hash function, load density, full table, load factor, rehashing, issues in

hashing, hash functions- properties of good hash function, division, multiplication, extraction, mid-

square, folding and universal, Collision resolution strategies- open addressing and chaining, Hash table

overflow- open addressing and chaining, extended hashing, Dictionary- Dictionary as ADT, ordered

dictionaries, Skip List- representation, searching and operations- insertion, removal.

IV. SEARCH TREES, INDEXING AND MULTIWAYTREES 12

Symbol Table-Representation of Symbol Tables- Static tree table and Dynamic tree table, Introduction

to Dynamic Programming, Weight balanced tree, Optimal Binary Search Tree (OBST), OBST as an

example of Dynamic Programming, Height Balanced Tree- AVL tree. Indexing and Multiway Trees-

Indexing, indexing techniques, Types of search tree- Multiway search tree, B-Tree, B+Tree, Trie Tree,

Splay Tree, Red-Black Tree, K-dimensional tree, AA tree, Heap-Basic concepts, realization of heap

and operations, Heap as a priority queue, heap sort

V. FILE ORGANIZATION 12

Sequential file organization- concept and primitive operations, Direct Access File- Concepts and

Primitive operations, Indexed sequential file organization-concept, types of indices, structure of index

sequential file, Linked Organization- multi list files, coral rings, inverted files and cellular partitions.

External Sort- Consequential processing and merging two lists, multiday merging- a k-way merge

algorithm.

TEXT BOOKS

1. Horowitz, Sahani, Dinesh Mehata, ―Fundamentals of Data Structures in C++‖, Galgotia Publisher,

ISBN: 8175152788, 9788175152786.

2. M Folk, B Zoellick, G. Riccardi, ―File Structures‖, Pearson Education, ISBN:81-7758-37-5

3. Peter Brass, ―Advanced Data Structures‖, Cambridge University Press, ISBN: 978-1-107-43982-

5

REFERENCES

19

1. A. Aho, J. Hopcroft, J. Ulman, ―Data Structures and Algorithms‖, Pearson Education, 1998,ISBN-

0-201-43578-0.

2. Michael J Folk, ―File Structures an Object Oriented Approach with C++‖, Pearson Education,

ISBN: 81-7758-373-5.

3. SartajSahani, ―Data Structures, Algorithms and Applications in C++‖, Second Edition, University

Press, ISBN:81-7371522 X.

4. G A V Pai, ―Data Structures and Algorithms‖, The McGraw-Hill Companies, ISBN -

9780070667266.

5. Goodrich, Tamassia, Goldwasser, ―Data Structures and Algorithms in Java‖, Wiley Publication,

ISBN: 9788126551903.

20

17BTCS403: Computer Graphics 4 0 0 4


I. GRAPHICS PRIMITIVES AND SCAN CONVERSION 12

Basic concepts, applications of computer graphics, pixel, frame buffer, resolution, aspect ratio, Plotting

Primitives, Scan conversions, lines, line segments, vectors, pixels and frame buffers, vector generation,

line drawing algorithms: Digital Differential Analyzer (DDA), Bresenham and parallel line algorithms,

Line styles, Bresenham Circle drawing algorithm, Character generating methods.

Display Files: display file structure, algorithms and display file interpreter. Primitive operations on

display file.

II. POLYGONS AND CLIPPING ALGORITHMS 12

Introduction to polygon, types: convex, concave and complex, Inside test, polygon filling algorithms –

flood fill, seed fill, scan line fill and filling with patterns.

Windowing and clipping: viewing transformations, 2-D clipping: Cohen – Sutherland algorithm,

Polygon clipping: Sutherland Hodgeman algorithm, generalized clipping.

III. GEOMETRIC TRANSFORMATIONS 12

2-D transformations: introduction, matrices, Translation, scaling, rotation, homogeneous coordinates

and matrix representation, translation, coordinate transformation, rotation about an arbitrary point,

inverse and shear transformation.

3-D transformations: introduction, 3-D geometry, primitives, 3-D transformations and matrix

representation, rotation about an arbitrary axis, 3-D viewing transformations, 3-D Clipping

Projections: Parallel, orthographic and Perspective, Vanishing Points.

IV. SHADING, HIDDEN SURFACES, CURVES AND FRACTALS 12 Illumination Models: Light Sources, Ambient Light, Diffuse reflection, Specular Reflection, and the

Phong model, combined diffuse and Specular reflections with multiple light sources, Shading

Algorithms: Halftone, Gauraud and Phong Shading.

Hidden Surfaces: Introduction, Back face detection and removal, Algorithms for hidden surface

removal

Curves: Introduction, Interpolation and Approximation, Blending function, B-Spline curve, Bezier

curve, Fractals: Introduction, Classification, Applications, Fractal generation: snowflake, Triadic curve,

Hilbert curve.

V. ANIMATION AND GAMING 12

Segment: Introduction, Segment table, Segment creation, closing, deleting and renaming, Visibility.

Animation: Introduction, Design of animation sequences, Animation languages, Key- frame, Morphing,

Motion specification.

Colour models and applications: Properties of Light, CIE chromaticity Diagram, RGB, HSV, CMY,

YIQ, Colour Selection and applications.

Gaming: Introduction, Gaming platform (NVIDIA, i860 etc.), Advances in Gaming, Advanced and

Interactive Graphics Tools: Eg. OpenGL, 3D Blender, etc , Game Development for Android

TEXT BOOKS

1. D. Hearn, M. Baker, “Computer Graphics – C Version”, 2nd Edition, Pearson Education, 2002,

ISBN81 – 7808 – 794 – 4.

2. S. Harrington, ―Computer Graphics‖, 2nd Edition, McGraw-Hill Publications, 1987, ISBN 0

– 07 – 100472 – 6

REFERENCES

21

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. Rogers, J. Adams, ―Mathematical Elements for Computer Graphics‖, 2nd Edition, Tata

McGrawHill Publication, 2002, ISBN 0 – 07 – 048677 – 8.

3. Mario Zechner, Robert Green, ―Beginning Android 4 Games Development‖, Apress, ISBN: 978-

81- 322-0575-3.

4. Donald D. Hearn, ―Computer Graphics with Open GL‖, 4th Edition, ISBN-13:

9780136053583

5. D. Rogers, ―Procedural Elements for Computer Graphics‖, 2nd Edition, Tata McGraw-Hill

Publication, 2001, ISBN 0 – 07 – 047371 –4.

22

17BTCS404: Theory of Computation 3 1 0 4

CA : 40 Marks FE : 60 Marks Total Number of Lectures: 60

I. AUTOMATA THEORYAND FINITE AUTOMATA 12

Alphabet, Strings, Language, Set, Relation, Characteristics of relations, Tree, Graph, finite automaton

model, acceptance of strings and languages, deterministic finite automaton and non-deterministic finite

automaton, transition diagrams and Language recognizers, NFA with epsilon transitions - Significance,

acceptance of languages. Conversions and Equivalence: NFA to DFA conversion, minimization of

FSM, equivalence between two FSM’s, Finite Automata with output, Applications of FA.

II. REGULAR EXPRESSIONS 12

Regular sets, regular expressions, identity rules, Constructing finite Automata for a given regular expressions,

Conversion of Finite Automata to Regular expressions. Pumping lemma of regular sets, closure

properties of regular sets. Applications of Regular expressions.

III. GRAMMAR & PUSH DOWN AUTOMATA 12

Chomsky hierarchy of languages, Production systems and Grammar, derivation trees, Context Free

Grammar CFG, Ambiguity in context free grammars, Normal Forms, Pumping Lemma for Context

Free Languages, Enumeration of properties of CFL. Regular grammars-right linear and left linear

grammars, equivalence between regular linear grammar and FA, inter-conversion. Push down automata,

definition, model, acceptance of CFL, Acceptance by final state and acceptance by empty state and its

equivalence. Equivalence of CFL and PDA, inter-conversion. Introduction to DCFL and DPDA.

IV. TURING MACHINE AND COMPUTABILITY THEORY 12

Turing Machine- model, design of TM, Computable functions, recursively enumerable languages.

Church’s hypothesis, counter machine, Non-deterministic Turing machines. Comparison FSM, PDA,

PM and TM, Post Correspondence problem.

V. TRACTABILITY AND INTRACTABILITY 12

Decidability and tractability, Tractable and Intractable problems, Definition of P and NP problems, NP

complete and NP hard problems, Turing reducibility, Satisfiability, Cooks theorem, CNF, 3-CNF

problems.

TEXT BOOKS

1. Hopcroft H.E. and Ullman J. D, Introduction to Automata Theory Languages and Computation.

Pearson Education

2. K.L.P. Mishra and Chandrashekharan, “Theory of Computer Science”.

REFERENCES

1. Micheal Sipser, Introduction to Theory of Computation, Thomson

2. Daniel Cohen, Introduction to Computer Theory, John Wiley.

3. John C Martin, Introduction to languages and the Theory of Computation, TMH

4. Lewis H.P. & Papadimitriou C.H., Elements of Theory of Computation, Pearson /PHI.

23

17BTCS405: ECONOMICS FOR ENGINEERS

3 1 0 4


I. INTRODUCTION TO ENGINEERING ECONOMICS 12

Concept, Nature and Methodology of Economics

II. DEMAND AND PRODUCTION 12

Demand: Meaning and Determinants of Demand and Supply, Law of Demand and Supply, Elasticity

of Demand and Supply.

Production: Meaning, production with one variable input, the law of variable proportion, the laws of

returns to scale. Economies of Scale.

Case Study

III. COST AND REVENUE 12

Concepts, Classifications, Short run and long run cost curves, Revenue, Measurement of Profit.(Case

Study)

IV. MARKET STRUCTURE 12

Meaning, Characteristics of different types of market Monopoly, Perfect Competition, Monopolistic

Competition, Oligopoly and Duopoly.

V. MONEY AND BANKING 12

Money- Functions - Quantity theory of money , Banking -Commercial Banks – Functions – Central

Bank (RBI) – Functions, Case Study in Recent Development in Banking.

TEXT BOOKS:

1. Dewett. K.K, “Modern Economic Theory”, S. Chand and Company Ltd, New Delhi, 2014.

2. Lipsey& Chrystal, “Economics”, Oxford University Press, 2010

REFERENCES:

1. Paul A Samuelson & William, “Economics”, Tata McGraw Hill, New Delhi, 2010.

2. Jhingan M.L “Money, Banking, International Trade and Public Finance”, Vrinda Publication, 2009.

3. Ahuja H.L, “Macro Economic Theory and Policy”, S.Chand and Co, New Delhi, 2010.

4. Francis Cherinullem “International Economics”, McGraw Hill Education, 2008.

5. Dutt and Sundaram “Indian Economy”, S.Chand and Co, New Delhi, 2011.

24

17BTCS421 Mini Project –II 0 0 4 2

CA : 100 Marks Total Number of hours = 30

Course Objectives: 1. To expose the students to use the engineering approach to solve the real time problems. 2. To learn

the skills of team building & team work.

3. To develop the logical skills and use of appropriate data structures for solving the engineering

problems.

Platforms: Free and Open source softwares

● The mini project should be undertaken preferably by a group of 3-4 students who will jointly

work and implement the project.

● The group will select a problem with the approval of the guide and prepare the solution

guidelines for its implementation.

● The same should be put in the form of synopsis (1 to 3 pages), stating the usage of logic,

algorithms and suitable data structures necessary for implementation of the solution.

● The group is expected to complete analysis of problem by examining the possible different

inputs to the system and the corresponding outputs.

● The term work submission is to be done in the form of a report containing the details of the

problem, solution techniques, implementation details, input-output scenarios and the

conclusion.

● The project must be implemented in C++/Python/Java.

25

17BTCS411: Advanced Data Structure Laboratory 0 0 2 1

CA : 40 Marks FE : 60 Marks Total Number of hours = 15

List of Experiments

1. A Dictionary stores keywords & its meanings. Provide facility for adding new keywords, deleting

keywords, updating values of any entry. Provide facility to display whole data sorted in ascending/

Descending order. Also find how many maximum comparisons may require for finding any keyword.

Use Binary Search Tree for implementation.

2. Accept prefix expression, and construct a binary tree and perform recursive and non-recursive

traversals

3. Create Binary Search tree and find its mirror image. Print original & new tree level wise. Find height

& print leaf nodes

4. Create inorder threaded binary tree and perform the traversals

5. Represent a given graph using adjacency list and perform DFS and BFS

6. Represent a given graph using adjacency list or array and find the shortest path using Dijkstra algorithm

7. Represent a given graph using adjacency list or array and generate a minimum spanning tree using

kruskal and prim’s algorithm

8. Implement binary search tree

9. Create a hash table and handle the collisions using linear probing with or without replacement

10. Implementation of simple index file

11. Implementation of direct access file - Insertion and deletion of a record from a direct access file using

chaining with or without replacement

12. Company maintains employee information as employee ID, name, designation and salary. Allow user

to add, delete information of employee. Display information of particular employee. If employee does

not exist an appropriate message is displayed. If it is, then the system displays the employee details.

Use index sequential file to maintain the data.

13. A Dictionary stores keywords & its meanings. Provide facility for adding new keywords, deleting

keywords, updating values of any entry. Provide facility to display whole data sorted in ascending/

Descending order. Also find how many maximum comparisons may require for finding any keyword.

Use Height balance tree and find the complexity for finding a keyword

14. Consider telephone book database of N clients. Make use of a hash table implementation to quickly

look up client‘s telephone number.

15. Implement Heap sort

26

16. Given sequence k = k1 <k2 < … <kn of n sorted keys, with a search probability pi for each key ki .

Build the Binary search tree that has the least search cost given the access probability for each key?

TEXT BOOKS

1. Horowitz, Sahani, Dinesh Mehata, ―Fundamentals of Data Structures in C++‖, Galgotia Publisher,

ISBN: 8175152788, 9788175152786.

2. M Folk, B Zoellick, G. Riccardi, ―File Structures‖, Pearson Education, ISBN:81-7758-37-5

3. Peter Brass, ―Advanced Data Structures‖, Cambridge University Press, ISBN: 978-1-107-43982-

5

REFERENCES

1. A. Aho, J. Hopcroft, J. Ulman, ―Data Structures and Algorithms‖, Pearson Education, 1998,ISBN-

0-201-43578-0.

2. Michael J Folk, ―File Structures an Object Oriented Approach with C++‖, Pearson Education,

ISBN: 81-7758-373-5.

3. SartajSahani, ―Data Structures, Algorithms and Applications in C++‖, Second Edition, University

Press, ISBN:81-7371522 X.

4. G A V Pai, ―Data Structures and Algorithms‖, The McGraw-Hill Companies, ISBN -

9780070667266.

5. Goodrich, Tamassia, Goldwasser, ―Data Structures and Algorithms in Java‖, Wiley Publication,

ISBN: 9788126551903.

27

17BTCS412: Computer Graphics Laboratory 0 0 4 2

CA : 40 Marks FE : 60 Marks Total Number of hours = 30

The laboratory for Computer Graphics will be based on programming assignments in C++ that would

include appropriate implementations of object oriented concepts and interactive graphics programming.

The list of assignments include the following:

1. Line drawing algorithms (DDA and Bresenham)

2. Bresenham Circle drawing algorithm

3. Implementation of generalized algorithm for filling a polygon (convex & concave) using scan-

line polygon filling method.

4. Implement Cohen-Sutherland line-clipping algorithm for given window. Draw line using mouse

interfacing to draw polygon

5. Write C++ program to draw 2-D object and perform following basic transformations,

a) Scaling

b) Translation

c) Rotation

6. Draw 3-D cube and perform following transformations on it using OpenGL.

a) Scaling b) Translation c) Rotation about one axis.

7. Perform animation using segments-

1. Moving Train

2. Movement of Clock Pendulum

3. Water drop falling into the water and generated waves after impact

4. Rising Sun

8. Generate fractals for coarse lines and surfaces.

9. Implement Painter‘s algorithm for hidden surface removal

TEXT BOOKS

1. D. Hearn, M. Baker, “Computer Graphics – C Version”, 2nd Edition, Pearson

Education, 2002, ISBN81 – 7808 – 794 – 4.

2. S. Harrington, ―Computer Graphics‖, 2nd Edition, McGraw-Hill Publications, 1987,

ISBN 0 – 07 – 100472 – 6

REFERENCES 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. Rogers, J. Adams, ―Mathematical Elements for Computer Graphics‖, 2nd Edition,

Tata McGrawHill Publication, 2002, ISBN 0 – 07 – 048677 – 8.

3. Mario Zechner, Robert Green, ―Beginning Android 4 Games Development‖, Apress,

ISBN: 978-81- 322-0575-3.

4. Donald D. Hearn, ―Computer Graphics with Open GL‖, 4th Edition, ISBN-13:

9780136053583

5. D. Rogers, ―Procedural Elements for Computer Graphics‖, 2nd Edition, Tata

McGraw-Hill Publication, 2001, ISBN 0 – 07 – 047371 –4.

28

Course Code Course Title Category

17BTCS501 Design and Analysis of Algorithms

Contact Hours per Week

CA FE Credits L T

D/P

3 1 0 40 60 4

Prerequisite:

● Basic knowledge of programming and mathematics.

● Fundamentals of Data Structure

● Basic understanding of Formal Language and Automata Theory.

Course Objectives:

● To design efficient algorithm for a given problem.

● To develop problem solving abilities using mathematical theories.

● To analyze algorithms for a given problem

● To study algorithmic examples in distributed, concurrent and parallel environments.

COURSE CONTENT

Fundamentals of Algorithms: 09

Problem solving principles: Classification of problem, problem solving strategies: Bruteforce

Approach, Divide and Conquer Strategy, classification of time complexities (linear,

logarithmic etc), Asymptotic notations, lower bound and upper bound: Best case, worst case,

average case analysis, amortized analysis. Performance analysis of basic programming

constructs. Recurrences: Formulation and solving recurrence equations using Master Theorem.

Greedy Strategy and Dynamic Programming 09

Greedy strategy: Principle, control abstraction, time analysis of control abstraction, knapsack

problem, scheduling algorithms- activity selection problem. Dynamic Programming: Principle,

control abstraction, time analysis of control abstraction, 0/1 knapsack, Chain Matrix

Multiplication, Flow network

Backtracking and Branch –n-Bound 09

Backtracking: Principle, control abstraction, time analysis of control abstraction, n-queen

problem, sum of subsets problem. Branch-n-Bound: Principle, control abstraction, time

analysis of control abstraction, strategies : FIFO, LIFO and LC approaches, TSP, knapsack

problem.

29

Complexity Theory: 09

Turing machine, polynomial and non-polynomial problems, deterministic and non-

deterministic algorithms, P class, NP class &NP complete problems- vertex cover and 3-SAT

and NP{hard problem {Hamiltonian cycle. The menagerie of complexity classes of Turing

degrees. Concept of randomized and approximation algorithms: Solving TSP by approximation

algorithm, Randomized sort algorithms and Approximating Max Clique.

Parallel and Concurrent Algorithms 09

Parallel Algorithms: Sequential and parallel computing, RAM &PRAM models, Amdahl's

Law, Brent's theorem, parallel algorithm analysis and optimal parallel algorithms, graph

problems (shortest paths and Minimum Spanning Tree, Bipartite graphs ) Concurrent

Algorithms: Dining philosophers problem

----------------------------------------------------------------------------------------------------------------

--

Course Outcomes: Students who complete the course will have demonstrated the ability to do

the following:

● Argue the correctness of algorithms.

● Analyze algorithms using asymptotic analysis.

● Apply appropriate design strategy for a given problem

----------------------------------------------------------------------------------------------------------------

--

TEXT BOOKS 1. Horowitz and Sahani, "Fundamentals of Computer Algorithms", 2ND Edition. University

Press, ISBN: 978 81 7371 6126, 81 7371 61262.

2. Gilles Brassard and Paul Bartley, "Fundamental of Algorithms", PHI, New Delhi.

3. Thomas H Cormen and Charles E.L Leiserson, "Introduction to Algorithm" PHI

Reference Books: 1. Fayez Gebali, Algorithms and Parallel Computing, Willy, ISBN 978-0-470-90210-3(Indian

Paperback Edition)

2 .Anany Levitin, "Introduction to the Design and Analysis of Algorithms" Pearson Education

3 .Jon Kleinberg, EvasTardos, “Algorithm Design”, Pearson Education

4. Algorithms, Kenneth Berman and Jerome Paul, Cenage Learning ISBN-13 978-81-315-

0521-2R

30


17BTCS502 Software Engineering Methodology Regular


CA FE Credits L T

D/P

3 1 0 40 60 4

Prerequisite:

● Basic Knowledge of Object Oriented Programming. ● Fundamentals of Programming & problem Solving

Course Objectives:

● To understand the fundamentals of Software Engineering

● To study an analysis of software requirement engineering & Modelling

● To acquire the knowledge of Scrum and Agile methodologies

● To learn software design patterns

COURSE CONTENT

Unit I – Introduction to Software Engineering (09)

The Nature of Software, The Changing Nature of Software, Professional Software

Development, Software Engineering Ethics, Software Development Myths, Software Process

Models- the Waterfall Model, Incremental Process Models, Evolutionary Process Models,

Concurrent Models, Personal and Team Process Models, coping with change, The Rational

Unified Process

Unit II – Requirements engineering&System modelling (09)

Requirement Analysis - Functional and non-functional requirements, The software

requirements document, Requirements specification, Requirements engineering processes,

Requirements elicitation and analysis, Requirements validation, Requirements management,

System Modelling - Context models, Interaction models, Structural models, Behavioural

models, Model-driven engineering, Architectural design – decisions, views & patterns, DFD.

Unit III – Agile Methodology (09)

Scrum- Roles, Scrum activities & artefacts, Sprint – time boxed, short duration, consistent

duration, Agile Software Development – Agile Methods, Plan-Driven and Agile

Development, Extreme Programming, Agile Project Management, Project Management

Concepts, Agile Project Management, Scaling Agile Methods, User stories, Agile estimating

& velocity, Iterations, product backlogs, Stakeholder roles.

Unit IV – Software Design Patterns (09)

What Is a Design Pattern?, Describing Design Patterns, The Catalogue of Design Patterns, Organizing

31

the catalogue, How Design Patterns Solve Design Problems, Creational patterns - Abstract Factory,

Builder, Factory Method, Prototype, Singleton, A Case Study:Designing a Document Editor

Unit V – Structural &Behavioural Patterns (09)

Structural Patterns-Adapter, Composite, Façade, Proxy, Behavioural Patterns - Chain of

Responsibility, Command, Interpreter, Iterator, Mediator, Observer, State, Strategy, Template Method

---------------------------------------------------------------------------------------------------------------------------

-------------

Course Outcomes: (Students will be able to-)

● Apply the concepts of software engineering for development of Software Systems ● Analyse software feasibility ● Use scrum and agile methodology for software Modelling ● Build software design patterns to solve design issues

---------------------------------------------------------------------------------------------------------------------------

Text Books:

1. Ian Sommerville, ‘Software Engineering’, Addison-Wesley, 9th Edition, 2010, ISBN-

13: 978- 0137035151.

2. Kenneth S. Rubin, Essential SCRUM: A Practical Guide To The Most Popular Agile

Process, Addison-Wesley, ISBN-13: 978-0-13-704329-3, 2012

3. Dean Leffingwell, Agile Software Requirements, Addison-Wesley, ISBN-13: 978-0-

321- 63584-6, 2011

4. Erich Gamma, Richard Helm,Ralph Johnson ,John Vlissides, Design patterns

Elements of Reusable Object-Oriented Software

Reference Books:

1. Soren Lauesen, Software requirements: Styles and techniques, Addison Wesley,

ISBN 0201745704, 2002

2. HASSAN GOMAA, Software Modeling and Design, Cambridge university Press, 2011, ISBN-13 978-1-107-44735-6

List of Tutorials:

Tutorial Number

Tutorial Topic

1. Design an assignment wherein multiple teams work together for development of a software. Use appropriate software Engineering model to design, develop and integratethe system.

2. Design a Data Flow Diagram for Home Automation System/any. Use appropriate tool to represent it and design software processes to maintain the integrity of the data.

3. Discuss & apply appropriateagile software method for solving Shopping Cart system.

4. Design &Apply Flyweight pattern for IoT based Intelligent Transportation System.

5. Use bridge and decorator structural patterns to create a model for forecast based financing which aims to create new funding mechanisms for disaster properness.

6. Apply Memento & Visitor behavioural patterns to develop a solution for Home Security System.

Note: In addition to above mentioned tutorials, course coordinator can design more tutorials if required.

32


17BTCS503 System Programming and Operating System core


CA FE Credits L T

D/P

4 0 0 40 60 4

Prerequisite:

● Fundamentals of Programming languages.

● Basic Data Structure concepts.

Course Objectives:

● To understand basics of System Programming.

● To learn and understand data structures used in design of system software.

● To learn, understand and use basics of compilers and tools.

● To understand functions of operating system.

● To learn and understand process, resource and memory management.

COURSE CONTENT

Unit I – Introduction to Systems Programming [09]

Fundamentals of Language Processing, Language Processing Activities, Components of

System Software, Introduction to Assemblers, Elements of Assembly Language Programming,

Simple Assembler scheme, Structure of an Assembler, Introduction to Macro Processors,

Macro Definition and Call, Macro expansion, Advanced Macro Facilities.

Loaders: Definition of Loader. Different Loader schemes: Compile and go, General loader

Scheme, Absolute loaders, subroutine linkages, relocating loaders, direct linking loaders,

overlay structure. Linkers: relocation and linking concepts, Self-relocating programs, an

introduction to static and dynamic linked libraries.

Unit II – Introduction to Compiler Design [09]

Overview of the Translation Process, A Simple Compiler, The Phases of a Compiler, Overview

of Compilation, Cousins of the Compiler, Grouping of Phases, Introduction to lexical Analysis,

LEX, LEX specification and features. Introduction to Syntax Analyzer: Role of parsers, Types

of Parsers, Top Down and Bottom Parser. Need of semantic analysis, type checking and type

conversion, Intermediate languages, and Intermediate code forms- Syntax Tree, DAG, Postfix

Notation, Three Address Codes, Quadruples, Triples, and Indirect Triples. Introduction to

Optimization, Principle sources of Optimization, Introduction to Code Generation, Issues in

Code Generation.

Unit III - Introduction to Operating System & Process Management [09]

Process: Concept of a Process, Process States, Process Description, Process Control (Process

Creation, Waiting for the Process/Processes, Loading Programs into Processes and Process

Termination), Threads: Processes and Threads, Concept of Multithreading, Types of Threads,

Thread programming Using Pthreads. Scheduling: Uniprocessor Scheduling - Types of

33

Scheduling, Scheduling Algorithms (Ex. FCFS, Round Robin Scheduling and SJF), Principles

of Concurrency, Requirements for Mutual Exclusion, Mutual Exclusion: Operating System

Support (Semaphores and Mutex), Example: Readers/Writers Problem, Deadlock and

Starvation: Principles of Deadlock, Deadlock Prevention, Deadlock Avoidance, Deadlock

Detection, An Integrated Deadlock Strategy, Example: Dining Philosophers Problem. Case

Study:Linux OS.

Unit IV - MEMORY MANAGEMENT [09]

Memory Management: Memory Management Requirements, Memory Partitioning: Fixed

Partitioning, Dynamic Partitioning, Buddy System, Relocation, Paging and Segmentation.

Virtual Memory: Principle of Locality, Demand Paging, Page Replacement Algorithms (Ex.

FIFO, Optimal, LRU and Clock), and Thrashing: Dealing with Thrashing. Case Study: Linux

Unit V - I/O and File management [09]

I/O Management and Disk Scheduling: I/O Devices, Organization of the I/O Function,

Operating System Design Issues, I/O Buffering, Disk Scheduling (Ex. FCFS, SSTF &

SCAN), Disk Cache. File Management: Overview, File Organization and Access, File

Directories, File Allocation Methods and Free Space Management. Case Study: Linux

------------------------------------------------------------------------------------------------------------

Course Outcomes: (Students will be able to)

● Analyze and synthesize system software

● Use tools like LEX & YACC.

● Understand the functions of operating system.

● Do the programming for process and thread management in OS

---------------------------------------------------------------------------------------------------------

TEXT BOOKS

1. Systems Programming and Operating Systems, Dhamdhere D.M, TMGH

2. Alfred V. Aho, Monica S.Lam, Ravi Sethi, Jeffrey D.Ullman, “Compilers: Principles, Techniques and Tools”,

Second Edition, Pearson Education, 2014.

3. K. Cooper, L. Torczon, “Engineering a Compiler”, Morgan Kaufmann Publishers,ISBN81–8147–369 –8.

4. Kenneth Louden “Compiler Construction”, Cengage Learning.

5. Modern Operating System – Andrew S. Tanenbaum, Pearson Education India

6. Operating System Concepts - Abraham Silberschatz, Peter B. Galvin &Grege Gagne, Wiley

REFERENCES

1. Operating System : Concepts and Design - Milan Milenkovic, TMGH

2. Understanding the Linux kernel - Daniel P Bovet and Marco Cesati, O’Reilly

3. J. R. Levine, T. Mason, D. Brown, "Lex &Yacc", O'Reilly, 2012

4. Linux System Programming - Robert Love, Publisher - SPD, O’ Reilly

5. Systems programming - John J. Donovan, TMGH

34


17BTCS504

Database Management Systems


CA FE Credits L T

D/P

4 0 0 40 60 4

Prerequisite:

● Fundamentals of data structures

● Basic Knowledge of file handling

Course Objectives:

● To learn the concepts of database management and querying the databases.

● To be familiar with various database design techniques and practice.

● To understand various transaction processing and concurrency control.

● To study the concepts of distributed databases and their management.

● To understand technical concepts to handle big data with distributed databases.

COURSE CONTENT

Unit I – INTRODUCTION OF DATABASs and SQL 09

Database Concepts, Three-schema architecture of a database, Data Models ER model,

Relational Model, ER to Table Conversion. Relational Algebra: Select, Project, Union, Set

difference, Join, SQL-Characteristics and advantages, SQL Data Types and Literals, DDL,

DML, DCL, TCL, Views, Indexes. PLSQL : Concept of Stored Procedures, Functions,

Cursors, Triggers. NOSQL- MongoDB CRUD Operations, SQL VsNoSQL Databases

Unit II – DATABASE DESIGN 09

Functional Dependency, Purpose of Normalization, Data Redundancy and Update

Anomalies, Functional Dependency Single Valued Dependencies. Single Valued

Normalization: 1NF, 2NF, 3NF, BCNF. Decomposition: lossless join decomposition and

dependency preservation, Multi valued Normalization (4NF), Join Dependencies and the Fifth

Normal Form

Unit III -DATABASE STORAGE, PROCESSING AND TRANSACTION 09

Query processing and query optimization, Basic concept of a Transaction, Transaction

Management, ACID Properties of Transactions, Concept of Schedule, Serial and

Concurrent Schedule, Serializability: Conflict and View, Cascaded Aborts, Recoverable

and Non-recoverable Schedules, Concurrency Control: Need, Locking based Protocol,

Deadlocks-Prevention, Detection Techniques, Recovery methods : Shadow Paging and Log

Based Recovery, Checkpoints

35

Unit IV – ADVANCE CONCEPTS OF DATABASES 09

Database Architectures: Centralized and ClientServer Architectures, Database Connectivity

using Java/Python with SQL and NoSQL databases. Introduction to Parallel Databases,

Architecture of Parallel Databases. Introduction to Distributed Databases, Distributed

Transactions. 2PC, 3PC protocols, Introduction to Data Mining and clustering.

Unit V - EMERGING DATA HANDLING TECHNIQUES 09

Introduction to Big data, Handling large datasets using Map-Reduce and Hadoop. Introduction

to Hbase data model and hbase region. Introduction to emerging database technologies- Cloud

Databases, Mobile Databases, SQLite Database, XML Databases

------------------------------------------------------------------------------------------------------------


● Apply the concepts of database design and SQL.

● Query a database using SQL, PL/SQL and NoSQL commands.

● Design and implement a big data store using HBase.

● Analyze big data using map-reduce programming.

------------------------------------------------------------------------------------------------------------

Text Books:

1. Silberschatz A., Korth H., Sudarshan S., "Database System Concepts", 6 th Edition, McGraw Hill

Publishers, ISBN 007120413X

2. Connally T., Begg C., "Database Systems", 3rd Edition, Pearson Education, 2002, ISBN 8178088614

3. “MongoDB: The Definitive Guide” by Kristina Chodorow, O’Reilly Publications

4. “Principles of Distributed Database Systems”, by M. Tamer Özsu, Patrick Valduriez, Springer

References:

1. Data Mining: Concepts and Techniques, Jiawei Han, Micheline Kamber, Jian Pei, Elsevier

2. Big Data: Understanding How Data Powers Big Business, Bill Schmarzo, Wiley

3. Hadoop: The Definitive Guide, Fourth Edition, Tom White, O’Reilly

4. HBase: The Definitive Guide, Fourth Edition, Lars George, O’Reilly

36


17BTCS505 Data Communication Core


CA FE Credits L T

D/P

4 0 0 40 60 4

Prerequisite: NA

Course Objectives:

1. To learn fundamental concepts of networking

2. To learn signals and data transmission techniques

3. To learn data link layer and different Ethernet standards

COURSE CONTENT

Unit I Introduction (9)

Data communication components, data representation, networks, protocol & standards, OSI

model, TCP/IP protocol suite, addressing, transmission media.

Unit II Signals & Digital transmission (9)

Analog and digital signals, periodic signals, attenuation, distortion, noise, data rate limits,

performance, digital to digital conversion, analog to digital conversion, transmission modes.

Unit III Analog transmission & Bandwidth Utilization (9)

Digital to analog conversion, analog to analog conversion, multiplexing, spread spectrum,

code division multiple access

Unit IV Data Link Layer (9)

Error detection and correction, block coding, linear block codes, cyclic codes, checksum,

framing, flow and error control, Noiseless and Noisy channels, HDLC, Point to point

protocol.

Unit V Multiple access and Ethernet (9)

Random access, aloha, CSMA, CSMA/CD, CSMA/CA, controlled access, channelization,

standard Ethernet, fast Ethernet, gigabit Ethernet, and connecting devices.

37

------------------------------------------------------------------------------------------------------------

Course Outcomes:

1. Ability to understand analog and digital transmission.

2. Ability to demonstrate error detection, framing, flow control and error control

3. Ability to understand Ethernet and demonstrate multiple access mechanism.

------------------------------------------------------------------------------------------------------------

Text Books: 1. Data Communications and Networking By Behrouz A. Forouzan, McGraw Hill Publication, 4th Edition

2. Data and Computer Communications by William Stallings, Pearson Education, 8th Edition

Reference books: 1. Computer Networks by Andrew S. Tanenbaum, Pearson Education, 3rd Edition.

2. Introduction To Data Communication And Networking by Wayne Tomasi, Pearson Education, 3rd Edition

3. Computer Networking: A Top-Down Approach by James F. Kurose, Keith W. Ross, Pearson Education, 4th

Edition

38


17BTCS511 PROGRAMMING LAB - 1 core


CA FE Credits

L T D/P

0 0 2 40 60 1

Prerequisite:

● Good knowledge of C programming

Course Objectives:

● To learn and understand various data structures used in the assembler design and its execution.

● To learn and understand LEX tool for simulating lexical analysis phase of the compiler.

● To program and execute various operating system concepts.

● To learn the confidentiality, integrity and authentication.

Part A - SYSTEM PROGRAMMING

1 Design suitable data structures and implement pass-I of a two-pass assembler. Implementation

should consist of a few instructions from each category and few assembler directives.

2 Implement pass-II of a two-pass assembler. The output of assignment-1 (intermediate file and

symbol table) should be input for this assignment.

3 Assignment to understand basic syntax of LEX Specifications, built-in functions and Variables.

a) Write a program to find out whether the given input is a letter or digit

b) Write a program to find out whether the given input is a noun, pronoun, verb, adverb,

adjective or preposition

c) Write a program to change case of given input (Upper, Lower, Sentence, Toggle)

d) Write a program to read positive integers from a file and calculate average of it.

Part B - OPERATING SYSTEM

4 Implement the following using shell scripting

Menu driven program for

a) Find the factorial of a no.

b) Find greatest of three numbers

c) Find a prime no

d) Find whether a number is palindrome

39

e) Find whether a string is palindrome

5 Process control system calls - Fork, execve and wait system calls along with the demonstration

of zombie and orphan states.

a) Application should consist of Fork –wait combination (parent with one application and child

with another application) and students must demonstrate zombie and orphan states.

b) Application should consist of Fork –execve combination (parent with one application and child

with another application).

6 Implement matrix multiplication using multithreading with pthread library.

7 Simulate the following scheduling algorithms using ‘C’ language.

● FCFS (Non-preemptive by default)

● SRTN (Preemptive version of SJF)

● Priority (Non-preemptive)

● Round Robin (Preemptive by default)

8 Simulation of Banker’s algorithm using C language.

9 Implement the following page replacement algorithms

● FIFO

● LRU

● Optimal

Part C - DESIGN & ANALYSIS OF ALGORITHMS

10 Sort a given set of elements using Quicksort method and determine the time required to sort the

elements. Run the program for varied values of n>5000 and record the time taken to sort. Plot a

graph of the “time taken” versus “n” on graph sheet. The elements can be read from a file or can

be generated using random number generator. Implements the same problem using parallelized

merge sort algorithm and compare the complexity of both the methods.

11 Implement any scheme to find the optimal solution for the Travelling Salesperson problem and

then solve the same problem instance using any approximation algorithm and determine the error

in the approximation.

12 Find a subset of a given set S = {Sl, S2,.....,Sn} of n positive integers whose SUM is equal to a

given positive integer d. For example, if S ={1, 2, 5, 6, 8} and d= 9, there are two solutions {1,2,6}

and {1,8}. Display a suitable message, if the given problem instance doesn't have a solution

References:

● Alfred V. Aho, Monica S.Lam, Ravi Sethi, Jeffrey D.Ullman, “Compilers: Principles,

Techniques and Tools”, Second Edition, Pearson Education, 2014.

● Thomas H Cormen and Charles E.L Leiserson, "Introduction to Algorithm" PHI


● Design and implement the algorithm for various translators.

● Demonstrate various operating system concepts like process and thread management through

C/C++/Java Programming

● Design and analyze various realtime algorithms.

40


17BTCS512

Programming Laboratory-II PL


CA FE Credits L T

D/P

0 0 4 40 60 2

Prerequisite:

● Fundamentals of data structures

● Basic Knowledge of file handling

Course Objectives:

1. Provide hands on skills on SQL and ER Diagrams.

2. Demonstrate different operations on database using PLSQL.

3. To get hands on exposure on NOSQL(Mongo) DB.

4. To understand concepts of Big data Hadoop.

COURSE CONTENT

1 Design sample database, draw ER diagram and Study of MySQL Database

Management System.

2 Write and execute SQL-DDL, DML queries (aggregate functions, nested sub-queries,

Join operations), PL/SQL stored procedures and functions to perform a suitable

operation on the database

3 Write PL/SQL blocks for demonstrating triggers and cursors.

4 Execute SQL queries on the sample database using MySQL and User Interface in

either Java, Python, or PHP.

5 Design and create a suitable collection example to perform CRUD operations in

MongoDB.

41

6 Use MongoDB/NoSQL/MySQL/Oracle (Any two) queries for:

1.Indexing

2.Administration

3.Aggregate

7 Execute NoSQL queries on the sample collections using MongoDB and User Interface

in either Java, Python, or PHP

8 Implement MapReduce example in MongoDB with suitable dataset.

9 Hadoop and HBase installation on single node.

10 Using HBase perform following operations

1.Create a table

2.Add, Retrieve, Modify, and delete the record(s)

3.Drop the table

11 Implement MapReduce example in HBase with suitable dataset


● Apply the concepts of database design and SQL. ● Query a database using SQL, PL/SQL and NoSQL commands. ● Design and implement a big data store using HBase. ● Analyze big data using map-reduce programming.

Text Books:

1. Silberschatz A., Korth H., Sudarshan S., "Database System Concepts", 6 th Edition, McGraw Hill

Publishers, ISBN 007120413X 2. Connally T., Begg C., "Database Systems", 3rd Edition, Pearson Education, 2002, ISBN 8178088614 3. “MongoDB: The Definitive Guide” by Kristina Chodorow, O’Reilly Publications 4. “Principles of Distributed Database Systems”, by M. Tamer Özsu, Patrick Valduriez, Springe

References:

1. Data Mining: Concepts and Techniques, Jiawei Han, Micheline Kamber, Jian Pei, Elsevier 2. Big Data: Understanding How Data Powers Big Business, Bill Schmarzo, Wiley 3. Hadoop: The Definitive Guide, Fourth Edition, Tom White, O’Reilly 4. HBase: The Definitive Guide, Fourth Edition, Lars George, O’Reilly

42

SEMESTER VI


17BTCS601 Computer Network Core


CA FE Credits

L T

D/P

4 0 0 40 60 4

Prerequisite: Data Communication, Computer Organization and Architecture

Course Objectives: ( 3 to 5 ):

● To understand the fundamental concepts of networking protocols and standards.

● To learn role of protocols at various layers in the protocol stacks.

● To learn different techniques for routing, addressing, and congestion control

● To understand difference between wired and wireless network and learn wireless standards

and techniques.

● To understand application of networks and explore recent trends in networking.

COURSE CONTENT

Application Layer 9

OSI Revisited, Principles of Network Applications, The Web and HTTP, File Transfer: FTP,

SMTP, TELNET, SSH, DNS,DHCP

Transport Layer 9

Introduction and Transport-Layer Services, Multiplexing and De-multiplexing, Connectionless

Transport: UDP, Connection-Oriented Transport: TCP, Principles of Congestion Control,

Quality of services (QoS), Differentiated services, Integrated services.

Network Layer 9

Internetworking, Network Layer in the Internet, Virtual Circuit and Datagram Networks, Internet

Protocol (IP): Forwarding and addressing in the Internet, IPV4, ICMPV4, IPV6, Routing

Algorithms, Routing protocols: RIP, OSPF, BGP

Wireless Networks 9

Wireless Links and Network Characteristics, WiFi: 802.11 Wireless LANs, Mobile IP, Wireless

43

TCP, Wireless application protocol, WiMax.

Advanced Network Technologies 9

VoIP, Vehicular network, Delay tolerant network, Software defined network, ATM: Overview,

Protocol Architecture.

------------------------------------------------------------------------------------------------------------


● Understand networking protocol, technologies, and standards, and select appropriate one according to requirements.

● Demonstrate design issues of various networking protocols. ● Analyze data flow between layered model using Application, Transport and Network

Layer Protocols. ● Demonstrate different routing and switching algorithms. ● Understand applications of computer network.

------------------------------------------------------------------------------------------------------------

TEXT BOOKS

1. James F. Kurose, Keith W. Ross, “Computer Networking: A Top-Down Approach”, 6th edition, Pearson Education.

2. William Stallings, “Data and Computer Communications”, 8th Edition, Pearson Education, Inc.

REFERENCES

3. Andrew S. Tanenbaum, David J. Wethrall, “Computer Network”, 5th Edition, Pearson Education,

4. Behrouz A. Forouzan, “Data Communication and Networking”, McGraw Hill Education, 5th Edition.

44

17BTCS602: ENVIRONMENTAL ENGINEERING 3 1 0 4


BASICS OF ENVIRONMENTAL ENGINEERING 09

Definition of environment and pollutants, central and state boards for the prevention and

control of environmental pollution, powers and functions of pollution control boards, penalties

and procedure, duties and responsibilities of citizens for environmental protection.

INDIAN CONSTITUTION AND ENVIRONMENTAL PROTECTION 09

National Environmental policies – Precautionary Principle and Polluter Pays Principle –

Concept of absolute liability – multilateral environmental agreements and Protocols – Montreal

Protocol, Kyoto agreement, Rio declaration, Functions and Constitutions of SPCB and CPCB.

KEY PROVISIONS OF ENVIRONMENTAL LAWS (INDIA) 09

Wildlife Protection Act 1972, Prevention and Control of Air Pollution Act 1981, Forest

Conservation Act 1981, Environment (protection) Act 1986, Hazardous waste (Management

and Handling) Rules, 1989, Bio-Medical Waste (Management and Handling) Rules, 1998,

Biological Diversity Act, 2002, Wild Life (Protection) Amendment Act 2002, National Green

Tribunal Act, 2010.

ENERGY AND ENVIRONMENTAL POLLUTION 09

Types of energy: conventional and non-conventional. Need for harnessing alternative energies

to meet the increased demand, Methods of harnessing energies. Sources, causes, effects and

measures associated with: air pollution, water pollution, noise pollution, land pollution.

ECOLOGY AND ECO SYSTEM 09

Biotic and abiotic factors, impact of the human behaviour and technological advancements on

the environment, Need for conserving natural resources and preserving the environment,

Engineer’s role in achieving sustainable development, Introduction to solid waste

management, electronic wastes and its disposal.

REFERENCE BOOKS

1.Shyam Divan and Armin Roseneranz “Environmental law and policy in India “Oxford

University Press, New Delhi, 2001.

2.Environmental studies by Rajgopalan- Oxford University Press.

3.Pares Distn. Environmental Laws in India (Deep, Latededn.)

ONLINE REFERENCE:

1.Ministry of Environment, Forest and Climate Change: http://moef.nic .in, http://envfor.nic.in

http://envfor.nic.in/

45

Guideline for Tutorial:

1. Conduct minimum one case study on each unit.

2. Engage student for any of the following activity

i) Small group meetings / Street play / Essay Writing about water management,

Promotion of recycle use, generation of less waste, avoiding electricity waste

ii) Slogan / Poster making event

iii) Cycle rally

iv) Lecture from experts – like on- Green Environment, Green Energy, e-waste and its

precaution etc.

v) Drive for Cleanliness, Segregation of Waste, etc.

46


17BTCS603 Principles of Compiler Design Core


CA FE Credits L T

D/P

4 0 0 40 60 4

Prerequisite: Theory of Computation


1. To introduce structure of compilers and basic theories and methods used in different

parts of compiler.

2. To design various phases of compiler for a subset of programming language

3. To distinguish different optimization techniques in design of compiler

4. To study different compiler tools

17BTCS603: Principles of Compiler Design 4 0 0 4


LEXICAL AND SYNTAX ANALYSIS: 9

Introduction to Compiler, Phases and Passes, Bootstrapping, Cross Compiler.

Introduction to lexical Analysis: Role of a Lexical Analyzer, Specification and Recognition of

Tokens, LEX

Introduction to Syntax Analyzer: Expressing Syntax, Top-Down Parsing, Predictive Parsers,

Bottom up Parsers - Operator precedence parsers, shift-Reduce: SLR, LR (k), LALR , ,

Constructing LALR parsing tables, using ambiguous grammars, YACC, Type Checking, Type

Conversion

SEMANTIC ANALYSIS: 9

Need of semantic analysis, type checking and type conversion, Syntax Directed Translation: Syntax

directed definitions, construction of syntax trees, bottom-up evaluation of S-attributed Definitions,

L-attributed definitions, Top-down translation, Declarations, assignment statements, iterative

statements, case statements, arrays, structures, conditional statements, Boolean expressions, back

patching, procedure calls.--

INTERMEDIATE CODE GENERATION: 9

Intermediate Representations, Intermediate Code Generation- Syntax Tree, DAG, Postfix Notation,

47

Three Address Codes, Quadruples, Triples, Indirect Triples. Error Detection & Recovery: Lexical

Phase errors, syntactic phase errors semantic error

CODE OPTIMIZATION: 9

Introduction, Principal Sources of Optimization, Optimization of basic Blocks, Introduction to

Global Data Flow Analysis, Runtime Environments, Source Language issues.

INTRODUCTION CODE GENERATION: 9

Issues in Code Generation, Basic Blocks and Flow Graphs, Next-use information, A simple Code

generator, DAG representation of Basic Blocks, Peephole Optimization.

----------------------------------------------------------------------------------------------------------

Course Outcomes:

Upon completion of the course, graduates will be able to -

1. Identify and interpret the different phases of a compiler and their functioning.

2. Acquaint themselves with compiler writing tools.

3. Propose solutions to address real world problems in language processing.

4. Develop compiler for a subset of a programming language with collaborative efforts. ------------------------------------------------------------------------------------------------------------

TEXT BOOK:

1.“Compilers: Principles, Techniques and Tools”, A. V. Aho, M. S. Lam, R. Sethi, J. D. Ullman,

Addison Wesley, ISBN 978-81317-2101-8, Second Edition, 2007.

2. “Engineering a Compiler”, K. Cooper, L. Torczon, Morgan Kaufmann, ISBN 1-55860-698-X,

First Edition, 2003.

Reference Books 1. “Advanced Compiler Design and Implementation”, S. S. Muchnik, Morgan Kaufmann,

ISBN 8178672413, First Edition, 1997.

2. V. Raghavan, “Principles of Compiler Design”, Tata McGrawHill Education Publishers.

3. “Lex & Yacc”, J. R. Levine, T. Mason, D. Brown, “Lex & Yacc”, J. R. Levine, T. Mason,

D. Brown, O’Reilly, ISBN 1-56592-000-7, Second Edition, 1992.

Additional Reading 1. “Compiler Construction: Principles and Practice”, K. Louden, Course Technology, ISBN 0-

534-93972-4, First Edition, 1997.

2. Steven S. Muchnick, “Advanced Compiler Design and Implementation”, Morgan Kaufmann

Publishers - Elsevier Science, India, Indian Reprint.

48


17BTCS604 Artificial Intelligence Core


CA FE Credits L T

D/P

3 1 0 40 60 4

Prerequisite: Computer Networks


1. To learn and understand basic artificial intelligence concept

2. To explore different problem solving and searching techniques

3. To learn and understand the basic concerns of knowledge representation, reasoning and

machine learning.

COURSE CONTENT

INTRODUCTION TO ARTIFICIAL INTELLIGENCE 9

Introduction to Artificial Intelligence, History, AI models, Learning aspects, Intelligent Agents,

Rational Agent, Environment types.

PROBLEM SOLVING AND SEARCH 9

Problem space and search, Toy Problems, Uninformed search methods – Breadth First

Search, Uniform Cost Search, Depth First Search, Depth Limited Search, Iterative Deepening

Search, Bi-directional Search, Heuristic search methods - Best first, Greedy, A* , AO*, Hill

Climbing, Local Search and optimization - Simulated Annealing, Local Beam Search, Tabu

search

CONSTRAINT SATISFACTION PROBLEM & PLANNING 9

CSP as Search Problem, Backtracking Search for CSP, Forward checking, Constraint

Propagation, Formulating Problem structure. Planning components, Blocks world, Goal Stack

Planning, Planning as a state space search, Partial Order Planning, Multi-agent Planning, Job

shop scheduling problem

49

KNOWLEDGE AND REASONING 9

Knowledge Representation, Wumpus World, Propositional Logic, Predicate Logic, Unification

and Lifting, Representing Knowledge using rules, Frame systems, Semantic networks,

Uncertainty and methods, Bayesian Probability and belief network, Probabilistic reasoning,

Forward and backward reasoning, Making simple decisions, influence diagrams

EXPERT SYSTEMS, MACHINE LEARNING & APPLICATIONS 9

Introduction to Expert Systems, Shells and Explanations, Rule based Expert system, Forward

and backward chaining, Frame based expert systems, Fuzzy Expert systems, Introduction to

Machine Learning, Supervised, unsupervised methods, application areas of AI

------------------------------------------------------------------------------------------------------------

Course Outcomes:

1. Able to apply knowledge of artificial intelligent to solve problems 2. Able demonstrate the knowledge of problem solving and reasoning 3. Able to apply machine learning approaches to develop intelligent applications

-----------------------------------------------------------------------------------------------------------

TEXT BOOKS

1. Stuart Russell and Peter Norvig (1995), “Artificial Intelligence: A Modern Approach”, Third edition, Pearson, 2003.

2. Parag Kulkarni and Prachi Joshi, “Artificial Intelligence Building Intelligent Systems”, PHI learning Pvt. Ltd., ISBN 978-81-203-5046-5, 2015.

REFERENCES

1. Elaine Rich and Kevin Knight “Artificial Intelligence”, Tata McGraw Hill, 1991

2. Patrick Henry Winston, “Artificial Intelligence”, Addison-Wesley, 1992

3. Jiaweihan, MichelineKamber, "Data Mining: Concepts and systems", Morgan

Kaufmann Publishers

4. Machine Learning,TomMitchell,McGraw Hill, 1997,ISBN: 978-0-070-42807-2

50


17BTCS611 Programming Laboratory-III Core


CA FE Credits L T

D/P

0 0 2 40 60 1

Prerequisite: Data Communication, Fundamentals of Computer Programming


● To implement fundamental concepts of network. ● Use modern tools for network traffic analysis ● To learn network programming.

COURSE CONTENT

Note: Student has to perform any 12 assignments out of given assignments.

1. Study Network Protocols using Wireshark.

2. Implementation of Packet sniffer.

3. Write a program to read the HTTP header and analyze the parameters.

4. Installing and configure DHCP server. Test Working of it

5. Write a program scan the network ports on remote machine.

6. Implement video server and display video at client side using to demonstrate packetization.

7. Simulation of networking protocols using packet tracer (any 2)

8. Study Linux networking commands

9. Write FTP/Telnet program using socket programming for TCP

10. Write TFTP program using socket programming for UDP

11. Implement any congestion control algorithm for TCP

51

12. Implement Multithreaded Text Conferencing program

13. Implement Proxy server program.

14. Implementation of Multithreaded web server

15. Implement sliding window protocol

16. Implement distance vector routing algorithm

17. Case Study VOIP application

18. Design a RPC application to add and subtract a given pair of integers

------------------------------------------------------------------------------------------------------------


● Demonstrate behavior of network using modern tools. ● Implement different networking protocols and use different networking commands. ● Develop application of computer network.

------------------------------------------------------------------------------------------------------------

REFERENCES

1. James F. Kurose, Keith W. Ross, “Computer Networking: A Top-Down Approach”, 6th edition, Pearson Education.

2. William Stallings, “Data and Computer Communications”, 8th Edition, Pearson Education, Inc.

3. Andrew S. Tanenbaum, David J. Wethrall, “Computer Network”, 5th Edition, Pearson Education.

4. Behrouz A. Forouzan, “Data Communication and Networking”, McGraw Hill Education, 5th Edition.

5. Tsunami Computing, Innokenty Rudenko, “Cisco Routers for IP Networking Black Book:

A Practical in Depth Guide for Configuring Cisco Routers for Internetworking IP-Based

Networks”, Paraglyph Press.

6. Michael J. Donahoo, Kenneth L. Calvert, “Pocket Guide to TCP/IP Socket Programming

in C”, C Version ed. Edition, Morgan Kaufmann.

52


17BTCS612 Programming Laboratory - IV Core


CA FE Credits L T

D/P

0 0 4 40 60 2

Prerequisite: Advanced Data Structures, Theory of Computation


1.To design various phases of compiler for a subset of programming language

2. To distinguish different optimization techniques in design of compiler

3. To study different compiler tools

COURSE CONTENT

17BTCS612: Programming Laboratory-IV 0 0 4 2

CA : 40 Marks FE : 60 Marks Total Number of hours: 30

List of Experiments:

1 LEX ● Implement Lexical Analyzer for identifying an alphabet or digit ● Implement a Lexical Analyzer for parts of speech.

● Implement a Lexical Analyzer for vowels and consonants

2 Implement a lexical analyzer for a Sample Language using LEX Implementation should support

Error handling.

3 YACC ● Assignment to understand basic syntax of YACC, generate a calculator using YACC. ● Implement Scientific Calculator using YACC.

4 Parser for for loop / while loop / if else statement using YACC.

5. Intermediate Code Generation for an Arithmetic Expression –Three Address Code- Quadruples,

Triples.

6 Intermediate Code Generation for Subset of C (for loop)

7 Assignment to optimize the generated equivalent three-address code.

8 Code Generation using LEX and YACC.

53

9 ● STUDY ASSIGNMENT: Write an ambiguous CFG to recognize an infix expression and implement a parser that recognizes

the infix expression using YACC. Provide the details of all conflicting entries in the parser table

generated by LEX and YACC and how they have been resolved.

10. Study of different LEX and YACC tools

Minimum 12 assignments need to be framed using the above list provided.

References :

1.“Compilers: Principles, Techniques and Tools”, A. V. Aho, M. S. Lam, R. Sethi, J. D. Ullman,

Addison Wesley, ISBN 978-81317-2101-8, Second Edition, 2007.

2. “Lex & Yacc”, J. R. Levine, T. Mason, D. Brown, “Lex & Yacc”, J. R. Levine, T. Mason, D.

Brown, O’Reilly, ISBN 1-56592-000-7, Second Edition, 1992.

54


17BTCS621 Mini Project-IV Core


CA FE Credits L T

D/P

0 0 4 40 60 2

Prerequisite: Computer Networks


1. To expose the students to use artificial intelligence approach to solve the real time

problems.

2. To learn and understand project management knowledge

3. To explore latest trends in machine learning

COURSE CONTENT

Mini Project IV includes two parts

1. Artificial Intelligence

1. Implementation of any 2 uninformed search methods with some application

2. Implement A* approach for any suitable application.

3. Implementation of Constraint Satisfaction Problem for Cryptarithmatic

4. Implementation of MiniMax approach for TIC-TAC-TOE using Java/ Python

5. Implementation of unification algorithm

6. Develop a rule based expert system for medical diagnosis

7. Case study- Machine Learning using Numpy, Scikit learn and pandas

2. Student can select problem statement in a group of 4 to design and implement an

intelligent application based on the research paper in area of Artificial Intelligence.

55

Students should also demonstrate the knowledge of Elective I subject in the

implementation of the mini project.

-----------------------------------------------------------------------------------------------------------

Course Outcomes:

1. Able to identify and solve real time problems 2. Able to apply project management knowledge 3. Able to develop real world application using latest machine learning approaches

------------------------------------------------------------------------------------------------------------

REFERENCES

1. Stuart Russell and Peter Norvig (1995), “Artificial Intelligence: A Modern Approach”,

Third edition, Pearson, 2003

2. Parag Kulkarni and Prachi Joshi, “Artificial Intelligence Building Intelligent Systems”, PHI

learning Pvt. Ltd., ISBN 978-81-203-5046-5, 2015.

2. https://cesoc.ieee.org/publications/ieee-transactions-on-computational-intelligence-and-ai-

in-games.html

3. https://www.journals.elsevier.com/artificial-intelligence

4. https://link.springer.com/journal/10462

56


17BTCS634 Project Management and Entrepreneurship Regular


CA FE Credits L T

D/P

3 0 0 40 60 3

Prerequisite:

● Basic Knowledge of software engineering

● Fundamentals of Entrepreneurship.

Course Objectives:

● To understand the fundamental principles of Software Project management

● To study an analysis of different methods and techniques used for project

management.

● To learn the ideal entrepreneur and Entrepreneurial Competencies.

● To acquire the knowledge of Entrepreneurship Development strategies.

COURSE CONTENT

Unit I Introduction (08)

What is a Project, Projects and Operational Work, Programs, Subprojects, and Portfolios, What

is a Software Project, Application Development, Process and Systems Reengineering Services,

System Integration Services, Other Types of Projects, Managing Projects, The Project

Manager and the Project Stakeholder, Project Stakeholders, Code of Conducts and Ethical

Aspects, Software Project Management, Evolution Of Project Management, Where Is Project

Management Appropriate, Different Forms Of Project Management, Project Environments.

Unit II Managing Goals, Time, and Costs (08)

Before You Start: Assessing Value and Risks, Formalizing the Project Goals, Deciding the

Work, Estimating, Scheduling a Plan, Optimizing a Plan, Budgeting and Accounting, Project

Execution, Project Monitoring and Control, Project Closing, Project quality management

process.

Unit III: Managing People and Organizing Communication (06)

Managing People, Project Organization Structures, Managing Communication, Software

Project Pricing- From Cost to Pricing, Software Pricing, Project Pricing Strategies,

Procurement and Outsourcing.

https://www.safaribooksonline.com/library/view/introduction-to-software/9781466559530/K15541_C001.xhtml

57

Unit IV: Entrepreneur and Entrepreneurship (08)

Entrepreneur-Concept, Functions, Types, Characteristics, Qualities and Role – Ideal

Entrepreneur; Entrepreneur vis-à-vis Professional Manager, Entrepreneur, Copreneur;

Distinction between wage employment, self-employment & Entrepreneurship; Entrepreneurial

Competencies; Entrepreneur and Entrepreneurship–Factors, Barriers & Problems and Process

of Entrepreneurship, Growth of Entrepreneurship in India

Unit V: Entrepreneurship Development (08)

Entrepreneurship Development: Concepts, Factors affecting, Development Cycle and Strategy;

Entrepreneurship Development Program (EDP): Concepts, Objective, Contents, issues, Phases,

Evaluation. Institutions conducting EDP’s in India; Entrepreneurship Development Training:

Importance, Objective, Methods; Role of Institutions in Entrepreneurship Development; Role

of Central and State Government in Entrepreneurship Development

---------------------------------------------------------------------------------------------------------------


● Students will be able to understand the issues and challenges faced while doing the Software

project Management.

● Students will be able to understand a good knowledge of responsibilities of project manager.

● Students will be able to understand why majority of the software projects fails and how that

failure probability can be reduced effectively.

● Students will be able to do the Project Scheduling, tracking, Risk analysis, Quality

management and Project Cost estimation using different techniques.

● Students will be able to learn entrepreneurship skills, competencies and strategies.

---------------------------------------------------------------------------------------------------------------

Text books

● Introduction to Software Project Management, by Adolfo Villafiorita, Publisher: CRC Press,

ISBN: 9781466559530

● Project Management for Engineering, Business and Technology, By John M. Nicholas, Herman

Steyn.

● Desai, V. (2011). Dynamics of Entrepreneurship Development and Management, New Delhi:

Himalaya publishers.

● Poornima, C. (2011). Entrepreneurship Development - Small Business Enterprises. New Delhi:

Pearson.

Reference books

● Robert D. H. & Peters, M.P. (2013). Entrepreneurship. New Delhi: Tata McGraw Hill.

● Larson, D. (2006). Project Management. New Delhi: Tata McGraw- Hill.

● Maylor, H. (2010). Project Management. New Delhi: Pearson.

58

17BTCS701 INFORMATION SECURITY 4 0 0 4


OVERVIEW AND NUMBER THEORY 9

Overview- Threats, risks, consequences, Sources of threats, Attacks classification, Network

Security Model, Classical Encryption Techniques, Number Theory- Prime numbers,

Factoring, Modular arithmetic, Fermat’s &Euler’s theorems, GCD, Euclid’s algorithm,

Testing for primality, Chinese Remainder Theorem, Discretelogarithm problem

CRYPTOGRAPHY 9

Concepts and Techniques, symmetric and asymmetric key cryptography, steganography,

Symmetric key

Ciphers- DES structure, DES Analysis, Security of DES, Block cipher modes of operation ,

Triple DES, RC5, AES structure, Analysis of AES , Key distribution Asymmetric key

Ciphers- Principles of public key cryptosystems, RSA algorithm, Analysis of RSA, Diffie-

Hellman Key exchange, Elliptic Curve Cryptography

MESSAGE AUTHENTICATION AND DIGITAL SIGNATURES 9

Authentication requirements and functions, MAC, Secure Hash Algorithm, HMAC, Digital

signatures, X.509, Kerberos, Authentication protocols

NETWORK AND WEB SECURITY 9

IPSec, Internet Key Exchange, Secure Socket Layer (SSL), Transport Layer Security (TLS),

Secure Electronic Transaction (SET), Pretty Good Privacy (PGP), S/MIME

INTRUSION DETECTION & PREVENTION 9

Intrusion detection, Snort, types of IDS, Virus and countermeasures, types of firewall,

Network Address Translation (NAT), IPTables/NetFilter, implementing NAT, Trusted

Systems, Security audit, Penetration testing and ethical hacking

TEXT BOOKS

1. William Stallings, “Cryptography and Network Security”, 6th Edition, Pearson Education.

2. AtulKahate,” Cryptography and Network Security”, 2nd Edition, Mc Graw Hill

REFERENCES

1. Behrouz Forouzan, “Cryptography and Network Security”, Special Indian Edition, Tata

Mc Graw Hill

2. Margaret Cozzens, Steven J Miller, The mathematics of encryption, American

Mathematical Society

3. Michael E. Whitman, Herbert J. Mattord , “Principles of Information Security”,

CENGAGE Learning,

4th Edition.

4. Yang Xiao, Frank H Li, Hui Chen , “Handbook of Security of Networks”, World

Scientific, 2011.

59

17BTCS702 : Internet of Things 3 1 0 4


Unit-I : INTERNET OF THINGS: AN OVERVIEW

Definition & Characteristics of IoT, Physical Design of IoT, Logical Design of IoT,

IoT Enabling Technologies, IoT Levels & Deployment Templates, IoT Applicatins

for: Home, Cities, Environment, Energy Systems, Retail, Logistics, Industry,

Agriculture, Health & Lifestyle, etc.

(09 hrs)

Unit-II: IoT, M2M and IoT Design Methodology

M2M, Differences and Similarities between M2M and IoT, SDN and NFV for IoT,

IoT Platforms Design Methodology, IoT Design Methodology that includes: Purpose

& Requirements Specification, Process Specification, Domain Model Specification,

Information Model Specification, Service Specifications, IoT Level Specification,

Functional View Specification, Operational View Specification, Device &

Component Integration, Application Development

(09 hrs)

Unit-III: IoT Physical Devices & Endpoints & IoT Physical Servers & Cloud

Offerings

Basic building blocks of an IoT Device, Exemplary Device: Raspberry Pi, Raspberry

Pi interfaces, Programming Raspberry Pi with Python, Other IoT devices. Cloud

Storage Models & Communication APIS, Web Application Messaging Protocol

(WAMP), Xively cloud for IoT, Python web application framework – Django,

Developing applications with Django, Developing REST web services, Amazon Web

Services for IoT, & SkyNet IoT Messaging Platform

(09 hrs)

Unit-IV: IoT Communication Protocols

Basics, Architectures, Security aspects and working of HTTP, UPnP, CoAP, MQTT

and XMPP Protocol

(09 hrs)

Unit-V: Analytics for loT

The Principal Steps toward Knowledge Discovery and Dissemination, The

Rewarding Repercussions of the Data Explosion, Describing Big Data Analytics, The

Strategic Importance of Big Data Analytics, The Key Drivers for IoT Data Analytics

, The Key Capabilities of Next-Generation IoT Data Analytics Platforms, The Prime

Modules of IoT Data Analytics Platforms, Overview of MapReduce parallel

programming model, Overview of Hadoop, Case study on batch data analysis using

Hadoop, Case study on real-time data analysis using Hadoop, Overview of Apache

Oozie, Overview of Apache Spark, Overview of Apache Storm, Case study on using

Apache Storm for real-time data analysis

(09 hrs)

References:

60

1. "The Internet of Things: Enabling Technologies, Platforms, and Use Cases", by Pethuru

Raj and Anupama C. Raman (CRC Press)

2. Adrian McEwen, Hakim Cassimally, “ Designing the Internet of Things”, Wiley

Publication

3. "Internet of Things: A Hands-on Approach", by Arshdeep Bahga and Vijay Madisetti

(Universities Press)

61

17BTCS703 : Cloud Computing 4004 CA : 40 Marks FE : 60 Marks

Unit I : CLOUD COMPUTING FUNDAMENTALS (9 Hours) Definition of Cloud Computing, features, multitenancy, cloud types, Cloud deployment

models, Benefits, challenges and risks of cloud computing, cloud cube model, Business

Agility: Benefits and challenges to Cloud architecture. Application availability, performance,

Case Studies: Google App Engine, Salesforce.com, Microsoft

Azure

Unit II: VIRTUALIZATION (9 Hours) Introduction to Virtualization, Server virtualization, Storage virtualization, Network

virtualization , virtual private network, role of virtualization in cloud computing, Virtual

machines, Virtual machine monitors , Performance and Security Isolation, Full virtualization

and paravirtualization, Hardware support for virtualization, types of hypervisors, Case study:

Xen, KVM, VMWare, Hyper-V

Unit III : CLOUD COMPUTING ARCHITECTURE (9 Hours)

Cloud Computing Architecture, Introduction, Cloud Reference Model, Architecture,

Infrastructure / Hardware as a Service, Platform as a Service, Software as a Service, Types of

Clouds, Public Clouds, Private Clouds, Hybrid Clouds, Community Clouds, Economics of the

Cloud, Open Challenges, Cloud Definition, Cloud Interoperability and Standards Scalability

and Fault Tolerance Security, Trust, and Privacy Organizational Aspects

Unit IV: CLOUD STORAGE INFRASTRUCTURES (9 Hours) Direct-Attached Storage (DAS) architecture, Storage Area Network (SAN) attributes,

components, topologies, connectivity options and zoning. FC protocol stack, addressing, flow

control. Networked Attached Storage (NAS) components, protocols, IP Storage Area Network

(IP SAN) iSCSI, FCIP and FCoE architecture. Cloud file systems: GFS and HDFS, BigTable,

HBase and Dynamo.

Unit V: CLOUD SECURITY , QoS AND CLOUD APPLICATIONS (9 Hours) Multitenancy issues, Cloud security threats and risks, attacks in cloud environment, virtual

machine security, data privacy and availability in cloud computing ,QoS : Auto scaling, Load

balancing, Performance tuning in cloud computing, disaster recovery,

Amazon Web Services: Amazon EC2 and S3, Openstack, Eucalyptus.

TEXT BOOKS

1. GautamShroff, “Enterprise Cloud Computing Technology Architecture Applications”,

Cambridge University Press; 1 edition, 2010.

2. Greg Schulz, “Cloud and Virtual Data Storage Networking”, Auerbach Publications

[ISBN: 978-1439851739], 2011.

3. Kris Jamsa, “Cloud Computing: SaaS, PaaS, IaaS, Virtualization and more”, Jones &

Bartlett Student Edition

4. Rajkumar Buyya, Christian Vecchiola, and Thamarai Selvi, Mastering Cloud

Computing McGraw Hill Education

62

REFERENCES

1. Dan C. Marinescu, "Cloud Computing - Theory and Practice", 1st Edition, Morgan

Kaufmann is an imprint of Elsevier, 2013,

2. Dr. Kumar Saurabh,”Cloud Computing”, Wiley Publication

3. Lizhe Wang, “ Cloud Computing:Methodology, System and Applications”, CRC Press

4. VenkataJosyula,”Cloud computing – Automated virtualized data center”, CISCO Press

5. YohanWadia, "The Eucalyptus Open-Source Private Cloud". Last Accessed on:

http://www.cloudbook.net/resources/stories/the-eucalyptus-open-source-privatecloud

63

ELECTIVE II


17BTCS731 Data Mining Core

Contact Hours per Week CA FE Credits

L T

D/P

3 1 0 40 60 4

Prerequisite: Databases and Database Management Systems, or equivalent.

Course Objectives: ( 3 to 5 ): 1. To identify the scope and essentiality of Data Warehousing and Mining. 2. To analyze data, choose relevant models and algorithms for respective applications. 3. To study spatial and web data mining. 4. To develop research interest towards advances in data mining.

17BTCS731: Data Mining 3 1 0 4


Introduction: (9 hrs) Data Mining Techniques, KDD vs data mining, machine learning concepts, , data pre-

processing – cleaning, integration, reduction, transformation and discretization, application

of mining.

Data Warehouse: (9 hrs) Introduction, Data warehouse modeling, Data warehouse design, Data warehouse

technology materialized view. OLAP, knowledge representation Data Cube: A

multidimensional model, data cube computation, data cube computation methods:

multidimensional data analysis.

Association Rules

Problem Definition, Frequent Item Set Generation, The APRIORI Principle, Support and

Confidence Measures, Association Rule Generation, APRIORI Algorithm, The Partition

Algorithms, FP-Growth Algorithms, Compact Representation of Frequent Item Set-

Maximal Frequent Item Set, Closed Frequent Item Set.

Classification

Problem definition, General Approaches to solving a classification problem,Evaluation of

Classifiers, Classification techniques, Decision trees-Decision Tree Construction, Methods

for expressing attribute test conditions, Measures for Selecting the Best split, Algorithm for

Decision tree Induction, Naïve-Bayes Classifier, Bayesian Belief Networks; K-nearest

neighbor classification-Algorithm and characteristics.

64

Clustering

Problem Definition, Clustering overview, Evaluation of clustering algorithms, Partitioning

clustering K-Means Algorithm, K-Means Additional Issues, PAM Algorithm, Hierarchical

Clustering-Algorithm- Agglomerative Methods and Divisive Methods, Basic Agglomerative

Hierarchical Clustering Algorithm, Specific techniques, Key Issues in Hierarchical

Clustering, Strengths and weakness, Outlier Detection

Text Books: 1. Jiawei han, Micheline Kamber, "Data Mining: Concepts and systems", Morgan

Kaufmann Publishers.

2. Christopher D. Manning,Prabhakar Paghavan, Hinrich Schiitze, “Introduction to

Information Retrieval”, Cambridge University Press

3. Abraham Silberschatz, Henry Korth, S. Sudarshan, "Database system concepts", 5th

Edition, McGraw Hill International Edition

References: 1. Introduction to Data Mining, Vipin Kumar, Pang-Ning Tan , Pearson

2. Building the Data Warehouse, William H Inmon, Wiley Publication 4th Edition.

3. Introduction to Business Intelligence & Data Warehousing, IBM, PHI.

4. Business modeling and Data Mining Dorian Pyle, Elsevier Publication MK.

5. Database Systems, Thomas Connolly, Carolyn Begg, Pearson 4th Edition.

6. Ian H. Witten, Eibe Frank, and Mark A. Hall. Data Mining: Practical Machine

Learning Tools and Techniques (3rd ed.). Morgan Kaufmann, 2011. ISBN 978-0-12-

374856-0. Learning Outcomes Students will be able to :

1. Understand data processing and data

2. Understand different algorithms related to data mining

3. Able to design data warehouses

4. Apply acquired knowledge for understanding data and select suitable methods for data

analysis

65

ELECTIVE II

17BTCS 732: Software Defined Networking 3 1 0 4


Unit I :Centralized and Distributed Control and Data Planes 9 hrs

Introduction to Software-defined networking, Introduction to Centralized and Distributed

Control and Data Planes, What Do They Do? Distributed Control Planes, Centralized Control

Planes

Unit II :OpenFlow, SDN Controllers & Network Programmability 9 hrs Introduction, Hybrid Approaches, General Concepts of SDN Controllers, Layer 3 Centric,

Plexxi, Cisco OnePK, The Management Interface, The Application-Network Divide, Modern

Programmatic Interfaces, I2RS, Modern Orchestration

Unit III: Data Center Concepts and Constructs 9 hrs Introduction, The Multitenant Data Center, The Virtualized Multitenant Data Center:

Orchestration, Connecting a Tenant to the Internet/VPN, Virtual Machine Migration and

Elasticity, Data Center Interconnect (DCI), Fallacies of Data Center Distributed Computing,

Data Center Distributed Computing Pitfalls to Consider; SDN Solutions for the Data Center

Network, VLANs, EVPN, VxLan, NVGRE

Unit IV: Network Function Virtualization 9 hrs Introduction, Virtualization and Data Plane I/O, Services Engineered Path, Service Locations

and Chaining: Metadata, An Application Level Approach, Scale, NFV at ETSI, Non-ETSI

NFV Work: Middlebox Studies, Embrane/LineRate, Platform Virtualization

Unit V: Building an SDN Framework 9 hrs Introduction, Build Code First; Ask Questions Later, the Juniper SDN Framework, IETF SDN

Framework(s), Open Daylight Controller/Framework, Policy

Text Book

1. Thomas D. Nadeau and Ken Gray “SDN Software Defined Networks”, OReilly,

Sep.2013, ISBN:1449342302

REFERENCE:

1. Paul Goransson and Chuck Black, “Software Defined Networks: A Comprehensive

Approach”, Morgan Kaufmann, 2014

1. SiamakAzodolmolky, “Software Defined Networking with OpenFlow”, Packt

Publishing Limited, 2013

66

ELECTIVE – II

17BTCS733: ADVANCED COMPUTER GRAPHICS 3 1 0 4

CA: 40 Marks FE : 60 Marks No. of Total Lectures = 45 Hours

Course Objectives:

1. Provide solid grounding in three dimensional modelling mechanisms.

2. Introduce students to techniques in virtual reality, solid modelling and animation

3. To gain first-hand experience for accurate modelling, rendering, and simulation, and the

necessary data structures and algorithms.

4. To develop programming skills in 3D computer graphics.

5. Become acquainted with some advanced topics in computer graphics.

Course Outcomes:

At the end of this course students should be able to

1. Learn recent methods in rendering, modelling, and animation.

2. Understand the current models for the interaction of light and materials

3. Understand some areas of current computer graphics research.

4. Learn and use the production pipeline to create your own animation

UNIT – I 3D MODELING AND 3D OBJECT REPRESENTATION 9 Hours

Brief Review of 3D modelling and 3D object Representation 3D display methods, Polygon

surfaces, polygon meshes, Curved lines and surfaces, Quadratic surfaces, Spline representation

and specification B-Spline curves and surfaces.

UNIT - II SOLID MODELING 9 Hours

Representing solids, Primitive instancing, sweep representations, Boundary representations,

spatial-partitioning representations, constructive solid geometry, user interfaces for solid

modelling, comparison of representations.

UNIT - III RENDERING 9 Hours

Introduction, Basics of illumination and shading models, Transparency, Shadows and textures,

Ray tracing from the light source, cone, beam and pencil tracing. Point based rendering, Mesh

Simplification, Spatial partitioning, Solid Modelling,

UNIT – IV OpenGL 9 Hours

OpenGL over windows, SDK, Extensions, GLUT, GLU, OpenGL primitives, Programming

language: Blending, 3D Viewing (camera analogy), Lighting model, Culling, Fog, Texture

67

mapping. OpenGL over Linux, pBuffer rendering, Shadowing Techniques, a few examples and

demos of OpenGL programs

UNIT - V ANIMATION & VIRTUAL REALITY 9 Hours

Introduction, Devices for producing animation , Conventional and Computer assisted

animation, Animation languages, Basic rules of animation, Methods of controlling animation,

frame-by-frame animation techniques, real-time animation techniques , Programming aspects

in creating simple animation. VR Basics, Devices for Virtual Reality, Virtual Reality

Languages, Virtual Reality Design, Omegalib And Applications

Text Books

1. Donald Hearn & M. Pauline Baker, "Computer Graphics C version", 2nd Ed, Pearson

Education.

2. David F. Rogers, "Procedural Elements for Computer Graphics", 2nd Ed - Tata McGraw

Hill Edition.

3. "OpenGL Programming Guide: The Official Guide to Learning OpenGL", Mason Woo,

Jackie, Tom Davis, Version 2.1, 6th Edition, Pearson Education, ISBN 978-81-317-2184-1.

Reference Books

1. M.N. Sinha, A.D. Udai, "Computer Graphics",Tata McGraw Hill Edition.

2. Foley, Dam, Feiner, Hughes,"Computer Graphics Principles & Practice", 2nd Ed, Pearson

Education.

3. Hill, Kelly, "Computer Graphics using OpenGL", 3rd Ed, Eastern Economy Edition.

4. "Advanced Animation and Rendering Techniques: Theory and Practice", Alan H. Watt and

Mark Watt, Addison-Wesley, ACM Press, ISBN: 0201544121 Web-links

List of Practical

1. Implement an OpenGL program to draw different 2D shapes.

2. Implement an OpenGL program to draw 2 overlapped shapes and use alpha blending.

3. Implement an OpenGL program to draw 3D cube and apply transformations.

4. Implement an OpenGL program to draw 12 spheres and apply different light effects.

5. Implement an OpenGL program to draw scene and apply fog effect.

6. Implement an OpenGL program to draw 3D cube and apply different textures on different

faces.

7. Program describing certain animation techniques like Basic Key-framing , Rigid Body

Dynamics, Motion Capture (Can be implemented in the language / API of your choice)

8. Assignments based on virtual reality

9. Draw histogram of 256-color BMP image

68

ELECTIVE – III


17BTCS736 Blockchain Technology and Applications Elective

Contact hours per week CA FE Credits

L T D/P

03 01 0 40 60 04

Prerequisite:

Fundamentals of Information Security.

Basic concepts of Data Communication and Networking.

Basic concepts of Data Structures.

Course Objectives:

To understand blockchain system’s fundamental components, how they fit together

and examine a modular blockchain system in more detail.

To understand smart contracts and their technical capabilities, practical applications,

limitations and security constraints.

To understand both fundamental and implied differences between Ethereum and

Bitcoin protocol by covering historical, conceptual and architectural distinctions.

To understand smart contracts programming, examining emerging practices for

assuring the quality of decentralized applications, code patterns and security

considerations.

17BTCS736 : Blockchain Technology and Applications 3 1 0 4


COURSE CONTENT

Unit I - Cryptocurrency and Regulations [09]

What is Cryptography: Hash function, Digital Signature – ECDSA, Public key as identities,

What is Cryptocurrency, Advantages and disadvantages of cryptocurrency, Cryptocurrency

Exchange, Black Market and Global Economy, Merkle Patricia Tree.

Unit II - Introduction to Blockchain [09]

What is blockchain, How blockchain works, Blockchain Network, Mining Mechanism, Chain

Policy, Life of Blockchain application, Soft & Hard Fork, Private and Public blockchain.

Unit III – Bitcoin and Decentralization [09]

Introduction to Bitcoin, History, Distributed Ledger, Bitcoin protocols - Mining strategy and

rewards,Centralization vs. Decentralization, Distributed Consensus, Bitcoin Transactions, Bitcoin

69

Scripts, Namecoin. Stakeholders, Roots of Bitcoin.

Unit IV - Distributed Consensus [09]

Distributed Database, Two General Problem, Byzantine General problem and Fault Tolerance,

Hadoop Distributed File System, Distributed Hash Table, Nakamoto consensus, Proof of

Work, Proof of Stake, Proof of Burn, Difficulty Level, Sybil Attack.

Unit V - Blockchain Applications [09]

Internet of Things, Medical Record Management System, Domain Name Service and future of

Blockchain

-------------------------------------------------------------------------------------------------------------

Course Outcomes: (Students will be able to)

Understand the architectural components of a blockchain system.

Understand the architecture and the data structures of Bitcoin.

Understand bitcoin network and Design bitcoin scripts using scripting language and

have a deep knowledge of deployment.

Design the programs using some libraries to create nodes in bitcoin and initiate the

transaction.

Implements the smart contracts and deploy in decentralized applications.

-------------------------------------------------------------------------------------------------------------

References:

1. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven

Goldfeder, Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction,

Princeton University Press (July 19, 2016).

2. Shermin Voshmgir, Valentin Kalinov, Blockchain: A Beginners Guide, Blockchainhub

3. Melanie Swan, Blockchain: Blueprint for a New Economy, O’Reilly series.

4. DR. Gavin Wood, “ETHEREUM: A Secure Decentralized Transaction

Ledger,”Yellow paper.2014. Nicola Atzei, Massimo Bartoletti, and Tiziana Cimoli, A

survey of attacks on Ethereum smart contracts.

Other Resources:

1. Bitcoin Protocol Specifications (https://en.bitcoin.it/wiki/Protocol_specification)

2. Bitcoin transaction scripting (https://en.bitcoin.it/wiki/Script)

3. Ethereum documentation (http://www.ethdocs.org/en/latest)

4. Solidity documentation (https://solidity.readthedocs.io/en/develop)

https://en.bitcoin.it/wiki/Script

http://www.ethdocs.org/en/latest

70


17BTCS711 Programming Laboratory –V Core


CA FE Credits L T

D/P

0 0 4 40 60 2

Prerequisite: Number Theory, Computer Networks, Operating System, Database

Management

Course Objectives:

To understand concepts of Cloud Computing, Information Security and Internet of Things.

To study various platforms, techniques and methods for Cloud Computing, Information Security and Internet of Things.

To explore various applications based on Cloud Computing, Information Security and Internet of Things.

Lab Assignments

Cloud Computing (Any 5)

Assignment 1

Case Study ON Amazon EC2, Microsoft azure and Google App Engine.

Assignment 2

Installation and Configuration of Own Cloud and creating an admin account.

Assignment 3

Create, Manage and groups User accounts in own Cloud using Administrative Features.

Assignment 4

Study and implementation of infrastructure as Service using Open Stack.

Assignment 5

Implementation of Virtualization in Cloud Computing to Learn Virtualization Basics, Benefits

of Virtualization in Cloud using Open Source Operating System.

71

Assignment 6

Install and configure Google App Engine.

Assignment 7

Design an Assignment to retrieve, verify, and store user credentials using Firebase

Authentication, the Google App Engine standard environment, and Google Cloud Data store.

Information Security (Any 4)

Assignment 1

Implement the following Substitution and Transposition Ciphers:

a. Caesar Cipher b. Playfair Cipher c. Vigenere Cipher

Assignment 2

Implement the RSA Encryption Algorithms.

Assignment 3

Implement the Signature Scheme - Digital Signature Standard (DSS)

Assignment 4

Demonstrate Intrusion Detection System (ids) using any tool (snort or any other s/w)

Assignment 5

Setup a Honeypot and monitor the Honeypot on network.

Internet of Things (Any 3)

Assignment 1

Interface the analog/digital temperature sensor using arduino or raspberry pi to measure the

current temperature.

Assignment 2

Interface the analog/digital IR/PIR sensor using Arduino or Raspberry-Pi to detect the thermal

energy and design any one IoT enabled application based on IR/PIR Sensor.

Assignment 3

Implement IoT Temperature Monitor for green house using Arduino or Raspberry-Pi.

72

Assignment 4

Design any one functionality of smart home automation using smartphone.

Course Outcomes:

After successful completion of the course, the students would be able to:

To develop and use of any one type of cloud.

To explore trends of cloud computing.

To secure a message over insecure channel by various means.

To understand and develop classical and advanced Cryptography Techniques.

To Implement Data and Knowledge Management and use of Devices in IoT Technology

To Understand State of the Art - IoT Architecture.

------------------------------------------------------------------------------------------------------------

References

1. Dan C. Marinescu, "Cloud Computing - Theory and Practice", 1st Edition, Morgan Kaufmann is an imprint of Elsevier, 2013,

2. Dr. Kumar Saurabh, ”Cloud Computing”, Wiley Publication

3. William Stallings, “Cryptography and Network Security”, 6th Edition, Pearson Education.

4. AtulKahate,” Cryptography and Network Security”, 2nd Edition, Mc Graw Hill

5. Behrouz Forouzan, “Cryptography and Network Security”, Special Indian Edition, Tata Mc Graw Hill

6. Pethuru Raj and Anupama C. Raman, "The Internet of Things: Enabling Technologies, Platforms, and Use Cases", CRC Press

7. Adrian McEwen, Hakim Cassimally, “ Designing the Internet of Things”, Wiley Publication

8. Arshdeep Bahga and Vijay Madisetti, "Internet of Things: A Hands-on Approach", Universities Press

73


17BTCS712 Programming Laboratory - VI Core

Contact Hours per Week CA FE Credits

L T

D/P

0 0 2 40 60 1

Prerequisite: Database Systems

Course Objectives: ( 3 to 5 ): .1. To analyze data, choose relevant models and algorithms for respective applications. 2. To develop research interest towards advances in data mining.

17BTCS712 : Programming Laboratory VI 0 0 2 1


Data Mining

1. Solving exercises in Data Exploration. : Univariate Analysis, Bivariate Analysis.

2. Study of Data Mining tool – WEKA., Rapid Miner ( Any one )

3. Implementation of association mining rule –Apriori algorithm using Java and in Rapid Miner.

4. Implementation of any one classifier

5. Implementation of K means clustering algorithm using Java and in Rapid Miner

Blockchain Technology

Assignment Title

01 Blockchain construction: Generate the Genesis Block for the Orderer node and start

ordering service (solo node).

02 Blockchain construction: Generate the multiple blocks for the blockchain

construction and connect them in transactions.

03 Generate the configuration transaction block to create a new channel and initiate the

transactions in blockchain.

04 Sign the configuration block and checks the chain validity using Hash Key.

05 Hashcash implementation: Sign the configuration block and get the balance of nodes

and minors (rewards).

06 Smart Contract Construction and deployment.

Text Books:

1. Jiawei han, Micheline Kamber, "Data Mining: Concepts and systems", Morgan Kaufmann Publishers.

74

References:

Introduction to Data Mining, Vipin Kumar, Pang-Ning Tan , Pearson

Ian H. Witten, Eibe Frank, and Mark A. Hall. Data Mining: Practical Machine Learning Tools and

Techniques (3rd ed.). Morgan Kaufmann, 2011. ISBN 978-0-12-374856-0.

Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven Goldfeder, Bitcoin and

Cryptocurrency Technologies: A Comprehensive Introduction, Princeton University Press (July 19,

2016).

Wattenhofer, The Science of the Blockchain

Antonopoulos, Mastering Bitcoin: Unlocking Digital Cryptocurrencies

Satoshi Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System

DR. Gavin Wood, “ETHEREUM: A Secure Decentralized Transaction Ledger,”Yellow paper.2014.

Nicola Atzei, Massimo Bartoletti, and Tiziana Cimoli, A survey of attacks on Ethereum smart contracts

Learning Outcomes

Students will be able to :

1. Understand different techniques related to data mining

2. Apply acquired knowledge for understanding data and select suitable methods for data mining and

analysis

75

SEMESTER VIII

17 BTCS831 Data Analytics with Python 3 0 0 3

CA 40 FE: 60

Online NPTEL course

https://swayam.gov.in/nd1_noc20_cs46/preview

C O UR SE L A YO UT

Week 1 : Introduction to data analytics and Python fundamentals

Week 2 : Introduction to probability

Week 3 : Sampling and sampling distributions

Week 4 : Hypothesis testing

Week 5 : Two sample testing and introduction to ANOVA

Week 6 : Two way ANOVA and linear regression

Week 7 : Linear regression and multiple regression

Week 8 : Concepts of MLE and Logistic regression

Week 9 : ROC and Regression Analysis Model Building

Week 10: 2 Test and introduction to cluster analysis

Week 11 : Clustering analysis

Week 12 : Classification and Regression Trees (CART)


76

17 BTCS832 Introduction to Operation Research 3 0 0 3

CA 40 FE: 60

Online NPTEL course

https://swayam.gov.in/nd1_noc20_ma23/preview

COURSE LAYOUT

Unit 1: Linear Programming (LP): Terminology and formulations

Unit 2: Graphical and Algebraic solutions to LP

Unit 3: Simplex Algorithm: Algebraic form, Tabular form, Types of LPs, Matrix

method

Unit 4: Duality: Writing the dual of an LP, Primal-Dual relationships

Unit 5: Dual: Basic understanding, significance, interpretation, Dual Simplex

algorithm

Unit 6: Transportation Problem

Unit 7: Assignment Problem

Unit 8: Solving LPs using Solver, Sensitivity analysis

BO O KS AN D RE FE RE NC ES

"Operations Research:Principles and Applications" by G.Srinivasan, PHI Learning Private Limited.

"Operations Research: An Introduction" by Hamdy A. Taha, Pearson.

"Operations Research: Principles and Practice" by Ravindran, Phillips and Solberg, Wiley India

"Operations Research: Concepts and Cases" by Hillier and Liberman, McGraw-Hill

https://swayam.gov.in/nd1_noc20_ma23/preview

77

17 BTCS833 Entreprenuership Esssentials 3 0 0 3

CA 40 FE : 60

Online NPTEL course

https://swayam.gov.in/nd1_noc20_ge08/preview

C O URS E LA Y O U T

Week 1: Introduction

Dhirubhai Ambani & Sofia

Myths & Realities about entrepreneurship

entrepreneurial qualities

Why start-ups fail?

Week 2: Mission, vision, entrepreneurial qualities – I

Mission, vision, entrepreneurial qualities – II

Value proposition

Business Model canvas

Business model generation

Week 3: Competitive advantage

Lean start-up – 1

Lean start-up – 2

Team and early recruit

Legal forms of business

Week 4: Marketing management 1

Marketing management 2

Market research –I

Market research –II

Market research –Example

Week 5: Introduction to financial statements

Profit & Loss statement

Balance sheet

Cash flow

Example – 1

Example – 2

Cost-volume-profit & Bread-Even analysis

Capital budgeting

Week 6: Business plan-I

Business plan-II

Pitching

Go-to-market strategies

Does & Don'ts

Week 7: How to innovate

https://swayam.gov.in/nd1_noc20_ge08/preview

78

Design Thinking

Design-Driven Innovation, Systems thinking

Open innovation, TRIZ

How to start a start-up?

Week 8: Government incentives for entrepreneurship (1 lecture)

Incubation, acceleration

Funding new ventures – bootstrapping, crowd sourcing,

angel investors, VCs, debt financing (3), due diligence

Legal aspects of business (IPR, GST, Labour law)

Week 9: Cost, volume, profit and break-even analysis

Margin of safety and degree of operating leverage

Capital budgeting for comparing projects or opportunities

Product costing

Product pricing

Week 10: Funding new ventures – bootstrapping, crowd sourcing,

Angel investors, VCs, debt financing (3), and due diligence

Incubation and acceleration

Government incentives for entrepreneurship

Project cost and Financial Closure

Week 11: Dos & Donts in entrepreneurship

Growth Hacking

Growth Strategy

Legal aspects of business (IPR, GST, Labor law)

Negotiation skill

Week 12: Human Resource management in startups

Pivoting

Entrepreneurial cases

Risk assessment and analysis

Strategy management for entrepreneurial ventures

Factors driving success and failure of ventures

Concluding remarks

BO O KS A N D RE FE RE N CES

Effective Entrepreneurial Management: Strategy, Planning, RiskManagement, and

Organization - Robert D. Hisrich • VelandRamadani, Springer (2017)

Entrepreneurship- Theory, Process Practice –by Kuratko &Hodgetts, Thompson South-

Western Publication

Entrepreneurship –by Robert D. Hisrich (Edition-9)

79

17BTCS834 Machine Learning 3 0 0 3

CA : 40 FE : 60


C O URS E LA Y O U T

Week 0: Probability Theory, Linear Algebra, Convex Optimization - (Recap)

Week 1: Introduction: Statistical Decision Theory - Regression, Classification, Bias Variance

Week 2: Linear Regression, Multivariate Regression, Subset Selection, Shrinkage Methods,

Principal Component Regression, Partial Least squares

Week 3: Linear Classification, Logistic Regression, Linear Discriminant Analysis

Week 4: Perceptron, Support Vector Machines

Week 5: Neural Networks - Introduction, Early Models, Perceptron Learning,

Backpropagation, Initialization, Training & Validation, Parameter Estimation - MLE, MAP,

Bayesian Estimation

Week 6: Decision Trees, Regression Trees, Stopping Criterion & Pruning loss functions,

Categorical Attributes, Multiway Splits, Missing Values, Decision Trees -

Instability Evaluation Measures

Week 7: Bootstrapping & Cross Validation, Class Evaluation Measures, ROC curve,

MDL, Ensemble Methods - Bagging, Committee Machines and Stacking, Boosting

Week 8: Gradient Boosting, Random Forests, Multi-class Classification, Naive Bayes,

Bayesian Networks

Week 9: Undirected Graphical Models, HMM, Variable Elimination, Belief Propagation

Week 10: Partitional Clustering, Hierarchical Clustering, Birch Algorithm, CURE Algorithm,

Density-based Clustering

Week 11: Gaussian Mixture Models, Expectation Maximization

Week 12: Learning Theory, Introduction to Reinforcement Learning, Optional videos (RL

framework, TD learning, Solution Methods, Applications)

BO O KS AN D RE FE RE NC ES

1. The Elements of Statistical Learning, by Trevor Hastie, Robert Tibshirani, Jerome H.

Friedman (freely available online)

2. Pattern Recognition and Machine Learning, by Christopher Bishop (optional)


80

17BTCS835 Digital Forensics 3 0 0 3

CA: 40 FE: 60

Prerequisite: Overview of hardware and operating systems: structure of storage

media/devices; windows / Macintosh / Linux -- registry, boot process, file systems, file

metadata.

Unit 1: Introduction to Computer Forensics Computer crimes, evidence, extraction,

preservation, etc., Computer crime and Legal issues: Intellectual property, privacy issues,

Criminal Justice system for forensic, audit/investigative situations and digital crime scene,

investigative procedure/standards for extraction, preservation, and deposition of legal evidence

in a court of law.

Unit 2: Data recovery identifying hidden data, Encryption/Decryption, Steganography,

recovering deleted files. Digital evidence controls: uncovering attacks that evade detection by

Event Viewer, Task Manager, and other Windows GUI tools, data acquisition, disk imaging,

recovering swap files, temporary &cache files

Unit 3: Computer Forensic tools Encase, Helix, FTK, Autopsy, Sleuth kit Forensic Browser,

FIRE, Found stone Forensic ToolKit, WinHex, Linux dd and other open source tools.

Unit 4: Network Forensic Collecting and analyzing network-based evidence, reconstructing

web browsing, email activity, and windows registry changes, intrusion detection, tracking

offenders, etc.

Unit 5: Mobile Network Forensic Introduction, Mobile Network Technology, Investigations,

Collecting Evidence, Where to seek Digital Data for further Investigations, Interpretation of

Digital Evidence on Mobile Network.

Text Books: 1. Digital Forensics with Open Source Tools. Cory Altheide and Harlan Carvey,

ISBN: 978-1- 59749586-8, Elsevier publication, April 2011 2. Computer Forensics and Cyber

Crime: An Introduction (3rd Edition) by Marjie T. Britz, 2013

Reference Books:

1. Network Forensics: Tracking Hackers through Cyberspace, Sherri Davidoff, Jonathan

Ham Prentice Hall, 2012

2. Guide to Computer Forensics and Investigations (4th edition). By B. Nelson, A.

Phillips, F. Enfinger, C. Steuart. ISBN 0-619-21706-5, Thomson, 2009.

3. Computer Forensics: Hard Disk and Operating Systems, EC Council, September 17,

2009

4. Computer Forensics Investigation Procedures and response, EC-Council Press, 2010 5.

EnCase Computer Forensics. 2014

6. File System Forensic Analysis. By Brian Carrier. Addison-Wesley Professional,

March 27, 2005.

7. Computer Forensics: Investigating Data and Image Files (Ec-Council Press Series:

Computer Forensics) by EC-Council (Paperback - Sep 16, 2009)

81

8. Digital Evidence and Computer Crime, Third Edition: Forensic Science, Computers,

and the Internet by Eoghan Casey, 2011 The Art of Memory Forensics: Detecting

Malware and Threats in Windows, Linux, and Mac Memory. Michael Hale Ligh, Andrew

Case, Jamie Levy, AAron Walters, ISBN: 978-1-118-82509-9, July 2014

17BTCS836 Patent Law for Engineers and Scientists 3 0 0 3

CA : 40 FE : 60

https://swayam.gov.in/nd1_noc20_hs26/preview

COURSE LAYOUT

Week 1: Introduction to the Indian Patent System Patent Laws as Concepts;

Understanding the Patents Act, 1970; Understanding the Patents Rules, 2003;Preliminary

Sections; Preliminary Rules; What’s New in the Patents (Amendment) Rules, 2016; Easy

way to read the Patents Act and Rules

Week 2: Patentability of Inventions Statutory Exceptions to Patentability; Novelty and

Anticipation; Inventive Step; Capable of Industrial Application; Person Skilled in the Art

Week 3: Patent Specification Provisional and Complete Specifications; Structure of a

Patent Specification—Title, Abstract, Description, Claims, etc.; Reading a Patent

Specification—Fair basis, Enabling Disclosure, Definiteness, Priority; Introduction to Patent

Drafting.

Week 4: Patent Prosecution: Patent Applications Patent Application—Who Can Apply,

True and First Inventor, How to Make a Patent Application,What to include in a Patent

Application, Types of Patent Applications, Patents of Addition, Dating of Application;

Week 5: Patent Prosecution: Publication and Examination - I Publication of Application;

Request for Examination; Examination of Application—First Examination Report

Week 6: Patent Prosecution: Publication and Examination – II Expedited Examination of

Application; Search for Anticipation—Procedure, wthdrawal of Application; Consideration

of Report of Examiner

Week 7: Patent Prosecution: Powers of Controller Powers of Controller—Examination

Stage, Consideration of report by examiner, Refuse or Amend Applications, Division of

Applications, Dating of Application, Anticipation, Potential Infringement; Putting

Applications in Order; Amendments during Prosecution

Week 8: Patent Prosecution: Opposition Pre-grant opposition; Post-grant opposition;

Wrongful obtaining of invention; Mention of Inventor; Opposition in General.

Week 9: Patent Prosecution: Practice at the Patent Office- I Secrecy Provisions; Grant of

Patents; Rights Conferred by Grant; Rights of Co-Owners; Term of Patent; Restoration of

Lapsed Patents;

https://swayam.gov.in/nd1_noc20_hs26/preview

82

Week 10: Patent Office and Patent Prosecution, Surrender; Revocation—Grounds for

Revocation; Register of Patents, Patent Office and its Establishment; Patent Agents; Use and

Acquisition by Government; Penalties.

Week 11: Compulsory Licensing

Compulsory Licensing—Working of Patents, Grounds for Grant of Compulsory

License, Revocation; Patent Licensing;

Week 12: Patent Enforcement, International Arrangements and Other Miscellaneous

Provisions

Intellectual Property Appellate Board; Declaratory Suits, Infringement

Suits; International Application—Convention Application,

PCT Application, Application Designating India, Multiple Priorities; PCT

Timeline; Fees—Application, In Relation to Grant of Patents; Timelines, Application,

Examination, Publication etc.

BOOKS AND REFERENCES

Feroz Ali, The Law of Patents, LexisNexis

Ronald D. Slusky, Invention Analysis and Claiming – A Patent Lawyer’s Guide,

Second Edition, American Bar Association, 2012.

Feroz Ali, The Touchstone Effect – The Impact of Pre-grant Opposition on Patents,

LexisNexis, 2009.

83


17BTCS821 Project Phase - II Core


CA FE Credits L T

D/P

0 0 20 100 200 10

Prerequisite:

Course Objectives: ( 3 to 5 ): ·

1) To develop problem solving abilities using mathematics;

2) To apply algorithmic strategies while solving problems;

3) To develop software engineering documents and testing plans;

4) To encourage and expose students for participation in National/ International paper

presentation activities.

5) Exposure to Learning and knowledge access techniques using Conferences, Journal

papers and participation in research activities.

COURSE CONTENT

Project Phase - II

1. Project workstation selection, installations and setup along with report to the

guide.

2. Programming of the project, GUI (if any) as per 1st Term termwork

submission.

3. Test tool selection for various testing recommended by preferably external

guide and generate various testing result charts, graphs etc. including

reliability testing.

4. Review of design and necessary corrective actions taking into consideration

feedback report of Term I assessment, and other competitions/conferences

participated like IIT, Central Universities, University Conferences or

equivalent centers of excellence etc.

5. Students must submit and preferably publish at least one technical paper in

the conferences held by IITs, Central Universities or UoP Conference or

International Conferences in Europe or US.

6. Final term work submissions in the prescribed format given by the guides

84

consisting of a project report consisting of a preliminary report prepared in term-

I, detailed design (all necessary UML diagrams) document, User Interface

design, Laboratory assignments on test cases and test results generated by

selected project testing tool, conclusions, appendix (if necessary), glossary, tools

used and references at the end of Term-II after checking, removing/ avoiding

plagiarism. If the project is the replica of any other previous project or work from

other unrelated persons than the students team, such a project should be rejected

for the term work.

The Term II examination is conducted by a panel of examiners (preferably guide and

expert from Industry having at least 5 years subject experience (or senior teacher in the

subject in case of non- availability of industry expert). The project assessment shall be

done using Live Project Demonstration [in existing functional condition], using

necessary simulators (if required) and presentation by the students. The remarks of

Term I assessment and related corrective actions must be assessed during examining

the term-work.

For all those students doing an Internship in industry have to report the progress

periodically to the internal guide allocated for the group. The internship opportunity

received by the students will be confirmed by the Department, where the scope,

feasibility of the internship will be verified and only then approval will be provided for

internship.

It is mandatory for students to take approval for internship from the Department before

finalizing with the industry and giving their approval for working with them.

-----------------------------------------------------------------------------------------------------------

Course Outcomes:

1. To solve problems and demonstrate the results of the project.

2. To extend SRS, reliability testing reports, and other software engineering documents in

the project report;

3. To demonstrate presentation, communication and team-work skills.

4. To use state-of-art technology for design and development of software / hardware

components.

b. tech computer science engineering · b. tech computer science & engineering 2017-18 . 2 b....

Documents