DR. A.P.J.

ABDUL KALAM TECHNICAL UNIVERSITY,

UTTAR PRADESH, LUCKNOW

EVALUATION SCHEME & SYLLABUS

FOR
B. TECH. THIRD YEAR

• Computer Science

• Computer Engineering

• Computer Science and Engineering

Based On

NEP2020

(Effective from the Session: 2024-25)

 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) SIXTH SEMESTER SYLLABUS

Software Engineering (BCS601)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to

Explain various software characteristics and analyze different software Development

CO 1 K1, K2
Models

Demonstrate the contents of a SRS and apply basic software quality assurance practices to
CO 2 K1, K2
ensure that design, development meet or exceed applicable standards

CO 3 Compare and contrast various methods for software design. K2, K3

Formulate testing strategy for software systems, employ techniques such as unit testing, Test
CO 4 K3
driven development and functional testing

Manage software development process independently as well as in teams and make use of
CO 5 K5
Various software management tools for development, maintenance and analysis.
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Introduction to Software Engineering, Software Components, Software
Characteristics, Software Crisis, Software Engineering Processes, Similarity and Differences from
I Conventional Engineering Processes, Software Quality Attributes. Software Development Life Cycle 08
(SDLC) Models: Water Fall Model, Prototype Model, Spiral Model, Evolutionary
Development Models, Iterative Enhancement Models.
Software Requirement Specifications (SRS): Requirement Engineering Process: Elicitation,
Analysis, Documentation, Review and Management of User Needs, Feasibility Study, Information
II Modelling, Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables, SRS Document, 08
IEEE Standards for SRS. Software Quality Assurance (SQA): Verification and Validation, SQA
Plans, Software Quality Frameworks, ISO 9000 Models, SEI-CMM Model.
Software Design: Basic Concept of Software Design, Architectural Design, Low Level Design:
Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion
III Measures, Design Strategies: Function Oriented Design, Object Oriented Design, Top-Down and 08
Bottom-Up Design. Software Measurement and Metrics: Various Size Oriented Measures:
Halestead’s Software Science, Function Point (FP) Based Measures, Cyclomatic Complexity
Measures: Control Flow Graphs.
Software Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing,
Regression Testing, Testing for Functionality and Testing for Performance, TopDown and Bottom-
Up Testing Strategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing),
IV Functional Testing (Black Box Testing), Test Data Suit Preparation, Alpha and Beta Testing of 08
Products. Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk Through, Code
Inspection, Compliance with Design and Coding Standards.
Software Maintenance and Software Project Management: Software as an Evolutionary Entity,
Need for Maintenance, Categories of Maintenance: Preventive, Corrective and Perfective
Maintenance, Cost of Maintenance, Software Re- Engineering, Reverse Engineering. Software
V Configuration Management Activities, Change Control Process, Software Version Control, An 08
Overview of CASE Tools. Estimation of Various Parameters such as Cost, Efforts,
Schedule/Duration, Constructive Cost Models (COCOMO), Resource Allocation Models, Software
Risk Analysis and Management.

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 22
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
Text books:
1. RS Pressman, Software Engineering: A Practitioners Approach, McGraw Hill.
2. Pankaj Jalote, Software Engineering, Wiley
3. Rajib Mall, Fundamentals of Software Engineering, PHI Publication.
4. KK Aggarwal and Yogesh Singh, Software Engineering, New Age International Publishers.
5. Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering, PHI Publication.
6. Ian Sommerville, Software Engineering, Addison Wesley.
7. Kassem Saleh, “Software Engineering”, Cengage Learning.
8. P fleeger, Software Engineering, Macmillan Publication

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 23
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
Compiler Design (BCS602)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

