Click here to load reader

Chemistry Investigatory Project

  • View
    140

  • Download
    0

Embed Size (px)

Text of Chemistry Investigatory Project

  • KENDRIYA VIDYALAYA SANGATHAN

    BENGALURU REGION BENGALURU

    Submitted in partial fulfillment of the requirements for the AISSCE CBSE Board examination

    In

    COMPUTER SCIENCE

    For the Academic year

    2015-2016

    To be carried out by

    NAME: NISHANT JHA

    REG No:

    Under the guidance of

    Department of Computer science

    KENDRIYA VIDYALAYA DRDO C V RAMAN NAGAR

    BENGALURU-560093

  • 2

    KV DRDO

    CV RAMAN NAGAR, BANGALORE-560093

    Certified that the project work entitled Computer Shop Database

    Management carried out by Kumar. Nishant Jha, Roll No , of

    class XII C is a bonafide work in partial fulfilment of AISSCE in the

    subject computer science prescribed by the Central Board of

    Secondary Education, during the year 2015-2016. It is certified that all

    corrections/suggestions indicated for Internal Assessment have been

    incorporated in the Report deposited in the departmental library. The

    project report has been approved as it satisfies the academic

    requirements in respect of the Project work prescribed for the said

    examination.

    Name & Signature of the Guide Signature of the Principal

  • 3

    Through this acknowledgement we express our sincere

    gratitude to all those people who have been associated with the

    project and have helped us with it and made it a worthwhile

    experience.

    We extend our thanks to Smt. Nutan Punj, the principal of this

    fine establishment KV DRDO for being pillar of support

    throughout the process.

    We would like to express our gratitude towards our parents our

    parents for their co-operations and encouragement which

    helped us in the completion of this project.

    We would also like to express our thanks to Smt. Aruna D

    Eknath, the head of computer department of KV DRDO who

    gave us this opportunity to learn the subject with a practical

    approach, guided us and gave us valuable suggestions regarding

    the project.

  • 4

  • 5

    The computer shop management system has been

    developed for stocking and sale of computer

    hardware items from a computer shop. The program

    offers a complete lists of the items available in the

    shop and their respective rates.

    In this C++ program we can modify, add, delete, recall

    and list the records.

    The products and their details are stored in the binary

    file main.dat.

    Being OOP concept available, we can add or remove

    function anytime we need and even add classes and

    derived classes for further improvement of the program

    without recording.

  • 6

    For Windows 7, 8, 8.1, 10

    Code::Blocks with MinGW compiler

    Dev C++

    Turbo C++

    For Linux

    Visual Studio

    Eclipse CDT

    Code::Blocks

    For Mac OS

    Code::Blocks

    Eclipse IDE

    Objective-C++

    For Hardware you need to have space to install the

    applications and space for saving your coding (100 MB

    approx.) and need to have more than 520 MB RAM for

    faster compilation.

  • 7

    #include

    #include

    #include

    #include

    #include

    #include

    #include

    #include

    #include

  • 8

    1. To add details of new customer.

    2. To display details of a customer.

    3. To search the details of a customer.

    4. To delete the details of a customer.

    5. To modify the details of a customer.

    6. To display the details of all customer.

    7. To display the quantity of goods available.

  • 9

    1. #include 2. #include 3. #include 4. #include 5. #include 6. #include 7. #include 8. #include 9. #include 10. using namespace std; 11. 12. void gotoxy(int i,int j) 13. { 14. int o=0,p=0; 15. for(;p

  • 10

    48. cin>>a; 49. coutb; 51. coutc; 53. couti; 55. } 56. 57. //FUNCTION TO DISPLAY THE VALUES 58. 59. void display() 60. { 61. cout

  • 11

    109. fstream f1; 110. f1.open("main.dat",ios::in|ios::binary); 111. while(!f1.eof()) 112. { 113. f1.read((char*)&c,sizeof(c)); 114. c.display(); 115. if(f1.eof()) 116. { 117. cout

  • 12

    170. found='t'; 171. coutconfirm; 173. if(confirm=='n') 174. f2.write((char*)&c,sizeof(c)); 175. } 176. else 177. f2.write((char*)&c,sizeof(c)); 178. } 179. if(found=='f') 180. cout

  • 13

    230. getch(); 231. } 232. 233. //STARING OF THE INT MAIN 234. 235. int main() 236. { 237. unsigned int sum,add,d,e,f,g,h,k,l,w,x,y,z,choice; 238. int abis=0,apep=0,amun=0,aperk=0,acoc=0,atit=0,alux=0,atid=0,aree=0,aden

    =0; 239. unsigned int m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0; 240. int pend=0,print=0,graph=0,ram=0,hard=0,win=0,ant=0,p1=0,p2=0,g1=0,r1=0,

    h1=0,w1=0,an1=0,mo=0,mous=0,web=0,aweb=0,asc=0,scan=0,total=0; 241. char pu,str[10],yes,et; 242. system("cls"); 243. 244. //WELCOME SCREEN 245. 246. system("cls"); 247. system("cls"); 248. system("cls"); 249. cout

  • 14

    289. cout

  • 15

    346. gotoxy(5,2); 347. cout

  • 16

    404. system("cls"); 405. cout

  • 17

    465. cout

  • 18

    524. } 525. else 526. { 527. system("cls"); 528. goto cash; 529. } 530. } 531. if(choice==2) 532. { 533. pep:; 534. system("cls"); 535. cout

  • 19

    584. coutyes; 586. if(yes=='Y'||yes=='y') 587. { 588. system("cls"); 589. goto items; 590. } 591. else 592. { 593. system("cls"); 594. goto cash; 595. } 596. } 597. if(choice==3) 598. { 599. den:; 600. system("cls"); 601. cout

  • 20

    645. } 646. } 647. if(choice==4) 648. { 649. mun:; 650. system("cls"); 651. cout

  • 21

    706. system("cls"); 707. cout

  • 22

    766. ram=2000; 767. } 768. else if(r1==2) 769. { 770. ram=4000; 771. } 772. else if(r1==0) 773. { 774. goto items; 775. } 776. else if(r1!=1||r1!=2) 777. { 778. cout

  • 23

    827. { 828. hard=3000; 829. } 830. else if(h1==4) 831. { 832. hard=5000; 833. } 834. else if(h1==5) 835. { 836. hard=8000; 837. } 838. else if(h1==0) 839. { 840. goto items; 841. } 842. else if(h1!=1||h1!=2||h1!=3||h1!=4||h1!=5) 843. { 844. cout

  • 24

    887. } 888. else if(w1==2) 889. { 890. win=2000; 891. } 892. else if(w1==3) 893. { 894. win=4000; 895. } 896. else if(w1==4) 897. { 898. win=8000; 899. } 900. else if(w1==5) 901. { 902. win=11000; 903. } 904. else if(w1==0) 905. { 906. goto items; 907. } 908. else if(w1!=1||w1!=2||w1!=3||w1!=4||w1!=5) 909. { 910. cout

  • 25

    948. if(an1==1) 949. { 950. ant=1500; 951. } 952. else if(an1==2) 953. { 954. ant=2000; 955. } 956. else if(an1==3) 957. { 958. ant=1300; 959. } 960. else if(an1==0) 961.

Search related