DR. A.P.J.

ABDUL KALAM TECHNICAL UNIVERSITY

UTTAR PRADESH, LUCKNOW

EVALUATION SCHEME & SYLLABUS

FOR
B. TECH. THIRD YEAR

Computer Science & Engineering (Cyber Security)

Based On

NEP2020

(Effective from the Session: 2024-25)

 B. TECH Computer Science and Engineering (Cyber Security)
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

BCCS051/
4 BCS052/ Departmental Elective-I 3 0 0 20 10 30 70 100 3
BCS053/
BCCS052
BCCS053/
5 BCIT054/ Departmental Elective-II 3 0 0 20 10 30 70 100 3
BCCS054/
BCCS055
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.
**It is desirable that the students should do their Summer Internship and Minor Project in their specialization area in line
with the B.Tech program.
Minor Degree/Honors Degree MT-1/HT-1
 SEMESTER- VI (Computer Science and Engineering (Cyber Security))

End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT T Tota PS TE PE
A l
1 BCS601 Software Engineering 3 1 0 20 10 30 70 100 4

2 BCCS601 Cryptography & Network 3 1 0 20 10 30 70 100 4

Security
3 BCS603 Computer Networks 3 1 0 20 10 30 70 100 4
BCCS061/
4 BCDS062/ Departmental Elective-III 3 0 0 20 10 30 70 100 3
BCS063/
BCS064
5 Open Elective-I 3 0 0 20 10 30 70 100 3

6 BCS651 Software Engineering 0 0 2 50 50 100 1

Lab
7 BCCS651 Cryptography and 0 0 2 50 50 100 1
Network Security Lab
8 BCS653 Computer Networks Lab 0 0 2 50 50 100 1
Constitution of India/
9 BNC601/ Essence of Indian 2 0 0 20 10 30 70
BNC602 Traditional Knowledge
Total 17 3 6 800 21

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

*The Mini Project or internship (4 weeks) will be done during summer break after 6th Semester and will be
assessed during 7th semester.
*It is desirable that the students should do their Summer Internship and Minor Project in their
specialization area in line with the B.Tech. program.

Departmental Elective-I
1. BCCS051 Web & Database Security
2. BCS052 Data Analytics
3. BCS053 Computer Graphics
4. BCCS052 Data Forensics

Departmental Elective-II
1. BCCS053 Cyber Crimes and Law
2. BCIT054 Artificial Intelligence
3. BCCS054 Ethical Hacking
4. BCCS055 IoT Security

Departmental Elective-III
1. BCCS061 Mobile and Wireless Security
2. BCDS062 Machine Learning Techniques
3. BCS063 Blockchain Architecture Design
4. BCS064 Data Compression
 B.TECH.
COMPUTER SCIENCE AND ENGINEERING (INTERNET OF THINGS)
FIFTH SEMESTER (DETAILED SYLLABUS)

DATABASE MANAGEMENT SYSTEM (BCS 501)

Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
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
 WEB TECHNOLOGY (BCS502)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to
