" Artificial Intelligence & Machine Learning

" Computer Science & Design

(Effective from the Session: 2023-24)

DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY LUCKNOW

SEMESTER I I

sY4suspuguopee

Sessional (sa/su) oLeuuexa

Aoe Periods
Subject Component Total Credit
SN
Code Subject SW+ESE Cr

L P CT TA CT+TA TE/PE

BOE3**/
Science Based Open
1
BAS303 Elective/BSC (Maths T ES/BS 3 20 10 30 70 100 4
II/Math IV/ Math V)
Universal Human Value
BVE301, and Professional Ethics/ T VA/HS 2 20 10 30 70 100
BAS301 Technical
Communication
Data Structure
3 BCS301 T PC 3 1 20 10 30 70 100 4

Computer Organization
and
4 BCS302 T PC 3 0 20 10 30 70 100 4
Architecture

Discrete Structures &

BCS303 Theory of Logic T PC 2 20 10 30 70 100 3

Data Structure Lab

6 BCS351 P PC 0 2 50 50 50 100 1

Computer Organization
and
7 BCS352 PO 0 2 50 50 50 100 1
Architecture Lab

Web Designing
BCS353 Workshop PO o2 50 50 100 1

10
BCC301 Cyber Security/Python VA 2 00 20 10 30 70 100 2
BCC302 programming
11 BCC351
Internship Assesment 100 100 2
/Mini Project
Total 15 S 25

Mathematics -ll for CE/ENV andallied branches

Mathematics-IV for Computer/Electronics/Electrical & allied Branches, Mechanical & Allied Branches
Textile/Chemical & allied Branches
" Mathematics-V for Bio Technology/Agriculture Engineering

SEMESTER -IV

Sessional
Periods
Component
SN
Subject adA! Total Credit
Code
Subject SW+ESE Cr

|TP CT TA CT+TA TE/PE

BAS403/
BSC(Maths-ll/Math IV/
1 Math V)/Science Based BS/ES 3 20 10 30 70 100 4
BOE4** 8
 B.Tech 2d Year Common Courses
(Effective from session 2023-24)
" BCC301 / BCC401/ BCC301H/BCC401H: yber Security
" BCC302/ BCC402/ BCC302H/ BCC402H: Python programming
BCC301 / BCC401/ BCC301H/ BCC401H:
CYBER SECURITY
Course Outcome ( Co) Bloom's Knowledge Level (KL)
At the end of course, the student will be able to

CO 1 Understand the basic concepts of cyber security and cybercrimes. K,. K¡

CO 2 Understand the security policies and cyber laws. K,, K,

CO 3 Understand the tools and methods used in cyber crime K

co 4 Understand the concepts of cyber forensics K1, K2

CO5 Understand the cyber security policies and cyber laws
DETAILED SYLLABUS
Unit Topic
Lecture
INTRODUCTION TO CYBER CRIME : Cybercrime- Definition and Origins of the word Cybercrime
and Information Security, Who are Cybercriminals? Classifications of Cybercrimes, A Global
Perspective on Cybercrimes, Cybercrime Era: Survival Mantra for the Netizens.
04
Cyber offenses: How Criminals Plan the Attacks, Social Engineering, Cyber stalking, Cybercafe and
Cybercrimes, Botnets: The Fuel for Cybercrime, Attack Vector.

CYBER CRIME : Mobile and Wireless Devices-Introduction, Proliferation of Mobile and Wireless
Devices, Trends in Mobility, Credit Card Frauds in Mobile and Wireless Computing Era, Security
Challenges Posed by Mobile Devices, Registry Settings for Mobile Devices, Authentication Service
Security, Attacks on Mobile/Cel Phones, Mobile Devices: Security Implications for organizations, 04
Organizational Measures for Handling Mobile, Organizational Security Policies and Measures in
Mobile Computing Era.

TOOLS AND METHODS USED IN CYBERCRIME : Introduction, Proxy Servers and Anonymizers,
Phishing, Password Cracking, Keyloggers and Spywares, Virus and Worms, Trojan-horses and
Backdoors, Steganography, DoS and DDoS At-tacks, SQL Injection, Buffer Overflow, Attacks on 04
Wireless Networks. Phishing and ldentity Theft: Introduction to Phishing, ldentity Theft (ID Theft).

UNDERSTANDING COMPUTER FORENSICS: Introduction, Digital Forensics Science, The Need for
Computer Forensics, Cyber forensics and Digital Evidence, Forensics Analysis of E-Mail, Digital
Forensics Life Cycle, Chain of Custody Concept, Network Forensics, Approaching a Computer
IV Forensics Investigation. 04
Forensics and Social Networking Sites: The Security/Privacy Threats, Challenges in Computer
Forensics.

