B.

TECH (Computer Engineering and Information Technology , Computer Science and

Information Technology, Information Technology) FIFTH SEMSTER SYLLABUS
Database Management System (BCS501)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
CO 1 Apply knowledge of database for real life applications. K3
CO 2 Apply query processing techniques to automate the real time problems of databases. K3, K4

CO 3 Identify and solve the redundancy problem in database tables using normalization. K2, K3
Understand the concepts of transactions, their processing so they will familiar with broad range K2, K4
CO 4
of database management issues including data integrity, security and recovery.
CO 5 Design, develop and implement a small database project using database tools. K3, K6
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Overview, Database System vs File System, Database System Concept and
Architecture, Data Model Schema and Instances, Data Independence and Database Language and
Interfaces, Data Definitions Language, DML, Overall Database Structure. Data Modeling Using the
I 08
Entity Relationship Model: ER Model Concepts, Notation for ER Diagram, Mapping Constraints,
Keys, Concepts of Super Key, Candidate Key, Primary Key, Generalization, Aggregation,
Reduction of an ER Diagrams to Tables, Extended ER Model, Relationship of Higher Degree.
Relational data Model and Language: Relational Data Model Concepts, Integrity Constraints,
Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints, Relational Algebra,
Relational Calculus, Tuple and Domain Calculus. Introduction on SQL: Characteristics of SQL,
II Advantage of SQL. SQl Data Type and Literals. Types of SQL Commands. SQL Operators and Their 08
Procedure. Tables, Views and Indexes. Queries and Sub Queries. Aggregate Functions. Insert,
Update and Delete Operations, Joins, Unions, Intersection, Minus, Cursors, Triggers,
Procedures in SQL/PL SQL
Data Base Design & Normalization: Functional dependencies, normal forms, first, second, 8 third
III normal forms, BCNF, inclusion dependence, loss less join decompositions, normalization using 08
FD, MVD, and JDs, alternative approaches to database design
Transaction Processing Concept: Transaction System, Testing of Serializability, Serializability of
Schedules, Conflict & View Serializable Schedule, Recoverability, Recovery from Transaction
IV 08
Failures, Log Based Recovery, Checkpoints, Deadlock Handling. Distributed Database: Distributed
Data Storage, Concurrency Control, Directory System.
Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency
V Control, Time Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple 08
Granularity, Multi Version Schemes, Recovery with Concurrent Transaction, Case Study of Oracle.
Text books:
1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill
2. Date C J, “An Introduction to Database Systems”, Addision Wesley
3. Elmasri, Navathe, “ Fundamentals of Database Systems”, Addision Wesley
4. O’Neil, Databases, Elsevier Pub.
5. RAMAKRISHNAN"Database Management Systems",McGraw Hill
6. Leon & Leon,”Database Management Systems”, Vikas Publishing House
7. Bipin C. Desai, “ An Introduction to Database Systems”, Gagotia Publications
8. Majumdar & Bhattacharya, “Database Management System”, TMH

Curriculum & Evaluation Scheme: Computer Engineering and Information Technology, 4