CO 1 Understand the fundamental concepts of web development, including the history, protocols, and K3, K6
tools. Apply HTML and XML in the development of web projects.
CO 2 Apply CSS for designing and styling web pages, including the use of CSS properties, styling K2, K3
elements, and advanced techniques for creating responsive web sites.
CO 3 Develop interactive web applications using JavaScript and AJAX, with a focus on scripting K3, K6
documents, forms, and networking concepts such as internet addressing and TCP/IP sockets.
CO 4 Design and implement server-side applications using Enterprise Java Beans (EJB) and Node.js, K2, K4, K6
including the creation of JavaBeans, RESTful APIs, and database operations with MongoDB
CO 5 Implement web server functionality using Servlets and Java Server Pages (JSP), focusing on K2, K3, K4
handling HTTP requests, session tracking, and utilizing custom tag libraries for dynamic web
content.
DETAILED SYLLABUS 3-1-0
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 Internet services and tools,
Introduction to client-server computing.
I
Web Page Designing: HTML: List, Table, Images, Frames, forms, XML: Document type definition
08
(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, Controlling Fonts),
II Working with block elements and objects, Working with Lists and Tables, CSS Id and Class, Box Model 08
(Introduction, Border properties, Padding Properties, Margin 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, introduction to
III 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 Session
bean, Stateless Session bean, Entity bean.
IV Node.js: Introduction, Environment Setup, REPL Terminal, NPM (Node Package Manager) Callbacks 08
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, Handling HTTP
get Requests, Handling HTTP post Requests, Redirecting Requests to Other Resources, Session Tracking,
V Cookies, Session Tracking with Http Session 08
Java Server Pages (JSP): Introduction, Java Server Pages Overview, A First Java Server Page Example,
Implicit Objects, Scripting, Standard Actions, Directives, Custom Tag Libraries
 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.
 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 understand

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 ÉvaTardos, 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”,FirstEdition,Oxford University Press.
11. Gilles Brassard and Paul Bratley,Algorithmics:Theory and Practice,Prentice Hall,1995.
 Web and Database Security (BCCS051)
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able:

CO 1 Understanding Web Application Fundamentals K2

Understand various authentication techniques and identify common design and K2,K4
CO 2
implementation flaws.
CO 3 To gain proficiency in reviewing source code to identify security vulnerabilities in various K3,K4
platforms (Java, ASP.NET, PHP, Perl, Javascript, SQL) and learn about fundamental data
security requirements
Understand the mechanisms of user authentication and password protection in databases. K2,K5
CO 4
Understand how to protect the data dictionary, manage system and object privileges, and K2,
CO 5
secure data outsourcing
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
UNIT I
Web Application Basics: Introduction, HTTP Protocol, Web Functionality, Encoding Schemes,
I Enumerating Content and Functionality, Analyzing the Application ,Authentication Security: 08
Authentication Techniques, Design Flaws in Authentication, Implementation Flaws in
Authentication, Securing Authentication, Path Traversal Attacks, Injection Attacks: Injecting
into Interpreted Contexts, SQL Injection, NoSQL Injection, XPath Injection, LDAP Injection,
XML Injection, Http Injection, Mail Service Injection
UNIT II
Cross Site Scripting (XSS): Types of XSS, XSS in Real World, Finding and Exploiting XSS
Vulnerabilities, Preventing XSS Attacks, User Attacks: Inducing User Actions, Capturing
II 08
Cross-Domain Data, Client-Side Injection Attacks, Local Privacy Attacks, ActiveX Control
attacks, Browser Attacks
Unit III
Vulnerability Analysis of Source Code: Approaches to Code Review, Signatures of Common
III Vulnerabilities, Analysis of Java platform, Analysis of ASP.NET platform, Analysis of PHP, 08
Analysis of Perl, Analysis of Javascript, Analysis of SQL, Introduction To Database Security:
Fundamental Data Security Requirements, Data Security Concerns, Compliance Mandates,
Security Risks, Developing Enterprise Security Policy, Defining a Security Policy,
Implementing a Security Policy, Techniques to Enforce Security
UNIT IV
Database Access Control: User Authentication, Protecting Passwords, Creating Fixed Database
Links, Encrypting Database Link Passwords, Using Database Links Without Credentials, Using
IV Database Links And Changing Passwords, Auditing With Database Links, Restricting A 08
Database Link With Views, Trust Management & Negotiation ,
UNIT V
V Database Security Issues: Database Security Basics, Security Checklist, Reducing
Administrative Effort, Applying Security Patches, Default Security Settings, Secure Password
Support, Enforcing Password Management, Protecting The Data Dictionary, System and Object 08
Privileges, Secure Data Outsourcing, Security in Advanced Database Systems, Managing
Enterprise User Security.
Text books:
1. “The Web Application Hacker’s Handbook”, Dafydd Stuttard, Wiley India Pvt. Ltd.
2. “ Database Security” , S.Castano, M. Fugini, G. Martella,P. Samarati, Addision-Wesley
3. “ Database Security “ Alfred Basta, Melissa Zgola, Cengage Publication, 2012.
 Data Analytics ( BCS052)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to :
Describe the life cycle phases of Data Analytics through discovery, planning and K1,K2
CO 1
building.
CO 2 Understand and apply Data Analysis Techniques. K2, K3

CO 3 Implement various Data streams. K3

CO 4 Understand item sets, Clustering, frame works & Visualizations. K2

CO 5 Apply R tool for developing and evaluating real time applications. K3,K5,K6

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Introduction to Data Analytics: Sources and nature of data, classification of data
(structured, semi-structured, unstructured), characteristics of data, introduction to Big Data
platform, need of data analytics, evolution of analytic scalability, analytic process and tools,
I 08
analysis vs reporting, modern data analytic tools, applications of data analytics.
Data Analytics Lifecycle: Need, key roles for successful analytic projects, various phases
of data analytics lifecycle – discovery, data preparation, model planning, model building,
communicating results, operationalization.
Data Analysis: Regression modeling, multivariate analysis, Bayesian modeling, inference
and Bayesian networks, support vector and kernel methods, analysis of time series: linear
II systems analysis & nonlinear dynamics, rule induction, neural networks: learning and 08
generalisation, competitive learning, principal component analysis and neural networks,
fuzzy logic: extracting fuzzy models from data, fuzzy decision trees, stochastic search
methods.
Mining Data Streams: Introduction to streams concepts, stream data model and
architecture, stream computing, sampling data in a stream, filtering streams, countingdistinct
III 08
elements in a stream, estimating moments, counting oneness in a window,
decaying window, Real-time Analytics Platform ( RTAP) applications, Case studies – real
time sentiment analysis, stock market predictions.
Frequent Itemsets and Clustering: Mining frequent itemsets, market based modelling,
Apriori algorithm, handling large data sets in main memory, limited pass algorithm, counting
IV 08
frequent itemsets in a stream, clustering techniques: hierarchical, K-means, clustering high
dimensional data, CLIQUE and ProCLUS, frequent pattern based clustering
methods, clustering in non-euclidean space, clustering for streams and parallelism.
Frame Works and Visualization: MapReduce, Hadoop, Pig, Hive, HBase, MapR,
Sharding, NoSQL Databases, S3, Hadoop Distributed File Systems, Visualization: visual
V data analysis techniques, interaction techniques, systems and applications. 08
Introduction to R - R graphical user interfaces, data import and export, attribute and data
types, descriptive statistics, exploratory data analysis, visualization before analysis, analytics
for unstructured data.
Text books and References:
1. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer
2. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge University Press.
3. Bill Franks, Taming the Big Data Tidal wave: Finding Opportunities in Huge Data Streams with Advanced
Analytics, John Wiley & Sons.
4. John Garrett, Data Analytics for IT Networks : Developing Innovative Use Cases, Pearson Education
5. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics: Emerging Business
Intelligence and Analytic Trends for Today's Businesses", Wiley
 Computer Graphics(BCS053)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

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

CO 1 Understand the graphics hardware used in field of computer graphics. K2

Understand the concept of graphics primitives such as lines and circle based on different K2, K4
CO 2
algorithms.
CO 3 Apply the 2D graphics transformations, composite transformation and Clipping concepts. K4

Apply the concepts of and techniques used in 3D computer graphics, including viewing K2, K3
CO 4
transformations.
CO 5 Perform the concept of projections, curve and hidden surfaces in real life. K2, K3

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Introduction and Line Generation: Types of computer graphics, Graphic Displays- Random scan
I displays, Raster scan displays, Frame buffer and video controller, Points and lines, Line drawing 08
algorithms, Circle generating algorithms, Mid-point circle generating algorithm, and parallel version
of these algorithms.
Transformations: Basic transformation, Matrix representations and homogenous coordinates,
Composite transformations, Reflections and shearing.
II Windowing and Clipping: Viewing pipeline, Viewing transformations, 2-D Clipping algorithms- 08
Line clipping algorithms such as Cohen Sutherland line clipping algorithm, Liang Barsky algorithm,
Line clipping against non rectangular clip windows; Polygon clipping – Sutherland Hodgeman
polygon clipping, Weiler and Atherton polygon clipping, Curve clipping, Text clipping

III Three Dimensional: 3-D Geometric Primitives, 3-D Object representation, 3-D Transformation, 3- 08
D viewing, projections, 3-D Clipping.

IV Curves and Surfaces: Quadric surfaces, Spheres, Ellipsoid, Blobby objects, Introductory concepts 08
of Spline, Bspline and Bezier curves and surfaces.
Hidden Lines and Surfaces: Back Face Detection algorithm, Depth buffer method, A- buffer
V method, Scan line method, basic illumination models– Ambient light, Diffuse reflection, Specular 08
reflection and Phong model, Combined approach, Warn model, Intensity Attenuation, Color
consideration, Transparency and Shadows.
Text books:

1. Donald Hearn and M Pauline Baker, “Computer Graphics C Version”, Pearson Education
2. Foley, Vandam, Feiner, Hughes – “Computer Graphics principle”, Pearson Education.
3. Rogers, “ Procedural Elements of Computer Graphics”, McGraw Hill
4. W. M. Newman, R. F. Sproull – “Principles of Interactive computer Graphics” – McGraw Hill.
5. Amrendra N Sinha and Arun D Udai,” Computer Graphics”, McGraw Hill.
6. R.K. Maurya, “Computer Graphics ” Wiley Dreamtech Publication.
7. Mukherjee, Fundamentals of Computer graphics & Multimedia, PHI Learning Private Limited.
8. Donald Hearn and M Pauline Baker, “Computer Graphics with Open GL”, Pearson education
 DATA FORENSICS (BCCS052)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:

CO 1 Undertand the basics of mobile and digital security. K2

CO 2 Explain mobile phone forensics and android forensics. K1,K2

Analyse issues in Digital forensics. K3,K4
CO 3

CO 4 Understand the common data privacy techniques. K2,K3

CO5 Examine and analyze Digital forensics techniques. K3,K4

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
INTRODUCTION
Overview of wireless technologies and security: Personal Area Networks, Wireless Local Area
I Networks, Metropolitan Area Networks, Wide Area Networks. Wireless threats, vulnerabilities and 08
security: Wireless LANs, War Driving, WarChalking, War Flying, Common Wi-fi security
recommendations, PDA Security, Cell Phones and Security, Wireless DoS attacks, GPS Jamming,
Identity theft
CONFIDENTIALITY, INTEGRITY, AVAILABILITY TRIAD IN MOBILE 9 Confidentiality,
II integrity, availability (CIA) triad in mobile phones-Voice, SMS and Identification data interception 08
in GSM: Introduction, practical setup and tools, implementation- Software and Hardware Mobile
phone tricks: Netmonitor, GSM network service codes, mobile phone codes, catalog tricks and AT
command set- SMS security issues
MOBILE PHONE FORENSICS
III Mobile phone forensics: crime and mobile phones, evidences, forensic procedures, files present in 08
SIM card, device data, external memory dump, evidences in memory card, operators
systemsAndroid forensics: Procedures for handling an android device, imaging android USB mass
storage devices, logical and physical techniques
DIGITAL FORENSICS Digital forensics: Introduction – Evidential potential of digital devices:
IV closed vs. open systems, evaluating digital evidence potential- Device handling: seizure issues, 08
device identification, networked devices and contamination
DIGITAL FORENSICS EXAMINATION PRINCIPLES
Digital forensics examination principles: Previewing, imaging, continuity, hashing and evidence
V 08
locations- Seven element security model- developmental model of digital systems- audit and logs-
Evidence interpretation: Data content and context
Text Books:
1. Gregory Kipper, “Wireless Crime and Forensic Investigation”, Auerbach Publications, 2007
2. Iosif I. Androulidakis, “Mobile phone security and forensics: A practical approach”, Springer publications, Second
Edition, 2016
3. Andrew Hoog, “Android Forensics: Investigation, Analysis and Mobile Security for Google Android”, Elsevier
publications, 2011
4. Angus M.Marshall, “ Digital forensics: Digital evidence in criminal investigation”, John – Wiley and Sons, 2008
 Cyber Crimes and Law (BCCS053)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

Make Learner Conversant With The Social And Intellectual Property Issues Emerging From K1, K2
CO 1 ‘Cyberspace.
CO 2 Explore The Legal And Policy Developments In Various Countries To Regulate Cyberspace; K1, K2

CO 3 Develop The Understanding Of Relationship Between Commerce And Cyberspace; K1, K2

CO 4 Give Learners In Depth Knowledge Of Information Technology Act And Legal Frame Work of K1, K2
Right To Privacy, Data Security And Data Protection.
CO5 Make Study On Various Case Studies On Real Time Crimes.

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
CYBER CRIMES:
I Introduction — Computer Crime and Cyber Crimes: Distinction between Cyber Crime and 08
Conventional Crimes; Cyber Forensic; Kinds of Cyber Crimes — Cyber Stalking, Cyber
Terrorism, Forgery and Fraud, Crimes Related to IPRs, Computer Vandalism: Privacy of Online
Data; Cyber Jurisdiction; Copyright Issues; Domain Name Dispute, etc.
DEFINITION: Concept of Internet, Internet Governance, E-contract, E-forms, Encryption, Data 08
Security. Access, Addressee, Adjudicating Officer, Affixing Digital Signatures, Appropriate
II Government, Certifying Authority, Certification Practice Statement,
TERMINOLOGY (INFORMATION TECHNOLOGY ACT, 2000): Computer, Computer 08
Network, Computer Resource, Computer System, Cyber Appellate Tribunal, Data, Digital
III
Signature, Electronic Form, Electronic Record, Information, Intermediary, Key Pair, Originator,
Public Key, Secure System, Verify, Subscriber as defined in the Information Technology Act,
2000.
ELECTRONIC RECORDS: Authentication of Electronic Records; Legal Recognition of Electronic 08
IV Records; Legal Recognition of Digital Signatures; Use of Electronic Records and Digital
Signatures in Government and its Agencies; Retention of Electronic Records; Attribution,
Acknowledgement and Dispatch of Electronic Records; Secure Electronic Records and Digital
Signatures.
REGULATORY FRAMEWORK: Regulation of Certifying Authorities; Appointment and
V Functions of Controller; License to Issue Digital Signatures Certificate; Renewal of License; 08
Controller’s Powers; Procedure to be Followed by Certifying Authority; Issue, Suspension and
Revocation of Digital Signatures Certificate, Duties of Subscribers; Penalties and Adjudication;
Appellate Tribunal; Offences.
Text Books:
1. Marjie T. Britz Computer Forensic & Cyber Crime : An Introduction.
2. Karnika Seth Cyber Laws in the Information Technology Age
3. Aparna Vishwanathan Cyber Law Indian and International Perspectives
4. Prof.Vimlendu Tayal Cyber Law ,Cyber Crime, Cyber Internet and ECommerce.
5. Marjie T. Britz, “Computer Forensics and Cyber Crime”, Pearson, 2013.
6. Garima Tiwari, “Understanding Laws– Cyber Laws And Cyber Crimes”, Lexis Nexis, 2014.
7. Chuck Easttom, Jeff Taylor, “Computer Crime, Investigation, and the Law”, Course Technology, 2018.
8. Eoghan Casey, “Digital Evidence and Computer Crime: Forensic Science, Computers, and the Internet”, Eoghan
Casey, 2018”
 ARTIFICIAL INTELLIGENCE (BCIT054)
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
Understand the basics of the theory and practice of Artificial Intelligence as a discipline and K2
CO 1
about intelligent agents.
CO 2 Understand search techniques and gaming theory. K2, K3
The student will learn to apply knowledge representation techniques and problem solving K3 , K4
CO 3
strategies to common AI applications.
CO 4 Student should be aware of techniques used for classification and clustering. K2 , K3
CO 5 Student should aware of basics of pattern recognition and steps required for it. K2 , K4
DETAILED SYLLABUS 3-0-0
Proposed
Unit Topic
Lecture
INTRODUCTION :
I Introduction–Definition – Future of Artificial Intelligence – Characteristics of Intelligent Agents– 08
Typical Intelligent Agents – Problem Solving Approach to Typical AI problems.
PROBLEM SOLVING METHODS
Problem solving Methods – Search Strategies- Uninformed – Informed – Heuristics – Local Search
II Algorithms and Optimization Problems – Searching with Partial Observations – Constraint 08
Satisfaction Problems – Constraint Propagation – Backtracking Search – Game Playing – Optimal
Decisions in Games – Alpha – Beta Pruning – Stochastic Games
KNOWLEDGE REPRESENTATION
First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-Backward
III Chaining – Resolution – Knowledge Representation – Ontological Engineering-Categories and 08
Objects – Events – Mental Events and Mental Objects – Reasoning Systems for Categories –
Reasoning with Default Information
SOFTWARE AGENTS
IV Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining – 08
Argumentation among Agents – Trust and Reputation in Multi-agent systems.
APPLICATIONS
V AI applications – Language Models – Information Retrieval- Information Extraction – Natural 08
Language Processing – Machine Translation – Speech Recognition – Robot – Hardware –
Perception – Planning – Moving
Text books:
1. S. Russell and P. Norvig, “Artificial Intelligence: A Modern Approach‖, Prentice Hall, Third Edition, 2009.
2. I. Bratko, ―Prolog: Programming for Artificial Intelligence‖, Fourth edition, Addison-Wesley Educational Publishers
Inc., 2011.
3. M. Tim Jones, ―Artificial Intelligence: A Systems Approach(Computer Science)‖, Jones and Bartlett Publishers, Inc.;
First Edition, 2008
4. Nils J. Nilsson, ―The Quest for Artificial Intelligence‖, Cambridge University Press, 2009.
5. William F. Clocksin and Christopher S. Mellish,‖ Programming in Prolog: Using the ISO Standard‖, Fifth Edition,
Springer, 2003.
6. Gerhard Weiss, ―Multi Agent Systems‖, Second Edition, MIT Press, 2013.
7. David L. Poole and Alan K. Mackworth, ―Artificial Intelligence: Foundations of Computational Agents‖, Cambridge
University Press, 2010.
 ETHICAL HACKING(BCCS054)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

CO 1 Understand vulnerabilities, mechanisms to identify vulnerabilities/threats/attacks K1, K2

CO 2 Use tools to identify vulnerable entry points K3, K4

CO 3 Identify vulnerabilities using sniffers at different layers K1, K2

Handle web application vulnerabilities K2, K3

CO 4

CO 5 Identify attacks in wireless networks K5, K6

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
ETHICAL HACKING OVERVIEW & VULNERABILITIES
Understanding the importance of security, Concept of ethical hacking and essential Terminologies
Threat, Attack, Vulnerabilities, Target of Evaluation, Exploit. Phases involved in hacking
I 08
FOOTPRINTING & PORT SCANNING
Footprinting - Introduction to foot printing, Understanding the information gathering methodology of
II the hackers, Tools used for the reconnaissance phase, Port Scanning - Introduction, using port 08
scanning tools, ping sweeps, Scripting Enumeration-Introduction, Enumerating windows OS & Linux
OS
SYSTEM HACKING
Aspect of remote password guessing, Role of eavesdropping ,Various methods of password cracking,
Keystroke Loggers, Understanding Sniffers ,Comprehending Active and Passive Sniffing, ARP
III 08
Spoofing and Redirection, DNS and IP Sniffing, HTTPS Sniffing.

HACKING WEB SERVICES & SESSION HIJACKING

Web application vulnerabilities, application coding errors, SQL injection into Back-end Databases,
IV 08
cross-site scripting, cross-site request forging, authentication bypass, web services and related flaws,
protective http headers. Understanding Session Hijacking, Phases involved in Session
Hijacking,Types of Session Hijacking, Session Hijacking Tools
HACKING WIRELESS NETWORKS
V Introduction To 802.11, Role Of WEP, Cracking WEP Keys, Sniffing Traffic, Wireless DOS 08
Attacks, Wlanscanners, Wlansniffers,Hackingtools,Securing Wireless Network
Text Books:
1. Kimberly Graves, "Certified Ethical Hacker", Wiley India Pvt Ltd, 2010
2. Michael T. Simpson, "Hands-on Ethical Hacking & Network Defense", Course Technology, 2010
3. RajatKhare, "Network Security and Ethical Hacking", Luniver Press, 2006
4. Ramachandran V, “BackTrack 5 Wireless Penetration Testing Beginner’s Guide (3rd ed.).” Packt Publishing,
2011
5. Thomas Mathew, "Ethical Hacking", OSB publishers, 2003
6. Matthew Hickey, Jennifer Arcuri, “Hands on Hacking: Become an Expert at Next Gen Penetration Testing and
Purple Teaming”, 1st Edition, Wiley, 2020.
7. Jon Ericson, Hacking: The Art of Exploitation, 2nd Edition, NoStarch Press, 2008.
 Internet of Things Security (BCCS055)

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

At the end of course, the student will be able to understand
CO 1 Assess different Internet of Things technologies and their applications. K3
CO 2 Identify the areas of cyber security for the Internet of Things. K3, K4
CO 3 Customize real time data for IoT applications. K2, K3
Solve IoT security problems using light weight cryptography. K2, K4
CO 4
CO 5 Design and build security systems using elementary blocks. K3, K6
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
CYBER PHYSICAL SYSTEMS AND INTERCONNECTION OF THREATS: IoT and cyber-
physicalsystems, IoT security (vulnerabilities, attacks, and countermeasures), security engineering for
IoT development, IoT security lifecycle. Network Robustness of Internet of ThingsSybil Attack
I Detection in Vehicular Networks- Malware Propagation and Control in Internet of Things- Solution- 08
Based Analysis of Attack Vectors on Smart HomeSystems

CRYPTO FOUNDATIONS: Block ciphers, message integrity, authenticated encryption, hash

functions, Merkle trees, elliptic curves, public-key crypto (PKI), signature algorithms.

II 08
PRIVACY PRESERVATION FOR IOT: Privacy Preservation Data Dissemination- Privacy
III Preservation Data Dissemination- Social Features forLocation Privacy Enhancement in Internet of 08
Vehicles- Lightweight and Robust Schemes for Privacy Protection in Key Personal IoT
Applications: Mobile WBSN and Participatory Sensing.
TRUST MODELS FOR IOT: Authentication in IoT- Computational Security for the IoT- Privacy-
Preserving Time Series Data Aggregation- Secure Path Generation Scheme for Real-Time Green
IV 08
Internet of Things- Security Protocols for IoT Access Networks- Framework for Privacy and Trust
in IoT- Policy-Based Approach for InformedConsent in Internet of Things
INTERNET OF THINGS SECURITY: Security and Impact of the Internet of Things (IoT) on
V Mobile Networks- Networking Function Security-IoT Networking Protocols, Secure IoT Lower 08
Layers, Secure IoT Higher Layers, Secure Communication Links inIoTs, Back-end Security -Secure
Resource Management, Secure IoT Databases, Security Products-Existing Test bed on Security and
Privacy of IoTs, Commercialized Products.
Text books:
1. Hu, Fei. Security and privacy in Internet of things (IoTs): Models, Algorithms, and Implementations,
1stedition,CRC Press, 2016.
2. Russell, Brian, and Drew Van Duren. Practical Internet of Things Security, 1 st edition, Packt PublishingLtd, 2016.
3. Whitehouse O. Security of things: An implementers’ guide to cyber-security for internet of thingsdevices and
beyond, 1 st edition, NCC Group, 2014
4. DaCosta, Francis, and Byron Henderson. Rethinking the Internet of Things: a scalable approach toconnecting
everything, 1 st edition, Springer Nature, 2013.
 DATABASE MANAGEMENT SYSTEMS LAB(BCS551)
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to:
Understand and apply oracle 11 g products for creating tables, views, indexes, sequences and K2, K4
CO 1
other database objects.
Design and implement a database schema for company data base, banking data base, library K3, K5,
CO 2
information system, payroll processing system, student information system. K6
CO 3 Write and execute simple and complex queries using DDL, DML, DCL and TCL K4, K5
CO 4 Write and execute PL/SQL blocks, procedure functions, packages and triggers, cursors. K4, K5
Enforce entity integrity, referential integrity, key constraints, and domain constraints K3, K4
CO 5
on database.
DETAILED SYLLABUS
1. Installing oracle/ MYSQL
2. Creating Entity-Relationship Diagram using case tools.
3. Writing SQL statements Using ORACLE /MYSQL:
a)Writing basic SQL SELECT statements.
b) Restricting and sorting data.
c)Displaying data from multiple tables.
d)Aggregating data using group function.
e)Manipulating data.
e)Creating and managing tables.
4. Normalization
5. Creating cursor
6. Creating procedure and functions
7. Creating packages and triggers
8. Design and implementation of payroll processing system
9. Design and implementation of Library Information System
10. Design and implementation of Student Information System
11. Automatic Backup of Files and Recovery of Files
12.Mini project (Design & Development of Data and Application ) for following :
a) Inventory Control System.
b) Material Requirement Processing.
c) Hospital Management System.
d) Railway Reservation System.
e) Personal Information System.
f) Web Based User Identification System.
g) Timetable Management System.
h) h) Hotel Management System
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 (MySQL , SQL server ,
Oracle ,MongoDB ,Cubrid ,MariaDBetc)