INTRODUCTION TO SECURITY POLICIES AND CYBER LAWS : Need for An Information

Security
Policy, Introduction to Indian Cyber Law, Objective and Scope of the Digital Personal Data 04
Protection Act 2023, Intellectual Property Issues, Overview of Intellectual Property Related
 Mathematics -IV

(PDE, Probability and Statistics)

Computer/Electronics/Electrical & Allied Branches, CS/IT, ECIC, EE/EN,
Mechanical& Allied Branches, (ME/AEIAUIMT/PE/MUPL)
Textile/Chemical & Allied Branches, TT/TCCT, CHE/FT
Subject Code BAS303/ BAS303H BAS403/BAS403H
Category Basic Science Course
Subject Name MATHEMATICS-IV(PDE, Probability and Statistics)
Theory Sessional
L-T-P Total Credit
Scheme and Credits Marks Test Assig/Att.
3-1-0 70 20 100 4
Pre- requisites (if any) Knowledge of Mathematics I and II of B. Tech or equivalent

Course Outcomes

The objective of this course is to familiarize the students with partial differential equation,
their application and statistical techniques. It aims to present the students with standard
concepts and tools at an intermediate to superior level that will provide them well towards
undertaking a variety of problems in the discipline.
The students will learm:

" The idea of partial differential equation and its different types of solution.
" The concept ofmethod of separation of variables and Fourier transform to solve
partial differential equations.
" The basic ideas of statistics including measures of central tendency, correlation,
regression and their properties.
" The idea of probability, random variables, discrete and continuous probability
distributions and their properties.
The statistical methods of studying data samples, hypothesis testing and statistical
quality control.

Module I: Partial Differential Equations

Origin of Partial Differential Equations, Linecar and Non-Linear Partial Differential Equations
of first order, Lagrange's Equations method to solve Linear Partial Differential Equations,
Charpit's method to solve Non-Linear Partial Differential Equations, Solution of Linear
Partial Differential Equation of Higher order with constant coefficients, Equations reducible
to linear partial differential equations with constant coefficients.

Module II: Applications of Partial Differential Equations and Fourier Transform

Method of separation of variables, Solution of one dimensional heat equation, wave cquation,
Two dimensional heat equation (only Laplace Equation) and their application, Complex
Fourier transform, Fourier sine transform, Fourier cosine transform, Inverse transform,
convolution theorem, Application of Fourier Transformto solve partial differential equation.

Module III: Statistical Techniques I

Overview of Measures of central tendency, Moments, Skewness, Kurtosis, Curve Fitting,
Method of least squares, Fitting of straight lines, Fitting of second degree parabola,
Exponential curves,Correlation and Rank correlation, Regression Analysis: Regression lines
of y on x and x on y.

Module IV: Statistical Techniques II

Overview of Probability Random variables (Discrete and Continuous Random variable)
Probability mass function and Probability density function, Expectation and variance,
Discrete and Continuous Probability distribution: Binomial, Poission and Normal
distributions.

Module V: Statistical Techniques III 8

Introduction of Sampling Theory, Hypothesis, Null hypothesis, Altermative hypothesis,

Testing a Hypothesis, Level of significance, Confidence limits, Test of significance of
difference of means, t-test, Z-test and Chi-square test, Statistical Quality Control (SQC).
Control Charts, Control Charts for variables (X andR Charts), Control Charts for Variables
(p, np and C charts).
 SYLLABUS
BCS301 DATA STRUCTURE

Course Outcome (co) Bloom's Knowledge Level (KL)

At the end of course, the student will be able to understand
Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by
CO 1 K1, Kz
the algorithms and their common applications.
CO 2 Discuss the computational efficiency of the sorting and searching algorithms.

CO 3 Implementation of Trees and Graphs and perform various operations on these data structure. Ka

Understanding the concept of recursion, application of recursion and its implementation and removal
CO 4 K
of recursion.

CO 5
Identify the alternative implementations of data structures with respect to its performance to solve a
real world problem. Ks, Ks

DETAILED SYLLABUS 3-1-0