Computer Science and Information Technology, IT (V & VI semester)
 Web Technology (BCS502)
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to:
Understand the fundamental concepts of web development, including the history, K3, K6
CO 1 protocols, and tools. Apply HTML and XML in the development of web projects.
Apply CSS for designing and styling web pages, including the use of CSS properties, K2, K3
CO 2 styling elements, and advanced techniques for creating responsive web sites.
Develop interactive web applications using JavaScript and AJAX, with a focus on K3, K6
CO 3 scripting documents, forms, and networking concepts such as internet addressing and
TCP/IP sockets.
Design and implement server-side applications using Enterprise Java Beans (EJB) and K2, K4,
CO 4 Node.js, including the creation of JavaBeans, RESTful APIs, and database operations K6
with MongoDB.
Implement web server functionality using Servlets and Java Server Pages (JSP), focusing K2, K3,
CO 5 on handling HTTP requests, session tracking, and utilizing custom tag libraries for K4
dynamic web content.
DETAILED 3-0-0
SYLLABUS
Unit Topic Proposed
Lecture
Introduction: Introduction and Web Development Strategies, History of Web and Internet,
Protocols Governing Web, Writing Web Projects, Connecting to Internet, Introduction to
I Internet services and tools, Introduction to client-server computing.
Web Page Designing: HTML: List, Table, Images, Frames, forms, XML: Document type
08
definition (DTD), XML schemes, Object Models, presenting and using XML, Using XML
Processors: DOM and SAX.
CSS: Creating Style Sheet, CSS Properties, CSS Styling (Background, Text Format,
II Controlling Fonts), Working with block elements and objects, Working with Lists and Tables,
CSS Id and Class, Box Model (Introduction, Border properties, Padding Properties, Margin
08
properties)
CSS Advanced (Grouping, Dimension, Display, Positioning, Floating, Align, Pseudo class,
Navigation Bar, Image Sprites, Attribute sector), CSS Color, Creating page Layout and Site
Designs.
Scripting: Java script: Introduction, documents, forms, statements, functions, objects,
III introduction to AJAX. 08
Networking: Internet Addressing, InetAddress, Factory Methods, Instance Methods, TCP/IP
Client Sockets, URL, URL Connection, TCP/IP Server Sockets, Datagram.
Enterprise Java Bean: Creating a JavaBeans, JavaBeans Properties, Types of beans, Stateful
IV Session bean, Stateless Session bean, Entity bean.
08
Node.js: Introduction, Environment Setup, REPL Terminal, NPM (Node Package Manager)
Callbacks Concept, Events, Packaging, Express Framework, Restful API.
Node.js with MongoDB: MongoDB Create Database, Create Collection, Insert, delete,
update, join, sort, query.
Servlets: Servlet Overview and Architecture, Interface Servlet and the Servlet Life Cycle,
V Handling HTTP get Requests, Handling HTTP post Requests, Redirecting Requests to Other
08
Resources, Session Tracking, Cookies, Session Tracking with Http Session
Java Server Pages (JSP): Introduction, Java Server Pages Overview, A First Java Server
Page Example, Implicit Objects, Scripting, Standard Actions, Directives, Custom Tag
Libraries

5
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
Text books:
1.Burdman, Jessica, “Collaborative Web Development” Addison Wesley
2.Xavier, C, “Web Technology and Design” , New Age International
3.Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication
4.Hans Bergsten, “Java Server Pages”, SPD O’Reilly
5. Margaret Levine Young, “The Complete Reference Internet”, McGraw Hill.
6. Greg Lim, “Beginning Node.js, Express & MongoDB Development”, 1 September 2020, Greg Lim
7.Shannon Bradshaw, Eoin Brazil, Kristina Chodorow, “MongoDB: The Definitive Guide, 3rd Edition”,
December 2019, O'Reilly Media, Inc.

6
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Object Oriented System Design with C++ (BCS054)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
To Understand the application development and analyze the insights of object oriented K2, K4
CO 1
programming to implement application
CO 2 To Understand, analyze and apply the role of overall modeling concepts (i.e. System, structural) K2, K3
CO 3 To Understand, analyze and apply oops concepts (i.e. abstraction, inheritance) K2, K3, K4
CO 4 To know the concepts of C++ for understanding the implementation of object oriented concepts K2, K3
CO 5 To understand and apply object oriented paradigm concepts to implement real world problems. K2, K3
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Introduction: The meaning of Object Orientation, object identity, Encapsulation, information hiding,
I polymorphism, generosity, importance of modelling, principles of modelling, object oriented 08
modelling, Introduction to UML, conceptual model of the UML, Architecture.
Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams. Class
&Object Diagrams: Terms, concepts, modelling techniques for Class & Object Diagrams.
Collaboration Diagrams: Terms, Concepts, depicting a message, polymorphism in collaboration
Diagrams, iterated messages, use of self in messages. Sequence Diagrams: Terms, concepts, depicting
II asynchronous messages with/without priority, call-back mechanism, broadcast messages. 08
Basic Behavioural Modeling: Use cases, Use case Diagrams, Activity Diagrams, State Machine ,
Process and thread, Event and signals, Time diagram, interaction diagram, Package diagram.
Architectural Modeling: Component, Deployment, Component diagrams and Deployment diagrams.

Object Oriented Analysis: Object oriented design, Object design, Combining three models, Designing
algorithms, design optimization, Implementation of control, Adjustment of inheritance, Object
representation, Physical packaging, Documenting design considerations.
III Structured analysis and structured design (SA/SD), Jackson Structured Development 08
(JSD).Mapping object oriented concepts using non-object oriented language, Translating classes into
data structures, Passing arguments to methods, Implementing inheritance, associations encapsulation.
Object oriented programming style: reusability, extensibility, robustness, programming in the large.
Procedural v/s OOP, Object oriented language features. Abstraction and Encapsulation.
C++ Basics : Overview, Program structure, namespace, identifiers, variables, constants, enum,
operators, typecasting, control structures
IV 08
C++ Functions : Simple functions, Call and Return by reference, Inline functions, Macro Vs. Inline
functions, Overloading of functions, default arguments, friend functions, virtual functions
Objects and Classes : Basics of object and class in C++, Private and public members, static data
and function members, constructors and their types, destructors, operator overloading, type conversion.
Inheritance : Concept of Inheritance, types of inheritance: single, multiple, multilevel, hierarchical,
V 08
hybrid, protected members, overriding, virtual base class
Polymorphism : Pointers in C++, Pointes and Objects, this pointer, virtual and pure virtual
functions, Implementing polymorphism
Text Books
1. James Rumbaugh et. al, “Object Oriented Modeling and Design”, 2nd Edition Pearson Education
2. Grady Booch, James Rumbaugh, Ivar Jacobson, “The Unified Modeling Language User Guide”, Pearson
Education
3. Object Oriented Programming With C++, E Balagurusamy, McGraw-Hill Education
4. C++ Programming, Black Book, Steven Holzner, dreamtech
5. Object Oriented Programming in Turbo C++, Robert Lafore, Galgotia
6. Object Oriented Programming with ANSI and Turbo C++, Ashok Kamthane, Pearson
7. The Compete Reference C++, Herbert Schlitz, McGraw-Hill Education
12
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Machine Learning Techniques (BCS055)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able:

