Library_database

CREATE Table student( stud_no INT PRIMARY KEY, stud_name VARCHAR(20) ); CREATE Table membership( Mem_no INT PRIMARY KEY, stud_no INT, FOREIGN KEY (stud_no) REFERENCES student(stud_no) on delete set NULL ); CREATE Table Book( book_no int PRIMARY KEY, book_name VARCHAR(20), author VARCHAR(15) ); CREATE Table iss_rec( iss_no INT PRIMARY key AUTO_INCREMENT, iss_data DATE , mem_no int , book_no int, FOREIGN KEY (mem_no) REFERENCES membership(Mem_no) on delete set NULL, FOREIGN KEY (book_no) REFERENCES Book(book_no) on delete set NULL ); SELECT * FROM student; SELECT * FROM membership; SELECT * FROM book; SELECT * FROM iss_rec; INSERT INTO student VALUES (1, "Harsh Prasad"); INSERT INTO student VALUES (2, "Rihana "); INSERT INTO student VALUES (3, "Love Kush"); INSERT INTO student VALUES (4, "Jiten Kapoor"); INSERT INTO student VALUES (5, "Anju Kumari"); INSERT INTO student VALUES (6, "jyoti kumari"); INSERT INTO student VALUES (7, "Anjali Kumari"); INSERT INTO membership VALUES (411, 1); INSERT INTO membership VALUES (121, 2); INSERT INTO membership VALUES (911, 3); INSERT INTO membership VALUES (472, 4); INSERT INTO membership VALUES (872, 5); INSERT INTO membership VALUES (711, 6); INSERT INTO membership VALUES (871, 7); INSERT INTO book VALUES (415, "Total computer","S.C Kumar"); INSERT INTO book VALUES (491, "Total Physics","rohan Kumar"); INSERT INTO book VALUES (225, "Maths Today","Vipin chandra"); INSERT INTO book VALUES (195, "DBMS full tutorial","C.J Date"); INSERT INTO book VALUES (100, "Python Easy","Pearson Kumar"); INSERT INTO book VALUES (125, "Harry Potter","J.K Rowling"); INSERT INTO iss_rec VALUES (1001, '2021-09-22',911,491); INSERT INTO iss_rec VALUES (1002,'2021-09-12',411,195); INSERT INTO iss_rec VALUES (1003,'2021-10-02',872,100); INSERT INTO iss_rec VALUES (1004,'2021-10-12',121,125); INSERT INTO iss_rec VALUES (1006,'2021-09-12',411,195); SELECT COUNT(stud_no) FROM student; SELECT COUNT(iss_no) FROM iss_rec WHERE iss_data > 2021-01-01; SELECT * FROM iss_rec WHERE iss_data < 2021-01-01;

Comments

Post a Comment

Popular posts from this blog

Height of the Tree.

  Below is the source code of checking the height of the binary tree. If you need any explanation then please feel free to contact me on my email i.e harshprasadaju@gmail.com. Thankyou. #include   <stdio.h> #include   <stdlib.h> struct   tree {      int   data ;      struct   tree   * left ;      struct   tree   * right ; }; struct   tree   * Createnode ( int   data ) {      struct   tree   * nd   =  ( struct   tree   * ) malloc ( sizeof ( struct   tree ));      nd -> left   =   NULL ;      nd -> right   =   NULL ;      nd -> data   =   data ;      return   nd ; } void   inOrderTraversal ( struct   tree   * root ) {      if  ( root   != ...
Read more

Insert and delete item in a BST

  #include   <stdio.h> #include   <stdlib.h> struct   tree {      int   data ;      struct   tree   * left ;      struct   tree   * right ; }; int   arr [ 9 ],  i   =   0 ; struct   tree   * Createnode ( int   data ) {      struct   tree   * nd   =  ( struct   tree   * ) malloc ( sizeof ( struct   tree ));      nd -> left   =   NULL ;      nd -> right   =   NULL ;      nd -> data   =   data ;      return   nd ; } void   inOrderTraversal ( struct   tree   * root ) {      if  ( root   !=   NULL )     {          inOrderTraversal ( root -> left );  ...
Read more

Multiple parenthesis balancing problem using stacks

  Below is the source code of parenthesis balancing problem using stacks. If you need any explanation then please feel free to contact me on my email i.e harshprasadaju@gmail.com. Thankyou. #include   <stdio.h> //Ignore spellings error #include   <stdlib.h> #include   <string.h> struct   stack {      int   top ;      int   size ;      char   * arr ; }; int   isEmpty ( struct   stack   * ptr ) {      if  ( ptr -> top   ==   - 1 )          return   1 ;      return   0 ; } struct   stack   * createStack ( int   size ) {      struct   stack   * s   =  ( struct   stack   * ) malloc ( sizeof ( struct   stack ));      s -> size   =   size ;   ...
Read more