Category: question bank

CS25C05 Data Structures using C++

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Data Abstraction & Overloading: Overview of C++, Structures, Class Scope and
Accessing Class Members, Reference Variables, Initialization, Constructors,
Destructors, Member Functions and Classes, Friend Function, Dynamic Memory
Allocation, Static Class Members, Container Classes and Integrators, Proxy Classes,
Overloading: Function overloading and Operator Overloading.
Practical: CS25C05 Data Structures using C++ Notes
1. Program to Implement Constructors and Destructors.
2. Program to implement Member Functions, Classes and Friend Functions.
3. Program to Implement Dynamic Memory Allocation and Overloading.
Inheritance & Polymorphism: Base Classes and Derived Classes, Protected
Members, Casting Class pointers and Member Functions, Overriding, Public, Protected
and Private Inheritance–Constructors and Destructors in derived Classes, Implicit
Derived, Class Object to Base, Class Object Conversion, Composition Vs. Inheritance,
Virtual functions, This Pointer, Abstract Base Classes and Concrete Classes, Virtual
Destructors, Dynamic Binding.
Practical: CS25C05 Data Structures using C++ Important QUestions
1. Program to Implement various inheritances.
2. Program to Implement virtual functions and dynamic binding.
3. Implementation of method overriding and operator overloading.
Linear Data Structures: Asymptotic Notations: Big-Oh, Omega and Theta, Best, Worst
and Average case Analysis: Definition and an example, Arrays and its representations,
Stacks and Queues, Linked lists, Linked list based implementation of Stacks and
Queues, Evaluation of Expressions, Linked list based polynomial addition.
Practical:
1. Program to implement various operations on arrays and linked lists.
2. Program to implement various operations on stacks and queues using array and
linked list.
3. Program to evaluate the infix expressions by converting into prefix and postfix
expressions CS25C05 Data Structures using C++ Question Paper
Linear Data Structures: Asympto tic Notations: Big-Oh, Omega and Theta, Best, Worst
and Average case Analysis: Definition and an example – Arrays and its representations,
Stacks and Queues, linked lists, linked list based implementation of Stacks and Queues,
Evaluation of Expressions, linked list based polynomial addition.
Practical:
1. Program to Implement Various Operations on Arrays and Linked Lists.
2. Program to Implement Various Operations on Stacks and Queues using Array
and Linked List. 

Non-Linear Data Structures: Trees, Binary Trees, Binary tree representation and
traversals, Threaded binary trees, Binary tree representation of trees, Application of
trees: Set representation and Union, Find operations, Graph and its representations,
Graph Traversals, Connected components. Standard template library.
Practical:
1. Program to Implement Binary Tree Traversal and Graph Traversal Algorithm.
2. Program to Implement the Single Source Shortest Path Algorithm and All Pair
Shortest Path Algorithm.
3. Program to find the Minimal Spanning Tree for a Graph.

Searching, Sorting and Complexity Analysis: Insertion sort, Merge sort, Quicksort,
Heapsort, Linear Search, Binary Search.
Practical: CS25C05 Data Structures using C++ QUestion Bank
1. Program to Implement Linear Search and Binary Search Algorithms.
2. Program to Implement Insertion Sort, Merge Sort, Quick Sort and Heap Sort
Algorithms.

References
1. Deitel, P. J., & Deitel, H. M. (2005). C++ how to program. Pearson Education.
2. Ellis Horowitz, E., Sahni, S., & Mehta, D. (2007). Fundamentals of data structures
in C++. Universities Press Pvt Ltd.
3. Weiss, M. A. (2007). Data structures and algorithm analysis in C++. AddisonWesley.
4. Trivedi, B. (2010). Programming with ANSI C++: A step-by-step approach. Oxford
University Press.
5. Goodrich, M. T., Tamassia, R., & Mount, D. (2004). Data structures and
algorithms in C++. Wiley.

Related Links

Anna University Syllabus Regulation 2025

