0% found this document useful (0 votes)
47 views20 pages

Practical Slips DS, DBMS-May2025

The document outlines the practical examination for the FYBBA(CA) program at Brihan Maharashtra College of Commerce, focusing on Data Structures in C and DBMS. It includes various programming tasks such as implementing linked lists, sorting algorithms, and database queries based on specified entities and relationships. Each section is allocated marks and includes viva and journal components.

Uploaded by

samiksha12200
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
47 views20 pages

Practical Slips DS, DBMS-May2025

The document outlines the practical examination for the FYBBA(CA) program at Brihan Maharashtra College of Commerce, focusing on Data Structures in C and DBMS. It includes various programming tasks such as implementing linked lists, sorting algorithms, and database queries based on specified entities and relationships. Each section is allocated marks and includes viva and journal components.

Uploaded by

samiksha12200
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Deccan Education Society’s

Brihan Maharashtra College of Commerce (AUTONOMOUS)


FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to accept n student names from user and store it in an array. Write a
function to search given student name into the array using Linear search method. (15)

2. Write a menu driven program using ‘C’ for implementation of Singly linked list. Menu
includes – (25)
- Create
- Display
- Insert node

3. Consider the following Entities and Relationships (40)

Department (deptno, deptname,location)

Employee (empno, empname, salary, commission, designation)

Relationship between Employee and Department is one-to-many.

Constraints : Primary Key, Salary should be > 0.

1. Update commission for every employee by 5 % for all department


2. List details of employee who belong to ‘Computer’ department and
salary > 20000

3. Display top 3 high salaried employees


4. Find the name of the employee whose salary is greater than average salary

4. Viva (10)
5. Journal (10)

1
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program for implementing Linear Search method using function. (15)

2. Write a ‘C’ program to sort array elements in ascending order using Selection sort
method. (25)

3. Consider the following Entities and Relationships (40)

Actor (ano, aname)

Movie (mvno, mvname, releaseyear)

Relationship between Movie and Actor is one-to-many.

Constraints : Primary Key,

releaseyear should be > 0.

1. Display all the movies released after year 2000.


2. Count the number of movies in which ‘Hrithik’ has acted.
3. Display all the movie names order by released year in ascending order.
4. Display movie names released between year 2000 to 2008.

4. Viva (10)

5. Journal (10)

2
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to reverse a String using static implementation of Stack. (15)

2. Write a ‘C’ program to sort array elements in ascending order using Bubble sort method.
(25)
3. Consider the following Entities and Relationships (40)

Employee (empno, empname, city, deptname)


Project (pno, pname, status)
Employee and Project are related with many to many relationships with
descriptive attribute no_of_days employee worked on that project
Constraints : Primary Key,
Project Status Constraints: C – completed, P-Progressive, I-Incomplete
1. List the names of employees working on projects having status
“Incomplete”
2. Display all project names and total number of employees who are
working on that project.
3. List the names of the employees who are working on project for more
than 20 days.
4. Display project wise Employee details

4. Viva (10)

5. Journal (10)

3
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write menu driven program using ‘C’ for Static implementation of Stack. The menu
includes following operations: (15)

- push
- pop
- display
- exit

2. Write a C program that create a 1-D table of integers whose size will be specified at run time.
(Dynamic Memory Allocation) (25)

3. Consider the following Entities and Relationships (40)

Doctor(dno, dname, city)

Hospital (hno, hname, hcity)

The relation between Doctor and Hospital is many-to-many.

Constraints : Primary Key,

City should not be null

 Display all the details of hospitals located in ‘Pune’ city.


 Display hospital wise doctor’s details

 Count the number of doctors who are visiting to ‘KEM’ Hospital.


 Display the hospital names whose from Mumbai and Delhi

4. Viva (10)

5. Journal (10)

4
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program that create a 2-D table of integers whose size will be specified at
run time. (Dynamic Memory Allocation) (15)

2. Write a menu driven program using ‘C’ for Static implementation of Queue for
integers. The menu includes (25)
- Insert
- Delete
- Display
- Exit