CO 1 Acquire knowledge of different phases and passes of the compiler and also able to use the K3, K6
compiler tools like LEX, YACC, etc. Students will also be able to design different types of
compiler tools to meet the requirements of the realistic constraints of compilers.
CO 2 Understand the parser and its types i.e. Top-Down and Bottom-up parsers and construction of LL, K2, K6
SLR, CLR, and LALR parsing table.
CO 3 Implement the compiler using syntax-directed translation method and get knowledge about the K4, K5
synthesized and inherited attributes.
CO 4 Acquire knowledge about run time data structure like symbol table organization and different K2, K3
techniques used in that.
CO 5 Understand the target machine’s run time environment, its instruction set for code generation and K2, K4
techniques used for code optimization.
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Introduction to Compiler: Phases and passes, Bootstrapping, Finite state machines and regular
expressions and their applications to lexical analysis, Optimization of DFA-Based Pattern Matchers
implementation of lexical analyzers, lexical-analyzer generator, LEX compiler, Formal grammars and
I their application to syntax analysis, BNF notation, ambiguity, YACC. The syntactic specification of
08
programming languages: Context free grammars, derivation and parse trees, capabilities of CFG.
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top down
parsing, predictive parsers Automatic Construction of efficient Parsers: LR parsers, the canonical
II Collection of LR(0) items, constructing SLR parsing tables, constructing Canonical LR parsing tables, 08
Constructing LALR parsing tables, using ambiguous grammars, an automatic parser generator,
implementation of LR parsing tables.
Syntax-directed Translation: Syntax-directed Translation schemes, Implementation of Syntax-
directed Translators, Intermediate code, postfix notation, Parse trees & syntax trees, three address
III code, quadruple & triples, translation of assignment statements, Boolean expressions, statements that 08
alter the flow of control, postfix translation, translation with a top down parser. More about
translation: Array references in arithmetic expressions, procedures call, declarations and case
statements.
Symbol Tables: Data structure for symbols tables, representing scope information. Run-Time
Administration: Implementation of simple stack allocation scheme, storage allocation in block
IV structured language. Error Detection & Recovery: Lexical Phase errors, syntactic phase errors semantic 08
errors.
Code Generation: Design Issues, the Target Language. Addresses in the Target Code, Basic Blocks
and Flow Graphs, Optimization of Basic Blocks, Code Generator. Code optimization: Machine-
Independent Optimizations, Loop optimization, DAG representation of basic blocks, value numbers
V 08
and algebraic laws, Global Data-Flow analysis.
Text books:
1. Aho, Sethi & Ullman, "Compilers: Principles, Techniques and Tools”, Pearson Education
2. K. Muneeswaran,Compiler Design,First Edition,Oxford University Press
3 .J.P. Bennet, “Introduction to Compiler Techniques”, Second Edition, McGraw-Hill,2003.
4. Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building with C”, PHI, 2001.
5. V Raghvan, “ Principles of Compiler Design”, McGraw-Hill,
6. Kenneth Louden,” Compiler Construction”, Cengage Learning.
7 .Charles Fischer and Ricard LeBlanc,” Crafting a Compiler with C”, Pearson Education

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 24
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
Computer Networks (BCS603)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

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

Explain basic concepts, OSI reference model, services and role of each layer of OSI model and
CO 1 K1,K2
TCP/IP, networks devices and transmission media, Analog and digital data transmission
CO 2 Apply channel allocation, framing, error and flow control techniques. K3
Describe the functions of Network Layer i.e. Logical addressing, subnetting & Routing
CO 3 K2,K3
Mechanism.
Explain the different Transport Layer function i.e. Port addressing, Connection Management,
CO 4 K2,K3
Error control and Flow control mechanism.
CO 5 Explain the functions offered by session and presentation layer and their Implementation. K2,K3
Explain the different protocols used at application layer i.e. HTTP, SNMP, SMTP, FTP,
CO 6 K2
TELNET and VPN.
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Introductory Concepts: Goals and applications of networks, Categories of networks, Organization
of the Internet, ISP, Network structure and architecture (layering principles, services, protocols and
standards), The OSI reference model, TCP/IP protocol suite, Network devices and components.
I Physical Layer:
08
Network topology design, Types of connections, Transmission media, Signal transmission and
encoding, Network performance and transmission impairments, Switching techniques and
multiplexing.

Link layer: Framing, Error Detection and Correction, Flow control (Elementary Data Link
II Protocols, Sliding Window protocols). 08
Medium Access Control and Local Area Networks: Channel allocation, Multiple access protocols,
LAN standards, Link layer switches & bridges (learning bridge and spanning tree algorithms).
Network Layer: Point-to-point networks, Logical addressing, Basic internetworking (IP, CIDR,
III 08
ARP, RARP, DHCP, ICMP), Routing, forwarding and delivery, Static and dynamic routing,
Routing algorithms and protocols, Congestion control algorithms, IPv6.
Transport Layer: Process-to-process delivery, Transport layer protocols (UDP and TCP),
IV 08
Multiplexing, Connection management, Flow control and retransmission, Window management,
TCP Congestion control, Quality of service.
Application Layer: Domain Name System, World Wide Web and Hyper Text Transfer Protocol,
V 08
Electronic mail, File Transfer Protocol, Remote login, Network management, Data compression,
Cryptography – basic concepts.
Text books and References:
1. Behrouz Forouzan, “Data Communication and Networking”, McGraw Hill
2. Andrew Tanenbaum “Computer Networks”, Prentice Hall.
3. William Stallings, “Data and Computer Communication”, Pearson.
4. Kurose and Ross, “Computer Networking- A Top-Down Approach”, Pearson.
5. Peterson and Davie, “Computer Networks: A Systems Approach”, Morgan Kaufmann
6. W. A. Shay, “Understanding Communications and Networks”, Cengage Learning.
7. D. Comer, “Computer Networks and Internets”, Pearson.
8. Behrouz Forouzan, “TCP/IP Protocol Suite”, McGraw Hill.

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 25
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
Big Data (BCS061)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