Anna University Results

EC25C02 Circuits and Network Analysis [PDF]

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Circuit Laws and Network Theorems: Basic electrical components, voltage, current,
power, Network terminology- Node, Junction, Branch, Loop, Short and Open Circuits,
DC and AC circuits, Ohm’s Law, Kirchhoff‘s Laws, Resistors, inductors, and capacitors
in series and parallel, voltage and current division rule, Mesh and Nodal Analysis for AC
and DC circuits, Source transformation techniques, Star delta transformation EC25C02 Circuits and Network Analysis Notes
techniques, principle of linearity, Thevenin’s and Norton’s theorems, Superposition
theorem, Maximum power transfer theorem, Reciprocity theorem.
Practical:
1. Verifications of KVL & KCL.
2. Verification of Mesh and Nodal analysis of DC circuits
3. Verification of Thevenin’s and Norton’s theorems
Steady-State and Transient Analysis of Ac and DC Circuits: Components behavior 
(R, L, and C) in AC and DC, Characteristics of sinusoids, Phasor relationship for R, L, EC25C02 Circuits and Network Analysis Important QUestions
and C, Phasor diagram, Natural and forced response, Steady-state and Transient
analysis of RL, RC, RLC circuits using Laplace Transform.
Practical:
1. Create a physical model of an RL, RC, or RLC circuit to observe its transient and
steady-state behaviour using LTspice (open-source)
Resonance and Coupled Circuits: Natural frequency and Damping ratio, Series EC25C02 Circuits and Network Analysis Question Paper
resonance, Parallel resonance, Quality factor (Q), Bandwidth, Selectivity, Effect of Q on
bandwidth and selectivity. Self-inductance, Mutual inductance, Dot conversion, Ideal
Transformer.
Practical:
1. Determination of Resonance Frequency of Series & Parallel RLC Circuits.
2. Transient analysis of RL and RC circuits.
Linear Two-Port Network Analysis: Introduction to two-port networks,
Characterization in terms of impedance, admittance, hybrid, and transmission
parameters, parameter conversions, Interconnection of two-port networks – Symmetry
and Reciprocity.
Practical: EC25C02 Circuits and Network Analysis Important QUestions
1. Measurement of Impedance Parameters (Z-Parameters)
2. Explore the behavior of two interconnected two-port networks and verify the
principles of symmetry and reciprocity.

1. Hayt, W. H., Kemmerly, J. E., & Durbin, S. M. (2024). Engineering circuit analysis.
McGraw Hill Education.
2. Boylestad, R. L. (2014). Introductory circuit analysis. Pearson Education India.
3. Alexander, C. K., & Sadiku, M. N. O. (2017). Fundamentals of electric circuits.
McGraw Hill Education.
4. Kuo, F. F. (2012). Network analysis and synthesis. Wiley India.

Related Links

Anna University Syllabus Regulation 2025

Anna University Results

