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.
See Answer →.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)
See Answer →Draw ERD for an Railway Reservation System. Make necessary assumptions.
See Answer →Draw the DFDs upto 3rd level for Railway Reservation System.
See Answer →Develop SRS for Railway Reservation System. SRS should be as per IEEE standard SRS template. Make necessary assumptions.
See Answer →Explain Direct File and Indexed Sequential File Organization.
See Answer →What is Red-Black tree? Explain insertion and deletion operations in a Red-Black tree with the help of a suitable example.
See Answer →What is Splay tree? Explain the Zig zag and Zag zig rotations in Splay tree with the help of a suitable example.
See Answer →Write a program in 'C' language for 2-way merge sort.
See Answer →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
See Answer →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
See Answer →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.
See Answer →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.
See Answer →Write a program in 'C' to implement a binary search tree (BST). Traverse and display the binary search tree in the Inorder, Preorder and Post order form.
See Answer →Draw the binary tree for which the traversal sequences are given as follows:
(i) Pre order: ABDEFCGHIJK
In order: BEDFACIHKJG
(ii) Post order: IJHDKECLMGFBA
In order: I HJDCKEAFLGMB
See Answer →What is a Dequeue? Write algorithm to perform insert and delete operations in a Dequeue.
See Answer →Write a program in 'C' to create a doubly linked list to store integer values and perform the following operations on it:
(i) Insert a new node at the beginning, in the middle or at the end of the linked list.
(ii) Delete a node from the linked list
(iii) Sort and display data of the doubly linked list in ascending order.
(iv) Count the number of items stored in a single linked list
Calculate the sum of all even integer numbers, stored in the doubly linked list.
See Answer →Write a program in 'C' to create a single linked list and perform the following operations on it:
(i) Insert a new node at the beginning, in the middle or at the end of the linked list.
(ii) Delete a node from the linked list
(iii) Display the linked list in reverse order
(iv) Sort and display data of the linked list in ascending order.
(v) Count the number of items stored in a single linked list
See Answer →Write a program in C to accepts two polynomials as input and prints the resultant polynomial due to the multiplication of input polynomials.
See Answer →