CO 1 Demonstrate knowledge of Big Data Analytics concepts and its applications in business. K1,K2

CO 2 Demonstrate functions and components of Map Reduce Framework and HDFS. K1,K2

CO 3 Discuss Data Management concepts in NoSQL environment. K6

CO 4 Explain process of developing Map Reduce based distributed processing applications. K2,K5

CO 5 Explain process of developing applications using HBASE, Hive, Pig etc. K2,K5

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lectures
Introduction to Big Data: Types of digital data, history of Big Data innovation, introduction
to Big Data platform, drivers for Big Data, Big Data architecture and characteristics, 5 Vs of
Big Data, Big Data technology components, Big Data importance and applications, Big Data
I
features – security, compliance, auditing and protection, Big Data privacy and ethics, Big 06
Data Analytics, Challenges of conventional systems, intelligent data analysis, nature of data,
analytic processes and tools, analysis vs reporting,
modern data analytic tools.
Hadoop: History of Hadoop, Apache Hadoop, the Hadoop Distributed File System,
components of Hadoop, data format, analyzing data with Hadoop, scaling out, Hadoop
streaming, Hadoop pipes, Hadoop Echo System.
II 08
Map Reduce: Map Reduce framework and basics, how Map Reduce works, developing a
Map Reduce application, unit tests with MR unit, test data and local tests, anatomy of a Map
Reduce job run, failures, job scheduling, shuffle and sort, task execution, Map Reducetypes,
input formats, output formats, Map Reduce features, Real-world Map Reduce
HDFS (Hadoop Distributed File System): Design of HDFS, HDFS concepts, benefits and
challenges, file sizes, block sizes and block abstraction in HDFS, data replication, how does
HDFS store, read, and write files, Java interfaces to HDFS, command line interface, Hadoop
III file system interfaces, data flow, data ingest with Flume and Scoop, Hadoop archives, 08
Hadoop I/O: compression, serialization, Avro and file-based data structures.
Hadoop Environment: Setting up a Hadoop cluster, cluster specification, cluster setup
and installation, Hadoop configuration, security in Hadoop, administering Hadoop, HDFS
monitoring & maintenance, Hadoop benchmarks, Hadoop in the cloud
Hadoop Eco System and YARN: Hadoop ecosystem components, schedulers, fair and
capacity, Hadoop 2.0 New Features - NameNode high availability, HDFS federation,MRv2,
YARN, Running MRv1 in YARN.
NoSQL Databases: Introduction to NoSQL
IV MongoDB: Introduction, data types, creating, updating and deleing documents, querying, 09
introduction to indexing, capped collections
Spark: Installing spark, spark applications, jobs, stages and tasks, Resilient Distributed
Databases, anatomy of a Spark job run, Spark on YARN
SCALA: Introduction, classes and objects, basic types and operators, built-in control
structures, functions and closures, inheritance.
Hadoop Eco System Frameworks: Applications on Big Data using Pig, Hive and HBase
V 09
Pig - Introduction to PIG, Execution Modes of Pig, Comparison of Pig with Databases,
Grunt, Pig Latin, User Defined Functions, Data Processing operators,
Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 26
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
Hive - Apache Hive architecture and installation, Hive shell, Hive services, Hive metastore,
comparison with traditional databases, HiveQL, tables, querying data and user defined
functions, sorting and aggregating, Map Reduce scripts, joins & subqueries.
HBase – Hbase concepts, clients, example, Hbase vs RDBMS, advanced usage, schema
design, advance indexing, Zookeeper – how it helps in monitoring a cluster, how to build
applications with Zookeeper.
IBM Big Data strategy, introduction to Infosphere, BigInsights and Big Sheets, introduction
to Big SQL.
Text books and References:
1. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics: Emerging Business
Intelligence and Analytic Trends for Today's Businesses", Wiley
2. DT Editorial Services, Big-Data Black Book, Wiley
3. Dirk deRoos, Chris Eaton, George Lapis, Paul Zikopoulos, Tom Deutsch, “Understanding Big Data Analytics for
Enterprise Class Hadoop and Streaming Data”, McGraw Hill.
4. Thomas Erl, Wajid Khattak, Paul Buhler, “Big Data Fundamentals: Concepts, Drivers and Techniques”, Prentice
Hall.
5. Bart Baesens “Analytics in a Big Data World: The Essential Guide to Data Science and its Applications (WILEY
Big Data Series)”, John Wiley & Sons
6. ArshdeepBahga, Vijay Madisetti, “Big Data Science & Analytics: A HandsOn Approach “, VPT
7. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, CUP
8. Tom White, "Hadoop: The Definitive Guide", O'Reilly.
9. Eric Sammer, "Hadoop Operations", O'Reilly.
10. Chuck Lam, “Hadoop in Action”, MANNING Publishers
11. Deepak Vohra, “Practical Hadoop Ecosystem: A Definitive Guide to Hadoop-Related Frameworks and Tools”,
Apress
12. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilly
13. Lars George, "HBase: The Definitive Guide", O'Reilly.
14. Alan Gates, "Programming Pig", O'Reilly.
15. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer
16. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced
Analytics”, John Wiley & sons
17. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons
18. Pete Warden, “Big Data Glossary”, O’Reilly

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