EC25C01 Electron Devices

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Semiconductor: Types, Conductivity, Electron energy levels and energy band diagram,
Carrier concentration, Mass action law, Characteristics and behavior of intrinsic
semiconductors, Variation in properties with temperature, Carrier drift and diffusion,
Current density equation, Excess carrier generation and recombination rates, Carrier life
time. Continuity equation. EC25C01 Electron Devices NOtes
Activity: Virtual demonstration of energy levels, Drift and diffusion current.
PN Junction Diodes: Energy band diagram of open-circuited PN junction, Forward and
reverse bias characteristics, Diode resistance, Transition and diffusion capacitance,
Effect of temperature on diode behavior, Applications of PN junction diodes. EC25C01 Electron Devices Important QUestions
Special Diodes: Zener diode – breakdown mechanisms and voltage regulation,
Varactor diode, Tunnel diode, Photo diode – construction, operation, and applications.
Activities: Virtual demonstration of characteristics of junction diodes, Design of a
constant voltage regulator using Zener Diode.
Bipolar Junction Transistors: Construction, working, characteristics in CB, CE, and EC25C01 Electron Devices Question Paper
CC configurations, regions of operation, current gain, input/output characteristics, Early
effect. Other Devices: Multi-emitter transistor – construction and applications.
Practical: Input and Output characteristics of Characteristics of BJT.
Field Effect Transistors: JFET – construction, working, characteristics, parameters.
MOSFET, MOS capacitor, depletion and enhancement modes, nMOS and pMOS, EC25C01 Electron Devices NOtes
threshold voltage, transfer and output characteristics. CMOS – introduction and basic
operation.
Practical: Input and Output characteristics of Characteristics of JFET, MOSFET.
Thyristors: Shockley diode, Silicon Controlled Rectifier (SCR), TRIAC and DIAC –
operation and applications, Thyristor protection techniques.
Unijunction Transistor (UJT): Construction, characteristics and application as
relaxation oscillator.
Optoelectronic Devices: LED, LCD, Photo transistor, Opto-coupler – principle,
characteristics and applications. Power MOSFETs: Construction, switching
characteristics and applications in power circuits.
Practical: VI characteristics of SCR, UJT.

References: EC25C01 Electron Devices Important Questions
1. Neamen, D. A. (2012). Semiconductor physics and devices. Tata McGraw-Hill.
2. Boylestad, R. L., & Nashelsky, L. (2008). Electronic devices and circuit theory.
Pearson Prentice Hall.
3. Yang, C. Y. (1978). Fundamentals of semiconductor devices. McGraw-Hill
International.
4. Salivahanan, S., Suresh Kumar, N., & Vallavaraj, A. (2008). Electronic devices and
circuits. Tata McGraw-Hill.
5. Floyd, T. L. (2018). Electronic Devices: Conventional Current Version. Pearson.

Related Links

Anna University Syllabus Regulation 2025

Anna University Results

CS25C04 Data Structures and Algorithms

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Data Types: Abstract Data Types (ADTs), ADTs and classes, introduction to OOP,
Classes in Python, Inheritance, Namespaces, Shallow and Deep Copying.
Practical: Implement simple ADTs as Python classes
Linear Structures: List ADT, array-based implementations, linked list
implementations, singly linked lists, circularly linked lists, doubly linked lists, Stack
ADT, Queue ADT, double ended queues, applications
Practical: List ADT using Python arrays, Linked list, Stack and Queue ADTs and CS25C04 Data Structures and Algorithms notes
Applications.
Tree Structures: Tree ADT, Binary Tree ADT, tree traversals, binary search trees,
AVL trees, heaps, multi-way search trees
Practical: Tree representation and traversal algorithms, Binary Search Trees, Heaps.
Graph Structures: Graph ADT, representations of graph, graph traversals, DAG,
topological ordering, greedy algorithms, dynamic programming, shortest paths,
minimum spanning trees, introduction to complexity classes and intractability CS25C04 Data Structures and Algorithms Important Questions
Practical: Graph representation and Traversal algorithms, Single source shortest
path algorithm, Minimum spanning tree algorithms.
Algorithm: Analysis of algorithms, Asymptotic notations, Divide & Conquer,
Recursion, Recursive Algorithms
Practical: Implement recursive algorithms in Python.
Sorting and Searching
Bubble sort, Selection sort, Insertion sort, Merge sort, Quick sort, Analysis of sorting CS25C04 Data Structures and Algorithms Question Paper
algorithms, Linear & Binary search, Hashing, Hash functions, Collision handling, Load
factors, Rehashing, and Efficiency
Practical: Sorting and searching algorithms, Hash tables

References: CS25C04 Data Structures and Algorithms Question Bank
1. Goodrich, M. T., Tamassia, R., & Goldwasser, M. H. (2021). Data structures &
algorithms in Python (Indian adaptation). John Wiley & Sons Inc.
2. Lee, K. D., & Hubbard, S. (2015). Data structures and algorithms with Python.
Springer.
3. Necaise, R. D. (2011). Data structures and algorithms using Python. John Wiley
& Sons.
4. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2002). Introduction to
algorithms. McGraw-Hill.
5. Weiss, M. A. (2014). Data structures and algorithm analysis in C++. Pearson
Education