Database Management Systems Lab BCS 551: Mapping with Virtual Lab

Name of the Lab Name of the Experiment

Data Definition Language(DDL) Statements: (Create table, Alter table, Drop table)
Data Manipulation Language(DML) Statements
Database Management Lab Data Query Language(DQL) Statements: (Select statement with operations like Where
(BCS-551) clause, Order by, Logical operators, Scalar functions and Aggregate functions)
Transaction Control Language(TCL) statements: (Commit(make changes permanent),
Rollback (undo)
Describe statement: To view the structure of the table created
 WEB TECHNOLOGY LAB (BCS 552)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

CO 1 Understanding fundaments of website development and apply HTL and XML languages K2, K4
for development of websites
CO 2 Applying CSS in designing and development of responsive website for compatibility of K2, K3,
various devices. K5
CO 3 Understand, analyze and design the role of JavaScript for dynamic web pages. K2, K4,
K5
CO 4 Design and deploy different components using Java Bean, Node.js and database tables K4, K5
using MongoDB and produce various results based on given query.
CO 5 Design and deploy server-side java application called Servlet & JSP tools to catch form K3, K4
data sent from client, process it and store it on database
DETAILED SYLLABUS
This lab is based on the Web Technologies. Some examples are as follows:
1. Write HTML program for designing your institute website. Display departmental information of your institute on the
website.
2. Write HTML program to design an entry form for student details/employee information/faculty details.
3. Develop a responsive website using CSS and HTML. Website may be for tutorial/blogs/commercial website.
4. Write programs using HTML and Java Script for validation of input data.
5. Write a program in XML for creation of DTD, which specifies set of rules. Create a style sheet in CSS/ XSL & display
the document in internet explorer.
6. Create a Java Bean for Employee information (EmpID, Name, Salary, Designation and Department).
7. Build a command-line utility using Node.js that performs a specific task, such as converting text to uppercase,
calculating
the factorial of a number, or generating random passwords.
8. Develop a script that uses MongoDB's aggregation framework to perform operations like grouping, filtering, and sorting.
For instance, aggregate user data to find the average age of users in different cities.
9. Assume four users user1, user2, user3 and user4 having the passwords pwd1, pwd2, pwd3 and pwd4 respectively. Write
a servlet for doing the following: 1. Create a Cookie and add these four user id’s and passwords to this Cookie. 2. Read
the user id and passwords entered in the Login form and authenticate with the values available in the cookies.
10. Create a table which should contain at least the following fields: name, password, email-id, phone number Write
Servlet/JSP to connect to that database and extract data from the tables and display them. Insert the details of the users
who register with the web site, whenever a new user clicks the submit button in the registration page.
11. Write a JSP which insert the details of the 3 or 4 users who register with the web site by using registration form.
Authenticate the user when he submits the login form using the user name and password from the database.
12. Design and implement a simple shopping cart example with session tracking API.
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 ( Java , JSP , Bootstrap
Firebug , WampServer , MongoDB, etc)
 DESIGN AND ANALYSIS OF ALGORITHM LAB (BCS553)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

CO 1 Implement algorithm to solve problems by iterative approach. K2, K4

CO 2 Implement algorithm to solve problems by divide and conquer approach K3, K5

CO 3 Implement algorithm to solve problems by Greedy algorithm approach. K4, K5

Implement algorithm to solve problems by Dynamic programming, backtracking, K4, K5

CO 4
branch and bound approach.
CO 5 Implement algorithm to solve problems by branch and bound approach. K3, K4

DETAILED SYLLABUS
1. Program for Recursive Binary & Linear Search.
2. Program for Heap Sort.
3. Program for Merge Sort.
4. Program for Selection Sort.
5. Program for Insertion Sort.
6. Program for Quick Sort.
7. Knapsack Problem using Greedy Solution
8. Perform Travelling Salesman Problem
9. Find Minimum Spanning Tree using Kruskal’s Algorithm
10. Implement N Queen Problem using Backtracking
11. Sort a given set of n integer elements using Quick Sort method and compute its time complexity. Run the program for
varied values of n> 5000 and record the time taken to sort. Plot a graph of the time taken versus non graph sheet. The
elements can be read from a file or can be generated using the random number generator. Demonstrate using Java how
the divide and- conquer method works along with its time complexity analysis: worst case, average case andbest
case.
12. Sort a given set of n integer elements using Merge Sort method and compute its time complexity. Run the program for
varied values of n> 5000, and record the time taken to sort. Plot a graph of the time taken versus non graph sheet.
The elements can be read from a file or can be generated using the random number generator. Demonstrate how the
divide and- conquer method works along with its time complexity analysis: worst case, average case and best case.
13.6. Implement, the 0/1 Knapsack problem using
(a) Dynamic Programming method
(b) Greedy method.
14. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm.
15. Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal's algorithm. Use Union-Find
algorithms in your program.
16. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
17. Write programs to (a) Implement All-Pairs Shortest Paths problem using Floyd's algorithm.
(b) Implement Travelling Sales Person problem using Dynamic programming.
18. Design and implement to find a subset of a given set S = {Sl, S2, .... ,Sn} of n positive integers whose SUM is equal to
a given positive integer d. For example, if S ={1, 2, 5, 6, 8} and d= 9, there are two solutions {1,2,6}and {1,8}.
Display a suitable message, if the given problem instance doesn't have a solution.
19. Design and implement to find all Hamiltonian Cycles in a connected undirected Graph G of n vertices using
backtracking principle.
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++ etc)
 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