Augmented & Virtual Reality (BCS062)

Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able :

To understand the basic concept and apply framework of virtual reality. K1 , K2,
CO 1
K3
To understand and analyze the principles and multidisciplinary features of virtual K2 , K4
CO 2 reality.

To understand and apply the technology for multimodal user interaction and K2 , K3
CO 3 perceptionin VR, in particular the visual, audial and haptic interface and behavior.

To understand and apply the technology for managing large scale VR environment K2 , K3
CO 4 inreal time.

To know an introduction to the AR system framework and apply AR tools in K2 , K3,

CO 5 softwaredevelopment.

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
VIRTUAL REALITY AND VIRTUAL ENVIRONMENTS: The historical development of
VR: Scientific landmarks Computer Graphics, Real-time computer graphics, Flight simulation,
I Virtual environments, Requirements for VR, benefits of Virtual reality. 08
HARDWARE TECHNOLOGIES FOR 3D USER INTERFACES: Visual Displays Auditory
Displays, Haptic Displays, Choosing Output Devices for 3D User Interfaces.
3D USER INTERFACE INPUT HARDWARE: Input device characteristics, Desktop input
II devices, Tracking Devices, 3D Mice, Special Purpose Input Devices, Direct Human Input, Home 08
- Brewed Input Devices, Choosing Input Devices for 3D Interfaces.
SOFTWARE TECHNOLOGIES: Database - World Space, World Coordinate, World
Environment, Objects - Geometry, Position / Orientation, Hierarchy, Bounding Volume, Scripts
and other attributes, VR Environment - VR Database, Tessellated Data, LODs, Cullers and
III 08
Occluders, Lights and Cameras, Scripts, Interaction - Simple, Feedback, Graphical User Interface,
Control Panel, 2D Controls, Hardware Controls, Room / Stage / Area Descriptions, World
Authoring and Playback, VR toolkits, Available software in the market

3D INTERACTION TECHNIQUES: 3D Manipulation tasks, Manipulation Techniques and

Input Devices, Interaction Techniques for 3D Manipulation, Deign Guidelines - 3D Travel Tasks,
Travel Techniques, Design Guidelines - Theoretical Foundations of Wayfinding, User Centered
Wayfinding Support, Environment Centered Wayfinding Support, Evaluating Wayfinding Aids,
Design Guidelines - System Control, Classification, Graphical Menus, Voice Commands, Gestrual
IV Commands, Tools, Mutimodal System Control Techniques, Design Guidelines, Case Study: 08
Mixing System Control Methods, Symbolic Input Tasks, symbolic Input Techniques, Design
Guidelines, Beyond Text and Number entry .
DESIGNING AND DEVELOPING 3D USER INTERFACES: Strategies for Designing and
Developing Guidelines and Evaluation.
VIRTUAL REALITY APPLICATIONS: Engineering, Architecture, Education, Medicine,
Entertainment, Science, Training.

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 28
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
Augmented and Mixed Reality, Taxonomy, technology and features of augmented reality,
V difference between AR and VR, Challenges with AR, AR systems and functionality, Augmented
reality methods, visualization techniques for augmented reality, wireless displays in educational 08
augmented reality applications, mobile projection interfaces, marker-less tracking for augmented
reality, enhancing interactivity in AR environments, evaluating AR systems.

