Department of Computer Science Engineering

(Artificial Intelligence & Machine Learning)

Course File

DISCRETE MATHEMATICS
(Course Code: CS402PC)

II B.Tech II Semester
2023-24

Mr. Shaik Shafi

Assistant Professor

Ananthagiri, Kodad, Telangana 508 206, India.

Course File

Department of Computer Science Engineering (AIML)

DISCRETE MATHEMATICS

Check List

S.No Name of the Format Page No.

1 Syllabus 1
2 Timetable 2
3 Vision and Mission of the Institute & Department 3
4 Program Educational Objectives 4
5 Program Objectives 4
6 Course Objectives 5
7 Course Outcomes 5
8 Guidelines to study the course 6
9 Course Schedule 7
10 Course Plan 10
11 Lesson Plan 19
12 Assignment Sheets 41
13 Tutorial Sheets 46
14 Evaluation Strategy 51
15 Course completion status 52
16 Mappings of CO's and PO's 53
17 Rubric for course 54
18 Mid-I and Mid-II question papers 55
19 Mid-I & Mid-II marks 56
20 Sample answer scripts and Assignments 60
21 Course materials like Notes, PPT's, etc. 62

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Int. Marks:40 Ext. Marks:60 Total Marks:100

DISCRETE MATHEMATICS

Course Code: CS402PC L-T-P-C : 3/0/0/3

II Year B.Tech. CSE - I Sem

UNIT - I
Mathematical logic: Introduction, Statements and Notation, Connectives, Normal Forms,
Theory of Inference for the Statement Calculus, The Predicate Calculus, Inference Theory of
the Predicate Calculus.
UNIT - II
Set theory: Introduction, Basic Concepts of Set Theory, Representation of Discrete Structures,
Relations and Ordering, Functions.
UNIT - III
Algebraic Structures: Introduction, Algebraic Systems, Semi groups and Monoids, Lattices as
Partially Ordered Sets, Boolean Algebra.
UNIT – IV
Elementary Combinatorics: Basics of Counting, Combinations and Permutations,
Enumeration of Combinations and Permutations, Enumerating Combinations and
Permutations with Repetitions, Enumerating Permutation with Constrained Repetitions,
Binomial Coefficient, The Binomial and Multinomial Theorems, The Principle of Exclusion.
UNIT - V
Graph Theory: Basic Concepts, Isomorphism and Subgraphs, Trees and their Properties,
Spanning Trees, Directed Trees, Binary Trees, Planar Graphs, Euler’s Formula, Multi -graphs
and Euler Circuits, Hamiltonian Graphs, Chromatic Numbers, The Four-Color Problem.
Text Books:
1. Discrete Mathematical Structures with Applications to Computer Science: J.P. Tremblay, R. Manohar,
McGraw-Hill, 1st edition.
2. Discrete Mathematics for Computer Scientists & Mathematicians: Joe l. Mott,
Abraham Kandel, Teodore P. Baker, Prentis Hall of India, 2
Reference Books:
1. Discrete and Combinatorial Mathematics - an applied introduction: Ralph.P.
Grimald, Pearsoneducation, 5th edition.
AY: 2023-24 II B.Tech II Sem Discrete Mathematics
Course File

Department of Computer Science Engineering (AIML)

2. Discrete Mathematical Structures: Thomas Kosy, Tata McGraw Hill publishing co.

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Timetable
Name of the Faculty: Mr. SHAIK SHAFI , Assistant Professor No. of Hrs: 6
DAY 9:30-10:20 10:20-11:10 11:20-12:10 12:10-1:00 1:00-1:40 1:40-2:25 2:25-3:10 3:15-4:00
MON DM
TUE DM
WED DM
LUNCH
THU DM
FRI DM
SAT DM

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Vision of the Institute

To be a premier Institute in the country and region for the study of Engineering, Technology and
Management by maintaining high academic standards which promotes the analytical thinking and
independent judgment among the prime stakeholders, enabling them to function responsibly in the
globalized society.
Mission of the Institute
To be a world-class Institute, achieving excellence in teaching, research and consultancy in cutting-edge
Technologies and be in the service of society in promoting continued education in Engineering,
Technology and Management.
Quality Policy
To ensure high standards in imparting professional education by providing world-class infrastructure, top-
quality-faculty and decent work culture to sculpt the students into Socially Responsible Professionals
through creative team-work, innovation and research
Vision of the Department
To become a center of excellence for technically proficient and creative computer engineers.
Mission of the Department
 To impart quality education and share professional & technical knowledge, leading to a career as
computer professional in different domains of industry, governance and academia.
 To impart hands on training in latest methodologies and technologies.
 To provide state-of-art environment for learning and practices.

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Program Educational Objectives (B.Tech. – CSE-AI&ML)

Graduates will be able to
PEO 1: Graduates will have broad scientific and engineering knowledge to formulate, analyze and
resolve engineering issues in real world.
PEO 2: Graduates will have the skills they need for a successful career in AI and related fields that
meet the needs of the country and businesses
PEO 3: Graduates will function effectively in workplace with demonstrable attributes like
leadership, lifelong learning, and teamwork in order to meet the requirements of society.
Program Outcomes (B.Tech. – CSE-AI&ML)
At the end of the Program, a graduate will have the ability to

PO 1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals,

