Dbms Final Report Nithin and Ramesh
Dbms Final Report Nithin and Ramesh
PROJECT GUIDES
Dr. Gururaj T Ph.D., Prof. Arjun H M.Tech .,
Associate Professor Assistant Professor
2023-2024
Bapuji Institute of Engineering and Technology
Department of Computer Science and Engineering
Davanagere-577004
Bapuji Institute of Engineering and Technology
Davanagere – 577004
CERTIFICATE
This is to certify that NITHIN KUMAR K N and RAMESH S bearing USN 4BD21CS092 and
4BD21CS113 respectively of Computer Science and Engineering department have satisfactorily
submitted the Mini Project report entitled “SCHOLARSHIP MANAGEMENT SYSTEM”
for 5th SEM DBMS MINI PROJECT (21CSL55). The project report has been approved as it
satisfies the academic requirements for the year 2023-24.
__________________________ ______________________
Dr. Gururaj T Ph.D., Prof. Arjun H M.Tech.,
Associate Professor Assistant Professor
Guide Co-Guide
__________________________
Dr. Nirmala C R Ph.D.,
Head of Department
Signature of Examiners:
Date: 1.__________________________
We express our sincere thanks to our resourceful guides Dr. Gururaj T, Associate Professor,
Department of Computer Science and Engineering, B.I.E.T., Davanagere, and Prof. Arjun H,
Assistant Professor, Department of Computer Science and Engineering, BI.E.T., Davanagere, who
helped us in every aspect of our project. We are indebted to discussions about the technical aspects
and suggestions pertaining to our project.
We are grateful to Dr. Nirmala C R, Professor and H.O.D, Department of Computer Science
and Engineering, B.I.E.T., Davanagere, for endeavoring encouragement, facilities, and extended
support.
We also express our wholehearted gratitude to our respected Principal, Dr. H B Aravind for
his moral support and encouragement.
We would like to extend our gratitude to all staff of the Department of Computer Science
and Engineering for the help and support rendered to us. We have benefited a lot from the feedback,
and suggestions given by them.
We would like to extend our gratitude to all our family members and friends especially for
their advice and moral support.
Vision
“To be a centre of excellence recognized nationally internationally, in distinctive areas of
engineering education and research, based on a culture of innovation and invention.”
Mission
“BIET contributes to the growth and development of its students by imparting a broadbased
engineering education and empowering them to be successful in their chosen field by
inculcating in them positive approach, leadership qualities and ethical values.”
Mission
1. Adapting best teaching and learning techniques that cultivates Questioning and
Reasoning culture among the students.
2. Creating collaborative learning environment that ignites the critical thinking in students
and leading to the innovation.
3. Establishing Industry Institute relationship to bridge skill gap and make them industry
ready and relevant.
PEO1 To apply skills acquired in the discipline of computer science and engineering for
solving Societal and industrial problems with apt technology intervention.
PEO2 To continue their carrier ion industry /academia or pursue higher studies and
research.
PEO3 To become successful entrepreneurs, innovators to design and develop software
products and services that meets societal, technical and business challenges.
PEO4 To work in the diversified environment by acquiring leadership qualities with effective
communication skills accompanied by professional and ethical values.
3
Program Specific Outcomes (PSOs):
PSO1 Analyse and develop solutions for problems that are complex in nature but applying the
knowledge acquired from the core subjects of this program.
PSO2 To develop secure, scalable, resilient and distributed applications for industry and
societal Requirements.
PSO3 To learn and apply the concepts and contract of emerging technologies like artificial
intelligence, machine learning, deep learning, big-data analytics, IOT, cloud computing
etc for any real time problems.
Course Outcomes:
4
ABSTRACT
Scholarship Management System is for managing the details of students applied for various
scholarship in college. This helps to find the details of eligible students and applied students.
year-wise selection of eligible students is also possible. Eligible students are selected by
Application ID and also by administrator preference. Administrator can also verify/decline
scholarships & can Add /Delete collage. This software is easy to handle. This will replace the
problems of existing system. The students can also give Feedback of this system which is
directly stored in database More features and functionalities are added later
5
Contents
ABBREVIATIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1 INTRODUCTION 2
1.1 INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 DBMS (DATABASE MANAGEMENT SYSTEM) . . . . . . . . . . . 2
1.3 PHP (HYPERTEXT PREPROCESSOR) . . . . . . . . . . . . . . . . . 3
1.4 PROBLEM STATEMENT . . . . . . . . . . . . . . . . . . . . . . . . 3 1.5
OBJECTIVES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2 REQUIREMENT SPECIFICATION 5
2.1 HARDWARE REQUIREMENTS . . . . . . . . . . . . . . . . . . . . 5 2.2
SOFTWARE REQUIREMENTS . . . . . . . . . . . . . . . . . . . . . 5
6
3 DESIGNS 6
3.1 ENTITY-RELATIONSHIP DIAGRAM . . . . . . . . . . . . . . . . . 6
3.2 DESCRIPTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
3.3 SEVEN STEPS FOR ER TO SCHEMA CONVERSION . . . . . . . . 8
3.4 SCHEMA DIAGRAM . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.5
DATABASE DESCRIPTION . . . . . . . . . . . . . . . . . . . . . . . 11
4 IMPLEMENTATION CODE 14
4.1 IMPLEMENTATION CODE . . . . . . . . . . . . . . . . . . . . . . . 14
4.1.1 CONNECTION CODE FOR FRONT END TO BACK END . . 14
4.1.2 CODE TO DELETE COLLEGE . . . . . . . . . . . . . . . . . 15
4.1.3 CODE TO INSERT NEW COLLEGE . . . . . . . . . . . . . . 16
4.1.4 CODE FOR VERIFYING APPLICATION . . . . . . . . . . . 16
4.1.5 CODE FOR DECLINING APPLICATION . . . . . . . . . . . 17
4.1.6 CODE FOR INSERTING DATA INTO STUDENT,
BANK_DETAIL AND APPLICATION TABLE . . . . . . . . . . . . . . . . . .
18
5 SNAPSHOTS 19
CONCLUSION 23
REFERENCES 24
List of Figures
7
List of Tables
3.5.1 Description of database . . . . . . . . . . . . . . . . . . . . . . . . 11
8
Scholarship Management System
ABBREVIATIONS
DBMS Database Management System
INTRODUCTION
1.1 INTRODUCTION
At the University of VTU, both freshmen and continuing students can apply to a large
number of scholarships. They need to apply for scholarships explicitly illustrating their
qualifications and eligibility for the scholarships they apply. There are various criteria to
satisfy when a student applies for a scholarship. The majority of criteria are based on
students’ merits and other academic performances. Their financial information is another
main consideration for how much scholarship they can receive. Some scholarships may
also require that applicants have to take specific courses or select a particular major. The
Scholarship Foundation Office plays the role as a sponsor in maintaining scholarships
information, processing applications.
Database is a collection of related data and data is a collection of facts and figures that
can be processed to produce information. Mostly data represents recordable facts. Data
aids in producing information, which is based on facts. For example, if we have data
about marks.
A database management system (DBMS) is a software package designed to define,
manipulate, retrieve and manage data in a database. A DBMS generally manipulates the
data itself, the data format, field names, record structure and file structure. It also defines
rules to validate and manipulate this data.
A DBMS relieves users of framing programs for data maintenance. Fourth- genera-
tion query languages, such as SQL, are used along with the DBMS package to interact
with a database.
• MySQL
• SQL Server
• Oracle
• dBase
• FoxPro
PHP is the most popular and widely used server-side scripting language for web devel-
opment. It is used to make the Dynamic pages in websites. Rasmus Lerdorf was the
creator of PHP in 1995. PHP codes are embedding in HTML source codes for making
the page dynamic. PHP can deal with most of the requirements in web development like
Database, File handling, String operations, Arrays, Graphics, File Uploads, Data
processing etc. PHP can be used in any operating system with a web server Supports
PHP. Apache web server is one of the popular web servers dealing with PHP + MySQL.
Moreover, PHP is absolutely free to use.
Students across the universities should have the tools and means to apply for scholarship
in a brief period of time without having them to go through a long process. Currently,
paper applications are overwhelming many of the employees by having them to do more
work manually. This hinders productivity and also requires more time to verify and
sanction the scholarship to the students. We propose that, using an online portal for
students to apply for scholarship by entering/uploading all the required information,
which then will be verified by their respective colleges, later the scholarship department
can sanction the scholarship for the applications verified by the colleges.
1.5 OBJECTIVES
CHAPTER 2
The hardware required for the development of this project is: Processor
:Intel Core i3
Processor speed :1.7 GHz
RAM :2 GB
CHAPTER 3
DESIGNS
3.1 ENTITY-RELATIONSHIP DIAGRAM
NOTATIONS:
3.2 DESCRIPTION
The ER Model figure shows conceptual view of the database. It works around real-world
entities and the associations among them. At view level, the ER model is considered a
good option for designing databases. So, let’s see each entity.
ADMIN TABLE
STUDENT TABLE
This entity stores the information about the student login credentials along with phone
number. Attributes are app_id, ph_no, S_password.
APPLICATION TABLE
This entity stores the information about the student. The attributes are app_id, c_code,
s_name, aadhar, reg_no, prev_year_perc, status.
COLLEGE TABLE
This entity stores information about the college. The attributes are c_code, c_name and
c_password.
BANK_DETAIL TABLE
This entity stores the bank details of the student. Attributes are ifsc, acc_no, b_name,
app_id.
FEEDBACK TABLE
This entity stores the details of student’s feedback. Attibutes are app_id, ratings, com-
ments.
For each regular (strong) entity type E in the ER schema, create a relation R that includes
all the simple attributes of E. Include only the simple component attributes of a composite
attribute. Choose one of the key attributes of E as the primary key for R. If the chosen
key of E is a composite, then the set of simple attributes that form it will together form
the primary key of R. If multiple keys were identified for E during the conceptual design,
the information describing the attributes that form each additional key is kept in order to
specify secondary (unique) keys of relation R. Knowledge about keys is also kept for
indexing purposes and other types of analyses.
For each weak entity type W in the ER schema with owner entity type E, create a relation
R and include all simple attributes (or simple components of composite attributes) of was
attributes of R. In addition, include as foreign key attributes of R, the primary key
attribute(s) of the relation(s) that correspond to the owner entity type(s); this takes care
of mapping the identifying relationship type of W. The primary key of R is the
combination of the primary key(s) of the owner(s) and the partial key of the weak entity
For each binary 1:1 relationship type R in the ER schema, identify the relations S and T that
correspond to the entity types participating in R. There are three possible approaches:
The first approach is the most useful and should be followed unless special conditions
exist, as we discuss below.
Choose one of the relations—S, say—and include as a foreign key in S the primary
key of T. It is better to choose an entity type with total participation in R in the role
of S. Include all the simple attributes (or simple components of composite
attributes) of the 1:1 relationship type R as attributes of S.
An alternative mapping of a 1:1 relationship type is to merge the two entity types
and the relationship into a single relation. This is possible when both participations
are total, as this would indicate that the two tables will have the exact same number
of tuples at all times.
The third option is to set up a third relation R for the purpose of cross-referencing
the primary keys of the two relations S and T representing the entity types. As we
will see, this approach is required for binary M: N relationships. The relation R is
called a relationship relation (or sometimes a lookup table), because each tuple in
For each regular binary 1: N relationship type R, identify the relation S that represents
the participating entity type at the N-side of the relationship type. Include as foreign key
in S the primary key of the relation T that represents the other entity type participating in
R; we do this because each entity instance on the N-side is related to at most one entity
instance on the 1-side of the relationship type. Include any simple attributes (or simple
components of composite attributes) of the 1: N relationship type as attributes of S.
For each binary M: N relationship type R, create a new relation S to represent R. Include
as foreign key attributes in S the primary keys of the relations that represent the par-
ticipating entity types; their combination will form the primary key of S. Also include
any simple attributes of the M: N relationship type (or simple components of composite
attributes) as attributes of S. Notice that we cannot represent an M: N relationship type
by a single foreign key attribute in one of the participating relations (as we did for 1:1 or
1: N relationship types) because of the M: N cardinality ratio; we must create a separate
relationship relation S.
For each multivalued attribute A, create a new relation R. This relation R will include an
attribute corresponding to A, plus the primary key attribute K—as a foreign key in R—
of the relation that represents the entity type or relationship type that has A as a
multivalued attribute. The primary key of R is the combination of A and K. If the
multivalued attribute is composite, we include its simple components.
For each n-array relationship type R, where n > 2, create a new relation S to represent R.
Include as foreign key attributes in S the primary keys of the relations that represent the
participating entity types. Also include any simple attributes of the n-array relationship
type (or simple components of composite attributes) as attributes of S. The primary key
of S is usually a combination of all the foreign keys that reference the relations
representing the participating entity types. However, if the cardinality constraints on any
of the entity types E participating in R is 1, then the primary key of S should not include
the foreign key attribute that references the relation E ‘corresponding to E.
Table 3.5.1 Description of project database Table 3.5.1 shows description of all tables in
the database scholarship
Table 3.5.4 shows structure and details of the student login information table
CODE
IMPLEMENTATION CODE
4.1 IMPLEMENTATION CODE
<?php
// connect to the database
$conn = mysqli_connect('localhost',
'root', '',
'scholarship');
// check connection
if(!$conn){
echo 'Connection error: '. mysqli_connect_error();
}
?>
<?php
if(!(array_filter($errors))){
// escape sql chars
$c_code = mysqli_real_escape_string($conn,
$_POST['c_code']);
// query to delete
$sql = "DELETE FROM college WHERE c_code='$c_code'";
CODE
<?php
$sql = "INSERT INTO college VALUES ('$c_code',
'$c_name',
'$c_password')";
CODE
<?php
$sql_ver = "UPDATE application\
SET status='verified'\
WHERE app_id='$id_to_update'";
if(mysqli_query($conn, $sql_ver)){
header('Location: index.php');
} else {
echo 'query error: '. mysqli_error($conn);
}
?>
4.1.5 FOR DECLINING APPLICATION
<?php
$sql_dec = "UPDATE application\
SET status='declined'\
WHERE app_id='$id_to_update'";
if(mysqli_query($conn, $sql_dec)){
header('Location: index.php');
} else {
echo 'query error: '. mysqli_error($conn);
}
?>
CODE
CODE
CHAPTER 5
SNAPSHOTS
Figure 1
CONCLUSION
2017, Pearson.
[2] Database management systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014,
McGraw Hill.
[3] Programming PHP, 4t h Edition, Kevin Tatroe and Peter MacIntyre, O’Reilly Media.
[4] Learning PHP, MySQL & JavaScript With jQuery, CSS & HTML5, 5t h Edition, Robin
Nixon, O’Reilly Media.