Text books:
1. Alan B Craig, William R Sherman and Jeffrey D Will, “Developing Virtual Reality
Applications: Foundations ofEffective Design”, Morgan Kaufmann, 2009.
2. Gerard Jounghyun Kim, “Designing Virtual Systems: The Structured Approach”, 2005.
3. Doug A Bowman, Ernest Kuijff, Joseph J LaViola, Jr and Ivan Poupyrev, “3D User
Interfaces, Theory and Practice”,Addison Wesley, USA, 2005.
4. Oliver Bimber and Ramesh Raskar, “Spatial Augmented Reality: Meging Real and Virtual
Worlds”, 2005.
5. Burdea, Grigore C and Philippe Coiffet, “Virtual Reality Technology”, Wiley Interscience,
India, 2003.
6. John Vince, “Virtual Reality Systems”, Addison Wesley, 1995.
7. Howard Rheingold, “Virtual Reality: The Revolutionary Technology and how it Promises
to Transform Society”,Simon and Schuster, 1991.
8. William R Sherman and Alan B Craig, “Understanding Virtual Reality: Interface,
Application and Design (TheMorgan Kaufmann Series in Computer Graphics)”. Morgan
Kaufmann Publishers, San Francisco, CA, 2002
9. Alan B. Craig, Understanding Augmented Reality, Concepts and Applications, Morgan
Kaufmann, 2013.

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

Blockchain Architecture Design (BCS063)

Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

CO 1 Describe the basic understanding of Blockchain architecture along with its primitive. K1, K2

CO 2 Explain the requirements for basic protocol along with scalability aspects. K2, K3

CO 3 Design and deploy the consensus process using frontend and backend. K3, K4

Apply Blockchain techniques for different use cases like Finance, Trade/Supply and
CO 4 Government activities. K4, K5

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Introduction to Blockchain: Digital Money to Distributed Ledgers, Design Primitives: Protocols,
I Security, Consensus, Permissions, Privacy. 08
Blockchain Architecture and Design: Basic crypto primitives: Hash, Signature,) Hashchain to
Blockchain, Basic consensus mechanisms
Consensus: Requirements for the consensus protocols, Proof of Work (PoW), Scalability aspects of
II Blockchain consensus protocols 08
Permissioned Blockchains:Design goals, Consensus protocols for Permissioned Blockchains
Hyperledger Fabric (A): Decomposing the consensus process , Hyperledger fabric components,
III Chaincode Design and Implementation 08
Hyperledger Fabric (B): Beyond Chaincode: fabric SDK and Front End (b) Hyperledger
composer tool
Use case 1 : Blockchain in Financial Software and Systems (FSS): (i) Settlements, (ii) KYC, (iii)
IV Capital markets, (iv) Insurance 08
Use case 2: Blockchain in trade/supply chain: (i) Provenance of goods, visibility, trade/supply
chain finance, invoice management discounting, etc
Use case 3: Blockchain for Government: (i) Digital identity, land records and other kinds of record
V keeping between government entities, (ii) public distribution system social welfare systems 08
Blockchain Cryptography, Privacy and Security on Blockchain
Text books:
1. Mstering Bitcoin: Unlocking Digital Cryptocurrencies, by Andreas Antonopoulos
2. Blockchain by Melanie Swa, O’Reilly
3. Hyperledger Fabric - https://www.hyperledger.org/projects/fabric
4. Zero to Blockchain - An IBM Redbooks course, by Bob Dill, David Smits -
https://www.redbooks.ibm.com/Redbooks.nsf/RedbookAbstracts/crse0401.html

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

Data Compression (BCS064)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

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

Describe the evolution and fundamental concepts of Data Compression and Coding K1, K2
CO 1 Techniques.
Apply and compare different static coding techniques (Huffman & Arithmetic coding) for text K2, K3
CO 2 compression.
Apply and compare different dynamic coding techniques (Dictionary Technique) for text K2, K3
CO 3 compression.

CO 4 Evaluate the performance of predictive coding technique for Image Compression. K2, K3

CO 5 Apply and compare different Quantization Techniques for Image Compression. K2,K3

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Compression Techniques: Loss less compression, Lossy Compression, Measures of performance,
I Modeling and coding, Mathematical Preliminaries for Lossless compression: A brief introduction to 08
information theory, Models: Physical models, Probability models, Markov models, composite source
model, Coding: uniquely decodable codes, Prefix codes.
The Huffman coding algorithm: Minimum variance Huffman codes, Adaptive Huffman coding:
II Update procedure, Encoding procedure, Decoding procedure. Golomb codes, Rice codes, Tunstall 08
codes, Applications of Hoffman coding: Loss less image compression, Text compression, Audio
Compression.
Coding a sequence, Generating a binary code, Comparison of Binary and Huffman coding,
Applications: Bi-level image compression-The JBIG standard, JBIG2, Image compression.
Dictionary Techniques: Introduction, Static Dictionary: Diagram Coding, Adaptive Dictionary. The
LZ77 Approach, The LZ78 Approach, Applications: File Compression-UNIX compress, Image 08
III Compression: The Graphics Interchange Format (GIF), Compression over Modems: V.42 bits,
Predictive Coding: Prediction with Partial match (ppm): The basic algorithm, The ESCAPE
SYMBOL, length of context, The Exclusion Principle, The Burrows-Wheeler Transform: Moveto-
front coding, CALIC, JPEG-LS, Multi-resolution Approaches, Facsimile Encoding, Dynamic
Markoy Compression.
IV Distortion criteria, Models, Scalar Ouantization: The Quantization problem, Uniform Quantizer, 08
Adaptive Quantization, Non uniform Quantization.