and an engineering specialization to the solution of complex engineering problems.
PO 2: Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural sciences,
and engineering sciences.
PO 3: Design/development of solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental considerations.
PO 4: Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information
to provide valid conclusions.
PO 5: Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modelling to complex engineering activities with an
understanding of the limitations.
PO 6: The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.
PO 7: Environment and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

PO 8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of
the engineering practice.
PO 9: Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.
PO 10: Communication: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear instructions.
PO 11: Project management and finance: Demonstrate knowledge and understanding of the engineering
and management principles and apply these to one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments.
PO 12: Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

COURSE OBJECTIVES

On completion of this Subject/Course the student shall be able to:

S.No. Objectives
1 Introduces the elementary Discrete Mathematics for computer science and
engineering.
2 Topics include formal logic notation, methods of proof, induction, sets, relations,
algebraic structures, elementary graph theory, permutations and combinations,
counting principles.
3 Analyze and solve POSET’s and Algebraic Problems using Groups.

4 Apply Permutations and Combinations to Solve the Discrete Problems

5 Apply graph theory in solving computing problems.

COURSE OUTCOMES

The expected outcomes of the Course/Subject are:

S.No. Outcomes
1. Understand and construct Inference Theory and Normal Forms.

2. Apply set theory and Relations to formulate Discrete Structures.

3. Analyse and solve POSET’s and Algebraic Problems using Groups.

4. Apply Permutations and Combinations to Solve the Discrete Problems.

5. Apply Graph Theory in solving computing problems.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

GUIDELINES TO STUDY THE COURSE / SUBJECT

Course Design and Delivery System (CDD):

 The Course syllabus is written into number of learning objectives and outcomes.
 Every student will be given an assessment plan, criteria for assessment, scheme of evaluation and
grading method.
 The Learning Process will be carried out through assessments of Knowledge, Skills and Attitude by
various methods and the students will be given guidance to refer to the text books, reference books,
journals, etc.

The faculty be able to –

 Understand the principles of Learning
 Understand the psychology of students
 Develop instructional objectives for a given topic
 Prepare course, unit and lesson plans
 Understand different methods of teaching and learning
 Use appropriate teaching and learning aids
 Plan and deliver lectures effectively
 Provide feedback to students using various methods of Assessments and tools of Evaluation
 Act as a guide, advisor, counselor, facilitator, motivator and not just as a teacher alone

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

COURSE SCHEDULE

The Schedule for the whole Course / Subject is:

Duration (Date) Total No.
S. No. Description
From To of Periods
UNIT-I: MATHEMATICAL LOGIC
Introduction, Statements and Notation, Connectives,
1. Normal Forms, Theory of Inference for the Statement
05.02.2024 24.02.2024 14
Calculus, The Predicate Calculus, Inference Theory of
Predicate Calculus.
UNIT-II: SET THORY:
2. Introduction, Basic Concepts of Set Theory,
Representation of Discrete Structures, 25.02.2024 18.03.2024 14
Relations and Ordering, Functions.
UNIT-III: ALGEBRAIC STRUCTURES:
3. Introduction, Algebraic Systems, Semi groups and
19.03.2024 20.04.2024 10
Monoids, Lattices as Partially Ordered Sets, Boolean
Algebra.
UNIT-IV: ELEMENTARY COMBINATIONS:
Basics of Counting, Combinations and Permutations,
Enumeration of Combinations and Permutations,
4. Enumerating Combinations and Permutations with
Repetitions, Enumerating Permutation with Constrained 21.04.2024 02.05.2024 11
Repetitions, Binomial Coefficient, The Binomial and
Multinomial Theorems, The Principle of Exclusion.

UNIT-V:GRAPH THEORY: Basic Concepts,

Isomorphism and Subgraphs, Trees and their Properties,
5. Spanning Trees, Directed Trees, Binary Trees, Planar
03.05.2024 12.06.2024 16
Graphs, Euler’s Formula, Multi –graphs and Euler
Circuits, Hamiltonian Graphs, Chromatic Numbers, The
Four-Color Problem.
Total No. of Instructional periods available for the course: 65 Hours

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

SCHEDULE OF INSTRUCTIONS - COURSE PLAN

Objectives
Unit Lesson No. of & References
Date Topics / Sub-Topics
No. No. Periods Outcomes (Textbook, Journal)
Nos.
Discrete Mathematical
Motivation and Introduction to 1 Structures with
1 05.02.2024 1
Discrete Mathematics 1 Applications to
Computer Science:
Discrete Mathematical
06.02.2024
1 Structures with
2 & 2 Connectives
1 Applications to
07.02.2024
Computer Science:
Discrete Mathematical
08.02.2024
Logical operators and truth 1 Structures with
3 & 2
tables 1 Applications to
09.02.2024
Computer Science:
Discrete Mathematical
12.02.2024
1 Structures with
1. 4 & 2 Logical Equivalences
1 Applications to
13.02.2024
Computer Science:
Discrete Mathematical
14.02.2024
1 Structures with
5 to 3 Logical Inferences
1 Applications to
17.02.2024
Computer Science:
Discrete Mathematical
1 Structures with
6 19.02.2024 1 Quantified Statements
1 Applications to
Computer Science:
Discrete Mathematical
21.02.2024
1 Structures with
7 & 3 Rules of Universal Quantifiers.
1 Applications to
24.02.2024
Computer Science:
Discrete Mathematical
2 Structures with
1 26.02.2024 1 Introduction to set theory
2 Applications to
Computer Science:
Discrete Mathematical
24.02.2024
Set definitions and 2 Structures with
2 & 2
applications 2 Applications to
2. 27.02.2024
Computer Science:
Discrete Mathematical
28.02.2024
Functions, Types of function 2 Structures with
3 to 3
and related problems 2 Applications to
02.03.2024
Computer Science:
05.03.2024 2 Discrete Mathematical
4 3 Relations and their properties
& 2
AY: 2023-24 II B.Tech II Sem Discrete Mathematics
Course File

