Course Plan

Course Handout

Institute/School Name Chitkara University Institute of Engineering and Technology

Department Name Department of Computer Science & Engineering
Programme Name Bachelor of Engineering (B.E.), Computer Science & Engineering
Course Name Discrete Structures Session July 2026 – Dec 2026
Course Code 24APS0105 Semester/Batch 3rd /2025
L-T-P(Per Week) 3-0-0 Course Credits 03
1
Pre-requisite th
12 Level Mathematics, Combinatorics NHEQF Level Level 5
Course Coordinator Dr. Renu Bala SDG Number4 1,2,9

1. Objectives of the Course

The course provides a wide scope of learning & understanding of the subject and the main objectives of the course are:
 To understand the theory and techniques of logic, graphs and trees, and algebraic systems.
 To apply the knowledge and skills obtained to investigate and solve a variety of discrete mathematical problems.
 To communicate mathematical ideas and to make effective use of appropriate technology.
 To comprehend discrete structures and their relevance within the context of computer science, in the areas of data
structures and algorithms, in particular (Enabling Knowledge).
 To apply discrete structures into other computing problems such as formal specification, verification, databases, and
cryptography (Problem Solving).

2. Course Learning Outcomes (CLOs)

Student should be able to:

Program Outcomes NHEQF Level No. of

CLOs
(PO) Descriptor2 Lectures
To apply the knowledge obtained to investigate and solve a PO1, PO2, PO4 15
CLO01 variety of live problems. Q1, Q2, Q3
PSO1
Analysis of relevance within the context of computer science PO1, PO2, PO3, 10
CLO02 in the areas of data structures and algorithms Q3, Q4
PSO1
To understand and apply the theory and techniques of PO1, PO2, PO5 10
CLO03 Lattice, Logic and Boolean algebra. Q3, Q4, Q5
PSO2
To comprehend Graph Theory and its relevance within the PO1, PO2, PO3, PO4, 5
context of computer science and finding solutions of live PO5,
CLO04 Q1, Q2, Q3, Q5
problems related to shortest path etc.
PSO1, PSO2
To apply discrete structures into other computing problems PO1, PO3, PO5, PO11 5
such as formal specification, verification, databases, and
CLO05 PSO2 Q4, Q5
cryptography (Problem Solving).

Total Contact Hours 45

1National Higher Education Qualification Framework Level, Refer to annexure

2 NHEQF Level Descriptor, Refer to Annexure & Learning outcomes descriptors for qualification for all levels on the NHEQF
3Types of Assessments can be referred from Type of Assessments. Refer to Annexure.

4For SDG Mapping with Courses, Pl refer SDG Mapping policy for Courses

Page1 of 12
24APS0105/ Discrete Structures
 Course Plan

CLO-PO Mapping

CLO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2 Type of Assessment’s3
CLO01 H M L L Summative assessments
CLO02 H M M L Summative assessments
CLO03 M H L M Summative assessments
CLO04 H M H L M L M Summative assessments
CLO05 H M L M M Summative assessments

H=High, M=Medium, L=Low

3. Recommended Books:

B01: Elements of Discrete Mathematics, by [Link], McGraw-Hill.

B02: Discrete Mathematics by Babu Ram, Pearson Education India.
B03: Discrete Mathematics by Lipschutz/Lipson, Schaum Series, 2nd Edition, TMH, Edition.
B04: Discrete Mathematics and its Applications by Kenneth H. Rosen, McGraw- Hill.
B05: Logic and Discrete Mathematics by Trembly/Grassmann, Pearson Education.
B06: Discrete Mathematics, Chitkara University Publications.
E-Resources: [Link]
4. Other readings and relevant websites:

Serial No Link of Journals, Magazines, websites and Research Papers

1. [Link]
2. [Link]
[Link]
3. [Link]
4. [Link]
5. [Link]
6. [Link]
5. Recommended Tools and Platforms

MATLAB, Wolfram Mathematica, Python and Sage.

6. Course Plan: Theory Plan

Lect. No. Topic(s)

