COMPUTER SCIENCE PROJECT REPORT

Kendriya Vidyalaya,PURI

TOPIC: PERIODIC TABLE

Developed by:
Anwesha Subudhi
CLASS: XII (B)
Roll No.______________

Under the Guidance of

MR. Tanmaya Mishra
(PGT, COMP. SC.)

1|Page
 ACKNOWLEDGEMENT

I express my deepest gratitude Mr. Tanmaya Mishra, (PGT

Computer Science) KV, Puri for giving me the privileged

opportunity to do the Project in his guidance.

Lastly, I am very much thankful to the Ms. Pratima Mishra,

PRINCIPAL, KV, Puri for giving me the opportunity/independence

to develop such Project.

Finally, I would like to thank all of the other members for helping me

for completion of the project and above all, I am very much thankful

to my friends who had helped me for the completion of this project

report.

Date:
Place: KV Puri Anwesha Subudhi

2|Page
 CONTENTS
PERIODIC TABLE

1. Certificate
2. Acknowledgment
3. Overview of C++
4. Need for the Project/Synopses/Summary
5. Requirements (hardware & Software)
6. Header Files (used in the Project along with the functions)
7. Classes & Objects (Description of user defined classes and
their purpose)

8. Functions (Description of user defined functions and their

purpose)
9. Source Code (listing of all the programs prepared as part of
project)

10. Testing (Output - Dumps of all the output screens)

11. Conclusion
12. Maintenance
13. Certificate (by External)
14. Bibliography

TEACHER’S CERTIFICATE
3|Page
 This is to certify that Anwesha Subudhi, is a student of
XII ‘B’, Kendriya Vidyalaya, Puri. She has successfully
Completed his project work “PERIODIC TABLE” under my
guidance of Mr. Tanmaya Mishra (PGT, Computer Science)
during Session 2018-19.

Under signed wishes you a happy and bright future.

Mr. Tanmay Mishra

(PGT, Computer Sc.)

4|Page
 PRINCIPAL’S CERTIFICATE

This is to certify that Anwesha Subudhi, is a student of

XII ‘B’, Kendriya Vidyalaya, Puri. She has successfully
completed his project work “PERIODIC TABLE” under my
guidance of Mr.Tanmaya Mishra (PGT, Computer Science)
during Session 2018-19.

Under signed wishes you a happy and bright future.

Ms. Pratima Mishra

(Principal, KV, Puri)

5|Page
 BONAFIDE Certificate
This is to certify that, Anwesha Subudhi, of Class – XII is a bonafide

student of Kendriya Vidyalaya, Puri. She has completed this project on the

topic: “PERIODIC TABLE” under the Guidance of Mr.Tanmaya Mishra (PGT

Computer Sc.) of Kendriya Vidyalaya, Puri during this session 2018 -19.

Signature of Teacher Signature of Principal

Mr. Tanmaya Mishra Ms. Pratima Mishra

Signature of Student
Anwesha Subudhi

6|Page
 OVERVIEW OF C++
This software is developed by using various software
methodologies, involving the Object Oriented Programming
approaches With File Handling to store and retrieve data through
C++ to automate the Book Keeping Jobs for Library.

STEPS MANIPULATE A DATA FILE (OPEN, READ/WRITE, CLOSE):

Step 1: Selection of the Stream Required

Stream Class
Type of Link Purpose of Link
Required
File-to-Memory Input (Read) ifstream class
Memory-to-File Output (Write) ofstream class
File-to-Memory / Memory-to- Input/Output fstream class
File (R/W)

Step 2: Open a Data File (Associate a Data File to the Stream)

File can be opened using two ways.

1 – Using Constructor Function:

Syntax: StreamName StreamObj(“FileName”, [file mode[s]]);

Example: ofstream wfile(“stud.dat”); // for write mode

ifstream rfile(“stud.dat”); // for read mode

2 – Open Using the function:

Syntax: streamObj.open(“FileName”, [file mode[s]]);
Example: To create a new stream object to write data:
ofstream fout;
fout.open(“stud.dat”);
ifstream fin; // To create a new stream object to read data:
fin.open(“library.dat”);

Step 3: Accessing the File to Write or Read Data:

To write data to the file:
Syntax: streamObj << datamember[s];
Example: wfile<<roll<<'\n'<<name<<'\n';

To read data from the file:

7|Page
 Syntax: streamObj << datamember[s];
Example: rfile<<roll<<'\n'<<name<<'\n';

Step 4: To close the Data File

Syntax: StreamObj.close();
Example: wfile.close();
file.close();