Department of Computer Science Engineering (AIML)

15.03.2024 Structures with
Applications to
Computer Science:
Discrete Mathematical
16.03.2024
Equivalence relations and 2 Structures with
5 & 2
Partially Ordered Set 2 Applications to
19.03.2024
Computer Science:
Discrete Mathematical
2 Structures with
6 21.03.2024 1 Discrete Structures
2 Applications to
Computer Science:
Discrete Mathematical
22.03.2024
2 Structures with
7 & 3 Problems
2 Applications to
25.03.2024
Computer Science:
Discrete Mathematical
3 Structures with
1 26.03.2024 1 Algebraic Structures
3 Applications to
Computer Science:
Discrete Mathematical
3 Structures with
2 27.03.2024 1 Semi group
3 Applications to
Computer Science:
Discrete Mathematical
3 Structures with
3 28.03.2024 1 Monoid and related problems
3 Applications to
Computer Science:
Discrete Mathematical
3 Structures with
4 30.03.2024 1 Group with examples
3 Applications to
Computer Science:
3. Discrete Mathematical
3 Structures with
5 05.04.2024 1 Lattices
3 Applications to
Computer Science:
Discrete Mathematical
3 Structures with
6 08.04.2024 1 Properties of Lattices
3 Applications to
Computer Science:
Discrete Mathematical
Complement of Lattices 3 Structures with
7 10.04.2024 1
Hasse Diagrams 3 Applications to
Computer Science:
Discrete Mathematical
18.04.2024
3 Structures with
8 & 3 Boolean Algebra
3 Applications to
22.04.2024
Computer Science:
1 23.04.2024 1 Permutations 4 Discrete Mathematical
AY: 2023-24 II B.Tech II Sem Discrete Mathematics
Course File

Department of Computer Science Engineering (AIML)

4 Structures with
Applications to
Computer Science:
Discrete Mathematical
24.04.2024
Permutations with problem 4 Structures with
2 & 2
solving 4 Applications to
25.04.2024
Computer Science:
4 Discrete Mathematical
4 Structures with
3 26.04.2024 1 Combinations
4 Applications to
Computer Science:
Discrete Mathematical
29.04.2024
4 Structures with
4 & 2 Problem Solving
4 Applications to
30.04.2024
Computer Science:
Discrete Mathematical
4 Structures with
5 01.05.2024 1 Combinations with repetitions
4 Applications to
Computer Science:
Discrete Mathematical
02.05.2024
Binomial Theorem & 4 Structures with
6 & 2
Mutinomial 4 Applications to
04.05.2024
Computer Science:
Discrete Mathematical
Principle of Inclusion- 4 Structures with
7 05.05.2024 1
Exclusion 4 Applications to
Computer Science:
Discrete Mathematics
06.05.2024 for Computer
5
1 & 2 Introduction to Graph Theory Scientists &
5
08.05.2024 Mathematicians: Joe l.
Mott
Discrete Mathematics
09.05.2024 for Computer
5
2 & 2 Types of Graphs Scientists &
5
11.05.2024 Mathematicians: Joe l.
Mott
5 Discrete Mathematics
for Computer
5
3 03.06.2024 2 Types of matrices from Graphs Scientists &
5
Mathematicians: Joe l.
Mott
Discrete Mathematics
04.06.2024 for Computer
5
4 & 2 Isomorphism of Graphs Scientists &
5
05.06.2024 Mathematicians: Joe l.
Mott
5 06.06.2024 2 Proper Coloring 5 Discrete Mathematics
AY: 2023-24 II B.Tech II Sem Discrete Mathematics
Course File

Department of Computer Science Engineering (AIML)

5 for Computer
Scientists &
Mathematicians: Joe l.
Mott
Discrete Mathematics
for Computer
5
6 07.06.2024 1 Types of trees Scientists &
5
Mathematicians: Joe l.
Mott
Discrete Mathematics
1, 2, 3, 4, for Computer
5
7 08.06.2024 2 Graph Traversals, BFS,DFS Scientists &
1, 2, 3, 4,
5 Mathematicians: Joe l.
Mott
Discrete Mathematics
09.06.2024 for Computer
1, 2
8 & 2 Revision of Unit I & II Scientists &
1, 2
10.06.2024 Mathematicians: Joe l.
Mott
Discrete Mathematics
for Computer
11.06.2024 3, 4
9 2 Revision of Unit III & IV Scientists &
&12.06.2024 3, 4
Mathematicians: Joe l.
Mott

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-I)

Lesson No: 01 Duration of Lesson:50 min

Lesson Title: Fundamental Logic

Instructional / Lesson Objectives:

 To make students understand the concept of statements and their utilization.

 To familiarize students on the concept of statements.
 To understand students the concept of Fundamental principles on connectives.
 To find conclusions from the given hypothesis.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 mins for taking attendance

40 min for the lecture delivery
05 min for doubts session

Refer assignment – I & tutorial-I sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-I)

Lesson No: 02 Duration of Lesson: 1hr 40 min

Lesson Title: Connectives