1. Recurrence relation: Homogeneous recurrence relation with constant coefficients.
2. Recurrence relation: Non-homogeneous recurrence relation with constant coefficients.
3. Characteristic polynomial & Introduction to generating functions: Methods of generating functions
4. Characteristic polynomial & Introduction to generating functions: Methods of generating functions
5. Characteristic polynomial & Introduction to generating functions: Methods of generating functions
6. Logic: Propositions & logical operators.
7. Logic: Truth table. Laws of logic & Quantifiers,
8. Logic: Validity of arguments, Truth values
9. Lattices: Definition of lattice, Sub lattice, Isomorphic lattices,
10. Lattices: Bounded lattice, Distributive lattice,
11. Lattices: Modular lattice.
12. Lattices: Modular lattice.
13. Boolean Algebra: Atoms, Boolean expressions,
14. Boolean Algebra: Applications of Boolean algebra to switching theory
15. Boolean Algebra: Logic Gates.
Sessional Test-1 (1– 15 Lectures)
16. Graph Theory: Introduction to graphs & Sub graphs. Directed & Undirected graph,

Page2 of 12
24APS0105/ Discrete Structures
 Course Plan

17. Graph Theory: Order& Size of graph, Degree of vertex,

18. Graph Theory: Source, sink, Eccentricity, Trail, Walk, Path,
19. Graph Theory: Distance, Diameter, Cycle, Wheel.
20. Graph Theory: Multi graph, Planer graph,
21. Graph Theory: Pseudo graph, weighted graph,
22. Graph Theory: Regular, Complete
23. Graph Theory: Traversable graph.
24. Graph Theory: Isomorphism of graphs,
25. Graph Theory: Sub graphs, Complement of graph,
26. Graph Theory: Adjacency Matrix, Adjacency List, Incidence Matrix.
27. Graph Theory: Complete Bipartite Graph & Spanning Graph,
28. Graph Theory: Cut vertex, Cut edge,
29. Graph Theory: Region, Eulerian & Hamiltonian graphs
30. Graph Theory: Hamiltonian graphs
31. Euler’s formula & its applications: Traveling salesman problem.
32. Euler’s formula & its applications: Konigsberg Bridge problem.
33. Euler’s formula & its applications : Chromatic number & Graph coloring by Welsh Powell Algorithm.
34. Euler’s formula & its applications: Chromatic number & Graph coloring by Welsh Powell Algorithm.
Sessional Test-1I (1– 34 Lectures)
35. Tree: Binary trees,
36. Tree: Traversing binary trees
37. Tree: Rooted & spanning tree,
38. Tree: Algebraic expression trees.
39. Tree: Depth-First Search Algorithm,
40. Tree: Breadth-First Search Algorithm.
41. Shortest path algorithm: Kruskal’s Algorithm,.
42. Shortest path algorithm: Dijkstra’s Algorithm,.
43. Shortest path algorithm: Wars hall’s Algorithm
44. Shortest path algorithm: Prim’s Algorithm.
45. Shortest path algorithm: Prim’s Algorithm.
End Term Exam. (1– 45 Lectures)

7. Delivery/Instructional Resources
Theory Plan:
Book No,
Lect.
Topics CLO CH No, TLM3 ALM4 Web References Audio-Video
No.
Page No
Recurrence B01, B02 [Link] [Link]
relation: Quiz/Test i/Discrete_mathematics ourses/106/106/10
Lecture
Homogeneous Question [Link] 6106183/
1. CLO1 Discussio
recurrence relation s u/~rafael/[Link]
n
with constant
coefficients.
Recurrence B01, B02 [Link] [Link]
relation: Non- Quiz/Test i/Discrete_mathematics ourses/106/106/10
Lecture
homogeneous Question [Link] 6106183/
2. CLO1 Discussio
recurrence relation s u/~rafael/[Link]
n
with constant
coefficients.
Characteristic B01, B02 [Link] [Link]
Lecture Quiz/Test
polynomial & ss/cs103x/[Link] rses/106/106/106106
3. CLO1 Discussio Question
Introduction to [Link] 183/
n s
generating wiki/Discrete_mat

3 Teaching Learning Methods

4 Active Learning Methods
Page3 of 12
24APS0105/ Discrete Structures
 Course Plan