POINTER
(The Most Useful and Strongest Feature of C++)
POINTER is a variable storing a memory address is called a pointer as it
points to a specific memory location whose address it is storing under its
name.
ADVANTAGES OF USING POINTER:
- Directly access to the memory location of a variable.
- Dynamic memory allocation
- Improves the efficiency of certain routines.
Dynamic Memory Allocation: The amount of memory to be allocated is not
known beforehand. So, it is the allocation of memory during runtime.
There are two operators for dynamic allocation:
1. new : used to allocate memory dynamically and returns a pointer
storing the memory address.
Syntax: pointer_variable = new data_type;
Example:
int *ptr;
ptr = new int; // here two byte allocated and base address

int *ptr; int val=9;

ptr = &val; // also we can declare like this to allocate memory directly.
//above case first byte address of val location will be assigned to ptr.

2. delete : used to de-allocate (reverse of new) pointed by given pointer.

Syntax: pointer_variable = delete data_type;
Example:
int *ptr;
ptr = new int;
:
delete ptr;
Remember: The memory allocated using new operator remains in memory
until explicitly deallocated/removed by the programmer using delete operator.

This Pointer

8|Page
 The ‘this’ is a pointer that points to that object using which the function is
called. The ‘this’ pointer is automatically passed to a member function
when it is called.
this.datamember – to access the data members of that particular object

DATA STRUCTURE

Data may be organized in many different ways. The logical or

mathematical model of a particular organization of data is called a data
structure. It is a way of organizing all data items and their relationship
between each other.
Algorithm + Data Structure = Program

The Data Structures are classified into following types:

1. Simple Data Structure:
Built from Primitive Data types (like int, char, float etc.)
– Array – Structure

2. Compound Data Structure:

Simple Data Structures can be combined different ways to form more
complex data structures called Compound Data Structures.
Again is also classified into following types:
(i) Linear Data Structure:
These are single Level Data structures, having their elements in a
sequence.
– Stack – Queue –Linked List
(ii) Non Linear Data Structure:
Multilevel Complex Data Structure is called non linear Data structure.
– Tree –Graph

ARRAY: It is a collection of homogeneous (similar type) data elements i.e.

array can contain one type of data only, either all integers, all floating-point
numbers or all characters stored in consecutive memory space.
Declaration/ syntax for array is: datatype variable-name[size];

STACK AND QUEUE

Stack and Queue: In a linked list and array we can insert or delete an
element at any position. But in case of stack and queue the insertion or
deletion operation can be done from only one end.

9|Page
Stack: Stack is defined as a list of elements in which we can insert or delete
the element only at the top of the stack. It is a LIFO ( Last In First Out ) type
data structure.
Eg: CD bundle, Tower of Hanoi, biscuit packet, plates at a party
There are two operations possible on the stack:
o PUSH, add an element to the stack at the TOS ( Top Of Stack )
o POP, delete an element from the TOS

Stack Implementation: Stack can be implemented in two ways:

o Static implementation
o Dynamic implementation

Static implementation uses array to create stack. Since we can’t

extend the array size after declaration, so it is not generally accepted. If there
is more number of elements is present then it is difficult to handle, which may
cause to wastage of memory.

Dynamic implementation is done by pointers. Dynamic

implementation also known as linked list.

QUEUE:
It is a homogenous collection of data. It is a non-primitive data structure
based on the logic FIFO ( First In First Out ). So it also known as FIFO data
structure.
E.g. People standing at a ticket counter, train buggy. Here the working
operation is done in FCSC (First Come First Serve) basis.
There are two operations possible on the queue:
o Insert, add an element to the queue at the REAR end
o Delete, delete an element from the FRONT end.

LINKED IMPLEMENTATION OF STACK:

A linked list, or one-way list, is a linear collection of data elements, called
nodes, where the linear ordering is given by means of pointers.

Link list is implemented using self referential structure.

struct node
{
int data;
struct node *link;
}

10 | P a g e
 DATA TOP

LINK

DATA

LINK

DATA

LINK=NULL

11 | P a g e
 NEED FOR THE PROJECT

This project is developed by using various software methodologies,

involving the Object Oriented Programming approach to automate the periodic

table. This is an application for the computer controlled periodic table with

which the people can search for the periodic elements with their atomic

number easily. Our project aims at modeling of the computer software for the

navigation of computer controlled environment to fulfill the requirements.

12 | P a g e
 REQUIREMENTS

(Hardware & Software Requirements for Development)

HARDWARE

PROCESSOR
 Pentium 486/PI/PII/PIII/PIV/Core2Due or Higher Processor

