Fast food management system

8/18/2019 Fast food management system

http://slidepdf.com/reader/full/fast-food-management-system 1/23





Fast Food Management System

In this syste" the "aintenance of data is difficult because all work is

perfor"ed by "anual syste". $he "aintenance of data is ti"e consu"e.

1.3.3 %ifficu#t 'eporting

'eport is very i"portant part of an organization. It is used for taking

decision. In current syste" the report can be prepared very difficult

because data is stored in different files.

1.3.* %ifficu#t to 'etrie&e

$he retrieving of data is difficult because it is stored in "any files. %hen the

"anager wants to see all infor"ation it is difficult to retrieve.

1.3.+ ecurity (ro,#em

In this syste" security proble" is very co""on. (veryone can check the

staff infor"ation and can used this infor"ation for illegal use.

Chapter No.2

(roposed ystem

2.0 Introduction of (roposed ystem

In this we "ake a new and fully auto"ated co"puterized syste" then all the

activities in our fast food "anage"ent syste".

2.0.1 Name of system

Fast Food Manage"ent syste"

Islamia University Bahawal Pur




2.1 (urpose of proposed system

)ur software saves a lot of ti"e and also increase the processing power. $his

software calculates bill in an easy way. $his software "akes design according to

custo"er re*uire"ents. $his software up to date the "anager about the fast food.

2.2 Too#s - Techno#ogies

2.2.1 )s !ord 200

For docu"entation and co"posing

2.2.2 )s /ccess 200

For "aking database

2.2.3 Edra$ )ax +

For "aking (ntity 'elationship +iagra"

2.2.* isio 2003

For "aking data flow diagra"

2.3 'euirements from proposed system

Num,e

r

%escription

,

$he salary of all staff will calculate by co"puterized syste" with very

ease and the history of staff-s salary will also store in this co"puterized

syste" so we "ay check it out in future as we need as we want $he personal infor"ation of all staff will store in co"puterized syste"





so we "ay use the" again and again with ease so we feel co"fort

$he working e/perience of staff will store in co"puterized syste"

!$he records of all staff that work in fast food will store in co"puterized

syste"

0 $he personal infor"ation of all staff will store in co"puterized syste"

1$he records of all custo"er that have taken ho"e delivery will store in

co"puterized syste"

2 Billing infor"ation will store electronically

3$he files and other docu"ents will send to head office by electronic

"ail

4 All the infor"ation about building will stored in co"puterized syste"

,5 All the infor"ation of e*uip"ent will store in co"puterized syste"

,,$he Certificate and Awards infor"ation will store in co"puterized

syste"

, All the infor"ation and specification of co"puter in fast food will store

in co"puterized syste"

2.* /d&antages of proposed system

2.*.1 No %up#ication

In our database no data duplication is not found.

2.*.2 ecurity

In our database security is provide to its user. (very one cannot see personal data

about our fast food.

2.*.3 /tomicity of %ata

6alf data transaction is not perfor"ing in database. Full data is transfer. A collection

of all steps to co"plete a process is known as transaction.

2.*.* Less (aper !or"





In this too "uch paper work is not done ."ost of the work is done by co"puter.

2.*.+ Consistency of %ata

In this data is consistent user can use infor"ation when data is re*uired .+ata ite"

appears only at one place. It is easy to "aintain.

2.*. ac"up and 'eco&ery

If the data is lost the backup is restored.

2.*. %ata haring

)nce a database is developed it can be use by several users in the organization.

$he database can also be share in different organization.

2.*.4 Compactness

In this database is efficient and less space will be used.

2.*.5 Consistency Constraints

Consistency constraints are the rules that "ust be followed to enter data in

database .If the constraints are not fulfilled# data cannot be enter in the database.

Chapter No.3

%esigning

3.0 %ata 6#o$ %iagram

$he "ost co""only used tool to design database syste" is data flow diagra" +F+.

A data flow diagra" shows the flow of data through an organization. It is used to

design syste" graphically .+F+ is si"ple and it hides co"ple/ities of the syste".

3.1 /d&antages of %ata 6#o$ %iagram

7nderstanding of interrelationships of syste"s and subsyste"s. It

provides the freedo" fro" co""itting to the technical i"ple"entation

of syste" to early.





It helps in further

It is helpful in co""unicating current syste" knowledge to user.

It is an analysis of proposed syste" to deter"ine if all data and

processes have been defined

3.2 E#ements of %ata 6#o$ %iagram

3.2.1 %ata (rocess

$he round rectangle sy"bol is used for data process. It e/presses a syste" for

which the database is designed.

3.2.2 Externa# Entity

'ectangle sy"bol is used for entity. It e/presses all entities that involved in syste".

3.2.2.1 (hysica# Entity

All entities that have real e/it in our life

(.g. person# things# places

3.2.2.2 Logica# Entity

All entities that have not real e/it in our life


Process

(ntity






3i##ing 6ood

Customer taff

6ast 6ood

)anagement

ystem

%ata tore

3i##ing Info

78

78

Customer Info

78

6ood Info

taff Info

78

tore

3.+ Entity 'e#ationship )ode#

$he (ntity 'elationship Model is a popular high level conceptual data "odel. $he ('"odel is used to construct the conceptual data "odel# which is a representation of

the structure of the database that is independent of the +BM& software.

$he (' "odel is e/pressed in ter"s of entities# relationships between entities and

the attributes of involved entities. $he (' "odel also allows the logical designer to

specify constraints on the entities or relationships between entities.

3. /d&antages of Entity 'e#ationship )ode#





(' "odel represents the conceptual of database along with its entities

and relationship in an easy way (' "odel provides visual representation of data and relationships

a"ong data

By using (' "odel database designer can get different views of data (' "odel can be integrated with relational database "odel

3. E#ements of Entity 'e#ationship )ode#

3..1 Entity

A table bo/ is used for entity. $he attributes of an entity written in table bo/

3..2 'e#ationship

Arrow &hape is used for relationship. It represents the relationship between entities.

3.4 Entity 'e#ationship )ode# of 6ast 6ood )anagement

ystem





Chapter No.*

Norma#ization

*.0 6unctiona# %ependencies





If A and B are attributes of relation '# then B is functionally dependent on A. If every

value of A uni*uely deter"ines the value of B or in other words if each value of A is

associated with e/actly one value of B. it is denoted by

A B

A is called the deter"inant of B. Functional dependencies are not necessarily

sy""etric i.e.

A B

+oes not necessarily i"ply that

B A

*.1 Types of 6unctiona# %ependencies

$here are three types of Functional +ependencies

*.1.1 6u##y 6unctiona# %ependency

An attribute of relation that can be uni*uely deter"ined by a co"posite pri"ary key

of that relation is said to be fully functional dependent on co"posite key.

*.1.2 (artia# 6unctiona# %ependency

If an attribute of a relation can be uni*uely deter"ined by the part of co"posite key

then this attribute is said to be partially functional dependent on the co"posite key.

$his type of dependency is known as the partial functional dependency.

*.1.3 Transiti&e 6unctiona# %ependencies

If in a relation a non key attribute can be uni*uely deter"ined by another non keyattribute then this attribute is said to be the transitive functional dependent on the





other non key attribute. $his type of dependency is known as the transitive functional

dependency.

*.2 Norma#ization

As with (ntity9'elationship "odeling# the purpose of the nor"alization is to get the

data into so"e si"ple for" that truly reflects the separate entity types# their

attributes and relationships between the". :or"alization is so"ewhat "ore detailed

and non diagra""atical process which the data analyst or dataset designer carries

out when designing the database sche"a. 'ather than starting fro" the real world

entities it starts fro" predocu"ented sets of attributes and tries to group and regroup

the" in such a way that update# insertion# and deletion ano"alies are avoided.

;It is a process for converting un9nor"alized for" or co"ple/ data structure into

si"ple data structure or nor"al for". A process of splitting entity type is also called

nor"alization<.

*.3 Types of Norma#ization

$here are three type of :or"alization

*.3.1 6irst Norma# 6orm





A relation is in first nor"al for" only if it contains no repeating attributes and no

repeating groups of attribute.

%hen there e/ists "ore than one value of an attribute for a single key value then this

attribute is called as repeating group. 'elational databases do not allow repeating

groups.

*.3.2 econd Norma# 6orm

A relation is said to be in :F if it is in ,:F and there e/ist no partial functional

dependency.

*.3.3 Third Norma# 6orm

A relation is said to be in :F if it is in :F and there e/ists no transitive functional

dependency.

Chapter No.+

'e#ationa# %ata )ode#

+.0 'e#ationa# %ata )ode#

'elational data "odel is the "ost co""only used data "odel to design thedatabase. In ,425# +r. (F Codd gave the concept of relational data "odel. $he





relational data "odel is based on "athe"atical theory. $his "odel represents a

database as a collection of relations. $he relations are physically represented as

tables.

+.1 E#ements of 'e#ationa# %ata )ode#

+.1.1 'e#ation

In a relational "odel# data is stored in relation. 'elation is another ter" used for

table.

+.1.2 Tup#e

In a relational "odel# every relation or table consists of "any $uples. $uples are also

called records or rows.

+.1.3 /ttri,ute

An attribute is a na"ed colu"n of a relation. Attributes are also called

characteristics. $he characteristics of (ntity are represented by attributes or fields.

+.1.* %egree

$otal no. of attributes in a relation is called degree of that relation

+.1.+ Cardina#ity

$otal no. of $uples in a relation is called cardinality of that relation

+.1. %omain

Allowable values in a relation is called do"ain of that relation.

+.2 /d&antages of 'e#ationa# %ata )ode#





o It allows for developing si"ple but powerful structure for database

o It allows separation of the logical and physical level# so that logical

design can be perfor"ed without considering the storage structureo It allows for designing or e/pressing the data of an organization in a

si"ple way# which can easily be understoodo $he data operations can easily be e/pressed in a si"ple way

o It allows for applying data integrity rules on the relations of database

o +ata fro" "ultiple tables can be retrieved very easily

o It allows users for inserting# "odifying and deleting the rows in a table

without facing any proble"

Chapter No.

9raphica# :ser Interface

.0 Ta,#es

.0.1 i##

1.5.,., +esign =iew





1.5.,. +atasheet =iew

.0.2 Customer

1.5.., +esign =iew

1.5.. +atabase =iew

.0.3 t ff

1.5.., +esign =iew





1.5.. +atabase =iew

.0.* 6ood

1.5.!., +esign =iew

1.5.!. +atabase =iew





.0.+ 'e#ationships





.1 6orms





1.,., Bill

1.,. Custo"er

1.,. Food

1.,.! &taff





.2 )acros





Documents

Fast food management system