V Advantages of Vector Quantization over Scalar Quantization, The Linde-Buzo-Gray Algorithm, 08

Tree structured Vector Quantizers. Structured VectorQuantizers.
Text books:
1. Khalid Sayood, Introduction to Data Compression, Morgan Kaufmann Publishers
2. Elements of Data Compression,Drozdek, Cengage Learning
3. Introduction to Data Compression, Second Edition, Khalid Sayood,The Morgan aufmann Series
4. Data Compression: The Complete Reference 4th Edition byDavid Salomon, Springer
5. Text Compression1st Edition by Timothy C. Bell Prentice Hall

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 31
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
Software Engineering Lab (BCS651)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

Identify ambiguities, inconsistencies and incompleteness from a requirements specification and K2, K4
CO 1
state functional and non-functional requirement

Identify different actors and use cases from a given problem statement and draw use case K3, K5
CO 2
diagram to associate use cases with different types of relationship

CO 3 Draw a class diagram after identifying classes and association among them K4, K5

Graphically represent various UML diagrams, and associations among them and K4, K5
CO 4 identify the logical sequence of activities undergoing in a system, and represent them
pictorially

CO 5 Able to use modern engineering tools for specification, design, implementation and testing K3, K4

DETAILED SYLLABUS
For any given case/ problem statement do the following;
1. Prepare a SRS document in line with the IEEE recommended standards.
2. Draw the use case diagram and specify the role of each of the actors. Also state the precondition, post
condition and function of each use case.
3. Draw the activity diagram.
4. Identify the classes. Classify them as weak and strong classes and draw the class diagram.
5. Draw the sequence diagram for any two scenarios.
6. Draw the collaboration diagram.
7. Draw the state chart diagram.
8. Draw the component diagram.
9. Perform forward engineering in java. (Model to code conversion)
10. Perform reverse engineering in java. (Code to Model conversion) 11. Draw the deployment diagram.

Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab ( Open Office , Libra ,
Junit, Open Project , GanttProject , dotProject, AgroUML, StarUML etc. )
Software Engineering Lab (BCS-651): Mapping with Virtual Lab

Name of the Lab Name of the Experiment

Identifying the Requirements from Problem Statements
Estimation of Project Metrics
Modeling UML Use Case Diagrams and Capturing Use Case Scenarios
E-R Modeling from the Problem Statements
Identifying Domain Classes from the Problem Statements
Software Engineering Lab (BCS-651)
Statechart and Activity Modeling
Modeling UML Class Diagrams and Sequence diagrams
Modeling Data Flow Diagrams
Estimation of Test Coverage Metrics and Structural Complexity
Designing Test Suites
Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 32
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW

Compiler Design Lab (BCS652)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

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

Identify patterns, tokens & regular expressions for lexical analysis. K2, K4
CO 1
Design Lexical analyser for given language using C and LEX /YACC tools K3, K5
CO 2
Design and analyze top down and bottom up parsers. K4, K5
CO 3
Generate the intermediate code K4, K5
CO 4
Generate machine code from the intermediate code forms K3, K4
CO 5

DETAILED SYLLABUS
1. Design and implement a lexical analyzer for given language using C and the lexical analyzer should ignore
redundant spaces, tabs and new lines.
2. Implementation of Lexical Analyzer using Lex Tool
3. Generate YACC specification for a few syntactic categories.
a) Program to recognize a valid arithmetic expression that uses operator +, – , * and /.
b) Program to recognize a valid variable which starts with a letter followed by any number of letters or digits.
c) Implementation of Calculator using LEX and YACC
d) Convert the BNF rules into YACC form and write code to generate abstract syntax tree
4. Write program to find ε – closure of all states of any given NFA with ε transition.
5. Write program to convert NFA with ε transition to NFA without ε transition.
6. Write program to convert NFA to DFA
7. Write program to minimize any given DFA.
8. Develop an operator precedence parser for a given language.
9. Write program to find Simulate First and Follow of any given grammar.
10. Construct a recursive descent parser for an expression.
11. Construct a Shift Reduce Parser for a given language.
12. Write a program to perform loop unrolling.
13. Write a program to perform constant propagation.
14. Implement Intermediate code generation for simple expressions.
15. Implement the back end of the compiler which takes the three address code and produces the 8086 assembly
language instructions that can be assembled and run using an 8086 assembler. The target assembly instructions can
be simple move, add, sub, jump etc.
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab (R , Python etc. )

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