3. Consider the following Entities and Relationships (40)

Student (rollno, name, marks, class)

Teacher (tno, tname)

The relation between Student and Teacher is many-to-many with subject


as descriptive attribute.

Constraints : Primary Key,

Class has to be FY, SY or TY.

 Count the number of students having marks greater than average


marks
 Count no. of teachers teaching DBMS subject to SY class
 Display top 3 students from SY
 Display name of teachers teaching to Amar

4. Viva (10)

5. Journal (10)

5
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a menu driven program using ‘C’ for implementation of Singly linked list. Menu
includes – (15)
- Create
- Display
- Insert Node at particular position

2. Write a ‘C’ program to sort the element using Quick sort (recursive) method. (25)

3. Consider the following Entities and Relationships (40)

Movie (mvno, mvname, releaseyear)

Actor (actno, actname)

Relationship between Movie and Actor is many-to-one.

Constraints : Primary Key,

releaseyear should be > 0.

 Dispay all details from both the tables


 Display all the movies released after year 2000.
 Count the number of movies in which ‘Hrithik’ has acted.
 Display all the movie names order by released year in ascending
order.

4. Viva (10)
5. Journal (10)

6
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write menu driven program using ‘C’ for Singly linked list. The menu includes (15)
- Create
- Display
- Search particular node in list and display its position.

2. Write a ‘C’ program to sort the array elements in ascending order using Merge sort method.
(25)

3. Consider the following Entities and Relationships (40)

Book ( bno, bname, pubname)

Author (ano, aname)

The relation between Book and Author is many-to-many.

Constraints : Primary Key,

Aname and Pubname should not be null.

Create a RDB in 3NF & construct queries in Oracle 8i.

 Count number of books of each publisher.


 Display all details of the book written by ‘Kanetkar’.
 Display Author-wise list of books.
 Display the book-name whose author-name is ‘Korth’ and publisher name is
‘BPB’.

4. Viva (10)

5. Journal (10)

7
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to create a singly linked list and count total number of nodes in it
and display the result. (15)

2. Write menu driven program using ‘C’ for Dynamic implementation of Stack. The menu
includes following operations: (25)
- push
- pop
- display
- exit

3. Consider the following Entities and Relationships (40)

Doctor (dno, dname, city)

Hospital (hno, hname, hcity)

The relation between Doctor and Hospital is many-to-many, Day varchar as


descriptive attribute

Constraints : Primary Key, City should not be null

Create a RDB in 3NF & write queries in Oracle 8i for following.

 Display doctor wise hospital details.


 Display the doctor details that are living in ‘Pune’ city visiting in
hospitals located in Mumbai.
 Count the number hospitals to which ‘Dr. Apte’ is visiting on
Saturday.
 Display all the details of hospitals not located in ‘Pune’ city.

4. Viva (10)

5. Journal (10)

8
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to sort elements of a singly linked list in ascending order and
display the sorted List. (15)

2. Write a menu driven program using ‘C’ for singly linked list- (25)
- To create linked list.
- To display linked list
- To insert node at last position of linked list.
- To delete node from specific position of linked list.

3. Consider the following Entities and Relationships (40)

Doctor (dno, dname, city)

Patient (opdno, pat_name, addr, disease)

The relation between Patient and Doctor is many-to-many, Fees in number


as descriptive attribute

Constraints: Primary Key, Address should not be null

Create a RDB in 3NF & write queries in Oracle 8i for following.

 Find the names of patients who are treated by ‘Dr. Apte’.


 Display doctor wise details of patient
 Count the number of patients suffering from ‘Asthma’ and treatment
by Dr. Shah.
 Find the name of doctors who charges minimum fees.

4. Viva (10)

5. Journal (10)

9
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to swap mth and nth element of singly linked list. (15)

2. Write a ‘C’ program to create two singly linked lists and perform the intersection
operations on two lists and display the resultant list. (25)

3. Machine (mno, mname, mtype, mcost) (40)

Part (pno, pnmae, pdesc)

