www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntukkd
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.TECH (ARTIFICIAL INTELLIGENCE & DATA SCIENCE)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)
B. Tech II Year I Semester
S.No. Category Title L T P Credits
1 BS&H Discrete Mathematics & 3 0 0 3
Graph Theory
2 BS&H Universal human values – 2 1 0 3
understanding harmony and
Ethical human conduct
3 Engineering Science Database Management 3 0 0 3
Systems
4 Professional Core Advanced Data Structures 3 0 0 3
Algorithms Analysis
5 Professional Core Object Oriented 3 0 0 3
Programming Through Java
6 Professional Core Advanced Data Structures 0 0 3 1.5
and Algorithms Analysis Lab
7 Professional Core Object Oriented 0 0 3 1.5
Programming Through Java
Lab
8 Skill Enhancement Python Programming Lab 0 1 2 2
course
9 Audit Course Environmental Science 2 0 0 -
Total 16 2 8 20
www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntukkd
, www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntukkd
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.TECH (ARTIFICIAL INTELLIGENCE & DATA SCIENCE)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)
B. Tech.– II Year II Semester
S.No. Category Title L T P Credits
1 Management Course- I Managerial Economic and 2 0 0 2
Financial Analysis
2 Engineering Science/ Basic Statistical methods for 3 0 0 3
Science Data science
3 Professional Core Artificial Intelligence 3 0 0 3
4 Professional Core Introduction to Data 3 0 0 3
Science
5 Professional Core Digital Logic& Computer 3 0 0 3
Organization
6 Professional Core Artificial Intelligence Lab 0 0 3 1.5
7 Professional Core Data Science using 0 0 3 1.5
Python Lab
8 Skill Enhancement course Full Stack Development-1 0 1 2 2
9 Design Thinking
BS&H 1 0 2 2
& Innovation
Total 15 1 10 21
Mandatory Community Service Project Internship of 08 weeks duration during summer
vacation
www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntukkd
, www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntukkd
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.TECH (ARTIFICIAL INTELLIGENCE & DATA SCIENCE)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)
II Year I Semester L T P C
3 0 0 3
DISCRETE MATHEMATICS AND GRAPH THEORY
Course Objectives:
To introduce the students to the topics and techniques of discrete methods and
combinatorial reasoning.
To introduce a wide variety of applications. The algorithmic approach to the solution
of problems is fundamental in discrete mathematics, and this approach reinforces the
close ties between this discipline and the area of computer science.
Course Outcomes: At the end of the course students will be able to
1. Build skills in solving mathematical problems (L3)
2. Comprehend mathematical principles and logic (L4)
3. Demonstrate knowledge of mathematical modeling and proficiency in using
mathematical software (L6)
4. Manipulate and analyze data numerically and/or graphicallysing appropriate Software
(L3)
5. How to communicate effectively mathematical ideas/results verbally or in writing
(L1)
UNIT–I: Mathematical Logic:
Propositional Calculus: Statements and Notations, Connectives, Well Formed Formulas,
Truth Tables, Tautologies, Equivalence of Formulas, Duality Law, Tautological Implications,
Normal Forms, Theory of Inference for Statement Calculus, Consistency of Premises,
Indirect Method ofProof, Predicate Calculus: Predicates, Predicative Logic, Statement
Functions, Variables and Quantifiers, Free and Bound Variables, Inference Theory for
Predicate Calculus.
UNIT-II: Set Theory:
Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties, Operations,
Partition and Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering,
Hasse Diagrams, Functions: Bijective, Composition, Inverse, Permutation, and Recursive
Functions, Lattice and its Properties.
UNIT-III: Combinatorics and Recurrence Relations:
Basis of Counting, Permutations, Permutations withRepetitions, Circular and Restricted
Permutations, Combinations, RestrictedCombinations, Binomial and Multinomial
Coefficients and Theorems.
Recurrence Relations:
www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntukkd
, www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntukkd
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.TECH (ARTIFICIAL INTELLIGENCE & DATA SCIENCE)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)
Generating Functions, Function of Sequences, Partial Fractions, Calculating Coefficient of
Generating Functions, Recurrence Relations, Formulation as Recurrence Relations, Solving
Recurrence Relations by Substitution and Generating Functions, Method of Characteristic
Roots, Solving Inhomogeneous Recurrence Relations
UNIT-IV: Graph Theory:
Basic Concepts, Graph Theory and its Applications, Subgraphs, Graph Representations:
Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and
Hamiltonian Graphs,
Unit-V: Multi Graphs
Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem, Graph Colouring and Covering,
Chromatic Number, Spanning Trees, Prim’s and Kruskal’s Algorithms, BFS and DFS
Spanning Trees.
TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science, J. P.
Tremblay and P. Manohar, Tata McGraw Hill.
2. Elements of Discrete Mathematics-A Computer Oriented Approach, C. L.Liu and D.
P. Mohapatra, 3rd Edition, Tata McGraw Hill.
3. Theory and Problems of Discrete Mathematics, Schaum’s Outline Series, Seymour
Lipschutz and Marc Lars Lipson, 3rd Edition, McGraw Hill.
REFERENCE BOOKS:
1. Discrete Mathematics for Computer Scientists and Mathematicians, J. L.Mott, A.
Kandel and T. P. Baker, 2nd Edition, Prentice Hall of India.
2. Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby andSharon
Cutler Ross, PHI.
3. Discrete Mathematics, S. K. Chakraborthy and B.K. Sarkar, Oxford, 2011.
4. Discrete Mathematics and its Applications with Combinatorics and GraphTheory, K.
H. Rosen, 7th Edition, Tata McGraw Hill.
II Year I Semester L T P C
2 1 0 3
www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntukkd
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.TECH (ARTIFICIAL INTELLIGENCE & DATA SCIENCE)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)
B. Tech II Year I Semester
S.No. Category Title L T P Credits
1 BS&H Discrete Mathematics & 3 0 0 3
Graph Theory
2 BS&H Universal human values – 2 1 0 3
understanding harmony and
Ethical human conduct
3 Engineering Science Database Management 3 0 0 3
Systems
4 Professional Core Advanced Data Structures 3 0 0 3
Algorithms Analysis
5 Professional Core Object Oriented 3 0 0 3
Programming Through Java
6 Professional Core Advanced Data Structures 0 0 3 1.5
and Algorithms Analysis Lab
7 Professional Core Object Oriented 0 0 3 1.5
Programming Through Java
Lab
8 Skill Enhancement Python Programming Lab 0 1 2 2
course
9 Audit Course Environmental Science 2 0 0 -
Total 16 2 8 20
www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntukkd
, www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntukkd
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.TECH (ARTIFICIAL INTELLIGENCE & DATA SCIENCE)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)
B. Tech.– II Year II Semester
S.No. Category Title L T P Credits
1 Management Course- I Managerial Economic and 2 0 0 2
Financial Analysis
2 Engineering Science/ Basic Statistical methods for 3 0 0 3
Science Data science
3 Professional Core Artificial Intelligence 3 0 0 3
4 Professional Core Introduction to Data 3 0 0 3
Science
5 Professional Core Digital Logic& Computer 3 0 0 3
Organization
6 Professional Core Artificial Intelligence Lab 0 0 3 1.5
7 Professional Core Data Science using 0 0 3 1.5
Python Lab
8 Skill Enhancement course Full Stack Development-1 0 1 2 2
9 Design Thinking
BS&H 1 0 2 2
& Innovation
Total 15 1 10 21
Mandatory Community Service Project Internship of 08 weeks duration during summer
vacation
www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntukkd
, www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntukkd
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.TECH (ARTIFICIAL INTELLIGENCE & DATA SCIENCE)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)
II Year I Semester L T P C
3 0 0 3
DISCRETE MATHEMATICS AND GRAPH THEORY
Course Objectives:
To introduce the students to the topics and techniques of discrete methods and
combinatorial reasoning.
To introduce a wide variety of applications. The algorithmic approach to the solution
of problems is fundamental in discrete mathematics, and this approach reinforces the
close ties between this discipline and the area of computer science.
Course Outcomes: At the end of the course students will be able to
1. Build skills in solving mathematical problems (L3)
2. Comprehend mathematical principles and logic (L4)
3. Demonstrate knowledge of mathematical modeling and proficiency in using
mathematical software (L6)
4. Manipulate and analyze data numerically and/or graphicallysing appropriate Software
(L3)
5. How to communicate effectively mathematical ideas/results verbally or in writing
(L1)
UNIT–I: Mathematical Logic:
Propositional Calculus: Statements and Notations, Connectives, Well Formed Formulas,
Truth Tables, Tautologies, Equivalence of Formulas, Duality Law, Tautological Implications,
Normal Forms, Theory of Inference for Statement Calculus, Consistency of Premises,
Indirect Method ofProof, Predicate Calculus: Predicates, Predicative Logic, Statement
Functions, Variables and Quantifiers, Free and Bound Variables, Inference Theory for
Predicate Calculus.
UNIT-II: Set Theory:
Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties, Operations,
Partition and Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering,
Hasse Diagrams, Functions: Bijective, Composition, Inverse, Permutation, and Recursive
Functions, Lattice and its Properties.
UNIT-III: Combinatorics and Recurrence Relations:
Basis of Counting, Permutations, Permutations withRepetitions, Circular and Restricted
Permutations, Combinations, RestrictedCombinations, Binomial and Multinomial
Coefficients and Theorems.
Recurrence Relations:
www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntukkd
, www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntukkd
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA – 533 003, Andhra Pradesh, India
B.TECH (ARTIFICIAL INTELLIGENCE & DATA SCIENCE)
(R23-IInd YEAR COURSE STRUCTURE & SYLLABUS)
Generating Functions, Function of Sequences, Partial Fractions, Calculating Coefficient of
Generating Functions, Recurrence Relations, Formulation as Recurrence Relations, Solving
Recurrence Relations by Substitution and Generating Functions, Method of Characteristic
Roots, Solving Inhomogeneous Recurrence Relations
UNIT-IV: Graph Theory:
Basic Concepts, Graph Theory and its Applications, Subgraphs, Graph Representations:
Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and
Hamiltonian Graphs,
Unit-V: Multi Graphs
Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem, Graph Colouring and Covering,
Chromatic Number, Spanning Trees, Prim’s and Kruskal’s Algorithms, BFS and DFS
Spanning Trees.
TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science, J. P.
Tremblay and P. Manohar, Tata McGraw Hill.
2. Elements of Discrete Mathematics-A Computer Oriented Approach, C. L.Liu and D.
P. Mohapatra, 3rd Edition, Tata McGraw Hill.
3. Theory and Problems of Discrete Mathematics, Schaum’s Outline Series, Seymour
Lipschutz and Marc Lars Lipson, 3rd Edition, McGraw Hill.
REFERENCE BOOKS:
1. Discrete Mathematics for Computer Scientists and Mathematicians, J. L.Mott, A.
Kandel and T. P. Baker, 2nd Edition, Prentice Hall of India.
2. Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby andSharon
Cutler Ross, PHI.
3. Discrete Mathematics, S. K. Chakraborthy and B.K. Sarkar, Oxford, 2011.
4. Discrete Mathematics and its Applications with Combinatorics and GraphTheory, K.
H. Rosen, 7th Edition, Tata McGraw Hill.
II Year I Semester L T P C
2 1 0 3
www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntukkd
