Sri Sivasubramaniya Nadar College of Engineering, Kalavakkam – 603 110
(An Autonomous Institution, Affiliated to Anna University, Chennai)
Department of Information Technology
Model Practical Examination
Question Paper
Degree & Branch B.E. Biomedical Engineering Semester III
UBM3361– OOPS AND DATA STRUCTURES USING
Subject Code & Name
C++
Course Outcome:
CO1- Grasp C++ fundamentals such as classes, objects, constructors, destructors, memory
handling, and operator/function overloading.
CO2- Apply object-oriented concepts like inheritance and polymorphism for reusable and
extensible code.
CO3- Implement and use linear data structures (lists, stacks, queues) for data manipulation
and expression evaluation.
CO4- Understand and apply non-linear data structures (trees, graphs) for real-world problem
solving.
K1: Remembering K2: Understanding K3: Applying K4: Analyzing K5:Evaluating
KL – Knowledge Level CO – Course Outcomes PI – Performance Indicator
Evaluation
Aim Algorithm Program Execution Viva
10 10 40 30 10
Internal Examiner External Examiner
Questions
Q. N. KL CO
Exercise 1
Write a C++ program to swap two numbers using both Call by
Value and Call by Address. Use default arguments for one of
the parameters in a function.
1 K3 CO1
Exercise 2
Design a class Student with data members name, rollNo, and
marks. Use a constructor to initialize the values and a friend
function to display the average marks of two students.
Exercise 1
2 K3 Implement operator overloading in C++ to add two complex CO1
numbers using both unary and binary operator overloading. Also,
demonstrate function overloading for addition of integers and
floats.
Exercise 2
Write a C++ program to swap two numbers using both Call by
Value and Call by Address. Use default arguments for one of
the parameters in a function.
Exercise 1
Write a C++ program demonstrating runtime polymorphism
using inheritance and virtual functions for calculating the area of
different shapes (Sphere, Rectangle, Triangle). CO2
3 K3 &
Exercise 2
CO1
Design a class Student with data members name, rollNo, and
marks. Use a constructor to initialize the values and a friend
function to display the average marks of two students.
Exercise 1
Implement a linear list (array-based list) using C++.
The program should include operations to:
Insert an element at any valid position in the list.
Delete an element from any valid position in the list.
Display all elements of the list. CO3
4 K3 &
Exercise 2 CO1
Design a class Student with data members name, rollNo, and
marks. Use a constructor to initialize the values and a friend
function to display the average marks of two students.
Exercise 1
Write a C++ program to swap two numbers using both Call by
Value and Call by Address. Use default arguments for one of
the parameters in a function.
Exercise 2 CO1
5 K3 &
Implement a Stack using a Linked List in C++. CO3
The program should include the following operations:
Push an element onto the stack
Pop an element from the stack
Display all elements in the stack
Exercise 1
Implement a Linear Queue using a Linked List in C++.
The program should include the following operations:
Enqueue an element into the queue
Dequeue an element from the queue
CO3
6 K3 Display all elements in the queue &
CO1
Exercise 2
Write a C++ program to swap two numbers using both Call by
Value and Call by Address. Use default arguments for one of
the parameters in a function.
Exercise 1
Implement a C++ program to convert an infix expression to postfix
and then evaluate the postfix expression using a stack.
CO3
Exercise 2
7 K3 &
Write a C++ program to swap two numbers using both Call by CO1
Value and Call by Address. Use default arguments for one of
the parameters in a function.
Exercise 1
Write a C++ program to implement Linear Search to find a given element
in an array.
Exercise 2
CO5
8 K3 &
CO2
Write a C++ program demonstrating runtime polymorphism using
inheritance and virtual functions for calculating the area of different
shapes (Sphere, Rectangle, Triangle).
Exercise 1
9 K3 CO5
Write a C++ program to sort an array using Insertion Sort and display the
sorted array.
Exercise 2
Implement Quick Sort in C++ and display the sorted list after each partition
step.