MEMORY
 `Main Memory : 64 MB or More

 Secondary Memory : 10 GB or More

OTHER PERIPHERALS:
 printer (for Documentation using hardcopy)

NETWORKING
 LAN (for module developments)

 INTERNET (for online informations)

SOFTWARE

OPERATING SYSTEM
 GUI : Windows 98SE/XP OS or Higher (or
any GUI OS)

APPLICATION
 Word Processor : MS Word (or any other for
documentation)

 Editor : C++ IDE or any other Editor for

coding

LANGUAGE
 Coding Language : Turbo C++ / Borland C++ (or any
higher ver.)

13 | P a g e
 HEADER FILES
(Used in the Project along with the functions)

1. conio.h - Declares various functions used in calling the

operating system console I/O routines.

2. ctype.h - Contains information used by the character

classification and character conversion macros (such as
isalpha and toascii)

3. dos.h - Defines various constants and gives declarations

needed for DOS and 8086-specific calls.

4. fstream.h - C++ Declares the C++ stream classes that

support file input and output.

5. iomanip.h - C++ Declares the C++ streams I/O manipulators

and contains templates for creating parameterized
manipulators.

6. iostream.h - C++Declares the basic C++ streams (I/O)

routines.

7. math.h - Declares prototypes for the math functions and

math error handlers.

8. process.h - Contains structures and declarations for the

spawn... and exec... functions.

9. stdio.h - Defines types and macros needed for the standard

I/O package defined in Kernighan and Ritchie and extended
under

10. stdlib.h - Declares several commonly used routines such as

conversion routines and search/sort routines.

11. string.h - Declares several string-manipulation and memory-

manipulation routines.

12. time.h - Defines a structure filled in by the time-conversion

routines asctime, localtime, and gmtime, and a type used by

14 | P a g e
 the routines ctime, difftime, gmtime, localtime, and stime. It
also provides prototypes for these routines.

CLASSES & OBJECTS

(Description of user defined classes and their purpose)

FUNCTIONS

(Description of user defined functions and their purpose)

void horr::accept()

 This function is used to accept the details about the birth date , year ,
Month and name of the user .

void horr::matching()

 This function is used to calculate the lucky no. , predict the zodiac
sign
Of the user according to the birth date entered .

void horr::display()

 This function is used to display the lucky no. , predicted the zodiac
sign,
A word of advice , characterstics of the user according to the birth
date entered .

void WELCOME_SCREEN()

 This function is used to show a welcome screen before the original

Program starts.

15 | P a g e
 SOURCE CODE
(Listing of all the programs prepared as part of
project)

16 | P a g e
 TESTING/OUTPUT
(Dumps of all the output screens)
OUTPUT SCREEN - 1

OUTPUT SCREEN - 2

17 | P a g e
 CONCLUSION

All the process of this “HORROSCOPE” is working successfully.

The CODE, TEST PLAN & Other documents are used to solving the total
process of the system. Any user can be tested this project easily but there
may be some error that can be negligible and that can’t be affect to the
system or the general user. Any type of difficulty will be find that should be
error free by the system administrator. The design of the system is very
attractive but time taking or the system is very user friendly.
- Maintenance: - The maintenance is very easy not so risky.
-
- Reliability: - The system reliability is perfect.
-
- Operation: - This process involves in the system is error free.

- Security: - The security is average but it can be increased on

maintenance

- Safety: - The Security provision for maintaining the records, so, it is a

safety system.

- Cost: - The cost of developing & validating the system reliability is very
less.
-
- Times consume: - The system is very less time consuming for updating,
entering the data & searching the data.

18 | P a g e
 MAINTENANCE

Installation procedure
The user has to first switch ON the computer then wait for
the desktop screen will show. Then open the CD drive & copy the
folder of this software to the mass storage device of the PC.

Maintenance
The Software proves a very user-friendly
environment/coding for its maintenance as per the requirement in
the place of installation.

19 | P a g e
 DEPARTMENT OF COMPUTER SCIENCE
Kendriya Vidyalaya, <school name>, Midnapore
(West)

CERTIFICATE
This is to certify that Master <Stu…Name>
Students of Computer Sc. of KV, <Sch.Name>,
MIDNAPUR(W),WB has developed the project
“HORROSCOPE” under the guidance of
<Teacher name> , PGT, Computer Science of
KV, <Sch.Name>, , MIDNAPUR (W),WB.

As a partial fulfillment of the academic curriculum,

they have worked on this project successfully.

External Examiner Internal

Examiner
Date: Date:

20 | P a g e
 BIBLIOGRAPHY

1. Complete Reference by our computer science teacher

<Teachers Name>.

2. Data Structure using C++ by Tarentum.

3. Detail about Horoscopes from Internet.

4. Computer Science Reference by our School book.

21 | P a g e