functions:
Methods of
generating
functions
Characteristic B01, B02 [Link] [Link]
polynomial & ss/cs103x/[Link] rses/106/106/106106
Introduction to [Link] 183/
Lecture Quiz/Test
generating wiki/Discrete_mat
4. CLO1 Discussio Question
functions:
n s
Methods of
generating
functions
Characteristic B01, B02 [Link] [Link]
polynomial & ss/cs103x/[Link] rses/106/106/106106
Introduction to [Link] 183/
Lecture Quiz/Test
generating wiki/Discrete_mat
5. CLO1 Discussio Question
functions:
n s
Methods of
generating
functions
Logic: B01, B06 [Link] [Link]
Lecture Quiz/Test
Propositions & i/Discrete_mathematics ourses/106/106/10
6. CLO1 Discussio Question
logical operators. [Link] 6106183/
n s
u/~rafael/[Link]
Logic: Truth table. B01, B06 Lecture [Link] [Link]
Quiz/Test
Laws of logic & and i/Discrete_mathematics courses/106/106/1
7. CLO1 Question
Quantifiers, Discussio [Link] 06106183/
s
n u/~rafael/[Link]
Logic: Validity of B01, B06 [Link] [Link]
Lecture Quiz/Test
arguments, Truth i/Discrete_mathematics /courses/106/106
8. CLO1 Discussio Question
values [Link] /106106183/
n s
u/~rafael/[Link]
Lattices: B01, B02 [Link] [Link]
Definition of Lecture Quiz/Test ss/cs103x/[Link] ourses/106/106/10
9. lattice, Sub lattice, CLO1 Discussio Question [Link] 6106183/
Isomorphic n s wiki/Discrete_mat
lattices,
Lattices: Bounded B01, B02 [Link] [Link]
Lecture Quiz/Test
lattice, Distributive ss/cs103x/[Link] ourses/106/106/10
10. CLO1 Discussio Question
lattice, [Link] 6106183/
n s
wiki/Discrete_mat
Lattices: Modular B01, B02 [Link] [Link]
Lecture Quiz/Test
lattice. ss/cs103x/[Link] ourses/106/106/10
11. CLO1 Discussio Question
[Link] 6106183/
n s
wiki/Discrete_mat
Lattices: Modular B01, B02 [Link] [Link]
Lecture Quiz/Test
lattice. ss/cs103x/[Link] ourses/106/106/10
12. CLO1 Discussio Question
[Link] 6106183/
n s
wiki/Discrete_mat
Boolean Algebra: B01, B06 Quiz/ [Link] [Link]
Lecture
Atoms, Boolean Test ss/cs103x/[Link] ourses/106/106/10
13. CLO1 Discussio
expressions, Question [Link] 6106183/
n
s wiki/Discrete_mat
Boolean Algebra: B01, B06 [Link] [Link]
Lecture Quiz/Test
Applications of ss/cs103x/[Link] ourses/106/106/10
14. CLO1 Discussio Question
Boolean algebra to [Link] 6106183/
n s
switching theory wiki/Discrete_mat
Boolean Algebra: B01, B06 Lecture Quiz/Test [Link] [Link]
15. Logic Gates. CLO1 Discussio Question ss/cs103x/cs103x- ourses/106/106/10
n s [Link]://[Link] 6106183/
Page4 of 12
24APS0105/ Discrete Structures
 Course Plan

[Link]/wiki/Discrete_mat

Graph Theory: CLO2 B02 [Link] [Link]