Instructional / Lesson Objectives:

 To make students understand the concept of Connectives.

 To familiarize students on the concept of AND, OR and NOT operators with truth tables..
 To understand students the concept of Fundamental principles on connectives.
 To find conclusions from the given statements.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 mins for taking attendance

80 min for the lecture delivery
15 min for doubts session

Refer assignment – I & tutorial-I sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-I)

Lesson No: 03 Duration of Lesson:1hr 40 min

Lesson Title: Logical Operators

Instructional / Lesson Objectives:

 To make students understand the concept of Logical Operators and their utilization.
 To familiarize students on the concept of variations in operators.
 To understand students the concept of Fundamental principles on connectives.
 To find conclusions from the given statements.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 mins for taking attendance

80 min for the lecture delivery
15 min for doubts session

Refer assignment – I & tutorial-I sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-I)

Lesson No: 04 Duration of Lesson:1hr 40 min

Lesson Title: Logical Equivalences

Instructional / Lesson Objectives:

 To make students understand the concept of Equivalences and their utilization.

 To familiarize students on the concept of properties of Equivalences.
 To understand students the applications of the Equivalences.
 To find solutions with the help of Equivalence properties.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 mins for taking attendance

80 min for the lecture delivery
15 min for doubts session

Refer assignment – I & tutorial-I sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-I)

Lesson No: 05 Duration of Lesson: 2hr 30 min

Lesson Title: Logical Inferences

Instructional / Lesson Objectives:

 To make students understand the concept of Inferences.

 To familiarize students on the concept of conclusions from the given hypothesis.
 To understand students the concept of Fundamental principles on Inferences.
 To find conclusions from the given hypothesis.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 mins for taking attendance

130 min for the lecture delivery
15 min for doubts session

Refer assignment – I & tutorial-I sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-I)

Lesson No: 06 Duration of Lesson:50 min

Lesson Title: Quantifiers

Instructional / Lesson Objectives:

 To make students understand the concept of Quantifiers and their utilization.

 To familiarize students on the concept of Quantifiers.
 To understand students the concept of Fundamentals of Quantified statements.
 To find conclusions from the given hypothesis.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 min for taking attendance

40 min for the lecture delivery
05 min for doubts session

Refer assignment – I & tutorial-I sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-I)

Lesson No: 07 Duration of Lesson:2hr 30 min

Lesson Title: Rules of Inferences

Instructional / Lesson Objectives:

 To make students understand the concept of Universal and Existential Quantifiers and their
utilization.
 To familiarize students on the concept of Quantified statements.
 To understand students the concept of Fundamental principles on Quantifiers.
 To find conclusions from the given Quantifies statements.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 min for taking attendance

130 min for the lecture delivery
15 min for doubts session

Refer assignment – I & tutorial-I sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-II)

Lesson No: 01,02 Duration of Lesson: 2hr30 MIN

Lesson Title: Introduction to set theory, Definitions

Instructional / Lesson Objectives:

 To make students to understand how to define Set.

 To familiarize students on definition and types of Sets.
 To understand students the concept of Addition of subtraction of Sets.
 To provide information and utilization of elements of a set.

Teaching AIDS : PPTs, Digital Board,

Time Management of Class :

15 mins for taking attendance

15 for revision of previous class
105 min for lecture delivery
15 min for doubts session

Refer assignment – II & tutorial-II sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-II)

Lesson No: 03, 04 Duration of Lesson: 1hr40 MIN

Lesson Title: Functions, Relation

Instructional / Lesson Objectives:

 To make students to understand how to define a Function.

 To familiarize students on giving conclusions from the variations of Functions.
 To understand students the concept of Relations.
 To provide information on using the Relations.

Teaching AIDS : PPTs, Digital Board,

Time Management of Class :

10 min for taking attendance

10 for revision of previous class
70 min for lecture delivery
10 min for doubts session

Refer assignment – II & tutorial-II sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-II)

Lesson No: 05,06 and 07 Duration of Lesson: 5hrs

Lesson Title: Equivalence relations, POSET and Discrete Structures problems.

Instructional / Lesson Objectives:

 To make students to understand how to define an Equivalence and Partial Ordered Relations.
 To familiarize students on checking the Equivalence relations and Discrete Structures.
 To understand students the concept of Different relations.
 To provide information on using the Discrete structures.

Teaching AIDS : PPTs, Digital Board,

Time Management of Class :

30 min for taking attendance

30 for revision of previous class
210 min for lecture delivery
30 min for doubts session

Refer assignment – II & tutorial-II sheets

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-III)

Lesson No: 01and 02 Duration of Lesson: 1hr 40min

Lesson Title: Algebraic Structures and Semi group

Instructional / Lesson Objectives:

 To make students understand the concept of Algebraic Structures.

 To familiarize the properties of the Semi group.
 To understand students Algebraic structures foe checking whether it is Semi group or not.
 To develop the abstract thinking on Algebra.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 mins for taking attendance

15 for revision of previous class
55 min for lecture delivery
15 min for doubts session

Refer assignment-III & tutorial-III sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-III)

Lesson No: 03, 04 Duration of Lesson: 1hr40 MIN

Lesson Title: Group and Monoids

Instructional / Lesson Objectives:

 To make students understand the concept of Group.

 To familiarize the properties of the Groups.
 To understand students the Algebraic structures.
 To develop the abstract thinking on Algebra.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

10 min for taking attendance

10 for revision of previous class
70 min for lecture delivery
10 min for doubts session