Unit
Proposed
Topic Lecture
Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C.
Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations:
Big Oh, Big Theta and Big Omega, Time-Space trade-off. Abstract Data Types (ADT)
Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row
Major Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D,3-D and 08
n-D Array Application of arrays, Sparse Matrices and their representations.
Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists,
Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion,
Traversal, Polynomial Representation and Addition Subtraction & Multiplications of Single
variable & Two variables Polynomial.
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions,
Evaluation of postfix expression, Iteration and Recursion- Principles of recursion, Tail
recursion, Removal of recursion Problem solving using iteration and recursion with 08
examples such as binary search, Fibonacci numbers, and Hanoi towers. Tradeoffs
between iteration and recursion.
Queues: Operations on Queue: Create, Add, Delete, Full and Empty, ircular queues,
Array and linked implementation of queues in C, Dequeue and Priority Queue.
Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary
Search. Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting:
Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.

Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Array
IV Representation and Pointer(Linked List) Representation, Binary Search Tree, Strictly
08
Binary Tree ,Complete Binary Tree. A Extended Binary Trees, Tree Traversal algorithms:
Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal,
Operation of Insertation, Deletion, Searching & Modification of data in Binary Search

Threaded Binary trees, Traversing Threaded Binary trees. Huffman coding using Binary
Tree. Concept & Basic Operations for AVL Tree, BTree &Binary Heaps
Graphs: Terminology used with Graph, Data Structure for Graph Representations:
Adjacency Matrices, Adjacency List, Adjacency. Graph Traversal: Depth First Search and
V Breadth First Search, Connected Component, Spanning Trees, Minimum Cost Spanning 08
Trees: Prims and Kruskal algorithm. Transitive Closure and Shortest Path algorithm:
Warshal Algorithm and Dijikstra Algorithm.
Text books:

1 Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, "Data Structures Using C and C++", PHI Learning
BCS302 COMPUTER ORGANIZATION AND ARCHITECTURE
Course utcome ( cO) Bloom's Knowledge Level (KL)
At the end of course,the student will be able to understand
CO 1 Study of the basic structure and operation of a digital computer system. KË K,
CO 2
Analysis of the design of arithmetic & logic unit and understanding of the fixed point and floating-point
arithmetic operations. Kz, K¡
CO 3 Implementation of control unit techniques and the concept of Pipelining K;
CO 4 Understanding the hierarchical memory system, cache memories and virtual memory K
CO5 Understanding the different ways of communicating with I/0 devices and standard i/0 interfaces K, K4

DETAILED SYLLABUS 3-1-0

Unit Topic Proposed
Lecture
Introduction: Functional units of digital system and their interconnections, buses, bus architecture, 08
types of buses and bus arbitration. Register, bus and memory transfer. Processor organization,
general registers organization, stack organization and addressing modes.
Arithmetic and logic unit: Look ahead carries adders. Multiplication: Signed operand multiplication,
Booths algorithm and array multiplier. Division and logic operations. Floating point arithmetic
operation, Arithmetic &logic unit design. IEEE Standard for Floating Point Numbers
Control Unit: Instruction types, formats, instruction cycles and sub cycles (fetch and execute etc),
micro operations, execution of a complete instruction. Program Control, Reduced Instruction Set
Computer, Pipelining. Hardwire and micro programmed control: micro programme sequencing,
concept of horizontal and vertical microprogramming.
Memory: Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 1/2D memory
organization. ROM memories. Cache memories: concept and design issues & performance, address 08
mapping and replacement Auxiliary memories: magnetic disk, magnetic tape and optical disks
Virtual memory: concept implementation.
Input/Output: Peripheral devices, /O interface, /0 ports, Interrupts: interrupt hardware, types of
interrupts and exceptions. Modes of Data Transfer: Programmed i/0, interrupt initiated /O and
Direct Memory Access., i/0 channels and processors. Serial Communication: Synchronous &
asynchronous communication, standard communication interfaces.
Text books:
1. Computer System Architecture - M. Mano
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky Computer Organization, MCGraw-Hill, Fifth Edition, Reprint 2012
3. John P. Hayes, Computer Architecture and Organization, Tata McGraw Hill, Third Edition, 1998. Reference books
4. Willlam Stallings, Computer Organization and Architecture-Designing for Performance, Pearson Education, Seventh edition, 2006.
5. Behrooz Parahami, "Computer Architecture", Oxford University Press, Eighth Impression, 2011.
6. David A. Patterson and John L. Hennessy, "Computer Architecture-A Quantitative Approach", Elsevier, a division of reed India
Private Limited, Fifth edition, 2012
7. Structured Computer Organization, Tannenbaum(PHI)
UNIT-1 Introduction to Value Education

Understanding the need, basic guidelines, content, and process for Value Education, Self
Exploration-what is it? - its content and process; 'Natural Acceptance' and Experiential
Validation -as the mechanism for self-exploration, Continuous Happiness, and Prosperity-A look
at basic Human Aspirations, Right understanding, Relationship, and Physical Facilities-the basic
requirements for fulfillment of aspirations of every human being with their correct priority,
Understanding Happiness and Prosperity correctly - A critical appraisal of the current scenario,
Method to fulfill the above human aspirations: understanding and living in harmony at various
levels.