Related Links

Anna University Syllabus Regulation 2025

Anna University Results

PH25C04 Applied Physics 2 (EE)

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Semiconductor Materials: Intrinsic and Extrinsic Semiconductors, Carrier
Concentration- Fermi level, Dependence on carrier-concentration and temperature,
Carrier generation and recombination, Carrier transport: diffusion and drift, Hall PH25C04 Applied Physics 2 Notes
Effect, Applications, Metal-semiconductor junction (Ohmic and Schottky)
Activities: Determination of Hall coefficient
Dielectrics Materials: Dielectric polarization under static fields – electronic, ionic
and dipolar polarizations-internal fields in solid-Clausius-Mossotti equation, PH25C04 Applied Physics 2 Important Questions
Behavior of dielectrics in alternating fields- Application of dielectrics in transformersCapacitor materials, Ferro and piezo materials- Complex dielectric permittivitydipolar relaxation- dielectric loss, Applications.
Activities: Measurement of Dielectric Constant of different materials
Magnetic Materials: Magnetic material parameters, Ferromagnetic materials,
Ferrites – Soft and Hard magnetic materials, GMR sensors, magnetic disk memories,
Principle of magnetic recording, Materials for magnetic data storage.
Activities: Determination of Hysteresis loop for a ferromagnetic material (B-H
curve) PH25C04 Applied Physics 2 Question Paper
Advanced Materials: Thermocouple, bimetals, leads soldering and fuses Materials
– their applications
Activities: Virtual demonstration of working of various types of thermocouples.

References:
1. Kasap, S. O. (2007). Principles of electronic materials and devices. McGrawHill Education.
2. Callister, W. D., & Rethwisch, D. G. (2014). Materials science and engineering.
John Wiley & Sons.
3. Indulkar, C. S., & Thiruvengadam, S. (n.d.). An introduction to electrical
engineering materials. S. Chand.

Related Links

Anna University Syllabus Regulation 2025

Anna University Results

MA25C03 Transforms and its Applications

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Laplace Transforms: Existence conditions, Properties of Laplace transform, Laplace
transform of standard functions, derivatives and integrals, Unit step function and Dirac
delta function, Laplace transform of periodic functions; Inverse Laplace transform:
Partial fraction technique, Convolution theorem.
Application: Solution of second order ordinary differential equations using Laplace
transform. MA25C03 Transforms and its Applications
Activities: Compute the Laplace transform of time-domain functions, Inverse Laplace
transform, Solution of ordinary differential equations using Laplace transform.
Z-Transform: Z-transform of standard functions, properties; Inverse Z – transform: MA25C03 Transforms and its Applications Notes
Standard functions, Partial fraction technique, Convolution theorem.
Application: Solution of difference equation using Z – transform.
Activities: Compute the Z-transform of a discrete-time signal, Solution of linear
constant-coefficient difference equations using Z-transform.
Fourier Series: Dirichlet’s conditions, General Fourier series, Convergence of
Fourier series, Odd and even functions; Half range sine series, Half range cosine
series, Root mean square value, Parseval’s identity.
Application: Solution of one-dimensional wave and heat equation.
Activities: Compute Fourier coefficients, Reconstruct signal using Fourier series MA25C03 Transforms and its Applications Important Questions
(Partial sum), Plot convergence of Fourier series.
Fourier Transform: Complex Fourier transform, Properties, Relation between
Fourier and Laplace transform, Fourier sine and cosine transforms, Parseval’s
identity, Convolution theorem.
Application: Simple applications to solve partial differential equations using Fourier
transform. MA25C03 Transforms and its Applications Question Paper
Activities: Compute the Fourier and inverse Fourier transform, Parseval’s theorem
validation.