Measures, Design Strategies: Function Oriented Design, Object Oriented Design, Top-Down and
III Bottom-Up Design. Software Measurement and Metrics: Various Size Oriented Measures: 08
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
V Maintenance, Cost of Maintenance, Software Re- Engineering, Reverse Engineering. Software 08
Configuration Management Activities, Change Control Process, Software Version Control, An
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.

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
 Cryptography & Network Security (BCCS601)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

CO 1 Classify the symmetric encryption techniques and Illustrate various Public key K2 , K3
cryptographic techniques.
Understand security protocols for protecting data on networks and be able to digitally sign K1 , K2
CO 2 emails and files.
CO 3 Understand vulnerability assessments and the weakness of using passwords for K4
authentication
Be able to perform simple vulnerability assessments and password audits K3
CO 4
Summarize the intrusion detection and its solutions to overcome the attacks. K2
CO 5

DETAILED SYLLABUS 3-1-0

Unit Topic Proposed
Lecture
INTRODUCTION – Introduction to security attacks, services and mechanism, Classical
encryption techniques substitution ciphers and transposition ciphers, cryptanalysis,
I steganography, Stream and block ciphers. Modern Block Ciphers: Block ciphers principles, 08
Shannon’s theory of confusion and diffusion, fiestal structure, Data encryption standard (DES),
Strength of DES, Idea of differential cryptanalysis, block cipher modes of operations, Triple
DES
Introduction to group, field, finite field of the form GF(p), modular arithmetic, prime and
relative prime numbers, Extended Euclidean Algorithm, Advanced Encryption Standard (AES)
encryption and decryption Fermat’s and Euler’s theorem, Primarily testing, Chinese Remainder
II 08
theorem, Discrete Logarithmic Problem, Principals of public key crypto systems, RSA
algorithm, security of RSA