UNIT-2 Understanding Harmony in the Human Being

Understanding human being as a co-existence of the sentient 'I' and the material 'Body',
Understanding the needs of Self (I) and 'Body' - Sukh and Suvidha, Understanding the Body as
an instrument of 'I' (I being the doer, see, and enjoyer), Understanding the characteristics and
activities of I' and harmony in T,Understanding the harmony of I with the Body: Sanyam and
Swasthya; correct appraisal of Physical needs, the meaning of Prosperity in detail, Programs
to ensure Sanyam and Swasthya.
UNIT-3 Understanding Harmony in the Family and Society
Harmony inHuman-Human Relationship Understanding harmony in the Family-the basic unit of
human interaction, Understanding values in the human-human relationship; meaning of Nyaya
and program for its fulfillment to ensure Ubhay-tripti; Trust (Vishwas) and Respect(Samman) as
the foundational values of relationship, Understanding the meaning of Vishwas; Difference
between intention and competence, Understanding the meaning of Samman, Difference between
respect and differentiation; the other salient values in a relationship, Understanding the harmony
in the society (society being an extension of the family): Samadhan, Samridhi, Abhay, Sah
astitva as comprehensive Human Goals, Visualizing a universal harmonious order in society
Undivided Society (Akhand Samaj), Universal Order (Sarvabhaum Vyawastha) - from family to
world family!.
UNIT-4 Understanding Harmony in Nature and Existence

Whole existence as Co-existence Understanding the harmony in Nature, Inter connectedness, and
mutual fulfillment among the four orders of nature- recyclability and self-regulation in nature,
Understanding Existence as Co-existence (Sah-astitva) of mutually interacting units in all
pervasive space, Holistic perception of harmony at all levels of existence.
UNIT-5 Implications of the above Holistic Understanding of Harmony on
Professional Ethics

Natural acceptance of human values, Definitiveness of Ethical Human Conduct, Basis for
Humanistic Education, Humanistic Constitution and Humanistic Universal Order, Competence
in Professional Ethics: a) Ability to utilize the professional competence for augmenting universal
human order, b) Ability to identify the scope and characteristics of people-friendly and eco
friendly production systems, technologies, and management models, Case studies of typical
holistic technologies, management models and production systems, Strategy for the transition
from the present state to Universal Human Order: a) At the level of individual: as socially and
ecologically responsible engineers, technologists and managers, b)At the level of society: as
mutually enriching institutions and organizations.
Text Book
BCS303 DISCRETE STRUCTURES & THEORY OF LOGIC

Course Outcome ( Co) Bloom's Knowledge Level (KL)

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

CO 1 Acquire Knowledge of sets and relations for solving the problems of POSET and lattices. K3, Ka
CO 2
Apply fundamental concepts of functions and Boolean algebra for solving the problems of logical
abilities. KË, Kz
CO 3 Employ the rules of propositions and predicate logic to solve the complex and logical problems. Ka

CO 4
Explore the concepts of group theory and their applications for solving the advance technological
problems.
K, K¡
CO5 Illustrate the principles and concepts of graph theory for solving problems related to computer science. Kz, Ks
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Set Theory& Relations: Introduction, Combination of sets. Relations: Definition, Operations on
relations, Properties of relations, Composite Relations, Equality of relations, Recursive definition
of relation, Order of relations. 08

POSET 8& Lattices: Hasse Diagram, POSET, Definition & Properties of lattices - Bounded,
Complemented, Distributed, Modular and Complete lattice.

Functions: Definition, Classification of functions, Operations on functions. Growth of Functions.

08
Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic manipulation
of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps.
Theory of Logics: Proposition, Truth tables, Tautology, Satisfiability, Contradiction, Algebra of
proposition, Theory of Inference. Predicate Logic: First order predicate, well- formed formula of 08
predicate, quantifiers, Inference theory of predicate logic.

Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability,
IV Contradiction, Algebra of proposition, Theory of Inference. 08
Predicate Logic: First order predicate, well formed formula of predicate, quantifiers, Inference
theory of predicate logic.
V Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs,
Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph 08
coloring
Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle
Text books:
1. Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill,
2006.
2. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
3. E.R. Scheinerman, Mathematics: ADiscrete Introduction, Brooks/Cole, 2000.
4. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
5. Liptschutz, Seymour, " Discrete Mathematics", McGraw Hill.
6. Trembley, J.P & R. Manohar, "Discrete Mathematical Structure with Application to Computer Science", McGraw Hill. 4. Deo,
7. Narsingh, "Graph Theory With application to Engineering and Computer.Science.", PHI.
8. Krishnamurthy, V., "Combinatorics Theory & Application", East-West Press Pvt. Ltd., New Delhi