Introduction to Lecture Quiz/Test i/Discrete_mathematics ourses/106/106/10
16. graphs & Sub Discussio Question 6106183/
graphs. Directed & n s [Link]
Undirected graph, u/~rafael/[Link]
Graph Theory: CLO2 B02 [Link] [Link]
Order& Size of Lecture Quiz/Test i/Discrete_mathematics ourses/106/106/10
17. graph, Degree of Discussio Question 6106183/
vertex, n s [Link]
u/~rafael/[Link]
Graph Theory: CLO2 B02 [Link] [Link]
Source, sink, Quiz/Test i/Discrete_mathematics ourses/106/106/10
18. Eccentricity, Trail, Lecture Question 6106183/
Walk, Path, s [Link]
u/~rafael/[Link]
Graph Theory: CLO2 B02 [Link] [Link]
Distance, Lecture Quiz/Test i/Discrete_mathematics ourses/106/106/10
19. Diameter, Cycle, Discussio Question 6106183/
Wheel. n s [Link]
u/~rafael/[Link]
Graph Theory: CLO2 B06 [Link] [Link]
Lecture Quiz/Test
Multi graph, Planer ss/cs103x/[Link] ourses/106/106/10
20. Discussio Question
graph, [Link] 6106183/
n s
wiki/Discrete_mat
Graph Theory: CLO2 B06 [Link] [Link]
Lecture Quiz/Test
Pseudo graph, ss/cs103x/[Link] ourses/106/106/10
21. Discussio Question
weighted graph, [Link] 6106183/
n s
wiki/Discrete_mat
Graph Theory: CLO2 B06 [Link] [Link]
Lecture Quiz/Test
Regular, Complete ss/cs103x/[Link] ourses/106/106/10
22. Discussio Question
[Link] 6106183/
n s
wiki/Discrete_mat
Graph Theory: CLO2 B06 [Link] [Link]
Lecture Quiz/Test
Traversable graph. ss/cs103x/[Link] ourses/106/106/10
23. Discussio Question
[Link] 6106183/
n s
wiki/Discrete_mat
Graph Theory: CLO2 B06 [Link] [Link]
Lecture Quiz/Test
Isomorphism of ss/cs103x/[Link] ourses/106/106/10
24. Discussio Question
graphs, [Link] 6106183/
n s
wiki/Discrete_mat
Graph Theory: CLO2 B06 [Link] [Link]
Lecture Quiz/Test
Sub graphs, i/Discrete_mathematics ourses/106/106/10
25. Discussio Question
Complement of [Link] 6106183/
n s
graph, u/~rafael/[Link]
Graph Theory: CLO2 B06 [Link] [Link]
Lecture Quiz/Test
Adjacency Matrix, i/Discrete_mathematics ourses/106/106/10
26. Discussio Question
Adjacency List, [Link] 6106183/
n s
Incidence Matrix. u/~rafael/[Link]
Graph Theory: CLO2 B03 [Link] [Link]
Lecture Quiz/Test
Complete Bipartite ss/cs103x/[Link] ourses/106/106/10
27. Discussio Question
Graph & Spanning [Link] 6106183/
n s
Graph, wiki/Discrete_mat
Graph Theory: CLO2 B03 [Link] [Link]
Lecture Quiz/Test
Cut vertex, Cut ss/cs103x/[Link] ourses/106/106/10
28. Discussio Question
edge, [Link] 6106183/
n s
wiki/Discrete_mat

Page5 of 12
24APS0105/ Discrete Structures
 Course Plan

Graph Theory: CLO2 B03 [Link] [Link]

