DBMS PRACTICAL 1 TABLES

CREATE TABLE DEPOSIT (ACTNO INT, CNAME VARCHAR(50), BNAME VARCHAR(50), AMOUNT DECIMAL(8,2), ADATE DATE);

CREATE TABLE BORROW (LOANNO INT, CNAME VARCHAR(50), BNAME VARCHAR(50), AMOUNT DECIMAL(8,2));

INSERT INTO DEPOSIT VALUES(101, 'ANIL', 'VRCE', 1000, '01/03/1995');

INSERT INTO DEPOSIT (ACTNO, CNAME, BNAME, AMOUNT, ADATE) VALUES(102, 'SUNIL', 'AJNI', 5000, '04/01/1996');

INSERT INTO DEPOSIT VALUES(103,'MEHUL', 'KAROLBAGH', 3500, '11/11/1995');

INSERT INTO DEPOSIT VALUES(104,'MADHURI', 'CHANDI', 1200, '12/07/1995');

INSERT INTO DEPOSIT VALUES(105,'PRAMOD', 'M.G.ROAD', 3000, '03/27/1995');

INSERT INTO DEPOSIT VALUES(106,'SANDEEP', 'ANDHERI', 2000, '03/31/1996');

INSERT INTO DEPOSIT VALUES(107,'SHIVANI', 'VIRAR', 1000, '09/05/1995');

INSERT INTO DEPOSIT VALUES(108,'KRANTI', 'NEHRU PLACE', 5000, '07/02/1995');

INSERT INTO DEPOSIT VALUES(109,'MINU', 'POWAI', 7000, '08/10/1995');

INSERT INTO BORROW VALUES(201, 'ANIL', 'VRCE', 1000);

INSERT INTO BORROW VALUES(206, 'MEHUL', 'AJNI', 5000);

INSERT INTO BORROW VALUES(311, 'SUNIL', 'DHARAMPETH', 3000);

INSERT INTO BORROW VALUES(321, 'MADHURI', 'ANDHERI', 2000);

INSERT INTO BORROW VALUES(375, 'PRAMOD', 'VIRAR', 8000);

INSERT INTO BORROW VALUES(481, 'KRANTI', 'NEHRU PLACE', 3000);

SE UNIT 9 MATERIAL FOR MID SEM EXAM

 3 UNIT 9 MATERIAL (FOR MID SEM EXAM ONLY) : DOWNLOAD

CNS UNIT 9 MATERIAL FOR MID SEM EXAM

CNS UNIT 9 MATERIAL (FOR MID SEM EXAM): DOWNLOAD

DBMS PRACTICE QUESTIONS 1

DBMS PRACTICE QUESTIONS 1

1. What is indexing? Explain different types of indexing with example. (UNIT 6)

2. What is hashing?  Explain types of hashing. Explain open hashing and closed hashing. (UNIT 6)

3. Explain query processing steps with diagram. (UNIT 5)

4. Create a b tree for following key values. 2,3,5,7,11,17,19,23,29,31) Assume that the tree is initially empty and values are added in ascending order. Consider the number of pointers in each node as four. (UNIT 5)

DBMS PRACTICE QUESTIONS 2

DBMS PRACTICE QUESTIONS 2

1. Explain all types of JOINS in relational algebra with example. (UNIT 3)

2. Explain SET OEPRATIONS in relational algebra with example. (UNIT 3)

3. How can we measure cost of Join query? Explain using example. (UNIT 5)

4. Explain query optimization process. (UNIT 5)

DBMS MID SEM SQL QUESTIONS

 DBMS MID SEM EXAM SQL QUERY QUESTIONS: DOWNLOAD

PPS PROGRAMS FOR PRACTICAL EXAM

1. Write a program to find maximum from 3 numbers using else if ladder structure.

2. Write a program to find minimum from 3 numbers using nested if else.

3. Write a program to find factorial of a number.

4. Write a program to print fibonacci series upto first n terms.

5. Write a program to create a user defined function check_prime(). Return 1 if number is not prime, return 0 if number is prime.

6. Develop a menu-based program to perform addition, multiplication, subtraction and division using user-defined function.

7. Write a program to print below pattern.

a b c d

a b c

a b

a

8. Write a program to print below pattern.

      *

    *  *

  *  *  *

*  *  *  *