Refer assignment-III & tutorial-III sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-III)

Lesson No: 05,06 and 07 Duration of Lesson: 2hr30 MIN

Lesson Title: Lattices and their properties

Instructional / Lesson Objectives:

 To make students understand the concept of Lattice Structures.

 To familiarize the properties of the Lattices.
 To understand students complemented properties of Lattices.
 To develop the abstract thinking on Algebra.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

15 min for taking attendance

15 for revision of previous class
95 min for lecture delivery
15 min for doubts session

Refer assignment-III & tutorial-III sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-III)

Lesson No: 08 Duration of Lesson: 2hr30 min

Lesson Title: Hasse diagrams and Boolean Algebra

Instructional / Lesson Objectives:

 To make students understand the concept of Boolean algebra.

 To familiarize the properties of the Boolean algebra.
 To understand students the Hasse diagrams and Lattices.
 To develop the abstract thinking on Algebra.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :
15 min for taking attendance
15 for revision of previous class
95 min for lecture delivery
15 min for doubts session

Refer assignment-III & tutorial-III sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-IV)

Lesson No: 01,02 Duration of Lesson: 1hr40 MIN

Lesson Title: Introduction to counting, Permutations

Instructional / Lesson Objectives:

 To make students understand the concept of counting.

 To familiarize the procedure of Selection and arranging the things.
 To understand students how to solve real life problems.
 To develop the counting techniques.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

10 min for taking attendance

10 for revision of previous class
70 min for lecture delivery
10 min for doubts session

Refer assignment-IV & tutorial-IV sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-IV)

Lesson No: 03, 04 Duration of Lesson: 1hr30 MIN

Lesson Title: Permutations and Combinations

Instructional / Lesson Objectives:

 To make students understand the concept of Permutations and Combinations.

 To familiarize the procedure of Selection and arranging the things.
 To understand students how to solve real life problems.
 To develop the counting techniques.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

10 min for taking attendance

10 for revision of previous class
70 min for lecture delivery
10 min for doubts session

Refer assignment-IV & tutorial-IV sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-IV)

Lesson No: 5 Duration of Lesson: 1hr30 MIN

Lesson Title: Combinations with repetitions.

Instructional / Lesson Objectives:

 To make students understand the concept of Combinations.

 To familiarize the procedure of Selection of the things.
 To understand students how to solve real life problems.
 To develop the counting techniques.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 mins for taking attendance

15 for revision of previous class
55 min for lecture delivery
15 min for doubts session

Refer assignment-IV & tutorial-IV sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-IV)

Lesson No: 06 ,07 Duration of Lesson: 2hr30 MIN

Lesson Title: Binomial Theorem

Instructional / Lesson Objectives:

 To make students understand the concept of Binomial and Multinomial Theorems.

 To familiarize the procedure of finding coefficients in the given expansion.
 To understand students how to solve real life problems.
 To develop the counting techniques.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 mins for taking attendance

15 for revision of previous class
55 min for lecture delivery
15 min for doubts session

Refer assignment-IV & tutorial-IV sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-V)

Lesson No: 01and 02 Duration of Lesson: 1hr40 MIN

Lesson Title: Introduction to graphs

Instructional / Lesson Objectives:

 To make students understand the Graph Theory.

 To familiarize the students about Graph structures.
 To understand students how to Paths and cycle in Graph theory
 To develop the creative thinking in using Graphs.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

5 mins for taking attendance

15 for revision of previous class
55 min for lecture delivery
15 min for doubts session

Refer assignment-V & tutorial-V sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-V)

Lesson No: 03 and 04 Duration of Lesson: 1hr40 MIN

Lesson Title: Conversion of Graphs to Matrices

Instructional / Lesson Objectives:

 To make students understand the Graph Theory.

 To familiarize the students about conversion of graphs into matrices.
 To understand students how to convert the graphs into matrices for different structures.
 To develop the creative thinking in using Graphs.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

10 min for taking attendance

10 for revision of previous class
70 min for lecture delivery
10 min for doubts session

Refer assignment-V & tutorial-V sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-V)

Lesson No: 05 and 06 Duration of Lesson: 2hr 30 MIN

Lesson Title: Isomorphism of Graphs

Instructional / Lesson Objectives:

 To make students understand the Isomorphism of Two Graphs.

 To familiarize the students about Graph structures.
 To understand students how to compare the Graphs
 To develop the creative thinking using Graph Theory.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

15 min for taking attendance

15 for revision of previous class
105 min for lecture delivery
15 min for doubts session

Refer assignment-V & tutorial-V sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

LESSON PLAN (U-V)

Lesson No: 07 and 08 Duration of Lesson: 3hr20 MIN

Lesson Title: Graph traversals and minimal spanning tree

Instructional / Lesson Objectives:

 To make students understand the Graph traversals.

 To familiarize the students about Graph structures.
 To understand students how to travel by different algorithms
 To develop the creative thinking in using Graphs.

Teaching AIDS : PPTs, Digital Board

Time Management of Class :

20 min for taking attendance

20 for revision of previous class
140 min for lecture delivery
20 min for doubts session

Refer assignment-V & tutorial-V sheets.

Signature of faculty

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

ASSIGNMENT – 1

This Assignment corresponds to Unit No. 1

Question Objective Outcome

Question
No. No. No.
Prove that the following equivalence is true
P ^  Q v R    P ^ Q  v  P ^ R  where v is X-OR
1 1 1
operator and ^ is AND operator