Lecture Quiz/Test
Region, Eulerian & ss/cs103x/[Link] ourses/106/106/10
29. Discussio Question
Hamiltonian [Link] 6106183/
n s
graphs wiki/Discrete_mat
Graph Theory: CLO2 B03 [Link] [Link]
Lecture Quiz/Test
Hamiltonian ss/cs103x/[Link] ourses/106/106/10
30. Discussio Question
graphs [Link] 6106183/
n s
wiki/Discrete_mat
Euler’s formula CLO3 B02 Quiz/Test [Link] [Link]
& its Lecture Question i/Discrete_mathematics ourses/106/106/10
31. applications: Discussio s [Link] 6106183/
Traveling salesman n ~rafael/[Link]
problem.
Euler’s formula CLO3 B02 Quiz/Test [Link] [Link]
& its Lecture Question i/Discrete_mathematics ourses/106/106/10
32. applications: Discussio s [Link] 6106183/
Konigsberg Bridge n ~rafael/[Link]
problem.
Euler’s formula CLO3 B02 Quiz/Test [Link] [Link]
& its applications Question ss/cs103x/[Link] ourses/106/106/10
Lecture
: Chromatic s [Link] 6106183/
33. Discussio
number & Graph i/Discrete_mat
n
coloring by Welsh
Powell Algorithm.
Euler’s formula CLO3 B02 Quiz/Test [Link] [Link]
& its applications: Question ss/cs103x/[Link] ourses/106/106/10
Lecture
Chromatic number s [Link] 6106183/
34. Discussio
& Graph coloring i/Discrete_mat
n
by Welsh Powell
Algorithm.
Tree: Binary trees, B06 Quiz/Test [Link] [Link]
Lecture
Question i/Discrete_mathematics ourses/106/106/10
35. CLO4 Discussio
s [Link] 6106183/
n
~rafael/[Link]
Tree: Traversing B06 Quiz/Test [Link] [Link]
Lecture
binary trees Question i/Discrete_mathematics ourses/106/106/10
36. CLO4 Discussio
s [Link] 6106183/
n
~rafael/[Link]
Tree: Rooted & B06 Quiz/Test [Link] [Link]
Lecture
spanning tree, Question ss/cs103x/[Link] ourses/106/106/10
37. CLO4 Discussio
s [Link] 6106183/
n
i/Discrete_mat
Tree: Algebraic B06 Quiz/Test [Link] [Link]
Lecture
expression trees. Question ss/cs103x/[Link] ourses/106/106/10
38. CLO4 Discussio
s [Link] 6106183/
n
i/Discrete_mat
Tree: Depth-First B06 Quiz/Test [Link] [Link]
Lecture
Search Algorithm, Question i/Discrete_mathematics ourses/106/106/10
39. CLO4 Discussio
s [Link] 6106183/
n
~rafael/[Link]
Tree: Breadth- B06 Quiz/Test [Link] [Link]
Lecture
First Search Question i/Discrete_mathematics ourses/106/106/10
40. CLO4 Discussio
Algorithm. s [Link] 6106183/
n
~rafael/[Link]
Shortest path B05 Quiz/Test [Link] [Link]
Lecture
algorithm: Question ss/cs103x/[Link] ourses/106/106/10
41. CLO4 Discussio
Kruskal’s s 6106183/
n
Algorithm,.
Shortest path B05 Lecture Quiz/Test [Link]
42. CLO4
algorithm: Discussio Question ss/cs103x/[Link]
Page6 of 12
24APS0105/ Discrete Structures
 Course Plan

Dijkstra’s n s
Algorithm,.
Shortest path B05 Lecture Quiz/Test [Link] [Link]
43. algorithm: Wars CLO5 Discussio Question i/Discrete_mat, ourses/106/106/10
hall’s Algorithm n s 6106183/
Shortest path B05 Lecture Quiz/Test [Link] [Link]
44. algorithm: Prim’s CLO5 Discussio Question i/Discrete_mat, ourses/106/106/10
Algorithm. n s 6106183/
Shortest path B05 Quiz/Test [Link] [Link]
Lecture
algorithm: Prim’s Question i/Discrete_mathematics ourses/106/106/10
45. CLO5 Discussio
Algorithm. s [Link] 6106183/
n
~rafael/[Link]

8. Remedial Classes5

After Every Sessional Test, weak learners will be identified and supplement course handout will be provided. Student
list and Impact Observed report will be submitted to Dean through proper channel.

9. Self-Learning6
Assignments to promote self-learning, survey of contents from multiple sources.

S. No Topics CLO ALM References/MOOCS

1. To solve a variety of live problems related CLO1 Assignment Reference Books
Analysis of relevance within the context of computer
2. CLO2 Assignment Reference Books
science, in the areas of data structures and algorithms
To understand and apply the theory and techniques of
3. CLO3 Assignment Reference Books
Lattice, Logic and Boolean algebra.
To comprehend Graph Theory and its relevance
4. within the context of computer science and finding CLO4 Assignment Reference Books
solutions of live problems related to shortest path etc.
To apply discrete structures into other computing
problems such as formal specification, verification,
5. CLO5 Assignment Reference Books
databases, and cryptography (Problem Solving).

10. Delivery Details of Content Beyond Syllabus7

Content beyond the syllabus covered (if any) should be delivered to all students that would be planned, and schedule
notified accordingly.

Advanced Topics,
[Link] Additional Reading, CLO POs ALM References/MOOCS
Research papers and any
NA NA NA NA NA NA

5 Refer to Annexure
6 Refer to Annexure
7 Refer to Annexure

Page7 of 12
24APS0105/ Discrete Structures
 Course Plan

