CSE 4th Year Syllabus
CSE 4th Year Syllabus
CSE 4th Year Syllabus
Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Page 1 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Page 2 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Text Books:
1. Fundamentals of Software Engineering, Rajib Mall, PHI, 2014.
2. Software Engineering, A Practitioner‟s Approach, Roger S. Pressman, TMG Hill.
Page 3 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Reference Books:
1. Software Engineering, I. Somerville, 9th Ed. , Pearson Education.
Module 1 12Hrs
Introduction, Intelligent Agents: Agents & Environments, Concept of Rationality, Nature &
Structure of Agents, Problem Spaces, and Search: Defining the Problem as a State Space Search,
Production Systems, Problem Characteristics, Production System Characteristics, and Issues in the
Design of Search Programs. Heuristic Search Techniques: Generate-and-Test, Hill Climbing, Best-
first Search, Problem Reduction, Constraint Satisfaction, Means-ends Analysis
Module 2 10Hrs
Knowledge Representation: Representations and Mappings, Approaches to Knowledge
Representation, Uncertain Knowledge and Reasoning: Probabilistic Reasoning Using Predicate
Logic: Representing Simple Facts in Logic, Representing Instance and ISA Relationships,
Computable Functions and Predicates, Resolution, Natural Deduction.
Using Rules: Procedural Versus Declarative Knowledge, Logic Programming, Forward Versus
Backward Reasoning, Matching, Control Knowledge.
Module 3 10Hrs
Game Playing: The Mini max Search Procedure, Adding Alpha-beta Cut offs, Iterative Deepening.
Planning: The Blocks World, Components of a Planning System, Goal Stack Planning, Nonlinear
Planning Using Constraint Posting, Hierarchical Planning Other Planning Techniques.
Understanding: What is Understanding, What Makes Understanding Hard?, Understanding as
Constraint Satisfaction. Natural Language Processing: Introduction, Syntactic Processing,
Semantic Analysis, Discourse and Pragmatic Processing, Statistical Natural Language Processing,
Spell Checking.
Module 4 8Hrs
Learning: Rote Learning, Learning by Taking Advice, Learning in Problem-solving, Learning from
Examples: Induction, Explanation-based Learning, Discovery, Analogy, Formal Learning Theory,
Neural Net Learning and Genetic Learning. Expert Systems: Introduction, Design of Expert
systems.
Text Book:
1. Elaine Rich, Kevin Knight, & Shivashankar B Nair, Artificial Intelligence, McGraw Hill, 3rd
ed.,2009
Page 4 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
References:
1. Introduction to Artificial Intelligence & Expert Systems, Dan W Patterson, PHI.,2010
2. S Kaushik, Artificial Intelligence, Cengage Learning, 1st ed.2011
3. Stuart Russell and Peter Norvig, ―Artificial Intelligence: A Modern Approach‖, Third Edition,
2010, Pearson Education, New Delhi.
Module – I 8 Hrs.
Introduction to parallel computing. Parallel programming platforms: Trends in microprocessor
Architectures, Limitations of memory system performance, Dichotomy of parallel computing
platforms, physical organization of parallel platforms, communication costs in parallel machines,
Routing mechanisms for interconnection network, Impact of process processors mapping and
mapping techniques.
Module – II 10 Hrs.
Principles of parallel algorithm design: Preliminaries, Decomposition techniques, Characteristics
of tasks and interactions, Mapping techniques for load balancing, Methods for containing.
Interactions overheads, Parallel algorithm models. Basic communication operations: One-to-All
Broadcast and All-to-One Reduction, All-to-All broadcast and reduction All-Reduce and prefix
sum operations, scatter and gather, All-to-All personalized communication, circular shift,
Improving the speed of some communication operation.
Module – IV 10 Hrs.
Programming using the message passing paradigm: Principle of message – Passing programming,
Send and receive operations, The message passing interface, Topologies and embedding,
Overlapping communication with computation, collective communication and computation
operations, Groups and communicators. Dense matrix algorithm: Matrix-vector multiplication,
Matrix-matrix algorithm, Solving a system of linear equations.
Page 5 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Text Books:
1. Introduction to Parallel Computing, Second Edition, Ananth Gram, Anshul Gupta, George
Karypis, Vipin Kumar Person Education.
2. Parallel computing Theory and Practice, Second Edition, Michael J. Quinn, TMH.
Module–I [10Hrs]
FAULT TOLERANT DESIGN Basic Concepts: Reliability Concepts, Failure & Faults, Reliability
and Failure rate, Relation between Reliability and Meantime between failure, Maintainability
and Availability, Reliability of series, parallel and Parallel –Series combinational circuits. Fault
Tolerant Design: Basic Concepts –Static, dynamic, hybrid Triple Modular Redundant
System, Self purging redundancy, Sift out redundancy (SMR), 5 MR Re-Configuration techniques,
Use of error correcting code. Time redundancy and software redundancy
Module-II [10Hrs]
SELF CHECKING CIRCUITS & FAIL SAFE DESIGN Self Checking circuits: Basic concepts
of self checking circuits, Design of Totally self checking checker, checkers using m out of n codes,
Berger code, Low Cost residue code. Fail Safe Design: Strongly fault secure circuits, fail safe
design of sequential circuits using partition theory and Berger code, Totally self checking PLA
Design.
Module-III [10Hrs]
ATPG FUNDAMENTALS & DESIGN FOR TESTABILITY FOR COMBINATIONAL
CIRCUIT Introduction to ATPG, ATPG Process –Testability and Fault analysis methods –Fault
masking –Transition delay fault ATPG, Path delay, fault ATPG Design for Testability for
Combinational Circuits: Basic concepts of Testability, Controllability and Observability, The Reed
Muller’s expansion technique, OR-AND-OR Design, Use of control and Syndrome Testable
Designs.
Module-IV [10Hrs]
SCAN ARCHITECTURES & TECHNIQUES Introduction to Scan Based testing, Functional
testing, The Scan effective Circuit, The MUX-D Stule Scan flip-flops, The Scan shift register,
scan cell operation Scan test sequencing, scan testing timing, partial scan, multiple scan
chains, scan based design rules (LSSD) At-speed scan testing and Architecture, multiple
clock and scan domain operation, critical paths for At speed scan test. BUILT IN SELF TEST
(BIST)BIST concepts, Tests Pattern generation for BIST exhaustive testing, Pseudorandom
testing, pseudo exhaustive testing, constant weight patterns, Generic offline BIST
architecture, Memory Test architecture.
Page 6 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Text Books:
1. Fault Tolerant & Fault Testable Hardware Design –Parag K. Lala, 1984, PHI
2. Design for Test for Digital IC’s and Embedded Core Systems –Alfred L. Crouch 2008, Pearson
Education.
Reference Books:
1. Digital Systems Testing and testable Design –Miron Abramovici, Melvin A. Breuer and
Arthur D. Friedman, Jaico Books
2. Essentials of Electronic Testing –Bushnell & Vishwani D. Agarwal, Springers.
Course Objectives:
To understand the importance of statistical approach for processing and availing meaningful
information from large text corpora and online-text in internet, social network and WWW.To learn
key concepts in probability theory, statistics, information theory, and linguistics required for
quantitative approaches to corpus based language processing. To apply these methods and
techniques for Text alignment, Machine translation, text clustering, Information Retrieval, and
Text categorization.
Text Books:
1. Christopher D. Manning, Hinrich Schutze, ―Foundations of Statistical Natural Language
Processing‖, The MIT Press, 2000.
Reference Books:
1. Daniel Jurafsky and James H. Martin, Speech and Language Processing.
Page 8 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Module 2 (10
Hours)
Output Primitives and Attributes of Output Primitives : Output Primitive Points and Lines, Line
Drawing Algorithms, Circle Generating Algorithms, Scan-Line Polygon Fill Algorithm, Inside-
Outside tests, Boundary-Fill Algorithm, Flood Fill Algorithm, Cell Array, Character Generation,
Attributes of Output Primitives : Line Attributes, Color and Gray scale Levels, Area fill Attributes,
Character Attributes, Bundled Attributes, Antialiasing.
Textbook:
1. Computer Graphics, D. Hearn and M.P. Baker (C Version), Pearson Education.
Reference Books:
1. Computer Graphics, S. Bhattacharya, Oxford University Press.
2. Computer Graphics Principle and Practice, J.D. Foley, A. Dam, S.K. Feiner, Addison Wesley.
3. Computer Graphics: Algorithms and Implementations, D.P Mukherjee, D. Jana, PHI.
4. Computer Graphics, Z. Xiang, R. A. Plastock, Schaum’s Outlines, McGraw Hill.
MODULE-I [10Hrs]
Fundamentals – Steps in digital image processing, sampling and quantization, relationship between
pixels, imaging geometry Image Transforms – Fourier Transform, Discrete Fourier Transform, Fast
Fourier Transform, Discrete Cosine Transform, Walsh Transform, Hadamard Transform, Hotelling
Transform.
Page 9 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
MODULE-II [10Hrs]
Image Enhancement – Point processing, spatial filtering (smoothing and sharpening
filters),enhancement in frequency domain Filtering in the Frequency Domain: preliminary
concepts, 2D DFT and its properties, basic filtering in the frequency domain, image smoothing
and sharpening.
MODULE-III [10Hrs]
Image Restoration and Reconstruction: Image restoration/degradation model, noise models,
restoration in the presence of noise only, estimating the degradation function. Color Image
Processing: Color models, Color transformation.
MODULE-IV [10Hrs]
Wavelets and Multi-resolution Processing: multi resolution expansions, wavelet transforms in one
and two dimension. Image Compression: Fundamentals, Some basic compression methods,
Morphological Image Processing: Erosion and Dilation, opening and closing.
Text books
1. Digital Image Processing, R.C. Gonzalez, R.E. Woods, Pearson Education , 3rd Edition, 2007
2. Digital Image Processing, S. Sridhar, Oxford University Press,2011
3. Digital Image Processing And Analysis, B. Chanda, Dutta D. Majumder,PHI
Reference Books:
1. Digital Image Processing using MATLAB, Rafael C. Gonzalez, Richard E. Woods Pearson
Education, Inc., Seventh Edition, 2004.
2. Digital Image Processing, William K. Pratt, John Wiley, New York, 2002
Module-II
Neural Networks (NN), Support Vector Machines (SVM),and K-nearest Neighbor: Fitting neural
networks, Back propagation, Issues in training NN, SVM for classification, Reproducing Kernels,
SVM for regression, K-nearest –Neighbour classifiers( Image Scene Classification).
Module-III
Unsupervised Learning and Random forests: Association rules, Cluster analysis, Principal
Page 10 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Components, Random forests and analysis.
Module-IV
Assessing Performance of a classification Algorithm (t-test, McNemar’s test, Paired t-test, paired
Ftest), Analysis of Variance, Creating data for analytics through designed experiments. Introduction
to big data and Challenges for big data analytics.
Text Books
1. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning-
DataS Mining, Inference, and Prediction, Second Edition, Springer Verlag, 2009.
2. G. James, D. Witten, T. Hastie, R. Tibshirani-An introduction to statistical learning with
applications in R,Springer,2013
3. E.Alpaydin, Introduction to Machine Learning, Prentice Hall ofIndia,2010.
Reference Books:
1. C.M. Bishop –Pattern Recognition and Machine Learning, Springer, 2006
2. L. Wasserman-All of statistics
HONOURS
Module: I [10Hrs]
Portable Devices Overview: Introduction to SW development for portable devices, Overview of
Portable Devices, HW & SW for Portable Devices, Applications of Portable Devices, Portable
devices - Understanding HW platforms: HW Platforms (Processors, Peripheral devices, Sensors
etc.), HW Platforms – (Mobile Phones + Wireless, HW Platforms – Internet of things (IoT) +
Wireless, Example - Rasberry Pi, Sensors in Portable devices, Generic HW platforms.
,
Module: II [10Hrs]
Overview of SW Platforms & Development:
Mobile OS: Architecture and Framework of different mobile platforms, Development platforms and
development tools, Programming languages, Simulator and emulator, SDK and Development
Environments, Development Life Cycle of Application, CREATING APPLICATIONS AND
ACTIVITIES: Introducing the Application Manifest File, Creating Applications and Activities,
Page 11 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Architecture Patterns (MVC), Review of other Architecture and Design patterns, The Android
Application Lifecycle, User Interface Design; Intents and Broadcasts: Fundamental Android UI
Design, Introducing Layouts, Introducing Fragments, Introducing Intents, Creating Intent Filters and
Broadcast Receivers, Background Services and Using Internet Resources: Introducing Services,
Using Background Threads, Parsing Internet Resources, Using the Download Manager, Using
Internet Services, Connecting to Google App Engine, Best Practices for Downloading Data Without
Draining the Battery.
Module: IV [10Hrs]
Location Based Services, Telephony and SMS: Using Location-Based Services, Using the
Emulator with Location-Based Services, Selecting a Location Provider, Using Proximity Alerts,
Using the Geocoder, example: Map-based activity, Hardware Support for Telephony, Using
Telephony, Introducing SMS and MMS.
Hardware Support and Devices (AUDIO, VIDEO, AND USING THE CAMERA): Using
Sensors and the Sensor Manager, Monitoring a Device’s Movement and Orientation, Introducing the
Environmental Sensors, Playing Audio and Video, Using Audio Effects, Using the Camera,
Recording Video.
Text Books:
1. Professional Android 4 Application Development, by Reto Meier, WROX Press, Wiley
Publishing
2. Hello Android, Introducing Google’s Mobile Development Platform, 3rd Edition, by Ed
Burnette, Pragmatic Programmers.
3. Android Application Development, Programming with the Google SDK, by, Rick Rogers, John
Lombardo, Zigurd Mednieks, Blake Meike, SPD, Oreilly.
Page 12 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
MINOR
MODULE IV (10
Hours)
File Management: File attribute, File operations, file access method, File protection, File system
structure, directory implementation, Allocation methods. Disk Management: Disk Structure, Disk
scheduling.
Text Books:
1. Operating System Concepts-Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Wiley
Page 13 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Course Outcomes:
At the end of the course, the students should be able to
1. Solve problem related to changes in size and shape of the mineral.
2. Understand briefly about the operation of a mineral plant
3. Can handle problem related to material transportation, material handling and storage.
Objective of the course: To provide comprehensive knowledge on concepts and principles of colloids,
interfaces and their applications.
Text Books
1. Principles of Colloid and Surface Chemistry, 3rd ed. by P CHiemenz and R Rajagopalan, Mercel
Dekker.
Page 15 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
2. Introduction to Colloid & Surface Chemistry, 4th ed. by D J Shaw, Butterworth Heinemann.
3. Colloid and Surface Chemistry by P. Somasundaran, Create Space Independent Publishing Platform.
4. Introduction to Applied Colloid and Surface Chemistry by G. M. Kontogeorgis and S. Kiil, John Wiley
& Sons.
Course Outcomes:
At the end of the course, the student should be able to
1. Understand the colloidal science engineering fundamentals.
2. Characterize interfaces and surface phenomena.
Module I:
Introduction: The Continuum, Equations of Equilibrium, Boundary Conditions, Strain displacement relations,
Stress strain Relations, Plane stress and plane Strain problems, Different methods of structural analysis
including numerical methods. Basics of finite element method (FEM), different steps involved in FEM,
Different approaches of FEM, Direct method, Energy approach, Weighted residual Method.
Module II:
One and Two Dimensional Problems: Detail formulation including shape functions. stress strain relations,
strain displacement relations and derivation of stiffness matrices using energy approach, Assembling of
element matrices, application of displacement boundary conditions, Numerical solution of one dimensional
problems using bar, truss, beam elements and frames. Derivation of shape function using Lagrange’s
interpolation, Pascal’s triangle, Convergence criteria.
Module III:
Finite Element modeling of two dimensional problems using Constant strain Triangle (CST) elements, Stress
strain relations for isotropic and orthotropic materials, Four nodded rectangular elements, axisymmetric solids
subjected to axisymmetric loading.
Isoparametric Elements: Natural coordinates, isoparametric elements, four node, eight node elements.
Numerical integration, order of integration.
Module IV:
Plate Bending: Bending of plates, rectangular elements, triangular elements and quadrilateral elements,
Concept of 3D modeling.
Text Books:
1. C. S. Krishnamoorthy, Finite Element analysis-Theory and Programming, TMH
2. Finite Element Method, R. Dhanraj and K. P. Nair, Oxford University Press
Page 16 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Reference Books:
1. R. D. Cook., Concepts and Applications of Finite Element Analysis, Wiley.
2. M. Mukhopadhyay-Matrix and Finite Element Analysis of Structures
3. O. C Zienkiewicz .and R. L. Taylor, Finite Element Method, McGraw Hill
4. Introduction to Finite Elements in Engineering, T.P. Chandrupatla and A.D. Belegundu
5. Finite Element Analysis in Engineering Design, S. Rajasekharan.
Prerequisites:
The course does not have any formal prerequisites. You must have a research project in sufficient maturity so
you can finish a meaningful portion of your research and a complete paper by the end of the semester. The
research topic can be a portion of your B.Tech, MCA, MS, M.Tech or PhD thesis project, a significant
extension of course projects from the past, or something you are passionate about. This course is most
appropriate for graduate students who are interested in research but do not have extensive prior research
experience.
Course Objectives:
1. To introduce research and research methodologies in CS to students going to peruse research in CS.
2. To understand the strengths and weakness of each of these methods.
3. How to choose suitable method(s) for the investigations?
4. How to carry out investigations using these methods?
5. What are the threats associated with these methods and how to deal with them.
6. Reporting the results of these investigations. Writing technical articles/research papers.
7. Understanding roles of authors, reviewers. How to review research articles?
Module I: 10 Hrs.
Introduction to Research, Research Methods in Computer Science, Analytical vs. Empirical Methods, Surveys,
Case Studies, Controlled Experiments, Ethnography and Action Research, Quantitative, Qualitative, and
Mixed Methods, Choosing research methods, Validity threats, Meaning of Research Problem, Data collection
methods - primary and secondary sources, Types of data analysis methods, Analysis and Interpretation of
Quantitative Data, Descriptive Statistics, Sampling, sampling distribution, Parameter Estimation, Statistical
Inference, confidence interval and Hypothesis Testing using normal distribution, Tests of significance, test of
difference of mean and proportions, t-tests, ANOVA, Chi-square Tests, correlation and regression, Review
Process, Review guidelines, Validity threats, Review decisions, Research Qualitative Methods, Study Designs,
Elements, and Methods, The nature and types of qualitative research, Study Designs, Elements, and Methods,
The nature and types of qualitative research, problem definition, Sources of research problem, Scope and
objectives of research problem, Criteria characteristics of a good research problem, Errors in selecting a
Page 17 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
research problem, Approaches of solutions for research problem, Necessary Instrumentation, use of SPSS
package.
Text Book:
There is no text book for the course. A teacher may use lecture notes and videos, read research papers and
Web Pages, which will be freely available on internet websites.
Reference books:
1. Research Design. Qualitative, Quantitative, and Mixed Methods Approaches. By John W. Creswell,
Fourth Edition. SAGE Publication, 2014
2. The Craft of Research, By Wayne C. Booth, Gregory G. Colomb, Joseph M. Williams, Joseph Bizup,
William T. FitzGerald, Third Edition, The University of Chicago Press, 2008
3. The Elements of Style. William Strunk Jr. and E. B. White, Forth Edition, Pearson, 1999
4. Research Methodology By Panneerselvam R, 2nd Edition, PHI, 2014
5. Statistical Design and Analysis of Experiments With Applications to Engineering and Science, Robert
L. Mason, Second Edition, Wiley Inter Science.[Good for Data Analysis and Hypothesis Testing]
6. THE DESIGN OF DESIGN: ESSAYS FROM A COMPUTER CIENTIST, Frederick P. Brooks Jr.,
Addison-Wesley Professional, 2010.
Page 18 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Course Objectives:
1. Introduction to analog and digital communication systems.
2. Analysis of signal in frequency domain.
3. Study of analog modulation schemes.
4. Study of digital modulation techniques
Module IV (6 Hours)
Digital Modulation Techniques. Phase Shift Keying (PSK), Frequency Shift Keying (FSK) – their Basic
Principle, Waveform, Generation and Detection. Ideal low pass, Band pass and Band rejection filters – their
impulse response (no mathematical derivation).
Program Outcomes:
At the end of this course students will demonstrate the ability to
1. Analyse signals in frequency domain.
2. Analyze and compare different analog modulation schemes for their efficiency and bandwidth.
3. Analyze different digital modulation schemes.
4. Investigate pulsed modulation system and analyze their system performance.
Page 19 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
TEXT BOOKS:
1. John G.Proakis, M. Salehi, COMMUNICATION SYSTEMS ENGINEERING, 2nd ed. New Delhi,
India: PHI Learning Private Limited, 2009.
2. R.P Singh and S.D Sapre, COMMUNICATION SYSTEMS Analog & Digital, 2nd ed. New Delhi,
India: Tata McGraw Hill Education Private Limited, 2009.
3. Martin S. Roden, ―Analog and Digital Communication Systems‖, SPD Publisher.
REFERENCE BOOKS:
1. H.Taub and D. L. Shilling, ―Principle of Communication System‖, TMH Publisher.
2. Modern Digital and Analog Communication Systems, by B.P. Lathi, Oxford.
Course Objectives:
1. To understand the design of IOT relevant applications in various domain.
2. To understand the concepts of Raspberry Pi, interfaces and applications in IoT domain.
3. To understand the importance of cloud computing and its applications.
4. To understand specific security and data protection issues in IoT
Unit 2
Domain Specific IOTs: Home Automation, Cities, Environment, Energy, Retail, Logistics, Agriculture,
Industry, Health & Life Style. Smart Lighting, Intrusion Detection, Smoke/Gas Detectors, Cities-Smart
Parking, Smart Lighting, Smart Roads, Environment-Weather Monitoring, Air pollution Monitoring, Forest
Fire Detection, Energy-Smart Grids, Logistics-Route Generation & Scheduling, Agriculture Smart Irrigation,
Health & Fitness Monitoring.
Unit 4
IOT Physical Devices & Endpoints: What is an IOT Device, Linux on Raspberry Pi, Interfaces,
Page 20 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Programming: Installing python. Data types and data structures, Flow, Functions, Modules, File Handling,
Date/ Time Operations, Classes, Python Packages.
Unit 6
Raspberry Pi Interfaces – Serial, SPI, I2C, Programming Raspberry Pi with Python-Controlling LED with
Raspberry Pi, interfacing an LED and Switch with Raspberry Pi, Interfacing a Light Sensor (LDR) with
Raspberry Pi.
MODULE-IV (8 Hours)
Unit 7
Privacy and Security threats on internet of Things: Specific security and data protection issues, IoT privacy
and security issues in smart cities.
Text Book:
1. Arshdeep Bahga and Vijay Audisetti, ―Internet of Things, A Hands on Approach‖, University Press, 1st
edition, 2016.
Reference Books:
1. Sébastien Ziegler, ―Internet of Things Security and Data Protection‖, Springer Publisher, 1 st edition,
2019.
2. Adrian McEwen, ―Designing the Internet of Things‖, Wiley, 1st edition, 2015.
3. Miller, ―The Internet of Things: How Smart TVs, Smart Cars, Smart Homes and Smart Cities are
Changing the World‖, Pearson, 1stedition, 2015.
Course Outcomes:
1. To analyse applications of IOT in various domain.
2. To realize the revolution of Internet in Mobile Devices, Cloud &Sensor Networks
3. To understand the importance of cloud computing and Embedded system.
4. To understand the challenges and limitations of internet of things.
Page 21 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
COURSE OBJECTIVES
1. To familiarize with soft computing concepts.
2. To introduce the fuzzy logic concepts, fuzzy principles and relations.
3. To know the basics of ANN and Learning Algorithms.
4. To analyze Ann as function approximation.
5. To know Genetic Algorithm and its applications to soft computing.
6. To analyze Hybrid system usage, application and optimization
MODULE-I ( 10 Hours)
Unit-1
Introduction
What is Soft Computing? Difference between Hard and Soft computing, Requirement of Soft computing,
Major Areas of Soft Computing, Applications of Soft Computing.
Unit-2
Fuzzy Systems
Fuzzy Set theory, Fuzzy versus Crisp set, Fuzzy Relation, Fuzzification, Minmax Composition,
Defuzzification Method, Fuzzy Logic, Fuzzy Rule based systems, Predicate logic, Fuzzy Decision Making,
Fuzzy Control Systems, Fuzzy Classification.
Text Books:
1. S, Rajasekaran & G.A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic & Genetic Algorithms,
Synthesis & applications, PHI Publication, 1st Edition, 2009.
2. F. O. Karry and C. de Silva, ―Soft Computing and Intelligent Systems Design – Theory, Tools and
Applications‖, Pearson Education.
Reference Books:
1. J. S. R. Jang. C. T. SUN and E. Mizutani, ―Neuro-fuzzy and soft-computing‖. PHI Pvt. Ltd., New
Delhi.
2. Fredric M. Ham and Ivica Kostanic, ―Principle of Neuro Computing for Science and Engineering‖,
Tata McGraw Hill.
3. S. Haykins, ―Neural networks: a comprehensive foundation‖. Pearson Education, India.
4. V. Keeman, ―Learning and Soft computing‖, Pearson Education, India.
5. R. C. Eberhart and Y. Shi, ―Computational Intelligence Concepts to Implementation‖. Morgan
Kaufmann Publishers (Indian Reprint).
6. David E. Goldberg, ―Genetic Algorithms in search, optimization, and machine learning‖, Addison-
Wesley Publishing Company, Inc, 1989.
Course Outcomes:
1. To analyze the facts and outline the different process carried out in fuzzy logic, ANN and Genetic
Algorithms.
2. To understand the concepts and meta-cognitive of soft computing.
3. To Apply Soft computing techniques the solve character recognition, pattern classification, regression
and similar problems.
4. To identify process/procedures to handle real world problems using soft computing.
5. To apply various techniques of soft computing to defend the best working solutions.
6. To Design hybrid system to revise the principles of soft computing in various applications.
Page 23 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
OBJECTIVES:
To stress the importance of reliability in Engineering and products also the concept of maintainability, failure
modes and testing methods.
TEXT BOOKS:
1. Charles E. Ebling, ―An introduction to Reliability and Maintainability Engg‖, Tata McGraw-Hill,
2000.
REFERENCES:
1. Patrick D T O’Connor, ―Practical Reliability Engineering‖, John-Wiley and Sons inc, 2002.
2. David J Smith, ―Reliability, Maintainability and Risk: Practical Methods for Engineers‖, Butterworth,
2002
3. Way kuo, Rajendra Prasad V, Frank A and Tillman, ching- lai Hwang ―Optimal Reliability Design and
Applications‖, Cambridge University Press P ltd., 2001.
Page 24 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
OUTCOMES
The Student must apply and optimize reliability for time independent and time dependent failure models
through various testing methods for various manufacturing amnesty process
Course objective:
To expose students to the automation, robot kinematics and robot arm dynamics. To acquire knowledge on
Classification and structure of robotic system, robot programming and its applications.
Essential Reading:
1. Groover, Industrial Robot, PHI. 2. Y. Korem, Robotics, Mc Graw-Hill.
Course Outcomes:
1. Complete knowledge of robotic system
2. Idea about robot kinematics and robot arm dynamics
3. Learning of robot languages and the use of sensors
Page 25 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Course Outcomes:
1. Students will be able to identify nanocomposites for a given application
2. Understanding properties of a nanocomposite by relating them to its structure
3. Identifying a suitable nanocomposite process for a given application
4. Applying nanocomposite fundamentals in real life situations
Page 26 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Course Objective
The objective of this course is to produce graduates who Contribute to the success of companies through
effective problem solving. Design, develop, implement, and improve integrated systems that include people,
materials, information, equipment, and environments.
Module I [12]
Basic Management Theory: Evolution of Management Thought, Scientific Management, Organization as a
System, Function of Management, Principles of Management, Planning, Decision Making, Organizing
Principle, Delegation of Authority, Line and Staff Function, Leadership, Motivation, Communication,
Controlling.
Module II [10]
Personnel Management: Organization as Social System, Motivation and Behaviour, Role of Personnel
Management, Recruitment, Selection, Training, Performance Appraisal, Job Evaluation and Merit Rating,
Wage Policy, Incentives, Group Dynamics, Job Satisfaction and Morale.
Materials Management: Purchasing, Selection of Vendor, Learning Curve Concept, MRP.
Module IV [08]
Financial Management: Scope, Time Value of Money, Depreciation cost of a product, Financial Statement
Analysis, Ratio Analysis, Working Capital, Sources of Finance.
Industrial Relation: Trade Union, Industrial Dispute, Workers Participation In Management, Industrial
Legislation, Labour Law, Factory Act.
Text Books:
1. Industrial Engineering & Production Management, M. Mahajan, Dhanpat Rai Publication.
2. Industrial Engineering & Management Science, T. R. Banga, N. K. Agarwal, S. C. Sharma, Khanna
Publication.
Reference Books:
1. Personnel Management, A. Mannappa, M. S. Saiyadain.
2. Fundamentals of Financial Management, Prasanna Chandra, TMH.
Course Outcomes:
Upon successful completion of the course, student will able to:
Page 27 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Page 28 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Page 29 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Text book:-
1. Web Technologies, Uttam K. Roy, Oxford University Press.
Reference Book:
1. Ivan Bayross, ―HTML, DHTML, JavaScript, Perl CGI‖, 3rd Edition, BPB Publications.
2. K. Laxmi Narayan, ‖Internet and web technology‖, SCITECH Publication
3. Greenlaw R and Hepp E ―Fundamentals of Internet and www‖ 2nd EL, Tata McGraw Hill,
2007.
Module-I: [10Hrs]
Introduction to Social Network Mining, Graph Models and Node Metrics. Introduction to social
network mining. Illustration of various social network mining tasks with real-world examples. Data
characteristics unique to these settings and potential biases due to them. Social Networks as Graphs.
Random graph models graph generators (Erd os-R enyi, power law, preferential attachment, small
world, stochastic block models, kronecker graphs), degree distributions. Models of evolving
networks. Node based metrics, ranking algorithms (Pagerank). Gephi graph visualization and
exploration software – practice.
Module-II: [10Hrs]
Social-Network Graph Analysis. Social network exploration/ processing: graph kernels, graph
classification, clustering of social-network graphs, centrality measures, community detection and
mining, degeneracy (outlier detection and centrality), partitioning of graphs. SNAP system for large
networks analysis and manipulation.
Page 30 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Module-III: [10Hrs]
Social-Network Graph Analysis and Properties. Social network exploration/ processing and
properties: Finding overlapping communities, similarity between graph nodes, counting triangles in
graphs, neighbourhood properties of graphs. Pregel paradigm and Apache Giraph graph processing
system.
Module-IV: [10Hrs]
Information Diffusion in Social Networks. Strategic network formation: game theoretic models for
network creation/ user behavior in social networks. Information diffusion in graphs: Cascading
behavior, spreading, epidemics, heterogeneous social network mining, influence maximization,
outbreak detection. Opinion analysis on social networks: Contagion, opinion formation,
coordination and cooperation. Dynamic Social Networks, Applications and Research Trends
Dynamic social networks, Link prediction, Social learning on networks. Special issues in
Information and Biological networks. Important applications of social network mining.
Books:
1. David Easley and Jon Kleinberg, Networks, crowds, and markets, Cambridge University Press,
2010.
2. Jure Leskovec, Anand Rajaraman and Jeffrey David Ullman, Mining of massive datasets,
Cambridge University Press, 2014
Course Objectives:
To understand the functions and design of various units of digital computers to store and process the
information, fundamental concepts of processing units, concepts of various memory systems,
input/output, Interrupts.
Page 31 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Introduction to Neural networks, perceptron and back propagation, Long and Short Term Memory
(LSTM) Recurrent Neural Networks
Text Books:
1. Daniel Jurafsky and James H. Martin, Speech and Language Processing
Reference Books:
1. Christopher D. Manning, Hinrich Schutze, ―Foundations of Statistical Natural Language
Processing‖, The MIT Press, 2000
Course Outcomes:
1. Know about the stages of NLP, issues of NLP and role of Machine learning, N-gram language
models
2. Know about Markov Models and Neural Network methods and technique for text processing
3. Know the grammar formalisms CFG, PCFG and use them for text parsing
4. Apply the techniques for semantic parsing, analysis and extraction
Page 32 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Tools, Measures of SQA Success–Risk Management: Risk Management Cycle, Risk Identification,
Quantification, Monitoring, Mitigation, Metrics in Risk Management.
TEXT BOOKS
1. Ramesh Gopalaswamy, ―Managing and global Software Projects‖, Tata McGraw Hill. Tenth
Reprint 2011.(Revised)
REFERENCES
1. Roger S. Pressman, ―Software Engineering - A Practitioner’s Approach‖, 7th Edition McGraw
Hill, 2010.(Revised).
2. Humphery Watts, ―Managing the Software Process‖, Addision Wesley, 1989.(Revised).
3. Wheelwright and Clark: ―Revolutionizing product development‖, The Free Press, 1993
Module-I: [8hrs]
Biological Data Acquisition: The form of biological information. Retrieval methods for DNA
sequence, protein sequence and protein structure information; Databases – Format and Annotation:
Conventions for database indexing and specification of search terms, Common sequence file
formats. Annotated sequence databases - primary sequence databases, protein sequence and
structure databases;
Page 33 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
Module-II: [8hrs]
Organism specific database; Data – Access, Retrieval and Submission: Standard search engines;
Data retrieval tools – Entrez, DBGET and SRS; Submission of (new and revised) data;
Module-III: [8hrs]
Sequence Similarity Searches: Local versus global. Distance metrics. Similarity and homology.
Scoring matrices. Dynamic programming algorithms, Needleman-wunsch and Smith-waterman.
Heuristic Methods of sequence alignment, FASTA, BLAST and PSI BLAST. Multiple Sequence
Alignment and software tools for pairwise and multiple sequence alignment;
Module-IV: [8hrs]
Genome Analysis: Whole genome analysis, existing software tools; Genome Annotation and Gene
Prediction; ORF finding; Phylogenetic Analysis Comparative genomics, orthologs, paralogs.
Methods of phylogenetic analysis: UPGMA, WPGMA, neighbor joining method, Fitch/ Margoliash
method, Character Based Methods.
Text Books:
1. Bioinformatics: Databases and Systems, by Stanley I. Letovsky.
2. Bioinformatics Databases: Design, Implementation, and Usage (Chapman & Hall/ CRC
Mathematical Biology & Medicine), by Sorin Draghici.
3. Data base annotation in molecular biology, principles and practices, Arthur M.Lesk
4. Current topics in computational molecular biology, Tao, Jiang, Ying Xu, Michael Q.Zang
MODULE-1 14 Hrs.
Introduction: What is real time, Applications of Real-Time systems, A basic model of Real-time
system, Characteristics of Real-time system, Safety and Reliability, Types of Real-time tasks, timing
constraints, Modelling timing constraints Real-Time Task Scheduling: Some important concepts,
Types of Real-time tasks and their characteristics, Task scheduling, Clock-Driven scheduling,
Hybrid schedulers, Event-Driven scheduling, Earliest Deadline First (EDF) scheduling, Rate
monotonic algorithm (RMA). Some issues Associated with RMA. Issues in using RMA practical
situations.
MODULE-2 14 Hrs.
Handling Resource Sharing and dependencies among Real-time Tasks: Resource sharing among
real-time tasks. Priority inversion. Priority Inheritance Protocol (PIP), Highest Locker Protocol
(HLP). Priority Ceiling Protocol (PCP). Different types of priority inversions under PCP. Important
Page 34 of 35
B.Tech Syllabus for Admission Batch 2018-19 Onwards Computer Science & Engineering
features of PCP. Some issues in using a resource. sharing protocol. Handling task dependencies.
Scheduling Real-time tasks in multiprocessor and distributed systems: Multiprocessor task
allocation, Dynamic allocation of tasks. Fault tolerant scheduling of tasks. Clock in distributed Real-
time systems, Centralized clock synchronization.
MODULE-3 12 Hrs.
Commercial Real-time operating systems: Time services, Features of a Real-time operating system,
Unix as a Real-time operating system, Unix-based Real-time operating systems, Windows as a Real-
time operating system, POSIX-RT, A survey of contemporary Real-time operating systems.
Benchmarking real-time systems.
MODULE-4 10 Hrs.
Real-time Databases: Example applications of Real-time databases. Review of basic database
concepts, Real-time databases, Characteristics of temporal data. Concurrency control in real-time
databases. Commercial real-time databases. Realtime. Communication: Basic concepts, Examples of
applications, Real-time communication in a LAN and Real-time communication over packet
switched networks.
Text Book:
1. Real-time Systems Theory and Practice by Rajib Mall, Pearson Publication, 2008.
Page 35 of 35