Scheme of Teaching and Examinations for BE Programme -2025-26
Outcome Based Education and Choice Based Credit System (CBCS)
(Effective from the Academic Year 2025-26)
DSATM
COURSE CURRICULUM
Module Topics Hours
No.
C++ Programming Foundations: C++ and its features, Data types, Variables, Operators,
Expressions, Control structures, Functions and parameters, Function overloading, Recursion.
1 OOP Essentials: Classes and Objects, Constructors, Destructors and Operator overloading, 8
Inheritance, Polymorphism, Programming examples.
Textbook 2: 2.1–2.4, 3.1–3.5, 4.1–4.4, 5.1–5.3, 6.2, 7.1, 8.1–8.4, 9.1
Pedagogy Think–Pair–Share
Arrays and Matrices: Arrays, Matrices, Special matrices, Sparse matrices.
Pointers & Linear Lists: Pointers, Dynamic memory allocation, Data objects and structures,
2 Introduction to Linear and Non-Linear data structures, Linear list data structures, Array 8
Representation, Vector Representation, Singly Linked Lists and Chains.
Textbook 1: 1.1–1.6, 2.1–2.4, 3.1–3.5
Textbook 2: 11.1–11.5
Pedagogy Problem Solving
Stacks: The abstract data types, Array Representation, Linked Representation, Applications –
Parsing and Evaluation of arithmetic expressions, Parenthesis Matching & Towers of Hanoi.
3 Queues: The abstract data type – Array, Linked, Circular Queues, Priority Queues, Deques. 8
Applications – Railroad Car Arrangement, Job Scheduling.
Textbook 1: 4.1–4.6, 5.1–5.7
Pedagogy Case Study
Hashing: Dictionaries, Hash table representation, Collision resolution techniques – Linear Probing,
Quadratic Probing, Chaining.
4 STL (Standard Template Library): Templates – Introduction to Vectors, Lists, Queues, Stacks, 8
Maps. Usage of Iterators, Usage of built-in container classes for data structures.
Textbook 1: 6.1–6.4
Textbook 2: 14.1–14.5
Pedagogy Simulation
Trees & Heaps: Binary Trees – Properties and Representations, Common Binary Tree Operations,
Tree Traversals – Inorder, Preorder, Postorder, Binary Search Tree – Operations and
5 Implementation. Heaps: Binary Heap, Min-Heap and Max-Heap, Applications – Heap Sort, Priority 8
Queues.
Graphs: Graph Representations – Adjacency Matrix and Adjacency List,
Traversal Algorithms – Depth First Search (DFS), Breadth First Search (BFS).
Textbook 1: 7.1–7.6, 8.1–8.5, 9.1–9.4
Pedagogy Demonstration & Poster Presentation
Pedagogical Initiatives (Not limited to):
Think Pair and Share (Blended Learning): provides an opportunity for students to learn from
one another
Problem Solving: encourages cognitive thinking and enables creative problem solving
Poster Presentation: allows students to represent the concepts visually in order to understand the
topics easily.
Case studies: maps different domains in real time applications
Demonstration: exhibits the implementation process
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of 50) and for the
SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks).
A student shall be deemed to have satisfied the academic requirements and earned the credits allotted
to each subject/ course if the student secures a minimum of 40% (40 marks out of 100) in the sum total
of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
Internal Assessment Test (IAT):
For the Internal Assessment Test component of CIE, there are 25 marks and for Assignment component of
the CIE, there are 25 marks. Two Tests, each of 50 Marks with 01-hour 30 minutes‟ duration, are to be
conducted and average of two tests to be reduced to 25 marks.
The first test will be administered after 40-50% of the syllabus has been covered, and
The second test will be administered after 85-90% of the syllabus has been covered
Any two assignment methods, if an assignment is project-based then only one assignment for the
course shall be planned. The teacher should not conduct two assignments at the end of the semester if
two assignments are planned.
For the course, CIE marks will be based on a scaled-down sum of two tests and other methods of assessment.