11. Evaluation Scheme & Components:

Assessment Evaluation Type of No. of % Weightage Max. Mode of

CLO
Type8 Component9 Component10 Assessments11 of Component Marks Assessment
CLO01,
Sessional Online/
Summative Component1 02** 50% 50 CLO02,
Tests (STs) Offline
CLO03.
CLO01,
End Term 50 Online/ CLO02,
Summative Component2 01** 50%
Examination Offline CLO03,
CLO04,
Total 100%

** Students will have to appear in all Sessional Tests.

* Makeup Examination will compensate for either ST-1 or ST-2 (Only for genuine cases, based on the Dean’s approval).
** As per Academic Guidelines, a minimum of 75% attendance is required to become eligible for appearing in the End Semester
Examination.

12. Syllabus of the Course:

Subject: Discrete Structures, 22APS0105

No. of
S. Topic(s) Weightage
Lectures
No. %
Recurrence relation: Homogeneous and Non-homogeneous recurrence relation with
constant coefficients,
1 5 10
Characteristic polynomial & Introduction to generating functions: Methods of
generating functions.
Logic: Propositions & logical operators, Truth table. Laws of logic & Quantifiers, Validity
2 of arguments, Truth values. Lattices: Definition of lattice, Sub lattice, Isomorphic lattices, 5 10
Bounded lattice, Distributive lattice
Lattices: complemented lattice, Modular lattice. Boolean Algebra: Atoms, Boolean
3 5 10
expressions, Applications of Boolean algebra to switching theory & Logic Gates.
Sessional Test 1 (ST1)
Graph Theory: Introduction to graphs & Sub graphs. Directed & Undirected graph, Order&
Size of graph, Degree of vertex, Source, sink, Eccentricity, Trail, Walk, Path, Distance,
Diameter, Cycle, Wheel., Multi graph, Planer graph, Pseudo graph, weighted graph, Regular,
4 15 35
Complete and Traversable graph. Isomorphism of graphs, Sub graphs, complement of graph,
Adjacency Matrix, Adjacency List, Incidence Matrix, Complete Bipartite Graph & Spanning
Graph, cut vertex, Cut edge, Region, Eulerian & Hamiltonian graphs.
Euler’s formula & its applications: Traveling salesman problem, Konigsberg Bridge
5 4 15
problem, Chromatic number & Graph coloring by Welsh Powell Algorithm.
Sessional Test 2 (ST2) (ST1 syllabus also included)
Tree: Binary trees, traversing binary trees, Rooted & spanning tree, Algebraic expression
trees, Depth-First Search Algorithm, Breadth-First Search Algorithm. Shortest path
6 11 20
Algorithm: Kruskal’s Algorithm, Dijkstra’s Algorithm, Warshall’s Algorithm, Prim’s
Algorithm.

End Term Exam (ETE)

8 Refer to Annexure 2 of NCrF

9 Refer to Annexure
10 Refer to Annexure
11 Refer to Annexure

Page8 of 12
24APS0105/ Discrete Structures
 Course Plan

13. Academic Integrity Policy:

Education at Chitkara University builds on the principle that excellence requires freedom where Honesty and integrity
are its prerequisites. Academic honesty in the advancement of knowledge requires that all students and Faculty respect
the integrity of one another's work and recognize the importance of acknowledging and safeguarding intellectual
property. Any breach of the same will be tantamount to severe academic penalties.

This Document is approved by:

Designation Name Signature

Course Coordinator Dr. Renu Bala
Program Head Prof. Reetu Malhotra
Dean Prof. Mohit Kumar Kakkar
Date (DD/MM/YYYY)

Annexure

1. Pre- requisite
Mention The Pre-requisite skill set or course/s if it is expected to be studies before this course, otherwise write “not
applicable”.

2. NHEQF levels
The NHEQF levels represent a series of sequential stages expressed in terms of a range of learning outcomes against which
typical qualifications are positioned/located. NHEQF level 4.5 represents learning outcomes appropriate to the first year (first
two semesters) of the undergraduate programme of study, while Level 8 represents learning outcomes appropriate to the
doctoral-level programme of study.
Table 1: Higher education qualifications at different levels on the NHEQF