Machine and parts are related with one to many relationships

Constraints :

Primary Key,

Machine name not be null

Create a RDB in 3NF & construct queries in Oracle 8i

 List all machines having cost > 5000.


 Display machine wise part details.
 Find the name of machine having maximum cost.
 Display the name of all machines having parts ‘wheel’

4. Viva (10)

5. Journal (10)

10
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to create two singly linked lists and concatenate one list at the end of
another list. (15)

2. Write a ‘C’ program to create doubly link list and display nodes having even value. (25)

3. Consider the following Entities and Relationships (40)

Department (deptno, deptname,location)

Employee (empno, empname, salary, commission, designation)

Relationship between Employee and Department is one-to-many.

Constraints : Primary Key, Salary should be > 0.

1. Update commission for every employee by 5 % for all department


2. List details of employee who belong to ‘Computer’ department and
salary > 20000

3. Display top 3 high salaried employees


4. Find the name of the employee whose salary is greater than average salary

4. Viva (10)

5. Journal (10)

11
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to create a singly Link list and display its alternative nodes. (15)

2. Write a ‘C’ program to search given element into the list using Recursive Binary search
method. (25)

3. Consider the following Entities and Relationships (40)

Actor (ano, aname)

Movie (mvno, mvname, releaseyear)

Relationship between Movie and Actor is one-to-many.

Constraints : Primary Key,

releaseyear should be > 0.

4. Display all the movies released after year 2000.


5. Count the number of movies in which ‘Hrithik’ has acted.
6. Display all the movie names order by released year in ascending order.
7. Display movie names released between year 2000 to 2008.

4. Viva (10)

5. Journal (10)

12
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to sort array elements using Bubble sort method. (15)

2. Write a ‘C’ program to create Circular Singly Link list and display it. (25)

3. Consider the following Entities and Relationships (40)

Employee (empno, empname, city, deptname)


Project (pno, pname, status)
Employee and Project are related with many to many relationships with
descriptive attribute no_of_days employee worked on that project
Constraints : Primary Key,
Project Status Constraints: C – completed, P-Progressive, I-Incomplete
5. List the names of employees working on projects having status
“Incomplete”
6. Display all project names and total number of employees who are
working on that project.
7. List the names of the employees who are working on project for more
than 20 days.
8. Display project wise Employee details

4. Viva (10)

5. Journal (10)

13
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to create binary search tree and display its leaf nodes. (15)

2. Write a ‘C’ program to read the adjacency matrix of directed graph and convert it into
adjacency list. (25)

3. Consider the following Entities and Relationships (40)


Doctor(dno, dname, city)

Hospital (hno, hname, hcity)

The relation between Doctor and Hospital is many-to-many.

Constraints : Primary Key,

City should not be null

 Display all the details of hospitals located in ‘Pune’ city.


 Display hospital wise doctor’s details

 Count the number of doctors who are visiting to ‘KEM’ Hospital.


 Display the hospital names whose from Mumbai and Delhi

4. Viva (10)

5. Journal (10)

14
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to read an adjacency matrix of a directed graph and traverse it using DFS

(15)

2. Write a ‘C’ program to accept two polynomials and add these two polynomials using function.
Display the result (Use array). (25)

3. Consider the following Entities and Relationships (40)

Student (rollno, name, marks, class)

Teacher (tno, tname)

The relation between Student and Teacher is many-to-many with subject


as descriptive attribute.

Constraints : Primary Key,

Class has to be FY, SY or TY.

 Count the number of students having marks greater than average


marks
 Count no. of teachers teaching DBMS subject to SY class
 Display top 3 students from SY
 Display name of teachers teaching to Amar

4. Viva (10)

5. Journal (10)

15
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to search given elements into the list using Non-Recursive Binary
Search Method. (15)

2. Write a ‘C’ program to create a Binary tree, traverse it using recursive operations like inorder,
preorder and postorder and display the result of each one separately. (25)

3. Consider the following Entities and Relationships (40)

Movie (mvno, mvname, releaseyear)