Message Authentication Codes: Authentication requirements, authentication functions,

message authentication code, hash functions, birthday attacks, security of hash functions,
III Secure hash algorithm (SHA) Digital Signatures: Digital Signatures, Elgamal Digital Signature 08
Techniques, Digital signature standards (DSS), proof of digital signature algorithm,

Key Management and distribution: Symmetric key distribution, Diffie-Hellman Key

Exchange, Public key distribution, X.509 Certificates, Public key Infrastructure. Authentication
Applications: Kerberos, Electronic mail security: pretty good privacy (PGP), S/MIME.
IV 08
IP Security: Architecture, Authentication header, Encapsulating security payloads, combining
security associations, key management. Introduction to Secure Socket Layer, Secure electronic,
transaction (SET) System Security: Introductory idea of Intrusion, Intrusion detection, Viruses
V and related threats, firewalls 08
Text books:
1. William Stallings, “Cryptography and Network Security: Principals and Practice”, Pearson Education.
2. Behrouz A. Frouzan: Cryptography and Network Security, McGraw Hill .
3. C K Shyamala, N Harini, Dr. T.R.Padmnabhan Cryptography and Security ,Wiley
4. Bruce Schiener, “Applied Cryptography”. John Wiley & Sons
5. Bernard Menezes,” Network Security and Cryptography”, Cengage Learning. 6. AtulKahate, “Cryptography and
Network Security”, McGraw Hill
 Computer Networks (BCS603)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

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