Computer Networks Lab (BCS653)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

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

CO 1 Simulate different network topologies. K3,K4

CO 2 Implement various framing methods of Data Link Layer. K3,K4

CO 3 Implement various Error and flow control techniques. K3,K4

CO 4 Implement network routing and addressing techniques. K3, K4

CO 5 Implement transport and security mechanisms K3, K4

DETAILED SYLLABUS
1. Implementation of Stop and Wait Protocol and Sliding Window Protocol.
2. Study of Socket Programming and Client – Server model
3. Write a code simulating ARP /RARP protocols.
4. Write a code simulating PING and TRACEROUTE commands
5. Create a socket for HTTP for web page upload and download.
6. Write a program to implement RPC (Remote Procedure Call)
7. Implementation of Subnetting .
8. Applications using TCP Sockets like
a. Echo client and echo server b. Chat c. File Transfer
9. Applications using TCP and UDP Sockets like d. DNS e. SNMP f. File Transfer
10. Study of Network simulator (NS).and Simulation of Congestion Control Algorithms using NS

11. Perform a case study about the different routing algorithms to select the network path with its optimum and
economical during data transfer. i. Link State routing ii. Flooding iii. Distance vector
12. To learn handling and configuration of networking hardware like RJ-45 connector, CAT-6 cable, crimping tool,
etc.
13. Configuration of router, hub, switch etc. (using real devices or simulators)
14. Running and using services/commands like ping, traceroute, nslookup, arp, telnet, ftp, etc.
15. Network packet analysis using tools like Wireshark, tcpdump, etc.
16. Network simulation using tools like Cisco Packet Tracer, NetSim, OMNeT++, NS2, NS3, etc.
17. Socket programming using UDP and TCP (e.g., simple DNS, data & time client/server, echo client/server, iterative
& concurrent servers)
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab ( C , C++ , Java , NS3,
Mininet, Opnet, TCP Dump, Wireshark etc.

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 34
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
Open Electives to be offered by the CSE/CS/IT/CSI Branches

Open Elective-1
BOE-067 Basics of Data Base Management System

BOE-068 Software Project Management

Basics of Data Base Management System (BOE067)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

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

Describe the features of a database system and its application and compare various
CO 1 K2
types of data models.
Construct an ER Model for a given problem and transform it into a relation database
CO 2 K5, K6
schema.
Formulate solution to a query problem using SQL Commands, relational algebra, tuple
CO 3 K5, K6
calculus and domain calculus.
CO 4 Explain the need of normalization and normalize a given relation to the desired normal form. K2, K3

CO 5 Explain different approaches of transaction processing and concurrency control. K2

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Introduction: An overview of database management system, database system vs file system,
database system concepts and architecture, views of data – levels of abstraction, data models, schema
and instances, data independence, database languages and interfaces, data definition languages,
DML, overall database structure, transaction management, storage management, database users and
I administrator. 08
Data Modeling using the 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, relationships of higher
degree.
Relational Database Concepts: Introduction to relational database, relational database structure,
relational model terminology – domains, attributes, tuples, relations & relationaldatabase schema,
integrity constraints, entity integrity, referential integrity, keys constraints, domain constraints,
Relational algebra - relational calculus, tuple and domain calculus, basic operations – selection
II and projection, set-theoretic operations, join operations. 08
Data Base Design & Normalization: Functional dependencies, normal forms, first, second, &
third normal forms, BCNF, inclusion dependence, loss less join decompositions,normalization
using FD, MVD, and JDs, alternative approaches to database design
Structured Query Language (SQL): Basics of SQL, DDL, DML, DCL, advantage of SQL, SQL
data type and literals, types of SQL commands, SQL operators and theirprocedure, tables – creation
III & alteration, defining constraints, views and indexes, queries and sub queries, aggregate functions, 08
built-in functions, insert, update and delete operations, joins, unions, intersection, minus, transaction
control commands.
PL/SQL: Introduction, features, syntax and constructs, SQL within Pl/SL, DML in

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 35
 DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW
PL/SQL Cursors, stored procedures, stored function, database triggers, indices
Transaction Processing Concepts: Transaction concepts, properties of transaction, testing of
serializability, Serializability of schedules, conflict & view serializable schedule, recoverability,
recovery from transaction failures, two-phase commit protocol, log based recovery, checkpoints,
IV deadlock handling. 08
Concurrency Control Techniques: Concurrency control, locking techniques for concurrency
control, time stamping protocols for concurrency control, validation based protocol, multiple
granularity, multi-version schemes, recovery with concurrent transaction.
Database Security – Types of security, system failure, backup & recovery techniques, authorization
& authentication, system policies, levels of security – physical, OS, network & DBMS, privileges –
grant & revoke.
Recent Trends in Database Management Systems: Centralized and Client-Server Architectures,
V Distributed Databases, Object-Oriented Database, Spatial & Temporal Databases, Decision Support 08
Systems, Data Analysis, Data Mining & Warehousing, Data Visualization, Mobile Databases, OODB
& XML Databases, Multimedia & Web Databases, Spatial and Geographical Databases, Web and
Mobile Databases, Active
Databases

Text Books and References:

1. Elmasri, Navathe, “Fundamentals of Database System”, Addision Wesley.

2. Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill.
3. Bipin C. Desai, “An Introduction to Database System”, Galgotia Publication.
4. Majumdar & Bhattacharya, “ Database Management System”, McGraw Hill.
5. Date C.J., “An Introduction to Database System”, Addision Wesley.
6. Ramakrishnan, Gehrke, “Database Management System”, Mc Graw Hill.
7. Atul Kahate, “Introduction to Database Management Systems”, Pearson Education.
8. Paul Beynon Davies, “Database System”, Palgrave Macmillan.
9. Bharti P.K., “ An Introduction to Database Systems”, JPNP.
10. Rajesh Narang, “Database Management System”, PHI.
11. Singh, S.K., “Database System Concepts – design & application”, Pearson Education.
12. Leon & Leon, “Database Management Systems”, Vikas Publishing House.
13. O’Neil, “Databases”, Elsevier Pub.
14. Ivan Bayross, “SQL, PL/SQL – The Programming Language of Oracle”, BPB Publications.
15. P.S. Deshpande, “SQL and PL/SQL for Oracle 10g, Black Book”, Dreamtech Press.
16. George Koch, Kevin Loney, “Oracle: The Complete Reference”, McGraw Hill.
17. Coronel, Morris and Rob, “Database Principles: Fundamentals of Design, Implementation and Management”,
Cengage Learning.
18. Gillenson, Paulraj Ponniah, “Introduction to Database Management”, Wiley.
19. G. K. Gupta, “Database Management Systems”, McGraw Hill.
20. Shraman Shah, “Oracle for Professional”, SPD.

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

Software Project Management (BOE068)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

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

CO 1 Identify project planning objectives, along with various cost/effort estimation models. K3

CO 2 Organize & schedule project activities to compute critical path for risk analysis. K3

CO 3 Monitor and control project activities. K4, K5

CO 4 Formulate testing objectives and test plan to ensure good software quality under SEI-CMM. K6

CO 5 Configure changes and manage risks using project management tools. K2, K4

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Project Evaluation and Project Planning :
Importance of Software Project Management – Activities – Methodologies – Categorization of
I 08
Software Projects – Setting objectives – Management Principles – Management Control – Project
portfolio Management – Cost-benefit evaluation technology – Risk evaluation – Strategic program
Management – Stepwise Project Planning.
Project Life Cycle and Effort Estimation :
Software process and Process Models – Choice of Process models – Rapid Application development
II 08
– Agile methods – Dynamic System Development Method – Extreme Programming– Managing
interactive processes – Basics of Software estimation – Effort and Cost estimation
techniques – COSMIC Full function points – COCOMO II – a Parametric Productivity Model.
Activity Planning and Risk Management :
Objectives of Activity planning – Project schedules – Activities – Sequencing and scheduling –
III Network Planning models – Formulating Network Model – Forward Pass & Backward Pass 08
techniques – Critical path (CRM) method – Risk identification – Assessment – Risk Planning –Risk
Management – – PERT technique – Monte Carlo simulation – Resource Allocation – Creation of
critical paths – Cost schedules.
Project Management and Control:
IV Framework for Management and control – Collection of data – Visualizing progress – Cost 08
monitoring – Earned Value Analysis – Prioritizing Monitoring – Project tracking – Change control
– Software Configuration Management – Managing contracts – Contract Management.
Staffing in Software Projects :
Managing people – Organizational behavior – Best methods of staff selection – Motivation – The
V 08
Oldham – Hackman job characteristic model – Stress – Health and Safety – Ethical and
Professional concerns – Working in teams – Decision making – Organizational structures –
Dispersed and Virtual teams – Communications genres – Communication plans – Leadership.
Text books:
1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, McGraw Hill,
New Delhi, 2012.
2. Robert K. Wysocki ―Effective Software Project Management – Wiley Publication, 2011.
3. Walker Royce: ―Software Project Management- Addison-Wesley, 1998.
4. Gopalaswamy Ramesh, ―Managing Global Software Projects – McGraw Hill Education (India), Fourteenth
Reprint 2013.

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