References: MA25C03 Transforms and its Applications Question Bank
1. Kreyszig, G. E. (2018). Advanced engineering mathematics. John Wiley & Sons
Ltd.
2. Grewal, B. S. (2021). Higher engineering mathematics. Khanna Publications.
3. Zill, D. G. (2022). Advanced engineering mathematics. Jones & Bartlett India Ltd.
4. Wylie, C. R., & Barrett, L. C. (2019). Advanced engineering mathematics. Tata
McGraw-Hill.
5. Duffy, D. G. (2017). Advanced engineering mathematics with MATLAB. CRC
Press.

Related Links

Anna University Syllabus Regulation 2025

Anna University Results

CY25C03 Applied Chemistry 2 (ME)

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Functional Materials: Types, Smart coatings, Mechanisms, Sustainable energy
materials.
Activities: Seminar on recent development in functional materials (e.g., smart
coatings, self-cleaning surfaces), Infographic Design of functional nanomaterials.
Fuels: Classification, Chemical Composition, natural resources, Calorific Value –
Alternative Fuels – Natural gas benefits.
Activities: Comparison of efficiency and emissions in fuels.
Composites: Matrix materials – Reinforcements, Hybrid composites, Engineering
applications. CY25C03 Applied Chemistry 2 Notes
Activities: Design of a simple composite structure for a real engineering application
(e.g., lightweight bike frame).
Lubricants: Types, Functions. Key properties, Synthetic lubricants, Mechanisms,
Emerging lubricants.
Activities: Collection of lubricants used in real-world engineering systems (e.g.,
gears, engines, bearings), Virtual demonstration of lubricant viscosity testing. CY25C03 Applied Chemistry 2 Important Questions
Combustion: Reaction Kinetics, Stoichiometric combustion and air-fuel ratio
calculations, Knocking and Anti-knocking agents, Hydrogen combustion, Flue Gas
analysis.
Activities: Virtual simulation of flue gas analysis and gas composition, Calculation
of air-fuel ratio. CY25C03 Applied Chemistry 2 Question Paper
Adhesives: Adhesion Mechanisms, Classification, Bond strength, Industrial
adhesives.
Activities: Adhesion of thermal pads on different Integrated circuits, Industrial
adhesives.

References: CY25C03 Applied Chemistry 2 Important Questions
1. Palanna, O. G. (2009). Engineering chemistry. McGraw-Hill Education (India)
Pvt. Ltd.
2. Cheong, K. Y., Impellizzeri, G., & Fraga, M. A. (2018). Emerging materials for
energy conversion and storage. Elsevier.
3. Jain, P. C., & Jain, M. (2013). Engineering chemistry. Dhanpat Rai Publishing
Company (P) Ltd.
Sharma, S. C. (2000). Composite materials. Narosa Publishing House

Related Links

Anna University Syllabus Regulation 2025

Anna University Results

IT25202 Digital Principles and System Design DPSD

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Boolean Algebra: Number Systems, Binary, Octal, Hexadecimal, Representation of
negative numbers, 1’s and 2’s Complements, Arithmetic Operations, Binary Codes.
Boolean Algebra, Theorems and Postulates, Functions, Truth Table, Logic Gates,
Universal gates
Practical:
1. Simple functions using gates
2. implementation of Boolean functions
Canonical Functions: Canonical and Standard Forms, Minterms and Maxterms, Sum of
Products and Product of Sums, Conversions and Expansion.
Practical: Simplification and expansion of standard Boolean functions
Karnaugh Map and Combinational Logic: Simplification of Boolean Functions, IT25202 Digital Principles and System Design Notes
Karnaugh Map, 2,3,4 variables, NAND / NOR Implementations, Combinational Circuits,
Arithmetic Circuits, Half and Full Adders, Subtractors. Introduction to HDL
Practical:
1. Implementation of combinational circuits using gates for arbitrary functions.
2. Implementation of Arithmetic circuits and extended operations.
Combinational Logic Design: Binary Parallel adder, Carry Look-ahead Adder, BCD
Adder, Binary multiplier, Magnitude Comparator, Code Converters, Decoder, Encoder,
Priority Encoder, Mux/Demux, Applications, Introduction to HDL and HDL for these circuits
Practical: IT25202 Digital Principles and System Design Important Questions
1. Combinational circuits using code converters.
2. BCD adder, encoder and decoder circuits.

