| S.NO | YEAR/SEMESTER | COURSE CODE & TITLE | UNIT | TOPIC | INNOVATIVE TEACHING METHOD USED |
| 1 | II/III | MA3354 DISCRETE MATHEMATICS | 1 | Tautology and Contradiction | Flipped classroom |
| Inference Theory | Flipped classroom |
| Proof methods and strategy | Z-A Approach |
| 2 | Strong induction and well-ordering | Flipped classroom |
| Recurrence relations | Flipped classroom |
| Inclusion and exclusion principle and its applications | Think Pair Share |
| 3 | Graphs and graph models | Flipped classroom |
| Graph terminology and special types ofgraphs | Think Pair Share |
| Matrix representation of graphs andgraph isomorphism | Flipped classroom |
| 4 | Subgroups | Think Pair Share |
| Normal subgroups and cosets | Flipped classroom |
| 5 | Properties of lattices | Flipped classroom |
| Lattices as algebraic systems | MIND MAPPING |
| Direct product and homomorphism | Flipped classroom |
| 2 | II/III | CS3351 DIGITAL PRINCIPLES AND COMPUTER ORGANIZATION | 1 | Analysis and Design Procedures | Z-A approach |
| Magnitude Comparator | Flipped Classroom |
| Encoder | Flipped Classroom |
| 2 | Operation and excitation tables,Triggering of FF | Flipped Class Room |
| State minimization, stateassignment | Flipped Class Room |
| Counters | Z-A technique |
| 3 | Functional Units of a DigitalComputer: Von NeumannArchitecture | Think-Pair-share |
| Addressing Modes | Flipped Classroom |
| Interaction between Assemblyand High-Level Language | Flipped Classroom |
| 4 | Micro programmed Control | Flipped Classroom |
| Data Hazard | Z-A approach |
| Control Hazards | Flipped Classroom |
| 5 | Memory Concepts andHierarchy | Flipped Classroom |
| DMA | Think-Pair-Share |
| Interconnection Standards:USB, SATA | Flipped Classroom |
| 3 | II/III | CC3353 FOUNDATIONS OF DATA SCIENCE | 1 | Data Science Process: Overview | ZA Approach |
| Data Mining | Flipped Classroom |
| Data Warehousing | Flipped Classroom |
| 2 | Types of Variables | Flipped Classroom |
| Describing Data with Graphs | Think Pair Share |
| | Describing Variability (Range,Variance, Standard Deviation) | Flipped Classroom |
| 3 | Correlation – Scatter plots | Flipped Classroom |
| Regression –regression line | ZA Approach |
| Regression towards the mean | Flipped Classroom |
| 4 | Aggregations | Flipped Classroom |
| Data manipulation with Pandas –data indexing and selection | ZA Approach |
| Aggregation and grouping | Flipped Classroom |
| 5 | Scatter plots – visualizing errors | ZA Approach |
| Text and annotation | Flipped Classroom |
| 4 | II/III | CD3291 DATA STRUCTURES AND ALGORITHMS | 1 | Namespaces – Shallow anddeep copying | Flipped classroom |
| Recursion | Z-A approach |
| Analyzing recursive algorithms | Flipped classroom |
| 2 | Array-based implementations | Flipped classroom |
| Doubly linked lists | Flipped classroom |
| Double ended queues – applications | Reciprocal Thinking |
| 3 | Selection sort | Flipped classroom |
| Insertion sort | Mind Mapping |
| Merge sort | Flipped classroom |
| 4 | Tree traversals | Flipped classroom |
| Heaps | Z-A Approach |
| Multi way search trees | Flipped classroom |
| 5 | Representations of graph | Flipped classroom |
| Graph traversals | Reciprocal Thinking |
| Minimum spanning trees | Flipped classroom |
| 5 | II/III | CS3391 OBJECT ORIENTEDPROGRAMMING | 1 | Overview of OOP–ObjectOriented programmingparadigms | Mind Mapping |
| Arrays ,Operators | Flipped Classroom |
| Control Statements | Flipped Classroom |
| 2 | Types of Inheritance | Think-Pair-Share |
| Interfaces | Flipped Classroom |
| 3 | Java’s Built-in Exceptions –User defined Exception | Flipped Classroom |
| Inter Thread Communication | Flipped Classroom |
| Suspending–Resuming, andStopping Threads | Think-Pair- Share |
| 4 | Generic Methods–Bounded Types | Z-A Technique |
| String Buffer Class | Flipped Classroom |
| 5 | List View– Combo Box,ChoiceBox | Flipped Classroom |
| Menus–Basics–Menubars– Menu Item | Z-A Technique |