Show that the following are equivalences

2 A   P v C    A ^ P  C 1 1
 P  C  ^ Q  C    P v Q   C
Evaluvate the following statements and check whether the
tautologies or contradiction
3 (a). P   P v Q  1 1
(b).  P   Q  R      P  Q    P  R  

Show that the conclusion C follows from the premises

H1 , H 2 , H 3 … in the following cases.
4.  a  H1 : P v Q H2 :  Q^ R  H3 : R C: P 1 1
 b  H1 : Q H2 : P  Q C: P

Write the equivalent forms of the following formulas in which

negations are applied to the variables only
5. (a).  P v Q  1 1
(b).  P  Q

Obtain the product-of-sums canonical forms of the following

formulas.
6.
 P ^ Q ^ R v  P ^ R ^ Q v  P ^ Q ^ R 1 1

Obtain the product-of-sums canonical forms of the following

7. formulas. 1 1
 P ^ Q v  P ^ Q ^ R
Obtain the principal disjunctive and conjunctive normal forms
8. of the following formulas. 1 1
 P v Q   P Q

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Obtain the principal disjunctive and conjunctive normal forms
9. of the following formulas. 1 1
Q ^  P v Q
Obtain the principal disjunctive and conjunctive normal forms
10. of the following formulas. 1 1
 P  Q ^ R  ^  P   Q ^ R 

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

ASSIGNMENT – 2

This Assignment corresponds to Unit No. 2

Question Objective Outcome

Question
No. No. No.
Use the De Morgan’s Laws to prove that the complement of

1
A B A B A C  is A B  A B C  2 2

Let A  1, 2,3, 4,5, 6 . Construct the pictorial descriptions of the

relation R on A for the following cases
2 2 2
R   j, k  / j divides k 

Let A  1, 2,3, 4,5, 6 . Construct the pictorial descriptions of the

relation R on A for the following cases
 j, k  /  j  k   A
3 2 2
R
2

Let A  1, 2,3, 4,5, 6 . Construct the pictorial descriptions of the

relation R on A for the following cases
4. 2 2
R   j, k  / j is a multiple of k 

Show that the function f from real numbers into the real
numbers defined as f  x   x3  1 is an one-one and onto
5 2 2
function and find f 1

6 Prove that B  A  B A 2 2

Prove that if R is a symmetric relation, then R R1  R .

7 2 2

Let N be the set of Natural numbers. The relation R is defined

8 by  x, y  R  u, v   x  v  y  u . Then prove that R is an 2 2

Equivalence relation.

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Let U  1, 2,3, 4,5 , A  1,5 , B  1, 2,3, 4 and C  2,5 .
Determine the following sets.
9 a) A B 2 2
b) A  B C 

Let U  1, 2,3, 4,5 , A  1,5 , B  1, 2,3, 4 and C  2,5 .

Determine the following sets.
10
 A B  A C  2 2

A B B C

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

ASSIGNMENT – 3

This Assignment corresponds to Unit No. 3

Question Objective Outcome

Question
No. No. No.
Q is the set of rational numbers, * is a binary operation defined
on Q such that a * b  a  b  ab for a, b  Q . Then show that
1 3 3
 Q,* is a semi group?

Let  A,* be a semi group. Show that for any p, q, r in A , if

p * r  r * p and q * r  r * q then p * q * r  r * p * q .
2     3 3

Show that the set of all Q  positive rational numbers forms an

abelian group under the composition defined by * such that
3 ab 3 3
a *b  , a, b  Q  .
4

Prove that the set of integers  with binary operation * is defined

4 3 3
by a * b  a  b  2 , a, b   is an abelian group.

Show that G   x / x  3a5b for a, b   is a group under

5 3 3
multiplication?

6 Define the group definition with one example 3 3

7 Define Lattice structure with one example 3 3

8 Define Boolean algebra 3 3

9 Explain the properties of Lattices 3 3

10 Explain the Boolean Function. 3 3

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

ASSIGNMENT – 4

This Assignment corresponds to Unit No. 4

Question Objective Outcome

Question
No. No. No.
Find the number of permutations of the letters of the word

1 MATHEMATICS. 4 4

Find the number of committees of 5 that can be selected from 7

2 men and 5 women if the committee is to consist of atleast 1 man 4 4

and atleast 1 woman.
A certain question paper contains three Parts A, B, C with Four
questions in Part A , Five questions in Part B and Six questions
in part C . It is required to to answer Seven questions selecting
3 4 4
atleast two questions from each Part. In how many different
ways can a student select his seven questions for answering?

In how many ways can 5 men and 5 women be seated in a

row
4 4 4
i) if any person may sit next to any other?

ii) if men and women must occupy alternate seats?

Find the value of n so that 2 P  n, 2   50  P(2n, 2)

5 4 4

A certain question paper contains three Parts A, B, C with Four

questions in Part A , Five questions in Part B and Six questions
6 in part C . It is required to to answer Seven questions selecting 4 4
atleast two questions from each Part. In how many different
ways can a student select his seven questions for answering?

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Find the number of arrangements of the letters in
7 4 4
TALLAHASSEE which have no adjacent E’s.?

8 Define the Binomial Theorem 4 4

9 Explain how to find coefficient in Multinomial expansion 4 4

10 Explain the Principle of Inclusion and Exclusion 4 4

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

ASSIGNMENT – 5

This Assignment corresponds to Unit No. 5

Question Objective Outcome