Explain basic concepts, OSI reference model, services and role of each layer of OSI model and
CO1 K1,K2
TCP/IP, networks devices and transmission media, Analog and digital data transmission
CO2 Apply channel allocation, framing, error and flow control techniques. K3
Describe the functions of Network Layer i.e. Logical addressing, subnetting & Routing
CO3 K2,K3
Mechanism.
Explain the different Transport Layer function i.e. Port addressing, Connection Management,
CO4 K2,K3
Error control and Flow control mechanism.
CO5 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,
CO6 K2
TELNET and VPN.
DETAILED SYLLABUS 3-1-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.
 Mobile and Wireless Security (BCCS061)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

CO 1 Familiarize with the issues and technologies involved in designing a wireless and mobile K1, K2
system that is robust against various attacks.
CO 2 Gain knowledge and understanding of the various ways in which wireless networks can be K1, K2
attacked and tradeoffs in protecting networks.
CO 3 Have a broad knowledge of the state-of-the-art and open problems in wireless and mobile K1, K2
security, thus enhancing their potential to do research or pursue a career in this rapidly
developing area.
CO 4 Learn various security issues involved in cloud computing. K1, K2

CO 5 Learn various security issues related to GPRS and 3G. K1, K2

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Security Issues in Mobile Communication: Mobile Communication History, Security – Wired Vs
Wireless, Security Issues in Wireless and Mobile Communications, Security Requirements in
Wireless and Mobile Communications, Security for Mobile Applications, Advantages and
I Disadvantages of Application – level Security. 08