NHEQF level Examples of higher education qualifications located within each level
Level 4.5 Undergraduate Certificate. Programme duration: First year (first two semesters) of the
undergraduate programme, followed by an exit 4-credit skills-enhancement course(s).
Level 5 Undergraduate Diploma. Programme duration: First two years (first four
semesters) of the undergraduate programme, followed by an exit 4-credit skills-
enhancement course(s) lasting two months.
Level 5.5 Bachelor’s Degree. Programme duration: First three years (Six semesters) of the four-year
undergraduate programme.
Level 6 Bachelor’s Degree (Honours/ Honours with Research). Programme duration: Four years(eight
semesters).
Level 6 Post-Graduate Diploma. Programme duration: One year (two semesters) for those who exit after
successful completion of the first year (two semesters) of the 2-year master’s programme.
Level 6.5 Master’s degree. (e.g. M.A., [Link]., [Link]., etc.) Programme duration: Two years (four
semesters) after obtaining a 3- year Bachelor’s degree (e.g. B.A., [Link]., [Link].).
Level 6.5 Master’s degree. (e.g. M.A., [Link]., [Link]., etc.) Programme duration: One year (two
semesters) after obtaining a 4 -year Bachelor’s degree (Honours/ Honours with Research) (e.g.
B.A., [Link]., [Link]. etc.).
Level 7 Master’s degree. (e.g. M.E./[Link]. etc.) Programme duration: Two years (four semesters) after
obtaining a 4-year Bachelor’s degree. (e.g. B.E./[Link]. etc.)
Level 8 Doctoral Degree

3. NHEQF level descriptors

Each NHEQF level is structured based on the defined learning outcomes which lead to the expected graduate attributes/profile.
The level descriptors reflect the expected outcomes of learning that should be achieved and demonstrated by graduates of a
specific programme of study leading to a qualification at a specific NHEQF level.
Page9 of 12
24APS0105/ Discrete Structures
 Course Plan

Click Learning outcomes descriptors for qualification for all levels on the NHEQF

4. Course Outcomes
The number of Course Outcomes is recommended to be 4-5 for courses that do not contain practical component
and 6 for those courses with a practical component. Flexibility can be sought by the post-graduate courses in this
regard.

5. Theory/lab Plan
The following are the guidelines to be followed while creating plans
 Each session may be planned for a duration of 45/50mins (irrespective of the double hour or single hour scheduled
in timetable).
 Every session must incorporate at least one active learning method which may or may not be part of the assessments.
 Put BoS Approved Syllabus in the topics. Deviations (if any) from BoS approved syllabus must be brought to the
notice of BoS chairman & Dean Academics, after approval, revised handout should be submitted.
 The Topics elaborated in the Theory/Lab plan must match those in the course execution plan.

6. Teaching Learning Methods

The following are some of the Teaching & Learning methods that can be incorporated in session wise teaching
learning plan.
 Teacher-centered Learning Methods:
i. Lecture
ii. Discussion
iii. Demonstration method using a simulation or a tool
iv. Reviewing
v. Questioning

 Learner-centered teaching & Learning methods:

i. Active learning, in which students solve problems, answer questions, formulate questions of
their own, discuss, explain, debate, or brainstorm during class;
ii. Cooperative learning, in which students work in teams on problems and projects under
conditions that assure both positive interdependence and individual accountability; and
iii. Inductive teaching and learning, in which students are first presented with challenges
(questions or problems) and learn the course material in the context of addressing the challenges.
iv. Inductive methods include inquiry-based learning, case based instruction, problem-based
learning, project-based learning, discovery learning, and just-in-time teaching. It is important to
integrate authentic, reflective and collaborative learning experiences when designing for student-
centered learning.

7. Active Learning Methods

The following are some of the Active Learning Methods that can be incorporated in session wise teaching learning plan.
 One Minute Paper
 Group Discussion
 Student-Created PPT, Charts, Matrices, Flowcharts, Models
 The Fish Bowl
 Debate
 Video Synthesis
 Quiz/Test Questions
 Brain Storming Sessions
 Case Study
 Shadowing
 Leading Question
 Puzzle, Enigma, Contradiction
 Statement-Opinion-Summary
 Think / Pair / Share
 Peer Review
 Just in Time Teaching
 Statement-Opinion-Summary
 Peer Survey