Question
No. No. No.

1 Define Proper coloring and Chromatic number. 5 5

2 What is Graph traversal? Explain the Breadth First Search. 5 5

3 Explain Prime’s Algorithm. 5 5

4 Define Eulerian graph 5 5

5 Explain the Isomorphism of two graphs 5 5

6 Explain Krushkals algorithm for minimal spanning tree 5 5

7 Explain the conversion of a graph into adjacency matrix 5 5

8 State Euler’s theorem 5 5

9 Define a graph with four edges and six vertices. 5 5

10 Explain about Depth First search algorithm 5 5

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

TUTORIAL – 1

This tutorial corresponds to Unit No. 1 (Objective Nos.: 1, Outcome Nos.: 1)

1. Which of the following statement is/ are true?

A. 281 is a prime number.
B. It is very cold today.
C. Cardinality of A  1,  , , 2,34 is 5
D. 10 1  11 .
2. She will neither visit the museum nor attend the concert. Negation of this statement is?
A. She will not visit the museum and she will not attend the concert.
B. She will visit the museum and she will attend the concert.
C. She will visit the museum or she will attend the concert.
D. She will visit the museum or she will not attend the concert.
3. If A and B are any statement, then which of the following is a tautology?
A. A  F
B. A A
C. A  T
D.  A  B   A
4. Which of the following is logically equivalent to  P  Q ?
A. P  Q
B. P   Q  R 
C.  P Q 
D.  P  Q
5. Which of the following statements is/are true?
S1: If p  q , then q  p is the converse of p  q
S2: If p  q , then q  p is the contrapositive of the p  q
S3: If p  q , then p  q is the inverse of the p  q
A. S1 and S2
B. S1
C. S1,S2 and S3
D. None of the above
6. Define a statement?
7. Define the Logical Inference?
8. Define the PDNF?
9. Define the PCNF?
10. Define the Modus Tonen’s?

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

TUTORIAL – 2

This tutorial corresponds to Unit No. 2 (Objective Nos.: 2, Outcome Nos.: 2)

1. A function f : R  R is defined as f  x   x 2 is

a) One-one
b) Onto
c) One-one and Onto
d) None of the above
2. Let R  1,1 ,  2, 2  ,  3,3 ,  4, 4  ,  2,3 be the relation on the set A  1, 2,3, 4

a) Reflexive
b) Symmetric
c) Transitive
d) None of the above
3. A function f  1, a  ,  2, b  ,  3, c  ,  4, d  from a set A  1, 2,3, 4 to B  a, b, c, d  is

a) One-one
b) Onto
c) Both One-one and onto
d) None of the above
4. A function f : R   R  is defined as f  x   x 2

a) One-one
b) Onto
c) One-one and Onto
d) None of the above
5. Let R is a relation defined as “ x divides y” from A  1, 2,3, 4 to B  6, 7,8,9

a) 1,6  R
b) 2R8
c) 3R7
d) 3R8
6. What is a set?
AY: 2023-24 II B.Tech II Sem Discrete Mathematics
Course File

Department of Computer Science Engineering (AIML)

7. What is the function?
8. What is the Relation?
9. What is One-One function?
10. What is Onto function?

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

TUTORIAL SHEET – 3

This tutorial corresponds to Unit No. 3 (Objective Nos.: 3, Outcome Nos.: 3)

1. If 1,  ,  2  is a group with respect to multiplication where 1,  ,  2 are the cube roots of unity then

which of the following is an identity element?

a) 0 b) 1 c) -1 d) 100
2. If a set G  1, 1, i, i where i 2  1 is an abilean group with respect to the multiplication, then the

inverse of i is
a) i b) i c) 1 d) 1
3. 5 3 4  ?

a) 1 b) 2 c) 3 d) 4
b)
4. Cancelation Laws holds in G for all a, b, c  G then

a *b  a * c 

a) a  a b) a  c c) b  a d) b  c

5. If  G,* is a group then  a * b   ?

1

1 1 1 1
a) b * a b) a * b c) b * a d) a * b
6. Define Group?
7. Define Associate Property under Addition?
8. Define Closure Property?
9. Define the Commutative Group?
10. Define a Lattice?

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

TUTORIAL – 4

This tutorial corresponds to Unit No. 4 (Objective Nos.: 3, Outcome Nos.: 3)

1. In how many ways can “m” persons can be seated at a round table if if the arrangemnts are

considered the same when one can be obtained from the other by rotation?

a) m! ways b)  m  1 !ways c)  n  1 ! ways d) n! ways

2. Suppose a hostel library has 12 books on Mathematics, 10 books on Physics, 18 books on

Computer Science and 12 books on Electronics for study. The number of ways in which he can

choose book is

a) 52 b) 49 c) 54 d) 51.

n n n n

3.          ....    
 0  1   2  n

a) 2n1 b) 2 n c) 2n1 d) 0.

4. In how many ways can be distribute 7 Apples and 6 Oranges among 4 children so that each child

gets atleast 1 Apple.(Repetition allowed)

a) 1680 b) 2400 c) 2100 d) 1420.

5. For two disjoint sets A, B A B  AB

a) True b) False c) Can’t Conclude d) None of the above

6. What is Permutation?

7. What is Combination?

8. What is Binomial Theorem statement?

9. How to find the Coefficient of Multinomial Expansion?

10. What is the definition of Principle of Inclusive- Exclusive?

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

TUTORIAL SHEET – 5

