DR. A.P.J.

ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW

B.TECH (COMPUTER SCIENCE & ENGINEERING/ COMPUTER SCIENCE)

CURRICULUM STRUCTURE
SEMESTER- V

End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE

Database Management
1 BCS501 3 1 0 20 10 30 70 100 4
System

2 BCS502 Web Technology 3 1 0 20 10 30 70 100 4

Design and Analysis of

3 BCS503 3 1 0 20 10 30 70 100 4
Algorithm

Deptt-
4 Departmental Elective-I 3 0 0 20 10 30 70 100 3
Elective-I

Deptt.-
5 Departmental Elective-II 3 0 0 20 10 30 70 100 3
Elective-II

Database Management
6 BCS551 0 0 2 50 50 100 1
System Lab

7 BCS552 Web Technology Lab 0 0 2 50 50 100 1

Design and Analysis of

8 BCS553 0 0 2 50 50 100 1
Algorithm Lab

Mini Project or Internship

9 BCS554 0 0 2 100 100 2
Assessment*

Constitution of India/
10 BNC501/ Essence of Indian 2 0 0 20 10 30 70
BNC502 Traditional Knowledge
Total 17 3 8 900 23

*The Mini Project or internship (4 weeks) conducted during summer break after IV semester and will be assessed during
V semester.

Minor Degree/Honors Degree MT-1/HT-1

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 2
DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW

B.TECH (COMPUTER SCIENCE & ENGINEERING/ COMPUTER SCIENCE)

CURRICULUM STRUCTURE

SEMESTER- VI
End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE

1 BCS601 Software Engineering 3 1 0 20 10 30 70 100 4

2 BCS602 Compiler Design 3 1 0 20 10 30 70 100 4

3 BCS603 Computer Networks 3 1 0 20 10 30 70 100 4

Deptt-
4 Departmental Elective-III 3 0 0 20 10 30 70 100 3
Elective-III

5 Open Elective-I 3 0 0 20 10 30 70 100 3

6 BCS651 Software Engineering Lab 0 0 2 50 50 100 1

7 BCS652 Compiler Design Lab 0 0 2 50 50 100 1

8 BCS653 Computer Networks Lab 0 0 2 50 50 100 1

Constitution of India/
9 BNC601/ Essence of Indian Traditional 2 0 0 20 10 30 70
BNC602 Knowledge
Total 17 3 6 800 21

Minor Degree/Honors
Degree MT-1/HT-1

Departmental Elective-I
1. BCS-051 Statistical Computing
2. BCS-052 Data Analytics
3. BCS-053 Computer Graphics
4. BCS-054 Object Oriented System Design with C++

Departmental Elective-II
5. BCS-055 Machine Learning Techniques
6. BCS-056 Application of Soft Computing
7. BCS-057 Image Processing
8. BCS-058 Data Warehousing & Data Mining

Departmental Elective-III
1. BCS-061 Big Data
2. BCS-062 Augmented & Virtual Reality
3. BCS-063 Blockchain Architecture Design
4. BCS-064 Data Compression

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 3
DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
B.TECH (CS, Computer Engineering and CSE) FIFTH SEMESTER 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: CS, Computer Engineering and CSE (V & VI Semester) 4
DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
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

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 5
DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
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.

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 6
DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW

Design and Analysis of Algorithm (BCS503)

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.

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 7