Security of Device, Network, and Server Levels: Mobile Devices Security Requirements, Mobile
Wireless network level Security, Server Level Security. Application-Level Security in Wireless
Networks: Application of WLANs, Wireless Threats, Some Vulnerabilities and Attach Methods 08
II over WLANs, Security for 1G Wi-Fi Applications, Security for 2G Wi-Fi Applications, Recent
Security Schemes for Wi-Fi Applications
Application-Level Security in Cellular Networks: Generations of Cellular Networks, Security
Issues and attacks in cellular networks, GSM Security for applications, GPRS Security for
III 08
applications, UMTS security for applications, 3G security for applications, Some of Security and
authentication Solutions.
Application-Level Security in MANETs: MANETs, Some applications of MANETs, MANET
Features, Security Challenges in MANETs, Security Attacks on MANETs, External Threats for
MANET applications, Internal threats for MANET Applications, Some of the Security Solutions. 08
Ubiquitous Computing, Need for Novel Security Schemes for UC, Security Challenges for UC,
IV
and Security Attacks on UC networks, Some of the security solutions for UC.
Data Center Operations - Security challenge, implement “Five Principal Characteristics of Cloud
Computing, Data center Security Recommendations Encryption for Confidentiality and Integrity,
Encrypting data at rest, Key Management Lifecycle, Cloud Encryption Standards.
V 08
Text Books:
1.Pallapa Venkataram, Satish Babu: “Wireless and Mobile Network Security”, 1st Edition, Tata McGraw
Hill,2010.
2. Frank Adelstein, K.S.Gupta : “Fundamentals of Mobile and Pervasive Computing”, 1st Edition, Tata McGraw
Hill 2005.
3.Randall k. Nichols, Panos C. Lekkas : “Wireless Security Models, Threats and Solutions”, 1st Edition, Tata
McGraw Hill, 2006.
4. Bruce Potter and Bob Fleck : “802.11 Security” , 1st Edition, SPD O’REILLY 2005.
5. James Kempf: “Guide to Wireless Network Security, Springer. Wireless Internet Security – Architecture and
Protocols”, 1st Edition, Cambridge University Press, 2008.
 MACHINE LEARNING TECHNIQUES(BCDS062)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

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