Actor (actno, actname)

Relationship between Movie and Actor is many-to-one.

Constraints : Primary Key,

releaseyear should be > 0.

 Dispay all details from both the tables


 Display all the movies released after year 2000.
 Count the number of movies in which ‘Hrithik’ has acted.
 Display all the movie names order by released year in ascending
order.

4. Viva (10)

5. Journal (10)

16
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a ‘C’ program to count all non-zero elements, odd numbers and even numbers in
the singly linked list. (15)

2. Write a ‘C’ program to count indegree and outdegree of each node in graph. (25)

3. Consider the following Entities and Relationships (40)

Book ( bno, bname, pubname)

Author (ano, aname)

The relation between Book and Author is many-to-many.

Constraints : Primary Key,

Aname and Pubname should not be null.

Create a RDB in 3NF & construct queries in Oracle 8i.

3. Count number of books of each publisher.


4. Display all details of the book written by ‘Kanetkar’.
5. Display Author-wise list of books.
6. Display the book-name whose author-name is ‘Korth’ and publisher name is
‘BPB’.

4. Viva (10)

5. Journal (10)

17
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write a menu driven program using ‘C’ for Dynamic implementation of Queue for
integers. The menu includes (15)
- Insert
- Delete
- Display
- Exit

2. Write menu driven program using ‘C’ for Binary Search Tree. The menu includes
- Create a BST (25)
- Insert element in a BST
- Display

3. Consider the following Entities and Relationships (40)

Doctor (dno, dname, city)

Hospital (hno, hname, hcity)

The relation between Doctor and Hospital is many-to-many, Day varchar as


descriptive attribute

Constraints : Primary Key, City should not be null

Create a RDB in 3NF & write queries in Oracle 8i for following.

 Display doctor wise hospital details.


 Display the doctor details that are living in ‘Pune’ city visiting in
hospitals located in Mumbai.
 Count the number hospitals to which ‘Dr. Apte’ is visiting on
Saturday.
 Display all the details of hospitals not located in ‘Pune’ city.

4. Viva (10)

5. Journal (10)

18
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write menu driven program using ‘C’ for Binary Search Tree. The menu includes - (15)
- Create a BST
- Traverse it by using Inorder traversing technique
- Search a given value in BST

2. Write a ‘C’ program to evaluate a given polynomial using function. (Use array). (25)

3. Consider the following Entities and Relationships (40)

Doctor (dno, dname, city)

Patient (opdno, pat_name, addr, disease)

The relation between Patient and Doctor is many-to-many, Fees in number


as descriptive attribute

Constraints: Primary Key, Address should not be null

Create a RDB in 3NF & write queries in Oracle 8i for following.

 Find the names of patients who are treated by ‘Dr. Apte’.


 Display doctor wise details of patient
 Count the number of patients suffering from ‘Asthma’ and treatment
by Dr. Shah.
 Find the name of doctors who charges minimum fees.

4. Viva (10)

5. Journal (10)

19
Deccan Education Society’s
Brihan Maharashtra College of Commerce (AUTONOMOUS)
FYBBA(CA) ( Sem-II) Practical Examination Apr 2025
Lab Course (Data Structures in C, DBMS)
[Time : 3 Hrs] [Marks : 100]
__________________________________________________________________________________

1. Write menu driven program using ‘C’ for Binary Search Tree. The menu includes (15)

- Create a BST
- Traverse it by using Preorder traversing technique
- Search a given value in BST

2. Write a ‘C’ program to read an adjacency matrix of a directed graph and traverse using BFS.
(25)

3. Machine (mno, mname, mtype, mcost) (40)

Part (pno, pnmae, pdesc)

Machine and parts are related with one to many relationships

Constraints :

Primary Key,

Machine name not be null

Create a RDB in 3NF & construct queries in Oracle 8i

 List all machines having cost > 5000.


 Display machine wise part details.
 Find the name of machine having maximum cost.
 Display the name of all machines having parts ‘wheel’

4. Viva (10)

5. Journal (10)

20

You might also like