Sequential Logic Design: R – S Latch, D Latch, Flip flops, SR, JK, T, D, Master /Slave
Flip Flop, Flip flop excitation tables, Analysis of clocked sequential circuits, Moore /Mealy
models, Registers, Shift Registers, Universal Shift Register. Counters, Asynchronous
Ripple Counters, Synchronous Counters- Ring Counter, Johnson Counter,
Practical: Design of a digital circuit for solving practical problems.

System Design: Memory Systems, RAM, ROM, Memory Decoding, error detection and IT25202 Digital Principles and System Design Question Paper
correction, Digital System Design using PROM, PLA , PAL, FPGA
Activities: Combination of in class & Flipped
Practical: DPSD Important Questions
1. Project demonstration and presentation
2. Mini project on the design of a digital circuit for solving practical problems.

References: IT25202 Digital Principles and System Design DPSD
1. Mano, M. M., & Ciletti, M. D. (2018). Digital design. Pearson Education.
2. Roth, C. H., Jr. (2003). Fundamentals of logic design. Jaico Publishing House.
3. Wakerly, J. F. (2007). Digital design principles and practices. Pearson Education.
4. Givone, D. D. (2003). Digital principles and design. Tata McGraw-Hill.
5. Kharate, G. K. (2010). Digital electronics. Oxford University Press.

Related Links

Anna University Syllabus Regulation 2025

Anna University Results

IT25201 Foundations of Data Science using Python

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Python Language Basics and Data Structures: Python Language Basics – Scalar
Types – Control Flow. Data Structures and Sequences: Tuple – List – Built-in Sequence
Functions – dict – set- List, Set, and Dict Comprehensions. Functions: Namespaces,
Scope, and Local Functions – Returning Multiple Values – Functions Are Objects – Files
and the Operating System.
Practical: IT25201 Foundations of Data Science using Python NOtes
1. Programs using Data Frames
2. Programs using functions and files 3.
Numpy Basics: The NumPy ndarray: A Multidimensional Array Object – Universal
Functions: Fast Element-Wise Array Functions – Array-Oriented Programming with
Arrays – File Input and Output with Arrays – Linear Algebra – Pseudorandom Number
Generation.
Practical: IT25201 Foundations of Data Science using Python Important Questions
1. Programs using numpy
2. Programs to solve linear algebra problems with numpy functions
Pandas Basics: Introduction to pandas Data Structures –Loading and Understanding
Data- Data aggregation for computing Descriptive Statistics- Data Cleaning and
Preprocessing
Practical: IT25201 Foundations of Data Science using Python Question Paper
1. Programs using numpy
2. Solving linear algebra problems

Data Loading, Storage, and File Formats: Reading and Writing Data in Text Format –
Binary Data Formats – Interacting with Web APIs – Interacting with Databases
Practical:
1. Data and Databases
2. Web APIs
Data Exploration: Data Transformation – String Manipulation. Data Wrangling: IT25201 Foundations of Data Science using Python NOtes
Hierarchical Indexing – Combining and Merging Datasets – Reshaping and Pivoting.
Practical:
1. String manipulations
2. Data wrangling

Data Wrangling: Data Aggregation and Group Operations: GroupBy Mechanics –
Data Aggregation – Apply: General split-apply-combine – Pivot Tables and CrossTabulation – Date and Time Data Types.
Practical: IT25201 Foundations of Data Science using Python Important Questions
1. Data aggregation operations
2. Handle time series data
Data Visualization: Introduction to Data Visualization- Visualizing categorical data,
visualizing time series data, Visualizing multiple variables -Visualizing Distribution
&Relationships -Multivariate and Time Series Visualization
exploration
Practical:
1. Visualization of Different kinds of Data
2. Distribution Analysis