K1 , K2
CO 1 To understand the need for machine learning for various problem solving
To understand a wide variety of learning algorithms and how to evaluate models generated K1 , K3
CO 2
from data
K2 , K3
CO 3 To understand the latest trends in machine learning
To design appropriate machine learning algorithms and apply the algorithms to a real-world K4 , K6
CO 4
problems
To optimize the models learned and report on the expected accuracy that can be achieved by K4, K5
CO 5 applying the models
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
INTRODUCTION – Learning, Types of Learning, Well defined learning problems, Designing
a Learning System, History of ML, Introduction of Machine Learning Approaches – (Artificial
I 08
Neural Network, Clustering, Reinforcement Learning, Decision Tree Learning, Bayesian
networks, Support Vector Machine, Genetic Algorithm), Issues in Machine Learning and Data
Science Vs Machine Learning;
REGRESSION: Linear Regression and Logistic Regression
BAYESIAN LEARNING - Bayes theorem, Concept learning, Bayes Optimal Classifier, Naïve
II Bayes classifier, Bayesian belief networks, EM algorithm. 08
SUPPORT VECTOR MACHINE: Introduction, Types of support vector kernel – (Linear
kernel, polynomial kernel,and Gaussiankernel), Hyperplane – (Decision surface), Properties of
SVM, and Issues in SVM.
DECISION TREE LEARNING - Decision tree learning algorithm, Inductive bias, Inductive
inference with decision trees, Entropy and information theory, Information gain, ID-3 Algorithm,
III 08
Issues in Decision tree learning.
INSTANCE-BASED LEARNING – k-Nearest Neighbour Learning, Locally Weighted
Regression, Radial basis function networks, Case-based learning.
ARTIFICIAL NEURAL NETWORKS – Perceptron’s, Multilayer perceptron, Gradient
descent and the Delta rule, Multilayer networks, Derivation of Backpropagation Algorithm,
Generalization, Unsupervised Learning – SOM Algorithm and its variant;
IV DEEP LEARNING - Introduction,concept of convolutional neural network , Types of layers – 08
(Convolutional Layers , Activation function , pooling , fully connected) , Concept of
Convolution (1D and 2D) layers, Training of network, Case study of CNN for eg on Diabetic
Retinopathy, Building a smart speaker, Self-deriving car etc.
REINFORCEMENT LEARNING–Introduction to Reinforcement Learning , Learning
Task,Example of Reinforcement Learning in Practice, Learning Models for Reinforcement –
(Markov Decision process , Q Learning - Q Learning function, Q Learning Algorithm ),
V 08
Application of Reinforcement Learning,Introduction to Deep Q Learning.
GENETIC ALGORITHMS: Introduction, Components, GA cycle of reproduction, Crossover,
Mutation, Genetic Programming, Models of Evolution and Learning, Applications.

Text books:
1. Tom M. Mitchell, ―Machine Learning, McGraw-Hill Education (India) Private Limited, 2013.
2. Ethem Alpaydin, ―Introduction to Machine Learning (Adaptive Computation and
Machine Learning), The MIT Press 2004.
3. Stephen Marsland, ―Machine Learning: An Algorithmic Perspective, CRC Press, 2009.
4. Bishop, C., Pattern Recognition and Machine Learning. Berlin: Springer-Verlag.

13
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Design and Analysis of Algorithm (BCS-503)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to:

Design new algorithms, prove them correct, and analyze their asymptotic and absolute runtime K4, K6
CO 1
and memory demands.
Find an algorithm to solve the problem (create) and prove that the algorithm solves the problem K5, K6
CO 2
correctly (validate).
Understand the mathematical criterion for deciding whether an algorithm is efficient, and know K2, K5
CO 3
many practically important problems that do not admit any efficient algorithms.
CO 4 Apply classical sorting, searching, optimization and graph algorithms. K2, K4

Understand basic techniques for designing algorithms, including the techniques of recursion, K2, K3
CO 5
divide-and-conquer, and greedy.
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of
I Functions, Performance Measurements, Sorting and Order Statistics - Shell Sort, Quick Sort, Merge 08
Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time.
Advanced Data Structures: Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci Heaps,
II 08
Tries, Skip List
Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull and
Searching.
III Greedy Methods with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum 08
Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths - Dijkstra’s and
Bellman Ford Algorithms.
Dynamic Programming with Examples Such as Knapsack. All Pair Shortest Paths – Warshal’s and
Floyd’s Algorithms, Resource Allocation Problem.
IV 08
Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph
Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets.
Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NP-
V 08
Completeness, Approximation Algorithms and Randomized Algorithms
Text books:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of
India.
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
3. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
4. LEE "Design & Analysis of Algorithms (POD)",McGraw Hill
5. Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning
6. Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
7. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples,
Second Edition, Wiley, 2006.
8. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997
9. Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011.
10. Harsh Bhasin,”Algorithm Design and Analysis”,First Edition,Oxford University Press.
11. Gilles Brassard and Paul Bratley,Algorithmics:Theory and Practice,Prentice Hall,1995.

7
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)