Page10 of 12
24APS0105/ Discrete Structures
 Course Plan

 Focused Listing
 Role-Playing
 Student Field Work with Reflection
 Infusing Humor into Class Sessions
 Inviting Effective Guest Speakers

8. Remedial Classes
After every Sessional Test, identify weak learners, provide supplement course handout. Student list and Impact
Observed report should be submitted to Dean through proper channel.

9. Self-Learning
Plan 10% of topics in self-learning mode with discussions, ALM’s and Assessment happing in the class.

10. Content Beyond Syllabus

Plan Advanced Topics, Experiments, Additional Reading, Research papers in self-learning mode with ALM’s and
Assessment happing in the regular class or lab. Usually caters advanced learners. Identify Advanced learners. For
Extra classes, schedule should be notified accordingly.

11. Assessment Type

1. Assessment broadly can be classified into the following types:

a. Diagnostic assessments: Diagnostic assessments are intended to help teachers identify what students know and
can do in different domains to support their students' learning. These help teachers determine strengths of students in
various areas to
better address their specific needs.
b. Formative assessments: Formative assessment refers to a wide variety of methods that teachers use to conduct
in-process evaluations of student comprehension, learning needs, and academic progress during a lesson, unit, or a
course. Formative assessments help teachers identify concepts that students are struggling to understand, skills they
are having difficulty acquiring, or learning standards they have not yet achieved so that adjustments can be made to
lessons, instructional techniques, and academic support.
c. Summative assessments: Summative assessment is an assessment administered at the end of an instructional unit
in a course. These assessments are intended to evaluate student learning by comparing performance to a standard or
benchmark.
d. Ipsative assessments: Ipsative assessment involves comparisons between past and current work to identify a
learner's growth over time, rather than progress toward an external set of criteria. Therefore, Ipsative assessment is
an internal or self-referenced assessment.
e. Norm-referenced assessments: Norm-referenced tests report whether test takers performed better or worse than
a hypothetical average student, which is determined by comparing scores against the performance results of a
statistically selected group of test takers, typically of the same age or grade level, who have already taken the exam.
f. Criterion-referenced assessments: Criterion-Reference tests measure the performance of test takers against the
criteria covered in the curriculum.
g. Peer-to-Peer randomized Assessments: Peers will be able to provide assessment in this case
h. Industry Validation of Effectiveness: In the Vocation Education, Industry validation of effectiveness of training
is particularly important.
i. Self-assessments: To evaluate how much the learner has grasped by self-learning.

2. Other Assessment Methods: Conducting an assessment takes time, thought, attention, planning, and often
collaboration. Each assessment tool, whether a short survey or detailed rubric, will be useful only insofar as it both
addresses the outcomes well and is feasible to use.

a. Rubrics: For assessing qualitative student work such as essays, projects, reports, or presentations. Rubrics serve
well to clearly denote the specific expectations for an assignment, for collecting data for assessment of student
learning outcomes. and for student performance. Rubrics can be used for grading, for providing feedback to students,
and for informing and encouraging students to think about their own learning.
b. Portfolios and E-Portfolio: Portfolios can provide a window into the process of student learning across a semester-
long project that can be assessed (usually by using a rubric).
c. Curriculum Mapping: A good curriculum map can serve to focus assessment, and the improvements that follow,
where it will be most useful, informative, or effective.
d. Structured Interviews: While time-consuming, structured interviews are useful when specific questions need to
be asked. It also leaves room for unplanned topics or ideas to emerge.

Page11 of 12
24APS0105/ Discrete Structures
 Course Plan

e. Student Experience Surveys: Student experience in research universities (SERU), including administration of
on-line census SERU Undergraduate and Graduate Surveys, can yield important information about student
perceptions and experiences.

12. Evaluation Component & Types

As per LMs we need to figure it out whether it is component 1, 2 or 3. In Types of Evaluation Component, we need
to specify what type of evaluation we are performing like Continuous Evaluation or Sessional Test or End Term
Examination.

13. No. of Assessments and Weightage of Components

Department will give guideline for number of assessments, mandatory or optional and weightage.

Page12 of 12
24APS0105/ Discrete Structures