References: IT25201 Foundations of Data Science using Python Question Paper
1. McKinney, W. (2017). Python for data analysis: Data wrangling with pandas,
NumPy, and IPython (Modules I–V). O’Reilly Media.
2. Mukhiya, S. K., & Ahmed, U. (2020). Hands-on exploratory data analysis with
Python. Packt Publishing.
3. VanderPlas, J. (2017). Python data science handbook: Essential tools for working
with data. O’Reilly Media.
4. Cielen, D., Meysman, A. D. B., & Ali, M. (2016). Introducing data science. Manning
Publications.
5. Ward, M. O., Grinstein, G., & Keim, D. (2015). Interactive data visualization:
Foundations, techniques, and applications. A. K. Peters/CRC Press.

Related Links

Anna University Syllabus Regulation 2025

Anna University Results

CS25C07 Object Oriented Programming OOps

Anna University Syllabus, Notes, Important Questions, Question Bank, Question Paper are available in Padeepz App

Principles of Object-Oriented Programming: Characteristics of object-oriented
languages, C++ Program structure, Procedure Oriented Programming vs Object
Oriented Programming, C++ constructs and syntax, tokens, variables, data-types, type
conversion, operators, Expressions, Namespace, flow Control and decision, making
statements.
Practical: CS25C07 Object Oriented Programming Notes
1. Simple programs to using Operators, and type conversion.
2. Programs using Conditional and Loop statements and loops.
Classes and Objects: Abstraction mechanism: Classes, Objects, member data,
member functions – Constructors and types – destructors, inline function, friend function
— array of objects, objects as function arguments – memory allocation for objects, static
members static data and static function.
Practical: CS25C07 Object Oriented Programming Important Questions
1. Programs using in-line and friend functions.
2. Programs using constructors and destructors
Inheritance and Compile Time Polymorphism: Inheritance: Derived Classes – Single
inheritance – Multilevel Inheritance – Multiple Inheritance – Hierarchical inheritance –
Hybrid inheritance. Operator Overloading: Compile time Polymorphism – Overloading
Functions, Overloading Operators, Overloading Unary Operators – Overloading Binary
Operators – Operator Overloading with Friend Functions.
Practical: CS25C07 Object Oriented Programming Question Paper
1. Programs for inheritance and its types.
2. Programs using friend function and operator overloading. 

Pointers and Runtime Polymorphism
Pointers with arithmetic operations – this pointer – Pointers to Derived classes and Base CS25C07 OOPs NOtes
classes – Compile time versus Runtime Polymorphism – Virtual functions – Late Binding
– Abstract classes- Pure virtual functions and Virtual Destructors – Virtual base class.
Practical: CS25C07 OOPs  Important Questions
1. Programs for pointer manipulation.
2. Programs for virtual functions.

Templates and Exception Handling
Class Templates – Function Templates – Overloading of Template Functions – String,
iterators, hashes, IO streams; Exception Handling.
Practical:
1. Programs using function and class templates.
2. Programs using exception handling.
I/O Systems and File I/O
C++ Streams – Formatted and Unformatted I/O –File stream classes – File modes – File
operations, Sequential Read / Write operations – Binary and ASCII Files – Error handling
in file I/O with member function.
Practical Activities
1. Programs for error handling in file and I/O management
2. Develop applications using OOP features.

References:
1. Deitel, P., & Deitel, H. (2024). C++ how to program: An objects-natural approach.
Pearson Education.
2. Bronson, G. (2011). A first book of C++. Course Technology Inc.
3. Balagurusamy, E. (2020). Object oriented programming with C++. McGraw Hill Education

Related Links

Anna University Syllabus Regulation 2025

Anna University Results