CO 1 To understand the need for machine learning for various problem solving K1 , K2

To understand a wide variety of learning algorithms and how to evaluate models generated K1 , K3
CO 2
from data
CO 3 To understand the latest trends in machine learning K2 , K3

To design appropriate machine learning algorithms and apply the algorithms to a real- K4 , K6
CO 4
world problems
To optimize the models learned and report on the expected accuracy that can be achieved K4, K5
CO 5
by 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 Neural Network, Clustering, Reinforcement Learning, Decision Tree Learning, 08
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
Bayes classifier, Bayesian belief networks, EM algorithm.
II 08
SUPPORT VECTOR MACHINE: Introduction, Types of support vector kernel – (Linear
kernel, polynomial kernel,andGaussiankernel), 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
III Algorithm, Issues in Decision tree learning. 08
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 Application of Reinforcement Learning,Introduction to Deep Q Learning. 08
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. EthemAlpaydin, ―Introduction to Machine Learning (Adaptive Computation and Machine Learning), 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.
5. M. Gopal, “Applied Machine Learning”, McGraw Hill Education
 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
 Data Compression (BCS064)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
To gain a fundamental understanding of data compression methods for text, images, and video, K1 , K2
CO 1 and related issues in the storage, access, and use of large data sets
To select, giving reasons that are sensitive to the specific application and particular K2 , K3
CO 2 circumstance, most appropriate compression techniques for text, audio, image and video
information
To illustrate the concept of various algorithms for compressing text, audio, image and video K2 , K3
CO 3
information.
To understand various Distortion criterias. K2 , K3
CO 4
To illustrate the Advantages of Vector Quantization over Scalar Quantization. K2, K3
CO 5
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Compression Techniques: Loss less compression, Lossy Compression, Measures of performance,
Modeling and coding, Mathematical Preliminaries for Lossless compression: A brief introduction to
I information theory, Models: Physical models, Probability models, Markov models, composite 08
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
codes, Applications of Hoffman coding: Loss less image compression, Text compression, Audio 08
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.
III Dictionary Techniques: Introduction, Static Dictionary: Diagram Coding, Adaptive Dictionary. The
08
LZ77 Approach, The LZ78 Approach, Applications: File Compression-UNIX compress, Image
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.
Distortion criteria, Models, Scalar Ouantization: The Quantization problem, Uniform Quantizer,
IV Adaptive Quantization, Non uniform Quantization. 08
Advantages of Vector Quantization over Scalar Quantization, The Linde-Buzo-Gray Algorithm,
V Tree structured Vector Quantizers. Structured VectorQuantizers. 08
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.
 Software Engineering Lab (BCS-651)
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
CO 1 K2, K4
state functional and non-functional requirement
Identify different actors and use cases from a given problem statement and draw use case
CO 2 K3, K5
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 identify
CO 4 K4, K5
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. )
 CRYPTOGRAPHY AND NETWORK SECURITY LAB (BCCS651)
Course Outcome (CO) Bloom’s Knowledge Level (KL)

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

CO 1 Understanding Fundamental Cryptographic Concepts K2, K3

CO 2 Implementing and Analyzing Classic Encryption Algorithms K2, K3

CO 3 Understand the importance of key management and cryptographic strength, specifically how K3, K4
different algorithms balance security and computational efficiency
CO 4 Students will use the Java Cryptography Architecture (JCA) to perform encryption, K3, K4
decryption, and key management operations, learning to utilize the built-in libraries for secure
software development
CO 5 students will learn about cryptographic hash functions, their applications, and their K3, K4
significance in data integrity and digital signatures
DETAILED SYLLABUS
1. Write a JAVA/C program that contains a string (char pointer) with a value \Hello World’. The program should XOR
each character in this string with 0 and displays the result.
2. Write a JAVA/C program that contains a string (char pointer) with a value \Hello World’. The program should
AND or and XOR each character in this string with 127 and display the result.
3. Write a Java/C program to perform encryption and decryption 3 using the following algorithms:
4. Ceaser Cipher b) Substitution Cipher c) Hill Cipher.
5. Write a Java program to implement the DES algorithm logic
6. Write a C/JAVA program to implement the BlowFish algorithm logic.
7. Write a C/JAVA program to implement the Rijndael algorithm logic.
8. Using Java Cryptography, encrypt the text “Hello world” using BlowFish. Create your own key using Java/C
keytool.
9. Write a Java program to implement RSA Algoithm.
10. Implement the Diffie-Hellman Key Exchange mechanism 9 using HTML and JavaScript. Consider the end user
as one of the parties (Alice) and the JavaScript application as other party (bob).
11. Calculate the message digest of a text using the SHA-1algorithm in JAVA/C.
12. Calculate the message digest of a text using the MD5 algorithm in JAVA/C.

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
 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.