FINALCSE
FINALCSE
TECHNOLOGY
B.E. COMPUTER SCIENCE AND ENGINEERING
CHOICE BASED CREDIT SYSTEM
CURRICULUM FOR SEMESTERS I TO VIII
SEMESTER I
S. PERIODS PER TOTAL
COURSE CATE- WEEK CONTACT
NO COURSE TITLE CREDITS
CODE GORY PERIODS
. L T P
1. Induction Programme - - - - - 0
THEORY
SEMESTER II
PERIODS PER TOTAL
S. COURSE COURSE TITLE CATE- WEEK CONTACT CREDITS
NO. CODE GORY PERIODS
L T P
THEORY
SEMESTER III
PERIODS PER TOTAL
S. COURSE COURSE TITLE CATE- WEEK CONTACT CREDITS
NO. CODE GORY PERIODS
L T P
THEORY
PRACTICALS
SEMESTER-IV
PERIODS PER TOTAL
S. COURSE COURSE TITLE CATE- WEEK CONTACT CREDITS
NO. CODE GORY PERIODS
L T P
THEORY
PRACTICALS
8. U24CSD10 Operating Systems Laboratory PCC
0 0 4 4 2
9. U24CSD12 Database management Systems PCC 0 0 4 4 2
Laboratory
10. U24CSD13 Algorithms Laboratory PCC 0 0 4 4 2
11. U24CSI02 Soft skills Laboratory EEC 0 0 2 0 2
TOTAL 21 2 15 33 27
SEMESTE
RV
PERIODS PER TOTAL
S. COURSE COURSE TITLE CATE- WEEK CONTACT CREDITS
NO. CODE GORY PERIODS
L T P
THEORY
SEMESTER-VI
PERIODS PER TOTAL
S. COURSE COURSE TITLE CATE- WEEK CONTACT CREDITS
NO. CODE GORY PERIODS
L T P
THEORY
SEMESTER-VII
PERIODS PER TOTAL
S. COURSE COURSE TITLE CATE- WEEK CONTACT CREDITS
NO. CODE GORY PERIODS
L T P
THEORY
SEMESTER-VIII
PERIODS PER TOTAL
S. COURSE COURSE TITLE CATE- WEEK CONTACT CREDITS
NO. CODE GORY PERIODS
L T P
THEORY
ELECTIVE – I
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. U24CSE01 Business Analytics PEC 2 0 2 4 3
2. U24CSE02 Big Data Analytics PEC 2 0 2 4 3
3. Computer Vision
U24CSE03 PEC 2 0 2 4 3
4. U24CSE04 Software Testing and PEC 2 0 2 4 3
Automation
5. U24CSE05 Cloud Computing PEC 3 0 0 3 3
6. U24CSE06 Ethical Hacking PEC 2 0 2 4 3
7. U24CSE07 Digital Marketing PEC 2 0 2 4 3
ELECTIVE – II
PERIODS TOTAL
S. COURSE CATE PER WEEK CONTACT
COURSE TITLE CREDITS
NO. CODE GORY PERIODS
L T P
1. U24CSE08 Web Technologies PEC 2 0 2 4 3
2. U24CSE09 Multimedia and Animation PEC 2 0 2 4 3
3. Visual Effects
U24CSE10 PEC 2 0 2 4 3
PERIODS TOTAL
S. COURSE CATE PER WEEK CONTACT
COURSE TITLE CREDITS
NO. CODE GORY PERIODS
L T P
1. U24CSE15 Ethics and AI PEC 2 0 2 4 3
2. U24CSE16 Optimization technologies PEC 2 0 2 4 3
OPEN ELECTIVES
LEARNING OUTCOMES :
At the end of the course, learners will be able
CO1:To use appropriate words in a professional context
CO2:To gain understanding of basic grammatic structures and use them in right context.
CO3:To read and infer the denotative and connotative meanings of technical texts CO4:To write
definitions, descriptions, narrations and essays on various topics
TEXT BOOKS :
1. English for Engineers & Technologists Orient Blackswan Private Ltd. Department of English, Anna
University, (2020 edition)
2. English for Science & Technology Cambridge University Press, 2021.
Authored by Dr. Veena Selvam, Dr. Sujatha Priyadarshini, Dr. Deepa Mary Francis, Dr. KN. Shoba,
and Dr. Lourdes Joevani, Department of English, Anna University.
REFERENCES:
1. Technical Communication – Principles And Practices By Meenakshi Raman & Sangeeta Sharma, Oxford
Univ. Press, 2016, New Delhi.
2. A Course Book On Technical English By Lakshminarayanan, Scitech Publications (India) Pvt. Ltd.
3. English For Technical Communication (With CD) By Aysha Viswamohan, Mcgraw Hill Education,
ISBN : 0070264244.
4. Effective Communication Skill, Kulbhusan Kumar, RS Salaria, Khanna Publishing House.
5. Learning to Communicate – Dr. V. Chellammal, Allied Publishing House, New Delhi,2003.
ASSESSMENT PATTERN
Two internal assessments and an end semester examination to test students’ reading and writing skills along
with their grammatical and lexical competence.
COURSE OBJECTIVES:
• To develop the use of matrix algebra techniques that are needed by engineers for practical
applications.
• To familiarize the students with differential calculus.
• To familiarize the student with functions of several variables. This is needed in many branches of
engineering.
• To make the students understand various techniques of integration.
• To acquaint the student with mathematical tools needed in evaluating multiple integrals and their
applications.
UNIT I MECHANICS 9
Multi-particle dynamics: Center of mass (CM) – CM of continuous bodies – motion of the CM –
kinetic energy of the system of particles. Rotation of rigid bodies: Rotational kinematics – rotational
kinetic energy and moment of inertia - theorems of M .I –moment of inertia of continuous bodies – M.I
of a diatomic molecule - torque – rotational dynamics of rigid bodies – conservation of angular
momentum– rotational energy state of a rigid diatomic molecule - gyroscope - torsional pendulum –
double pendulum –Introduction to nonlinear oscillations.
REFERENCES:
1. R.Wolfson. Essential University Physics. Volume 1 & 2. Pearson Education (Indian Edition), 2009.
2. Paul A. Tipler, Physic – Volume 1 & 2, CBS, (Indian Edition), 2004.
3. K.Thyagarajan and A.Ghatak. Lasers: Fundamentals and Applications, Laxmi Publications, (Indian
Edition), 2019.
4. D.Halliday, R.Resnick and J.Walker. Principles of Physics, Wiley (Indian Edition), 2015.
5. N.Garcia, A.Damask and S.Schwarz. Physics for Computer Science Students. Springer- Verlag,
2012.
UNIT II NANOCHEMISTRY 9
Basics: Distinction between molecules, nanomaterials and bulk materials; Size-dependent properties
(optical, electrical, mechanical and magnetic); Types of nanomaterials: Definition, properties and
uses of – nanoparticle, nanocluster, nanorod, nanowire and nanotube. Preparation of nanomaterials:
sol-gel, solvothermal, laser ablation, chemical vapour deposition, electrochemical deposition and
electro spinning. Applications of nanomaterials in medicine, agriculture, energy, electronics and
catalysis.
UNIT III PHASE RULE AND COMPOSITES 9
Phase rule: Introduction, definition of terms with examples. One component system - water system;
Reduced phase rule; Construction of a simple eutectic phase diagram - Thermal analysis; Two component
system: lead-silver system - Pattinson process.
Composites: Introduction: Definition & Need for composites; Constitution: Matrix materials
(Polymer matrix, metal matrix and ceramic matrix) and Reinforcement (fiber, particulates, flakes and
whiskers). Properties and applications of: Metal matrix composites (MMC), Ceramic matrix
composites and Polymer matrix composites. Hybrid composites - definition and examples.
TEXT BOOKS:
1. P. C. Jain and Monica Jain, “Engineering Chemistry”, 17th Edition, Dhanpat Rai Publishing
Company (P) Ltd, New Delhi, 2018.
2. Sivasankar B., “Engineering Chemistry”, Tata McGraw-Hill Publishing Company Ltd, New Delhi,
2008.
3. S.S. Dara, “A Text book of Engineering Chemistry”, S. Chand Publishing, 12th Edition, 2018
REFERENCES:
1. B. S. Murty, P. Shankar, Baldev Raj, B. B. Rath and James Murday, “Text book of nanoscience and
nanotechnology”, Universities Press-IIM Series in Metallurgy and Materials Science, 2018.
2. O.G. Palanna, “Engineering Chemistry” McGraw Hill Education (India) Private Limited, 2 nd Edition,
2017.
3. Friedrich Emich, “Engineering Chemistry”, Scientific International PVT, LTD, New Delhi, 2014.
4. ShikhaAgarwal, “Engineering Chemistry-Fundamentals and Applications”, Cambridge University
Press, Delhi, Second Edition, 2019.
5. O.V. Roussak and H.D. Gesser, Applied Chemistry-A Text Book for Engineers and Technologists,
Springer Science Business Media, New York, 2nd Edition, 2013.
TEXT BOOKS:
1. Allen B. Downey, “Think Python: How to Think like a Computer Scientist”, 2nd Edition, O’Reilly
Publishers, 2016.
2. Karl Beecher, “Computational Thinking: A Beginner's Guide to Problem Solving and
Programming”, 1st Edition, BCS Learning & Development Limited, 2017.
REFERENCES:
1. Paul Deitel and Harvey Deitel, “Python for Programmers”, Pearson Education, 1st Edition, 2021.
2. G Venkatesh and Madhavan Mukund, “Computational Thinking: A Primer for Programmers and
Data Scientists”, 1st Edition, Notion Press, 2021.
3. John V Guttag, "Introduction to Computation and Programming Using Python: With Applications to
Computational Modeling and Understanding Data‘‘, Third Edition, MIT Press , 2021
4. Eric Matthes, “Python Crash Course, A Hands - on Project Based Introduction to Programming”,
2nd Edition, No Starch Press, 2019.
5. https://www.python.org/
6. Martin C. Brown, “Python: The Complete Reference”, 4th Edition, Mc-Graw Hill, 2018.
REFERENCE BOOKS
1. ொவரலத த ொ று – ் ் ொ ் ் பண ் பத த ொ
டும ் – கக.கக.
ப ள ள்ள (தவள ய டு:
ொ ொ ்த ொ
டு பத த ொ
டந ல ்மற
் ் கல் வியியல் பண
கள் கழகம் ).
2. கண ன த் தமிழ் – முளனவர் இல. சுந்தரம் . (விகடன் பிரசுரம் ).
3. கீழடி – ் ் ொ ொ ் ் சங ்ககத த ொ
ல நகர நத த ொ
கர கம ்
( ொ ் ் ல யல ் F ளற தவள யீடு)
4. ொத ொ
ருளந – ் ொ ் ் ொகளர
் நத த ொ
கர கம ்
. ( ொ ் ் ல யல ்
F ளற தவள யீட )
5. Social Life of Tamils (Dr.K.K.Pillay) A joint publication of TNTB & ESC and RMRL – (in print)
6. Social Life of the Tamils - The Classical Period (Dr.S.Singaravelu) (Published by: International
Institute of Tamil Studies
7. Historical Heritage of the Tamils (Dr.S.V.Subatamanian, Dr.K.D. Thirunavukkarasu) (Published by:
International Institute of Tamil Studies).
8. The Contributions of the Tamils to Indian Culture (Dr.M.Valarmathi) (Published by: International
Institute of Tamil Studies.)
9. Keeladi - ‘Sangam City C ivilization on the banks of river Vaigai’ (Jointly Published by: Department
ofArchaeology & Tamil Nadu Text Book and Educational Services Corporation, Tamil
Nadu)
10. Studies in the History of India with Special Reference to Tamil Nadu (Dr.K.K.Pillay) (Publishedby:
The Author)
11. Porunai Civilization (Jointly Published by: Department of Archaeology & Tamil Nadu Text Bookand
Educational Services Corporation, Tamil Nadu)
12. Journey of Civilization Indus to Vaigai (R.Balakrishnan) (Published by: RMRL) – Reference Book.
1. Identification and solving of simple real life or scientific or technical problems, and developing flow
charts for the same. (Electricity Billing, Retail shop billing, Sin series, weight of a motorbike, Weight
of a steel bar, compute Electrical Current in Three Phase AC Circuit, etc.)
2. Python programming using simple statements and expressions (exchange the values of two variables,
circulate the values of n variables, distance between two points).
3. Scientific problems using Conditionals and Iterative loops. (Number series, Number Patterns, pyramid
pattern)
4. Implementing real-time/technical applications using Lists, Tuples. (Items present
in a
library/Components of a car/ Materials required for construction of a building –operations of list
& tuples)
5. Implementing real-time/technical applications using Sets, Dictionaries. (Language, components of an
automobile, Elements of a civil structure, etc.- operations of Sets & Dictionaries)
6. Implementing programs using Functions. (Factorial, largest number in a list, area of shape)
7. Implementing programs using Strings. (reverse, palindrome, character count, replacing characters)
8. Implementing programs using written modules and Python Standard Libraries (pandas, numpy.
Matplotlib, scipy)
9. Implementing real-time/technical applications using File handling. (copy from one file to another,
word count, longest word)
10. Implementing real-time/technical applications using Exception handling. (divide by zero error, voter’s
age validity, student mark range validation)
11. Exploring Pygame tool.
12. Developing a game activity using Pygame like bouncing ball, car race etc.
TOTAL: 60 PERIODS COURSE OUTCOMES:
On completion of the course, students will be able to:
CO1: Develop algorithmic solutions to simple computational problems
CO2: Develop and execute simple Python programs.
CO3: Implement programs in Python using conditionals and loops for solving problems..
CO4: Deploy functions to decompose a Python program.
CO5: Process compound data using Python data structures.
CO6: Utilize Python packages in developing software
applications.
TEXT BOOKS:
1. Allen B. Downey, “Think Python: How to Think like a Computer Scientist”, 2nd Edition, O’Reilly
Publishers, 2016.
2. Karl Beecher, “Computational Thinking: A Beginner's Guide to Problem Solving and
Programming”, 1st Edition, BCS Learning & Development Limited, 2017.
REFERENCES:
1. Paul Deitel and Harvey Deitel, “Python for Programmers”, Pearson Education, 1 st Edition, 2021.
2. G Venkatesh and Madhavan Mukund, “Computational Thinking: A Primer for Programmers and
Data Scientists”, 1st Edition, Notion Press, 2021.
3. John V Guttag, "Introduction to Computation and Programming Using Python: With Applications to
Computational Modeling and Understanding Data”, Third Edition, MIT Press, 2021
4. Eric Matthes, “Python Crash Course, A Hands - on Project Based Introduction to Programming”, 2 nd
Edition, No Starch Press, 2019.
5. https://www.python.org/ 6. Martin C. Brown, “Python: The Complete Reference”, 4th Edition,
McGraw Hill, 2018.
0042
PHYSICS LABORATORY : (Any Seven Experiments)
COURSE OBJECTIVES:
TOTAL : 30 PERIODS
COURSE OUTCOMES:
Upon completion of the course, the students should be able to
CO1:Understand the functioning of various physics laboratory equipment.
CO2:Use graphical models to analyze laboratory data.
CO3:Use mathematical models as a medium for quantitative reasoning and describing physical reality.
CO4:Access, process and analyze scientific information. CO5:Solve
problems individually and collaboratively.
1. Preparation of Na2CO3 as a primary standard and estimation of acidity of a water sample using
the primary standard
2. Determination of types and amount of alkalinity in a water sample.
- Split the first experiment into two
3. Determination of total, temporary & permanent hardness of water by EDTA method.
4. Determination of DO content of water sample by Winkler’s method.
5. Determination of chloride content of water sample by Argentometric method.
6. Estimation of copper content of the given solution by Iodometry.
7. Estimation of TDS of a water sample by gravimetry.
8. Determination of strength of given hydrochloric acid using pH meter.
9. Determination of strength of acids in a mixture of acids using conductivity meter.
10. Conductometric titration of barium chloride against sodium sulphate (precipitation titration)
11. Estimation of iron content of the given solution using potentiometer.
12. Estimation of sodium /potassium present in water using a flame photometer.
13. Preparation of nanoparticles (TiO2/ZnO/CuO) by Sol-Gel method.
14. Estimation of Nickel in steel
15. Proximate analysis of Coal TOTAL : 30 PERIODS
COURSE OUTCOMES :
CO1:To analyse the quality of water samples with respect to their acidity, alkalinity, hardness and DO.
CO2:To determine the amount of metal ions through volumetric and spectroscopic techniques CO3:To
analyse and determine the composition of alloys.
CO4:To learn simple method of synthesis of nanoparticles
CO5:To quantitatively analyse the impurities in solution by electroanalytical techniques
TEXT BOOKS :
1. J. Mendham, R. C. Denney, J.D. Barnes, M. Thomas and B. Sivasankar, Vogel’s Textbook of
Quantitative Chemical Analysis (2009).
UNIT V EXPRESSION
6 Listening – Listening to debates/ discussions; different viewpoints on an issue; and panel
discussions. Speaking –making predictions- talking about a given topic-giving opinions- understanding a
website-describing processes
TOTAL : 30 PERIODS LEARNING OUTCOMES:
At the end of the course, learners will be able
CO1:To listen to and comprehend general as well as complex academic information
CO2:To listen to and understand different points of view in a discussion
CO3:To speak fluently and accurately in formal and informal communicative contexts CO4:To
describe products and processes and explain their uses and purposes clearly and accurately CO5:To
express their opinions effectively in both formal and informal discussions
ASSESSMENT PATTERN
• One online / app based assessment to test listening /speaking
• End Semester ONLY listening and speaking will be conducted online.
• Proficiency certification is given on successful completion of listening and speaking internal test
and end semester exam.
COURSE OUTCOMES:
At the end of the course, learners will be able
CO1:To compare and contrast products and ideas in technical texts.
CO2:To identify and report cause and effects in events, industrial processes through technical texts CO3:To
analyse problems in order to arrive at feasible solutions and communicate them in the written format.
CO4:To present their ideas and opinions in a planned and logical manner CO5:To draft effective resumes
in the context of job search.
TEXT BOOKS :
1. English for Engineers & Technologists (2020 edition) Orient Blackswan Private Ltd. Department of
English, Anna University.
2. English for Science & Technology Cambridge University Press 2021.
3. Authored by Dr. Veena Selvam, Dr. Sujatha Priyadarshini, Dr. Deepa Mary Francis, Dr. KN. Shoba,
and Dr. Lourdes Joevani, Department of English, Anna University.
REFERENCES:
1. Raman. Meenakshi, Sharma. Sangeeta (2019). Professional English. Oxford university press. New
Delhi.
2. Improve Your Writing ed. V.N. Arora and Laxmi Chandra, Oxford Univ. Press, 2001, NewDelhi.
3. Learning to Communicate – Dr. V. Chellammal. Allied Publishers, New Delhi, 2003
4. Business Correspondence and Report Writing by Prof. R.C. Sharma & Krishna Mohan, Tata McGraw
Hill & Co. Ltd., 2001, New Delhi.
5. Developing Communication Skills by Krishna Mohan, Meera Bannerji- Macmillan India Ltd. 1990,
Delhi.
ASSESSMENT PATTERN
Two internal assessments and an end semester examination to test students’ reading and writing skills along
with their grammatical and lexical competence.
COURSE OUTCOMES:
Upon successful completion of the course, students will be able to:
CO1:Apply the concept of testing of hypothesis for small and large samples in real life problems.
CO2:Apply the basic concepts of classifications of design of experiments in the field of agriculture.
CO3:Appreciate the numerical techniques of interpolation in various intervals and apply the numerical
techniques of differentiation and integration for engineering problems.
CO4:Understandthe knowledge of various techniques and methods for solving first and second order
ordinary differential equations.
CO5:Solve the partial and ordinary differential equations with initial and boundary conditions by using
certain techniques with engineering applications.
TEXT BOOKS:
1. Grewal, B.S., and Grewal, J.S., "Numerical Methods in Engineering and Science", Khanna
Publishers, 10th Edition, New Delhi, 2015.
2. Johnson, R.A., Miller, I and Freund J., “Miller and Freund’s Probability and Statistics for
Engineers", Pearson Education, Asia, 8th Edition, 2015.
REFERENCES:
1. Burden, R.L and Faires, J.D, "Numerical Analysis”, 9th Edition, Cengage Learning, 2016.
2. Devore. J.L., "Probability and Statistics for Engineering and the Sciences”, Cengage Learning, New
Delhi, 8th Edition, 2014.
3. Gerald. C.F. and Wheatley. P.O. "Applied Numerical Analysis” Pearson Education, Asia, New
Delhi, 7th Edition, 2007.
4. Gupta S.C. and Kapoor V. K., “Fundamentals of Mathematical Statistics”, Sultan Chand & Sons,
New Delhi, 12th Edition, 2020.
5. Spiegel. M.R., Schiller. J. and Srinivasan. R.A., "Schaum’s Outlines on Probability and Statistics ",
Tata McGraw Hill Edition, 4th Edition, 2012.
6. Walpole. R.E., Myers. R.H., Myers. S.L. and Ye. K., “Probability and Statistics for Engineers and
Scientists", 9th Edition, Pearson Education, Asia, 2010.
U24SHB11 PHYSICS FOR INFORMATION SCIENCES L T P C
3 0 0 3
COURSE OBJECTIVES:
• To make the students understand the importance in studying electrical properties of materials. •
To enable the students to gain knowledge in semiconductor physics
• To instill knowledge on magnetic properties of materials.
• To establish a sound grasp of knowledge on different optical properties of materials, optical displays
and applications
• To inculcate an idea of significance of nano structures, quantum confinement, ensuing nano device
applications and quantum computing.
TEXT BOOKS:
1. Kothari DP and I.J Nagrath, “Basic Electrical and Electronics Engineering”, Second Edition, McGraw
Hill Education, 2020
2. S.K.Bhattacharya “Basic Electrical and Electronics Engineering”, Pearson Education, Second Edition,
2017.
3. Sedha R.S., “A textbook book of Applied Electronics”, S. Chand & Co., 2008
4. James A .Svoboda, Richard C. Dorf, “Dorf’s Introduction to Electric Circuits”, Wiley, 2018.
5. A.K. Sawhney, Puneet Sawhney ‘A Course in Electrical & Electronic Measurements & Instrumentation’,
Dhanpat Rai and Co, 2015.
REFERENCES:
1. Kothari DP and I.J Nagrath, “Basic Electrical Engineering”, Fourth Edition, McGraw Hill
2. Education, 2019.
3. Thomas L. Floyd, ‘Digital Fundamentals’, 11th Edition, Pearson Education, 2017.
4. Albert Malvino, David Bates, ‘Electronic Principles, McGraw Hill Education; 7th edition, 2017.
5. Mahmood Nahvi and Joseph A. Edminister, “Electric Circuits”, Schaum’ Outline Series, McGraw Hill,
2002.
6. H.S. Kalsi, ‘Electronic Instrumentation’, Tata McGraw-Hill, New Delhi, 2010
COURSE OUTCOMES:
On successful completion of this course, the student will be able to CO1:Use BIS conventions
and specifications for engineering drawing.
CO2:Construct the conic curves, involutes and cycloid.
CO3:Solve practical problems involving projection of lines.
CO4:Draw the orthographic, isometric and perspective projections of simple solids. CO5:Draw the
development of simple solids.
TEXT BOOK:
1. Bhatt N.D. and Panchal V.M., “Engineering Drawing”, Charotar Publishing House, 53rd Edition,
2019. 2. Natarajan K.V., “A Text Book of Engineering Graphics”, Dhanalakshmi Publishers, Chennai,
2018. 3. Parthasarathy, N. S. and Vela Murali, “Engineering Drawing”, Oxford University Press, 2015
REFERENCES:
1. Basant Agarwal and Agarwal C.M., “Engineering Drawing”, McGraw Hill, 2nd Edition, 2019.
2. Gopalakrishna K.R., “Engineering Drawing” (Vol. I&II combined), Subhas Publications, Bangalore,
27th Edition, 2017.
3. Luzzader, Warren.J. and Duff,John M., “Fundamentals of Engineering Drawing with an introduction
to Interactive Computer Graphics for Design and Production, Eastern Economy Edition, Prentice
Hall of India Pvt. Ltd, New Delhi, 2005.
4. Parthasarathy N. S. and Vela Murali, “Engineering Graphics”, Oxford University, Press, New Delhi,
2015.
5. Shah M.B., and Rana B.C., “Engineering Drawing”, Pearson Education India, 2nd Edition, 2009.
6. Venugopal K. and Prabhu Raja V., “Engineering Graphics", New Age International (P) Limited,
2008.
COURSE OBJECTIVES:
• To extend student’s logical and mathematical maturity and ability to deal with abstraction.
• To introduce most of the basic terminologies used in computer science courses and application of
ideas to solve practical problems.
• To understand the basic concepts of combinatorics and graph theory.
• To familiarize the applications of algebraic structures.
• To understand the concepts and significance of lattices and boolean algebra which are widely
used in computer science and engineering.
REFERENCES:
1. Grimaldi. R.P. "Discrete and Combinatorial Mathematics: An Applied Introduction", 5thEdition,
Pearson Education Asia, Delhi, 2013.
2. Koshy. T. "Discrete Mathematics with Applications", Elsevier Publications, 2006.
3. Lipschutz. S. and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata McGraw Hill
Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.
TEXT BOOKS
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson Education,
2005.
2. Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson Education, 2007
REFERENCES
1. Langsam, Augenstein and Tanenbaum, Data Structures Using C and C++, 2nd Edition, Pearson
Education, 2015.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to
Algorithms", Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
3. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and Algorithms, 1st edition,
Pearson, 2002.
4. Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson Education, 2006.
COURSE OUTCOMES:
On completion of this course, the students will be able to
CO1:Apply the concepts of classes and objects to solve simple problems
CO2:Develop programs using inheritance, packages and interfaces
CO3:Make use of exception handling mechanisms and multithreaded model to solve real world
problems
CO4:Build Java applications with I/O packages, string classes, Collections and generics concepts
CO5:Integrate the concepts of event handling and JavaFX components and controls for developing
GUI based applications
TEXT BOOKS:
1.Herbert Schildt, “Java: The Complete Reference”, 11 th Edition, McGraw Hill Education, New
Delhi, 2019
2.Herbert Schildt, “Introducing JavaFX 8 Programming”, 1 st Edition, McGraw Hill Education, New
Delhi, 2015
REFERENCE:
1.Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 11 th Edition, Prentice Hall, 2018.
U24CSD06 COMPUTER GRAPHICS AND MULTIMEDIA L T P C
3 0 0 3
COURSE OBJECTIVES
• To understand the basics of various inputs and output computer graphics hardware devices
• Exploration of fundamental concepts in 2D and 3D computer graphics
• To know 2D raster graphics techniques, 3D modeling, geometric transformations, 3D viewing
and rendering
• Exploration of fundamental concepts in multimedia systems, file handling, hypermedia
Course Contents
REFERENCE BOOKS
1. D. F. Rogers, J. A. Adams, “Mathematical Elements for Computer Graphics”, Second Edition,
McGraw Hill International Edition, 1990.
2. F. S. Hill Jr., “Computer Graphics using OpenGL”, Second Edition, Pearson Education, 2003
3. “The OpenGL Reference Manual - The Bluebook”, Version 1.4, Fourth Edition, Addison-
Wesley.
4. Judith Jeffcoate, “Multimedia in Practice: Technology and Applications”, PHI, 1998.
5. “The OpenGL Programming Guide - The Redbook”, Version 2, Fifth Edition, Addison-
Wesley.
UNIT I
Introduction: Role of Software Engineer - Software Components - Software Characteristics -
Software Crisis - Software Engineering Processes - Similarity and Differences from Conventional
Engineering Processes - Quality Attributes. Assessment: How Software Engineering Changes?
Software Development Life Cycle (SDLC) Models: Water Fall Model, Prototype Model, Spiral Model,
Evolutionary Development Models, Iterative Enhancement Models, Choosing a social relevant
problem, Summary Team Report.
UNIT II
Requirement Engineering Process: Elicitation - Analysis - Documentation - Review and
Management of User Needs - Feasibility Study - Information Modeling - Data Flow Diagrams -
Entity Relationship Diagrams - Designing the architecture. Assessment: Impact of Requirement
Engineering in their problem, Decision Tables, SRS Document, IEEE Standards for SRS,
Architectural design, component level design, user interface design, WebApp Design, Submission of
SRS Document for Team Project. UNIT III
Quality concepts - Review techniques - Software Quality Assurance (SQA): Verification and
Validation - SQA Plans - Software Quality Frameworks. Assessment: Framing SQA Plan, ISO
9000 Models, SEI-CMM Model and their relevance to project Management, other emerging models
like People CMM. UNIT IV
Testing Objectives - Unit Testing - Integration Testing - Acceptance Testing - Regression Testing -
Testing for Functionality and Testing for Performance - Top-Down and Bottom-Up Testing - Software
Testing Strategies - Strategies: Test Drivers and Test Stubs - Structural Testing (White Box Testing)
- Functional Testing (Black Box Testing) - Testing conventional applications - object oriented
applications - Web applications - Formal modeling and verification - Software configuration
management - Product metrics. Assessment: Team Analysis in Metrics Calculation. UNIT V
Project Management Concepts - Process and Project Metrics - Estimation for Software projects -
Project Scheduling - Risk Management - Maintenance and Re-engineering. Assessment: Preparation of
Risk mitigation plan.
COURSE OUTCOMES
Upon completion of the course, the students will be able to:
• Assess each module given the overall Software engineering practice
• Enhance the software project management skills
• Comprehend the systematic methodologies involved in SE
• Design and develop a software product in accordance with SE principles
• Design risk mitigation plans for software products.
TEXT BOOKS
1. R. S. Pressman, “Software Engineering: A Practitioners Approach”, Seventh Edition, McGraw
Hill, 2010.
2. Rajib Mall, “Fundamentals of Software Engineering”, Third Edition, PHI Publication, 2009.
3. Pankaj Jalote, “Software Project Management in Practice”, Pearson Education, New Delhi, 2002.
COURSE OBJECTIVES:
• To demonstrate array implementation of linear data structure algorithms.
• To implement the applications using Stack.
• To implement the applications using Linked list
• To implement Binary search tree and AVL tree algorithms.
• To implement the Heap algorithm.
• To implement Dijkstra’s algorithm.
• To implement Prim’s algorithm
• To implement Sorting, Searching and Hashing algorithms.
LIST OF EXERCISES
1.Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs
4. Implementation of Polynomial Manipulation using Linked list
5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Implementation of Dijkstra’s Algorithm
10. Implementation of Prim’s Algorithm
11. Implementation of Linear Search and Binary Search
12. Implementation of Insertion Sort and Selection Sort
13. Implementation of Merge Sort
14. Implementation of Open Addressing (Linear Probing and Quadratic Probing)
COURSE OUTCOMES:
At the end of this course, the students will be able to
CO1: Implement Linear data structure algorithms.
CO2: Implement applications using Stacks and Linked lists
CO3: Implement Binary Search tree and AVL tree operations.
CO4: Implement graph algorithms.
CO5: Analyze the various searching and sorting algorithms.
COURSE OBJECTIVES:
• To build software development skills using java programming for real-world applications.
• To understand and apply the concepts of classes, packages, interfaces, inheritance, exception
handling and file processing.
• To develop applications using generic programming and event handling
LIST OF EXPERIMENTS:
1. Solve problems by using sequential search, binary search, and quadratic sorting algorithms
(selection, insertion)
2. Develop stack and queue data structures using classes and objects.
3. Develop a java application with an Employee class with Emp_name, Emp_id, Address,
Mail_id, Mobile_no as members. Inherit the classes, Programmer, Assistant Professor,
Associate Professor and Professor from employee class. Add Basic Pay (BP) as the member of
all the inherited classes with 97% of BP as DA, 10 % of BP as HRA, 12% of BP as PF, 0.1%
of BP for staff club funds. Generate pay slips for the employees with their gross and net salary.
4. Write a Java Program to create an abstract class named Shape that contains two integers and
an empty method named printArea(). Provide three classes named Rectangle, Triangle and
Circle such that each one of the classes extends the class Shape. Each one of the classes
contains only the method printArea( ) that prints the area of the given shape.
5. Solve the above problem using an interface.
6. Implement exception handling and creation of user defined exceptions.
7. Write a java program that implements a multi-threaded application that has three threads. First
thread generates a random integer every 1 second and if the value is even, the second thread
computes the square of the number and prints. If the value is odd, the third thread will print the
value of the cube of the number.
8. Write a program to perform file operations.
9. Develop applications to demonstrate the features of generics classes
10. Develop applications using JavaFX controls, layouts and menus.
11. Develop a mini project for any application using Java concepts.
COURSE OUTCOMES:
On completion of this course, the students will be able to
CO1 : Design and develop java programs using object oriented programming concepts
CO2 : Develop simple applications using object oriented concepts such as package, exception
CO3: Implement multithreading, and generics concepts
CO4 : Create GUIs and event driven programming applications for real world problems CO5:
Implement and deploy web applications using Java
U24CSD08 MOBILE COMPUTING L T P C
3 0 0 3
Course Objectives
• To understand the fundamentals of mobile communication
• To understand the architecture of various Wireless Communication Networks
• To understand the significance of different layers in mobile system
UNIT III
Wireless LAN - Infrared vs. Radio transmission - Infrastructure - Adhoc Network - IEEE
802.11WLAN Standards - Architecture - Services - HIPERLAN - Bluetooth Architecture &
protocols.*
UNIT IV
Mobile Network Layer - Mobile IP - Dynamic Host Configuration Protocol - Mobile Transport Layer
- Traditional TCP - Indirect TCP - Snooping TCP - Mobile TCP - Fast retransmit/Fast recovery -
Transmission/Time-out freezing - Selective retransmission - Transaction Oriented TCP.*
UNIT V
WAP Model - Mobile Location based services - WAP Gateway - WAP protocols - WAP user agent
profile caching model - wireless bearers for WAP - WML - WML Scripts – WTA – iMode -
SyncML.*
*Programming assignments are mandatory.
COURSE OUTCOMES
Upon completion of the course, the students will be able to:
• Develop a strong grounding in the fundamentals of mobile Networks
• Define mobile technologies in terms of hardware, software, and communications
• Apply knowledge in MAC, Network, and Transport Layer protocols of Wireless Network
• Demonstrate the Adhoc networks concepts and its routing protocols
• Comprehend, design, and develop a lightweight network stack
TEXT BOOKS
1. Jochen Schiller, “Mobile Communication”, Second Edition, Pearson Education, 2008.
2. Theodore, S. Rappaport, “Wireless Communications, Principles, Practice”, Second Edition, PHI,
2002.
REFERENCE BOOKS
1. William Stallings, “Wireless Communications and Networks”, Second Edition, Pearson
Education, 2004.
2. C. Siva Ram Murthy, B. S. Manoj, “Adhoc Wireless Networks: Architectures and Protocols”,
Second Edition, Pearson Education, 2008.
3. Vijay. K. Garg, “Wireless Communication and Networking”, Morgan Kaufmann Publishers,
2007.
COURSE OBJECTIVES
• To provide knowledge about the services rendered by operating systems
• To explore the various scheduling policies and to provide solutions for critical section and deadlock
problems
• To provide a detailed discussion of the various memory management techniques
• To discuss the various file-system design and implementation issues
• To discuss how the protection domains, help to achieve security in a system
• To explore the design and implementation issues of Distributed OS
UNIT I INTRODUCTION
Need for Operating Systems - Computer Systems - OS Operations - Abstract view of OS - Virtualization -
Computing Environments - OS Services - OS Structures - System Calls - Building and Booting OS - Process -
Threads - Multithreading.
COURSE OUTCOMES
Upon completion of the course, the students will be able to:
• Comprehend the techniques used to implement the process manager
• Comprehend virtual memory abstractions in operating systems
• Design and develop file system and I/O system
• Apply various mechanisms in storage management
• Design and develop OS modules for Distributed Environment
TEXT BOOK
1. Silberschatz, Galvin, Gagne, “Operating System Concepts”, Tenth Edition, John Wiley and Sons, 2018.
REFERENCE BOOKS
1. William Stallings, “Operating Systems – Internals and Design Principles”, Eighth Edition, Pearson
Publications, 2014.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Fourth Edition, Pearson Publications, 2014.
3. Dhananjay M. Dhamdhere, “Operating Systems - A Concept-Based Approach”, Third Edition, Tata
McGraw Hill Education, 2012.
UNIT I INTRODUCTION
Purpose of Database System - Views of data - data models - database management system - three-schema
architecture of DBMS - components of DBMS - E/R Model - Conceptual data modelling - motivation - entities -
entity types - attributes - relationships - relationship types - E/R diagram notation - examples.
Relational Data Model - Concept of relations - schema-instance distinction - keys - referential integrity and
foreign keys - relational algebra operators - SQL - Introduction - data definition in SQL - table - key and foreign
key definitions - update behaviours - Querying in SQL - notion of aggregation - aggregation functions groupby
and having clauses - embedded SQL.
UNIT IV TRANSACTIONS
Transaction processing and Error recovery - concepts of transaction processing - ACID properties -
concurrency control - locking based protocols for CC - error recovery and logging - undo - redo - undo-redo
logging and recovery methods.
UNIT V IMPLEMENTATION TECHNIQUES Data Storage and Indexes - file organizations - primary and
secondary index structures - various index structures - hash-based dynamic hashing techniques - multi-level
indexes - B+ trees.
COURSE OUTCOMES
Upon completion of this course, the students will be able to:
• Install, configure, and interact with a relational database management system
• Master the basics of SQL and construct queries using SQL • Design and develop a large database with
optimal query processing
• Develop efficient storage scheme of saving and retrieving Records and Files
• Design the database with normalization techniques
Text Books
1. Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, Fifth Edition, Tata McGraw
Hill, 2006.
2. J. Date, A. Kannan, S. Swamynathan, “An Introduction to Database Systems”, Eighth Edition, Pearson
Education, 2006.
Reference Books
U24CSD13 ALGORITHMS L T P C
3 0 0 3
COURSE OBJECTIVES:
• To understand and apply the algorithm analysis techniques on searching and sorting
algorithms
• To critically analyze the efficiency of graph algorithms
• To understand different algorithm design techniques
• To solve programming problems using state space tree
• To understand the concepts behind NP Completeness, Approximation algorithms and
randomized algorithms.
UNIT I INTRODUCTION
Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties Best case,
Worst case and average case analysis – Recurrence relation: substitution method - Lower bounds –
searching: linear search, binary search and Interpolation Search, Pattern search: The naïve string-
matching algorithm - Rabin-Karp algorithm - Knuth-Morris-Pratt algorithm. Sorting: Insertion sort –
heap sort
PRACTICAL EXERCISES:
Searching and Sorting Algorithms
1. Implement Linear Search. Determine the time required to search for an element.
Repeat the experiment for different values of n, the number of elements in the list to be
searched and plot a graph of the time taken versus n.
2. Implement recursive Binary Search. Determine the time required to search an
element. Repeat the experiment for different values of n, the number of elements in the
list to be searched and plot a graph of the time taken versus n.
3. Given a text txt [0...n-1] and a pattern pat [0...m-1], write a function search (char pat [
], char txt [ ]) that prints all occurrences of pat [ ] in txt [ ]. You may assume that n > m.
4. Sort a given set of elements using the Insertion sort and Heap sort methods and
determine the time required to sort the elements. Repeat the experiment for different
values of n, the number of elements in the list to be sorted and plot a graph of the time
taken versus n.
Graph Algorithms
1. Develop a program to implement graph traversal using Breadth First Search
2. Develop a program to implement graph traversal using Depth First Search
3. From a given vertex in a weighted connected graph, develop a program to find the
shortest paths to other vertices using Dijkstra’s algorithm.
4. Find the minimum cost spanning tree of a given undirected graph using Prim’s
algorithm.
5. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.
6. Compute the transitive closure of a given directed graph using Warshall's algorithm.
TEXT BOOKS:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
"Introduction to Algorithms", 3rd Edition, Prentice Hall of India, 2009.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran “Computer Algorithms/C++”
Orient Blackswan, 2nd Edition, 2019.
REFERENCES:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd Edition,
Pearson Education, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "Data Structures and
Algorithms", Reprint Edition, Pearson Education, 2006.
3. S. Sridhar, “Design and Analysis of Algorithms”, Oxford university press, 2014.
PRACTICAL EXERCISES:
1. Implementation of Uninformed search algorithms (BFS, DFS)
2. Implementation of Informed search algorithms (A*, memory-bounded A*)
3. Implement naïve Bayes models
4. Implement Bayesian Networks
5. Build Regression models
6. Build decision trees and random forests
7. Build SVM models
8. Implement ensembling techniques
9. Implement clustering algorithms
10. Implement EM for Bayesian networks
11. Build simple NN models
12. Build deep learning NN models
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Use appropriate search algorithms for problem solving
CO2: Apply reasoning under uncertainty
CO3: Build supervised learning models
CO4: Build ensembling and unsupervised models
CO5: Build deep learning neural network models
TEXT BOOKS:
1. Stuart Russell and Peter Norvig, “Artificial Intelligence – A Modern Approach”,
Fourth Edition, Pearson Education, 2021.
2. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Fourth Edition,
2020.
REFERENCES:
1. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems”,
Pearson Education,2007
2. Kevin Night, Elaine Rich, and Nair B., “Artificial Intelligence”, McGraw Hill, 2008
3. Patrick H. Winston, "Artificial Intelligence", Third Edition, Pearson Education, 2006
4. Deepak Khemani, “Artificial Intelligence”, Tata McGraw Hill Education, 2013
(http://nptel.ac.in/)
5. Christopher M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2006.
6. Tom Mitchell, “Machine Learning”, McGraw Hill, 3rd Edition,1997.
7. Charu C. Aggarwal, “Data Classification Algorithms and Applications”, CRC Press,
2014
8. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar, “Foundations of Machine
Learning”, MIT Press, 2012.
9. Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press, 2016
COURSE OBJECTIVES:
• To understand foundations of computation including automata theory
• To construct models of regular expressions and languages.
• To design context free grammar and push down automata
• To understand Turing machines and their capability
• To understand Undecidability and NP class problems
UNIT V UNDECIDABILITY
Unsolvable Problems and Computable Functions –PCP-MPCP- Recursive and recursively
enumerable languages – Properties - Universal Turing machine -Tractable and Intractable problems -
P and NP completeness – Kruskal’s algorithm – Travelling Salesman Problem- 3-CNF SAT
problems.
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Construct automata theory using Finite Automata
CO2: Write regular expressions for any pattern
CO3: Design context free grammar and Pushdown Automata
CO4: Design Turing machine for computational functions
CO5: Differentiate between decidable and undecidable problems
TEXT BOOKS:
1. Hopcroft J.E., Motwani R. & Ullman J.D., "Introduction to Automata Theory,
Languages and Computations", 3rd Edition, Pearson Education, 2008.
2. John C Martin , "Introduction to Languages and the Theory of Computation", 4th
Edition, Tata McGraw Hill, 2011.
REFERENCES:
1. Harry R Lewis and Christos H Papadimitriou , "Elements of the Theory of
Computation", 2nd Edition, Prentice Hall of India, 2015.
2. Peter Linz, "An Introduction to Formal Language and Automata", 6th Edition, Jones &
Bartlett, 2016.
3. K.L.P.Mishra and N.Chandrasekaran, “Theory of Computer Science: Automata
Languages and Computation”, 3rd Edition, Prentice Hall of India, 2006.
COURSE OUTCOMES:
At th end of this course, the students will be able to:
CO1 : Define and implement UNIX Commands.
CO2 : Compare the performance of various CPU Scheduling Algorithms.
CO3 : Compare and contrast various Memory Allocation Methods.
CO4 :Define File Organization and File Allocation Strategies.
CO5 : Implement various Disk Scheduling Algorithms.
COURSE OBJECTIVES:
• To learn and implement important commands in SQL.
• To learn the usage of nested and joint queries.
• To understand functions, procedures and procedural extensions of databases.
• To understand design and implementation of typical database applications.
• To be familiar with the use of a front end tool for GUI based application development.
LIST OF EXPERIMENTS:
1. Create a database table, add constraints (primary key, unique, check, Not null), insert rows,
update and delete rows using SQL DDL and DML commands.
2. Create a set of tables, add foreign key constraints and incorporate referential integrity.
3. Query the database tables using different ‘where’ clause conditions and also implement
aggregate functions.
4. Query the database tables and explore sub queries and simple join operations.
5. Query the database tables and explore natural, equi and outer joins.
6. Write user defined functions and stored procedures in SQL.
7. Execute complex transactions and realize DCL and TCL commands.
8. Write SQL Triggers for insert, delete, and update operations in a database table.
9. Create View and index for database tables with a large number of records.
10. Create an XML database and validate it using XML schema.
11. Create Document, column and graph based data using NOSQL database tools.
12. Develop a simple GUI based database application and incorporate all the abovementioned
features
13. Case Study using any of the real life database applications from the following list
a) Inventory Management for a EMart Grocery Shop
b) Society Financial Management
c) Cop Friendly App – Eseva
d) Property Management – eMall
e) Star Small and Medium Banking and Finance
● Build Entity Model diagram. The diagram should align with the business and
functional goals stated in the application.
● Apply Normalization rules in designing the tables in scope.
● Prepared applicable views, triggers (for auditing purposes), functions for enabling
enterprise grade features.
● Build PL SQL / Stored Procedures for Complex Functionalities, ex EOD Batch
Processing for calculating the EMI for Gold Loan for each eligible Customer.
● Ability to showcase ACID Properties with sample queries with appropriate settings
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Create databases with different types of key constraints.
CO2: Construct simple and complex SQL queries using DML and DCL commands.
CO3: Use advanced features such as stored procedures and triggers and incorporate in GUI based
application development.
CO4: Create an XML database and validate with meta-data (XML schema). CO5:
Create and manipulate data using NOSQL database.
COURSE OBJECTIVES:
• To understand the concept of layering in networks.
• To know the functions of protocols of each layer of TCP/IP protocol suite.
• To visualize the end-to-end flow of information.
• To learn the functions of network layer and the various routing protocols.
• To familiarize the functions and protocols of the Transport layer.
PRACTICAL EXERCISES:
1.Learn to use commands like tcpdump, netstat, ifconfig, nslookup and traceroute. Capture ping and
trace route PDUs using a network protocol analyzer and examine
2. Write a HTTP web client program to download a web page using TCP sockets. 3.Applications
using TCP sockets like: a) Echo client and echo server b) Chat
4.Simulation of DNS using UDP sockets.
5. Use a tool like Wireshark to capture packets and examine the packets
6.Write a code simulating ARP /RARP protocols.
7.Study of Network simulator (NS) and Simulation of Congestion Control Algorithms using NS.
8. Study of TCP/UDP performance using Simulation tool.
9. Simulation of Distance Vector/ Link State Routing algorithm.
10.Simulation of an error correction code (like CRC).
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO 1: Explain the basic layers and its functions in computer networks.
CO 2: Understand the basics of how data flows from one node to another.
CO 3: Analyze routing algorithms.
CO 4: Describe protocols for various functions in the network.
CO 5: Analyze the working of various application layer protocols.
TEXT BOOKS
1. James F. Kurose, Keith W. Ross, Computer Networking, A Top-Down Approach Featuring the
Internet, Eighth Edition, Pearson Education, 2021.
2.Behrouz A. Forouzan, Data Communications and Networking with TCP/IP Protocol
Suite, Sixth Edition TMH, 2022.
REFERENCES
1.Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth
Edition, Morgan Kaufmann Publishers Inc., 2012.
2.William Stallings, Data and Computer Communications, Tenth Edition, Pearson,
Education, 2013.
3.Nader F. Mir, Computer and Communication Networks, Second Edition, Prentice Hall,
2014.
4.Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source
COURSE OBJECTIVES:
• To learn the various phases of compiler.
• To learn the various parsing techniques.
• To understand intermediate code generation and run-time environment.
• To learn to implement the front-end of the compiler.
• To learn to implement code generator.
• To learn to implement code optimization.
LIST OF EXPERIMENTS:
1. Using the LEX tool, Develop a lexical analyzer to recognize a few patterns in C. (Ex.
identifiers, constants, comments, operators etc.). Create a symbol table, while
recognizing identifiers.
2. Implement a Lexical Analyzer using LEX Tool
3. Generate YACC specification for a few syntactic categories.
4. Generate three address code for a simple program using LEX and YACC.
5. Implement type checking using Lex and Yacc.
6. Implement simple code optimization techniques (Constant folding, Strength reduction
and Algebraic transformation)
7. Implement back-end of the compiler for which the three address code is given as input
and the 8086 assembly language code is produced as output.
COURSE OUTCOMES:
On Completion of the course, the students should be able to:
CO1:Understand the techniques in different phases of a compiler.
CO2:Design a lexical analyser for a sample language and learn to use the LEX tool.
CO3:Apply different parsing algorithms to develop a parser and learn to use YACC tool
CO4:Understand semantics rules (SDT), intermediate code generation and run-time environment.
CO5:Implement code generation and apply code optimization techniques.
TEXT BOOK:
1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, “Compilers: Principles,
Techniques and Tools”, Second Edition, Pearson Education, 2009.
REFERENCES
1. Randy Allen, Ken Kennedy, Optimizing Compilers for Modern Architectures: A
Dependence based Approach, Morgan Kaufmann Publishers, 2002.
2. Steven S. Muchnick, Advanced Compiler Design and Implementation‖, Morgan
Kaufmann Publishers - Elsevier Science, India, Indian Reprint 2003.
3. Keith D Cooper and Linda Torczon, Engineering a Compiler‖, Morgan Kaufmann
Publishers Elsevier Science, 2004.
4. V. Raghavan, Principles of Compiler Design‖, Tata McGraw Hill Education
Publishers, 2010.
5. Allen I. Holub, Compiler Design in C‖, Prentice-Hall Software Series, 1993.
U24CSD17 VIRTUALIZATION L T P C
3 0 0 3
COURSE OBJECTIVES:
• To Learn the basics and types of Virtualization
• To understand the Hypervisors and its types
• To Explore the Virtualization Solutions
• To Experiment the virtualization platforms
PRACTICAL EXERCISES:
1.Create type 2 virtualization in VMWARE or any equivalent Open Source Tool. Allocate memory
and storage space as per requirement. Install Guest OS on that VMWARE.
2.
a.Shrink and extend virtual disk
b. Create, Manage, Configure and schedule snapshots
c. Create Spanned, Mirrored and Striped volume
d. Create RAID 5 volume
3.
a.Desktop Virtualization using VNC
b.Desktop Virtualization using Chrome Remote Desktop
COURSE OUTCOMES:
CO1: Analyse the virtualization concepts and Hypervisor
CO2: Apply the Virtualization for real-world applications
CO3: Install & Configure the different VM platforms
CO4: Experiment with the VM with various software
TEXT BOOKS
1. Cloud computing a practical approach - Anthony T.Velte , Toby J. Velte Robert
Elsenpeter, TATA McGraw- Hill , New Delhi – 2010
2. Cloud Computing (Principles and Paradigms), Edited by Rajkumar Buyya, James
Broberg, Andrzej Goscinski, John Wiley & Sons, Inc. 2011
3. David Marshall, Wade A. Reynolds, Advanced Server Virtualization: VMware and
Microsoft Platform in the Virtual Data Center, Auerbach
4. Chris Wolf, Erick M. Halter, “Virtualization: From the Desktop to the Enterprise”,
APress, 2005.
5. James E. Smith, Ravi Nair, “Virtual Machines: Versatile Platforms for Systems and
Processes”, Elsevier/Morgan Kaufmann, 2005.
6. David Marshall, Wade A. Reynolds, “Advanced Server Virtualization: VMware and
Microsoft Platform in the Virtual Data Center”, Auerbach Publications, 2006.
U24CSD18 DATA WAREHOUSING L T P C 3 0 0 3
COURSE OBJECTIVES:
• To know the details of data warehouse Architecture
• To understand the OLAP Technology
• To understand the partitioning strategy
• To differentiate various schema
• To understand the roles of process manager & system manager
PRACTICAL EXERCISES:
1. Data exploration and integration with WEKA
2. Apply weka tool for data validation
3. Plan the architecture for real time application
4. Write the query for schema definition
5. Design data ware house for real time applications
6. Analyse the dimensional Modeling
7. Case study using OLAP
8. Case study using OTLP
9. Implementation of warehouse testing.
COURSE OUTCOMES:
At the end of the course the students should be able to
CO1: Design data warehouse architecture for various Problems
CO2: Apply the OLAP Technology
CO3: Analyse the partitioning strategy
CO4: Critically analyze the differentiation of various schema for given problem
CO5: Frame roles of process manager & system manager
TEXT BOOKS
1. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”, Tata McGraw
– Hill Edition, Thirteenth Reprint 2008.
2. Ralph Kimball, “The Data Warehouse Toolkit: The Complete Guide to Dimensional
Modeling”, Third edition, 2013.
REFERENCES
1. Paul Raj Ponniah, “Data warehousing fundamentals for IT Professionals”, 2012.
2. K.P. Soman, ShyamDiwakar and V. Ajay “Insight into Data mining Theory and Practice”, Easter
Economy Edition, Prentice Hall of India, 2006.
COURSE OBJECTIVES:
• To learn the internal architecture and programming of an embedded processor.
• To introduce interfacing I/O devices to the processor.
• To introduce the evolution of the Internet of Things (IoT).
• To build a small low-cost embedded and IoT system using Arduino/Raspberry Pi/ open platform.
• To apply the concept of Internet of Things in real world scenario.
PRACTICAL EXERCISES:
1. Write 8051 Assembly Language experiments using simulator.
2. Test data transfer between registers and memory.
3. Perform ALU operations.
4. Write Basic and arithmetic Programs Using Embedded C.
5. Introduction to Arduino platform and programming
6. Explore different communication methods with IoT devices (Zigbee, GSM, Bluetooth)
7. Introduction to Raspberry PI platform and python programming
8. Interfacing sensors with Raspberry PI
9. Communicate between Arduino and Raspberry PI using any wireless medium
10. Setup a cloud platform to log the data
11. Log Data using Raspberry PI and upload to the cloud platform
12. Design an IOT based system
COURSE OUTCOMES:
CO1: Explain the architecture of embedded processors.
CO2: Write embedded C programs.
CO3: Design simple embedded applications.
CO4: Compare the communication models in IOT
CO5: Design IoT applications using Arduino/Raspberry Pi /open platform.
TEXTBOOKS
1. Muhammed Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay, “The 8051 Microcontroller
and Embedded Systems”, Pearson Education, Second Edition, 2014
2. Robert Barton, Patrick Grossetete, David Hanes, Jerome Henry, Gonzalo Salgueiro, “IoT
Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of Things”,
CISCO Press, 2017.
REFERENCES
1. Michael J. Pont, “Embedded C”, Pearson Education, 2007.
2. Wayne Wolf, “Computers as Components: Principles of Embedded Computer System Design”,
Elsevier, 2006. 3. Andrew N Sloss, D. Symes, C. Wright, “Arm System Developer's Guide”,
Morgan Kauffman/ Elsevier, 2006.
4. Arshdeep Bahga, Vijay Madisetti, “Internet of Things – A hands-on approach”, Universities Press,
2015.
U24CSD21 DEVOPS L T P C
3 0 0 3
COURSE OBJECTIVES:
• To introduce DevOps terminology, definition & concepts
• To understand the different Version control tools like Git, Mercurial
• To understand the concepts of Continuous Integration/ Continuous Testing/ Continuous
Deployment)
• To understand Configuration management using Ansible
• Illustrate the benefits and drive the adoption of cloud-based Devops tools to solve real world
problems
UNIT I INTRODUCTION TO DEVOPS
Devops Essentials - Introduction To AWS, GCP, Azure - Version control systems: Git and Github.
UNIT II COMPILE AND BUILD USING MAVEN & GRADLE
Introduction, Installation of Maven, POM files, Maven Build lifecycle, Build phases(compile build,
test, package) Maven Profiles, Maven repositories(local, central, global),Maven plugins, Maven
create and build Artificats, Dependency management, Installation of Gradle, Understand build using
Gradle
UNIT III CONTINUOUS INTEGRATION USING JENKINS
Install & Configure Jenkins, Jenkins Architecture Overview, Creating a Jenkins Job, Configuring a
Jenkins job, Introduction to Plugins, Adding Plugins to Jenkins, Commonly used plugins (Git Plugin,
Parameter Plugin, HTML Publisher, Copy Artifact and Extended choice parameters). Configuring
Jenkins to work with java, Git and Maven, Creating a Jenkins Build and Jenkins workspace.
UNIT IV CONFIGURATION MANAGEMENT USING ANSIBLE
Ansible Introduction, Installation, Ansible master/slave configuration, YAML basics, Ansible
modules, Ansible Inventory files, Ansible playbooks, Ansible Roles, adhoc commands in ansible
UNIT V BUILDING DEVOPS PIPELINES USING AZURE
Create Github Account, Create Repository, Create Azure Organization, Create a new pipeline, Build a
sample code, Modify azure-pipelines.yaml file
COURSE OUTCOMES:
CO1: Understand different actions performed through Version control tools like Git.
CO2: Perform Continuous Integration and Continuous Testing and Continuous Deployment using
Jenkins by building and automating test cases using Maven & Gradle.
CO3: Ability to Perform Automated Continuous Deployment
CO4: Ability to do configuration management using Ansible
CO5: Understand to leverage Cloud-based DevOps tools using Azure DevOps
PRACTICAL EXERCISES:
1. Create Maven Build pipeline in Azure
2. Run regression tests using Maven Build pipeline in Azure
3. Install Jenkins in Cloud
4. Create CI pipeline using Jenkins
5. Create a CD pipeline in Jenkins and deploy in Cloud
6. Create an Ansible playbook for a simple web application infrastructure
7. Build a simple application using Gradle
8. Install Ansible and configure ansible roles and to write playbooks
TEXT BOOKS
1. Roberto Vormittag, “A Practical Guide to Git and GitHub for Windows Users: From Beginner to
Expert in Easy Step-By-Step Exercises”, Second Edition, Kindle Edition, 2016.
2. Jason Cannon, “Linux for Beginners: An Introduction to the Linux Operating System and
Command Line”, Kindle Edition, 2014
REFERENCES
1. Hands-On Azure Devops: Cicd Implementation For Mobile, Hybrid, And Web Applications Using
Azure Devops And Microsoft Azure: CICD Implementation for ... DevOps and Microsoft Azure
(English Edition) Paperback – 1 January 2020
2. by Mitesh Soni
3. Jeff Geerling, “Ansible for DevOps: Server and configuration management for humans”, First
Edition, 2015.
4. David Johnson, “Ansible for DevOps: Everything You Need to Know to Use Ansible for DevOps”,
Second Edition, 2016. 5. Mariot Tsitoara, “Ansible
6. Beginning Git and GitHub: A Comprehensive Guide to Version Control, Project Management, and
Teamwork for the New Developer”, Second Edition, 2019.
6. https://www.jenkins.io/user-handbook.pdf
7. https://maven.apache.org/guides/getting-started/
UNIT I INTRODUCTION
Neural Networks-Application Scope of Neural Networks-Artificial Neural Network: An Introduction
Evolution of Neural Networks-Basic Models of Artificial Neural Network- Important Terminologies
of ANNs-Supervised Learning Network.
UNIT II ASSOCIATIVE MEMORY AND UNSUPERVISED LEARNING
NETWORKS
Training Algorithms for Pattern Association-Autoassociative Memory Network-Heteroassociative
Memory Network-Bidirectional Associative Memory (BAM)-Hopfield Networks-Iterative
Autoassociative Memory Networks-Temporal Associative Memory Network-Fixed Weight
Competitive Nets-Kohonen Self-Organizing Feature Maps-Learning Vector Quantization-Counter
propagation Networks-Adaptive Resonance Theory Network.
LAB EXPERIMENTS:
1. Implement simple vector addition in TensorFlow.
2. Implement a regression model in Keras.
3. Implement a perceptron in TensorFlow/Keras Environment.
4. Implement a Feed-Forward Network in TensorFlow/Keras.
5. Implement an Image Classifier using CNN in TensorFlow/Keras.
6. Improve the Deep learning model by fine tuning hyper parameters.
7. Implement a Transfer Learning concept in Image Classification.
8. Using a pre trained model on Keras for Transfer Learning
9. Perform Sentiment Analysis using RNN
10. Implement an LSTM based Autoencoder in TensorFlow/Keras. 11. Image generation using
GAN Additional Experiments:
12. Train a Deep learning model to classify a given image using pre trained model
13. Recommendation system from sales data using Deep Learning
14. Implement Object Detection using CNN
15. Implement any simple Reinforcement Algorithm for an NLP problem
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Apply Convolution Neural Network for image processing.
CO2: Understand the basics of associative memory and unsupervised learning networks. CO3:
Apply CNN and its variants for suitable applications.
CO4: Analyze the key computations underlying deep learning and use them to build and train deep
neural networks for various tasks.
CO5: Apply autoencoders and generative models for suitable applications.
TEXT BOOKS:
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press, 2016.
2. Francois Chollet, “Deep Learning with Python”, Second Edition, Manning Publications, 2021.
REFERENCES:
1. Aurélien Géron, “Hands-On Machine Learning with Scikit-Learn and TensorFlow”, Oreilly, 2018.
2. Josh Patterson, Adam Gibson, “Deep Learning: A Practitioner’s Approach”, O’Reilly Media, 2017.
110
3. Charu C. Aggarwal, “Neural Networks and Deep Learning: A Textbook”, Springer International
Publishing, 1st Edition, 2018.
4. Learn Keras for Deep Neural Networks, Jojo Moolayil, Apress,2018
5. Deep Learning Projects Using TensorFlow 2, Vinita Silaparasetty, Apress, 2020
6. Deep Learning with Python, FRANÇOIS CHOLLET, MANNING SHELTER ISLAND,2017.
7. S Rajasekaran, G A Vijayalakshmi Pai, “Neural Networks, FuzzyLogic and Genetic Algorithm,
Synthesis and Applications”, PHI Learning, 2017.
8. Pro Deep Learning with TensorFlow, Santanu Pattanayak, Apress,2017
9. James A Freeman, David M S Kapura, “Neural Networks Algorithms, Applications, and
Programming Techniques”, Addison Wesley, 2003.
COURSE OBJECTIVES:
• To realize the significance of value education and explore the happiness and prosperity
• To practice the harmony in the human being, family, society and nature
• To learn harmony in existence in their profession and lead an ethical life
COURSE OUTCOMES:
Upon completion of the course, the student will be able to
CO1: Identify the implication of value education and apply in the life and profession (Understand)
CO2: Distinguish between the self and the body, understand the meaning of harmony in the self
andthe co-existence of self and body (Understand)
CO3: Realize the value of harmonious relationship based on trust and respect in their life and
Profession (Understand)
CO4: Explore the role of a human being in ensuring harmony in society and nature (Understand)
CO5: Distinguish between ethical and unethical practices, and start working out the strategy to
actualize a harmonious environment wherever they work (Understand)
UNIT I Introduction to Value Education
Understanding Value Education, Self-exploration as a means of Value Education, Continuous
Happiness and Prosperity, Basic Human Aspirations, Right Understanding, Relationship and physical
Facilities, Method to Fulfil the Basic Human Aspirations.
TEXT BOOKS:
1. Smriti Srivastava, "Professional Ethics and Human Values", 1" Edition, Scitech Publications,2018.
2. BS Raghavan, "Human Values and Professional Ethics", 3" Edition, S. Chand Limited, 2009.
REFERENCES:
1. R.R.Gaur, R.Sangat. G.P. Bagaria, "A Foundation Course in Human Values and Professional
Ethics", 1st Edition, Excel Books, 2010.
2. Banerjee B P, "Foundations of Ethics and Management", 1st Edition, Excel Books, 2005.
U24CSI10 PROJECT WORK / INTERNSHIP
COURSE OBJECTIVES:
• To train the students
• For gaining domain knowledge, and technical skills to solve potential business /
research problems
• Gather requirements and Design suitable software solutions and evaluate
• alternatives
• To work in small teams and understand the processes and practices in the ‘industry.
• Implement, Test and deploy solutions for target platforms
• Preparing project reports and presentation
The students shall individually / or as group work on business/research domains and related
problems approved by the Department / organization that offered the internship / project.
The student can select any topic which is relevant to his/her specialization of the
programme. The student should continue the work on the selected topic as per the
formulated methodology. At the end of the semester, after completing the work to the
satisfaction of the supervisor and review committee, a detailed report which contains clear
definition of the identified problem, detailed literature review related to the area of work
and methodology for carrying out the work, results and discussion, conclusion and
references should be prepared as per the format prescribed by the University and
submitted to the Head of the department. The students will be evaluated based on the
report and viva-voce examination by a panel of examiners as per the Regulations.