Write a program using linked list that accepts two polynomials as input and displays the resultant polynomial after performing the multiplication of the input polynomials.

Write a program to implement singly linked list for user inputs and perform the following operations on it

(i)Reverse the linked list and display it.

(ii)Sort the nodes in ascending order and display them.

Write a program in 'C' Language to accept 10 strings as input and print them inlexicographic order

Write a program to take input of a Matrix using array and display its transpose.

IV. Write and execute the following SQL Queries:

1.Retrieve all orders along with the customer details who placed the order.

2. Find all products that have been ordered by a specific customer.

3. Retrieve the total sales for each product.

4. Find all customers who have placed at least one order.

5. Retrieve the total quantity of products ordered by each customer.

6. Find all orders and their order details for a specific customer.

7. Retrieve all products along with the total quantity ordered.

8. Find the total revenue generated from orders placed within a specific date range.

9. Retrieve all customers who have ordered a specific product.

10. Find the most frequently ordered product.

11. Retrieve the average order value for each customer.

12. Find all products that have never been ordered.

13. Retrieve the total number of orders placed each month.

14. Retrieve the total number of products ordered in each order.

15. Find the top 5 customers based on total spending.

16. Retrieve all orders placed on a specific date.

17. Find the total number of unique products ordered by each customer.

18. Retrieve the order details for the order with the highest total price.

19. Find the top 3 products based on the total quantity ordered.

20. Retrieve the total sales for each month.

21. Find the customer who has placed the most orders.

22. Retrieve the total number of orders for each status.

23. Find the order with the highest quantity of a single product.

24. Retrieve the customer details for the order with the highest total price.

25. Find the average quantity of products ordered per order.

Operations:

CRUD (Create, Read, Update, Delete) Operations

Insert new records into each table.

Read/display records from each table.

Update existing records in each table.

Delete records from each table.

Relationships:

Each order is placed by one customer.

Each order can have multiple products.

Each product can be part of multiple orders.

Draw an ER-diagram for this application.

.Design and implement a simple database using MS-Access for an Online Retail Store, using fundamental concepts of database management systems such as creating tables, establishing relationships, performing CRUD (Create, Read, Update, Delete) operations, and writing basic SQL queries.

Create a database schema for an online retail store and implement various operations on it. The database will manage information about customers, products, orders, and order details. Use SQL to create tables, establish relationships, and perform queries to manipulate and retrieve data.

I. Create Database Schema:

Customers Table:

customer_id (Primary Key, INT, Auto Increment)

first_name (VARCHAR)

last_name (VARCHAR)

email (VARCHAR, Unique)

phone (VARCHAR)

address (VARCHAR)

Products Table:

product_id (Primary Key, INT, Auto Increment)

product_name (VARCHAR)

description (TEXT)

price (DECIMAL)

stock_quantity (INT)

Orders Table:

order_id (Primary Key, INT, Auto Increment)

customer_id (Foreign Key, INT)

order_date (DATE)

status (VARCHAR)

OrderDetails Table:

order_detail_id (Primary Key, INT, Auto Increment)

order_id (Foreign Key, INT)

product_id (Foreign Key, INT)

quantity (INT)

total_price (DECIMAL)

Draw ERD for an Railway Reservation System. Make necessary assumptions.

Draw the DFDs upto 3rd level for Railway Reservation System.

Develop SRS for Railway Reservation System. SRS should be as per IEEE standard SRS template. Make necessary assumptions.

Explain Direct File and Indexed Sequential File Organization.

What is Red-Black tree? Explain insertion and deletion operations in a Red-Black tree with the help of a suitable example.

What is Splay tree? Explain the Zig zag and Zag zig rotations in Splay tree with the help of a suitable example.

Write a program in 'C' language for 2-way merge sort.

What is a heap tree? Create a max heap tree for the following list of items inserted in the order. Also, explain the heap sort with the help of thus created heap tree. 10, 20, 5, 25, 30, 18, 3, 70, 55, 45, 12, 24

Apply Prim's Algorithm to find the minimum spanning tree for the following graph.

Apply Insertion and Selection sorting algorithms to sort the following list of items. So, all Intermediate steps. Also, analyze their best, worst and average case time complexity.

12, 5, 2, 15, 25, 30, 45, 8, 17, 50, 3, 7

Apply Dijkstra's algorithm to find the shortest path from the vertex 'S' to all other vertices for the following graph:

Define a B-tree and its properties. Create a B-tree of order-5, if the data items are inserted into an empty B-tree in the following sequence:

12, 5, 15, 20, 60, 45, 35, 40, 25, 8, 7, 55, 50, 66, 65, 80 Further, delete the items 5, 12, 8, and 20 from the B-tree.

 Define AVL tree. Create an AVL tree for the following list of data if the data are inserted in the order in an empty AVL tree.

12, 5, 15, 20, 35, 8, 2, 40, 14, 24, 27, 45, 50, 3, 4 Further delete 2, 4, 5 and 12 from the above AVL tree.