Practical Slip 24 - 2019 Pattern

 C Language:

Q1) Write a C program to find maximum elements of 1D array

Q2) Create a structure Book (Bno, Bname, Price). Accept details of n Books and write a menu driven program to perform the following operations options. 

1. Display all Books having price > 500

2. Display Book having maximum price

DBMS:

Q3) Consider the following entities and their relationships. Create a RDB in 3 NF with appropriate data types and Constraints.

Bus(bus_no, capacity, depo_name)

Route(Route_no, source, destination, no_of_stations)

Relation between Bus and Route is Many to One.

Constraint: Bus capacity should be greater than 0, depo_name should not be null.

Consider the above tables and execute the following queries:

1. List all buses at depo “kothrud”.

2. Delete bus details whose number is “MH12HL7812”.

Q4) Consider the above tables and execute the following queries:

1. List all buses on route no 41.

2. List the route details having number of stations > 10.

3. Delete all buses having capacity < 20.

4. Find the maximum number of stations.

5. List all routes starting from “station”.