This tutorial corresponds to Unit No. 5 (Objective Nos.: 5, Outcome Nos.: 5)

1. The number of edges in a complete graph with 60 vertices.

a) 1770 b) 1170 c) 1270 d) 187
2. The degree of a Self-loop counted as
a) Once b) Twice c) Thrice d) n times
3. A single vertex in a graph G is a sub graph of G.
True/False

4. If G is a connected graph then V  E  R 

a) 2 b) 4 c) 3 d) 5
5. Which of the following are true
a) A vertex of degree Zero is called an isolated vertex.
b) A vertex of degree 1 is called a Pendant vertex.
c) Only a) is correct
d) Both a) and b) are correct.
6. What is a Graph?
7. Define Eulerian Graph?
8. Define Proper coloring?
9. Define Chromatic number?
10. Define the Graph traversal?

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

EVALUATION STRATEGY

Target (s)

a. Percentage of Pass : 95%

Assessment Method (s) (Maximum Marks for evaluation are defined in the Academic Regulations)

a. Daily Attendance
b. Assignments
c. Online Quiz (or) Seminars
d. Continuous Internal Assessment
e. Semester / End Examination

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

COURSE COMPLETION STATUS

Actual Date of Completion & Remarks if any

Objective No. Outcome No.

Units Remarks
Achieved Achieved

Unit 1 Completed on 25.02.2024 1 1

Unit 2 Completed on 21.03.2024 2 2

Unit 3 Completed on 20.04.2024 3 3

Unit 4 Completed on 05.05.2024 4 4

Unit 5 Completed on 12.06.2024 5 5

Signature of HOD Signature of faculty

Date: Date:

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

Course File

Department of Computer Science Engineering (AIML)

Mappings

1. Course Objectives-Course Outcomes Relationship Matrix

(Indicate the relationships by mark “X”)

Course-Outcomes
1 2 3 4 5
Course-Objectives
1 H
2 H M
3 H
4 H
5 H

2. Course Outcomes-Program Outcomes (POs) & PSOs Relationship Matrix

(Indicate the relationships by mark “X”)

PSO-1

PSO-2
PO-10

PO-11

PO-12
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M H M L H M

CO-2 H M H M L H M

CO-3 H M H M L H M

CO-4 H M H M L H M

CO-5 H M H M L H M

H-HIGH M-MODERATE L-LOW

AY: 2023-24 II B.Tech II Sem Discrete Mathematics

 Continuous Internal Assessment (R-22)

Programme: BTech Year: II Course: Theory A.Y: 2023-24

Course: Discrete Mathematics Section: CSE (AIML) Faculty Name: Mr. Shaik Shafi

Viva-
S. MID-I MID-II Avg. of MID Voce/Poster Total Marks
Roll No
No (35M) (35M) I & II Presentation (40)
(5M)
1 22C11A6601 23 31 27 5 32

2 22C11A6602 23 30 27 5 32

3 22C11A6603 30 28 29 5 34

4 22C11A6604 28 33 31 5 36

5 22C11A6605 34 35 35 5 40

6 22C11A6606 32 30 31 5 36

7 22C11A6607 31 34 33 5 38

8 22C11A6608 15 29 22 5 27

9 22C11A6609 27 34 31 5 36

10 22C11A6610 20 35 28 5 33

11 22C11A6612 27 34 31 5 36

12 22C11A6613 35 35 35 5 40

13 22C11A6614 22 35 29 5 34

14 22C11A6615 24 32 28 5 33

15 22C11A6616 12 20 16 5 21

16 22C11A6617 21 32 27 5 32

17 22C11A6618 17 35 26 5 31

18 22C11A6620 14 19 17 5 22

19 22C11A6621 19 29 24 5 29

20 22C11A6622 30 32 31 5 36

21 22C11A6623 20 30 27 5 32

22 22C11A6624 33 33 33 5 38

23 22C11A6625 12 20 16 5 21
24 22C11A6626 16 25 21 5 26

25 22C11A6627 20 32 26 5 31

26 22C11A6628 11 28 20 5 25

27 22C11A6629 34 35 35 5 40

28 22C11A6630 25 32 29 5 34

29 22C11A6631 28 33 31 5 36

30 22C11A6632 32 29 31 5 36

31 22C11A6633 30 31 31 5 36

32 22C11A6634 16 5 11 5 16

33 22C11A6635 29 34 32 5 37

34 22C11A6636 20 22 21 5 26

35 22C11A6637 33 35 34 5 39

36 22C11A6638 30 28 29 5 34

37 22C11A6639 28 33 31 5 36

38 22C11A6640 15 23 19 5 24

39 22C11A6641 21 34 28 5 33

40 22C11A6642 16 26 21 5 26

41 22C11A6643 29 34 32 5 37

42 22C11A6644 26 29 28 5 33

43 22C11A6645 33 34 34 5 39

44 22C11A6646 33 33 33 5 38

45 22C11A6647 21 20 21 5 26

46 22C11A6649 12 14 13 5 18

47 23C15A6601 15 32 24 5 29

48 23C15A6602 11 21 16 5 21

49 23C15A6603 25 34 30 5 35

50 23C15A6604 13 33 23 5 28

51 23C15A6605 29 33 31 5 36

52 23C15A6606 24 19 22 5 27
53 23C15A6607 18 33 26 5 31

54 23C15A6608 27 32 30 5 35

Total Strength: 54
Signature of Faculty

Signature of HoD
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner