INTERNATIONAL SCHOOL OF

MANAGEMENT AND TECHNOLOGY

FACULTY OF COMPUTING
ASSIGNMENT COVER SHEET
This form is to be completed by students submitting assignments of level 4 and level 5.
Students are required to complete all sections and attach to your assignment.

STUDENT DETAILS

STUDENT NAME Dipesh Kumar Yadav

STUDENT ID [email protected]

UNIT AND ASSIGNMENT DETAILS

UNIT TITLE Unit 4: Database Design and Development

UNIT NUMBER A/618/7400

ASSIGNMENT Hinea Telecom Limited Helpdesk Systems

TITLE

ISSUE DATE 9/03/2024 DUE DATE 28/04/2024

ASSESSOR Nabina Rijal

NAME

ESTIMATED 5977
WORD LENGTH

SUBMISSION

HAND IN DATE 27/04/2024

DECLERATION AND ACKNOWLEDGEMENT

i
When submitting assignments, each student must sign a declaration confirming
that the work is their own.
Plagiarism and Collusion
Plagiarism: to use or pass off as one’s own, the writings or ideas of another
without acknowledging or crediting the source from which the ideas are taken.
Collusion: submitting an assignment, project or report completed by another
person and passing it off as one’s.
In accordance with the Academic Integrity and Plagiarism Policy:

1. I declare that:
a) this assignment is entirely my own work, except where I have included fully-
documented references to the work of others,
b) the material contained in this assignment has not previously been submitted
for any other subject at the University or any other educational institution,
except as otherwise permitted,
c) no part of this assignment or product has been submitted by me in another
(previous or current) assessment, except where appropriately referenced, and
with prior permission from the Lecturer / Tutor / Unit Coordinator for this unit.

2. I acknowledge that:
a) if required to do so, I will provide an electronic copy of this assignment to the
assessor;
b) the assessor of this assignment may, for the purpose of assessing this
assignment:
I. reproduce this assignment and provide a copy to another member of
academic staff;
II. Communicate a copy of this assignment to a plagiarism checking
service such as Plagiarism Check (which may then retain a copy of this
assignment on its database for the purpose of future plagiarism
checking).

I am aware of and understand that any breaches to the Academic Code of Conduct
will be investigated and sanctioned in accordance with the College Policy.

SIGNATURE DATE

ii
Table of Contents
Executive summary...................................................................................................................................1
Introduction...........................................................................................................................................1
TOOLS USED IN DATABASE DESIGN................................................................................................1
MYSQL server.......................................................................................................................................1
Draw.io....................................................................................................................................................2
USER REQUIRMENT................................................................................................................................2
SYSTEM requirement.................................................................................................................................2
RELATIONAL DBMS...............................................................................................................................3
Advantages of RDBMS.............................................................................................................................3
Structured Query Language.........................................................................................................................4
Types of Structured Query Language......................................................................................................4
SQL Constraints..........................................................................................................................................6
ER MODEL.................................................................................................................................................7
Entity.......................................................................................................................................................7
Strong entity........................................................................................................................................8
Weak Entity.........................................................................................................................................8
Attribute..................................................................................................................................................9
Types of attribute.....................................................................................................................................9
Simple attribute.................................................................................................................................9
Composite attribute................................................................................................................................9
Single value attribute.............................................................................................................................10
Multivalued attribute.............................................................................................................................10
Derived attributes..................................................................................................................................10
Complex attribute..................................................................................................................................11
Key attribute..........................................................................................................................................12
Stored attribute......................................................................................................................................12
Relationship.........................................................................................................................................13
One to one relationship..........................................................................................................................13
Many to many relationship....................................................................................................................14
Data validation..........................................................................................................................................16
Types of data validation........................................................................................................................16

1
Data normalization....................................................................................................................................18
Types of normalization..........................................................................................................................18
Sorting.......................................................................................................................................................23
Types of sorting.....................................................................................................................................24
Quick Sort.............................................................................................................................................24
Bubble sort............................................................................................................................................24
Merge sort.............................................................................................................................................24
Insertion sort..........................................................................................................................................24
Selection Sort........................................................................................................................................25
Heap Sort...............................................................................................................................................25
Radix sort..............................................................................................................................................25
Entity relational diagram....................................................................................................................26
ACTIVITY2..............................................................................................................................................27
Integrated Development Environment.......................................................................................................27
Login Page................................................................................................................................................28
CRUD OPERATATION...........................................................................................................................31
Create and Read Operation................................................................................................................32
Update Operation................................................................................................................................33
Delete operation...................................................................................................................................35
Caller Information Registration.............................................................................................................38
Check for User Information...................................................................................................................44
Problem Registration..............................................................................................................................52
Check for Equipment Information.........................................................................................................60
Specialist Entity.......................................................................................................................................67
Conclusion.................................................................................................................................................74

Executive summary
The proposed data set arrangement provides an extensive structure for effectively managing
helpdesk inquiries, satisfying both framework and client requirements. The structure
demonstrates its continued existence and ease via thorough planning, development, and testing.
It also has the potential to be strengthened by ongoing assessment and evaluate components.

2
Introduction
As a way to ensure client devotion and retention in the dynamic broadcast communications
market, Hinea Telecom Restricted recognises the basic significance of offering effective and
engaging customer service. The business has committed to building an IT Helpdesk structure in
order to promptly and accurately respond to customer inquiries as part of its commitment to
excellence and further growth. My role as the assigned Data Set Designer comprises organizing,
developing, implementing, and optimizing a strong data set structure to support the Helpdesk's
activities. By working fast to achieve its objectives and ensuring a uniform client experience, the
suggested data set framework seeks to simplify the process for recording and monitoring
helpdesk inquiries.

TOOLS USED IN DATABASE DESIGN

Data repository Plan is an ensemble of cycles that deal with data set administration framework
(DBMS) organizing, improvement, execution, and support. You can further develop information
consistency for circle capacity with the use of efficiently laid out data bases.

MYSQL server
Structured Question Language (SQL)-oriented Prophet embraces the free and open-sourced
MySQL social information collection management architecture (RDBMS). MySQL may be
utilized with almost any operating system, including UNIX, Linux, and Windows. Though
possessing an extensive number of applications MySQL is most often involved with apps that are
online and net-based distribution. A key component of the open-source Light project stack is
MySQL. Light is a web build stage that uses PHP as the item-specific prearranging language,
MySQL as the social information set maintenance framework, Apache as the web server, and
Linux as an operating system (Christudas, 2019).

Draw.io
While the greatest flowchart or charting program offers an entirely free degree of administration,
Draw.io isn't the best. Draw.io offers a commercial version of Intersection Waiter, which is how
the application functions while it is productive, but all of its other versions—including the web-
based Electronic iteration that is examined below—are free. With the use of this tool, creating
charts and other representations is easier than it would be to use vector programming. Draw.io,
when used in addition to Google Drive, is a terrific tool for ongoing, coordinated work that goes

3
beyond what one person can accomplish while working on an outline. Due the high cost of many
outlining programs, such as Microsoft Visio, Draw.io, which is free, is a good option if you just
need this kind of coding (Hendrawan, 2019).

USER REQUIRMENT
The business needs to meet the clients' expectations of the framework are presented in the Client
Necessities Particular. Client Prerequisites Determinations are usually written prior to the
creation of the framework, early in the stage of approval. They are written by the individual in
charge of the framework and the end consumers, with feedback from Quality Confirmation. The
Exhibition Capability or Client Acknowledgment Testing is often where requirements listed in
the URS are tested. Client Prerequisites Details are not intended to be a technical report; readers
who are only interested in a general overview of the framework should be able to understand the
requirements as they are presented in the URS.The URS is essentially an organizing document
that is created when a company is trying to determine specific requirements while waiting to
receive a framework. Right at this moment.

SYSTEM requirement
A software tool termed an integrated development environment (IDE) aids programmers in
creating code more effectively. By merging features like software editing, building, testing, and
packaging into a user-friendly program, it boosts developer product. System requirements are the
specifications that a computer must meet in order to run any kind of program, application, or
game.

The helpdesk system needs the following systems:

Technical details of the device:

2.10 GHz AMD Ryzen 5 5500U processor with Radeon graphics

Device-ID BF756556-8F4D-45C4-84D4-4396ABC7CF92 RAM installed: 8.00 GB

64-bit operating system and CPU based on x64 architecture

Specifications for Windows:

Microsoft Windows 11 Pro Version 22H2

4
3/13/2023, OS build 22621.1555, installed

RELATIONAL DBMS
The Social Data Set Administration Framework is expressed by RDBMS. Information capacity,
recovery, and association within a social gathering process are all addressed by a product
framework. It employs a methodical approach, arranging data into tables with lines and sections,
and it offers SQL (Organized Question Language) for controlling and asking about the data. To
see more about data sets, learn SQL.A well-known tool for information capacity and executives
in various applications and businesses, RDBMS comes with a plethora of benefits. Furthermore,
it comes with certain drawbacks. Making educated decisions when selecting the appropriate data
set solution for certain use cases requires an understanding of both the advantages and
disadvantages of relational database management systems relational database management
system.

Advantages of RDBMS
DATA structure

They give storage of information and administration a structured and uniform method by
arranging data into tables with rows and columns. Easy data access, retrieval, and alteration are
made possible by this structure.

DATA integrity
They bring information trustworthiness into practice by imposing requirements such as
uncommon imperatives, unfamiliar keys, and necessary keys. The limitations prohibit the
presentation of duplicate or inaccurate data while ensuring that the information remains accurate
and consistent

DATA indexing
To improve information recovery, they use ordering techniques. Files expedite the execution of
operations by decreasing the need for full-table outputs, especially for large datasets.

DATA security

5
They include strong safety precautions that safeguard sensitive data. Highlights of access control
let supervisors set client permissions and restrict unwanted access to data.

ACID Transaction

The Corrosive (Atomicity, Consistency, Confinement, Solidness) exchanges they enable

guarantee the dependability of data set jobs and the reliability of information even in the face of
setbacks (Satapathy, 2020).

Structured Query Language

Data contained in relational databases can be extracted, arranged, managed, and altered using a
standard programming language called Structured Query Language (SQL). To put it another
way, SQL is a database language that can operate on databases that have tables with rows and
columns in them.

In order for different platforms, such Python or R, to use the necessary data that is retrieved from
databases for analysis, SQL plays a critical role. Large amounts of data can be written constantly
and SQL can handle several data transactions at once.

Relational databases including MySQL, SQL Server, Oracle PostgreSQL, and many more
support the SQL standard that is an American National Standards Institute (ANSI) standard that
operates across a number of versions and frameworks to handle backend data across many online
applications (Halvorsen, 2019).

Types of Structured Query Language

i. DATA definition language

A type of structured query language called data definition language concentrates on the structure and
layout of databases rather than the data itself. Database structures such as tables, schemas, indexes,
and constraints can be defined, changed, or removed with its commands.DDL doesn't deal for specific
data. On everything database architecture and schema, however, is of primary focus. A DDL statement
cannot change any data when it is conducted; instead, it modifies the database's system catalog, which
is home to the schema of the database.

6
 ii. DATA manipulation language
The method of arranging data to make it easier to interpret is known as data manipulation.
Data of any kind can be organized alphabetically to make comprehension simple. Finding a
specific employee at a company may be difficult if staff information is disorganized. It is possible
to sort all employee data alphabetically, which facilitates simple access to individual employee
data. Web server logs frequently use this to track traffic and popular sites among website
owners. This method is used by accounting users to categorize data in order to ascertain pricing
patterns, production costs, and prospective revenue taxes. It aids in the prediction of future
stock performance by stock market analysts. Additionally, it can be utilized for data formatting,
software programs, and webpages for displaying information more authentically.

iii. Data control language

SQL directions that let a user to access, edit, and work on a database are handled by DCL (Data
Control Language) programs. Accessing stored data is what it's used for. In accordance with
demands, it grants, revokes, and changes access to the database owner. It improves the process of
using a user's authority in SQL to get or edit data while guarding against unauthorized access.
Data language language (DDL) and data manipulation language (DML) are enhanced by it of the
three orders, this one is the easiest to follow. Enforcing data security is essentially its purpose.

iv. Transaction control language

Maintaining information integrity and respectability is essential while working with data sets and
improving programming. Exchange Control Language (TCL) orders can be helpful in the present
situation. TCL is an extension of SQL (Organized Inquiry Language), which was designed
primarily to handle database transactions. In this part, we will examine TCL orders, discuss how
important they are, and then address practical uses for them.

SQL Constraints
The concepts we can apply to the type of data in a table are called limitations. In other words,
through the use of imperatives, we may establish the threshold for the kind of data that can be
kept within certain sections of a database.

There are various SQL constraints. They are given below.

i. NOT NULL

7
This restriction indicates that an invalid value cannot be stored in a section. That is, we are no
longer allowed to save invalid in this specific section in the unlikely event that some of it is
found to be NOT Invalid.

ii. UNIQUE
This condition indicates that each and every quality in the segment must be extraordinary when it
is determined using a section. That examples, no line in a segment should be repeated due to its
attributes.

iii. PRIMARY KEY

A field that is able to recognize every line in a table is a crucial key. Additionally, this constraint
is used to determine a field in a table as a critical key.

iv. FORIGEN KEY

A field that has the extraordinary ability to recognize every line in a different table is called an unfamiliar
key. Moreover, this restriction is used to identify a field as a foreign key.

v. CHECK
This restriction assists in verifying the advantages of an area in order to fulfill a particular need.
That is, it helps to ensure that the value invested in a section satisfies a specific requirement.
vi. DEFULT
This restriction shows that if the client cannot figure out the section's value, an incentive will be
provided by default.

DATA NORMALIZATION

They support information uniformity, which eliminates blatant repetitions and deviations in the
information. Standardized data reduces update anomalies and guarantees productive capacity.

DATA backup and recovery

Typically, they offer full, growing, and differential reinforcements, amongst other options for
reinforcement and recovery. These components ensure data protection and the ability to partially
restore the data collection over time.

8
ER MODEL
The Entity Relational Model is a model that shows the connections between the things that
should be documented in the database and how they are related. The enterprise schema, typically
graphically depicts a database's overall logical structure, is specified by the ER data model. The
relationship between the various entities in the database is shown in the entity relationship
diagram. ER models are used to simulate the relationships between real-world things, such as
people, cars, and companies. The database's structural format is, in essence, shown in the ER
Diagram.

Entity
A specific sort of flowchart named an entity relationship (ER) diagram illustrates the
relationships between "entities"—people, things, or concepts—within a system. Relational
database design and debugging is a prevalent application for ER Diagrams in all areas of
software engineering, business information systems, education, and research. ER Models, also
called Entity Relationship Diagrams, utilize a predetermined set of symbols, comprising
diamonds, ovals, rectangles, and connecting lines, in order to show how entities, relationships,
and their properties are interconnected. They operate in relationships as verbs and entities as
nouns, replicating the grammar architecture.

9
Strong entity

A Strong Entity represents an entity that contains a crucial attribute, or a characteristic that makes it
specifically recognized. The Employee, which includes the vital characteristic "Employee ID," which
enables a record of that Entity Type to be easily and uniquely identified, is an elementary representation
of a Strong Entity. One rectangle is used for representing it on the ER Diagram.

Weak Entity
There exists no Key Component for a Weak Entity in a DBMS. To be precisely identifiable, it needs to rely
upon another Strong Entity. In this case, only in the event that a loan likewise exists as an entity would
an installment exist as an entity. In the ER Diagram, a double rectangle substitutes in over it.

Attribute
An attribute is, in overall, a characteristic. A database component, such a table, is commonly
referred by the term an attribute inside a database management system (DBMS).

10
Types of attribute

Simple attribute
An attribute is considered simple if it cannot be further broken down into smaller components .For
instance, a student's roll number or an employee's identification number. These traits are typically given
by an organization and are used to uniquely identify each member of the organization. Information is
monitored and handled by databases and other systems using simple properties.

Composite attribute
A composite attribute is made up of two or more simple traits combined. A person's address, for
instance, could refer to a composite property consisting of their zip code, city, state, and street address.
When trying to represent data succinctly, composite attributes might be useful when creating deeper
information models

11
Single value attribute
There is just one value given a single-valued attribute. One single-valued attribute is the Social Security
Number of a person. Since Social Security numbers are used to uniquely identify people in the US, they
are single-valued traits. Customer and employee numbers, and also product codes, are a few examples
of single-valued attributes. Databases regularly employ single-valued characteristics, those are generally
used to provide an entity a unique identifier.

Multivalued attribute
A multivalued attribute is one that has many values. A person might have several phone numbers or
email accounts, for instance. Relationship information is frequently stored in database management
systems (DBMS) using attributes with multiple values. An employee thing, for example, might have a
multivalued attribute called "dependents" that includes the names of the dependents of the employee.
An additional method to describe hierarchical data is having multivalued attributes.

Derived attributes
Derived attributes are based on other attributes and are not stored directly in the database. For
example: Consider a database of employees. Each employee has a date of birth, and we might want to
calculate their age. However, age is a derived attribute because it can be determined from the date of

12
birth. As such, it would not make sense to store it directly in the database. Here is an example diagram
of a derived attribute in DBMS:

Complex attribute
In database management systems, multivalued and composite attributes are included in the complex
attribute. It is feasible, for instance, for someone to own many homes, each of which may include
multiple phones. The phone is then regarded as an attribute with complication. A composite typical
consisting of the area code, exchange, and line number is the phone number in the example above. To
be able to depict relationships between entities, complex attributes can be used in architecture. A
diagram is used to describe a difficult attribute example.

13
Key attribute
DBMS's key attributes are used to uniquely identify each row in a table. Usually, there is more
than one key attribute in a table (primary key and foreign key).For example: In a table of
employees, the employee ID would be the primary key, while the manager ID would be the
foreign key (Taylor, 2015).

Stored attribute
Static data for an entity instance in a DBMS, or database management system, is referred to as
stored attributes. The derived attributes are derived with the help of these values. Take a bank's
customer entity as a case study. Name, age, and address of the customer would be preserved as
attributes. The transactions (an additional stored property) linked to the customer could be
employed in calculating the account balance (a derived attribute) for the customer. These are the
many DBMS attribute types and their respective significance. By now, we think you must be
curious to find out more about the world's most sought-after database. If so, you ought to wonder
about enrolling in a MongoDB Administrative Course to gain access to more than 100 courses in
addition to 24 hours of instructor-led instruction.

14
Relationship
A connection is an essential concept in the field of database management systems (DBMSs) and serves
as a basis for comprehending other DBMS and SQL concepts and elements. Real-world relationships can
be defined as those between a parent and kid, as in the case of you and your father, etc. In DBMS
jargon, a relationship refers to the link between two or more data sets; that is, any linkage that exists
between two types of information. The entity, symbolized by a diamond shape, interacts in the
interaction.

Types of relationship:
One to one relationship
One to many relationship
Many to many relationship

One to one relationship

A one to one relationship exists when one row of a table is related to only one row of another
data table and vice versa. This type of relationship between tables is only used rarely. In the
below table you can visualize the one-to-one relationship. Each row in the customer table can
only be linked to only one row of account no: table as each customer can have only one and
unique account linked to them.

one to many relationship

15
When one row in table 1 may be connected to many rows in table 2, and many rows in table 2
can be related to one row in table 1, then there is a one-to-many relationship. That means that
only one record in table 2 can be linked to a single record in table 1. This is the most often
occurring and extensively utilized relationship between data that you will identify. You can see
the one-to-many relationship in the table below. For the straightforward reason that a customer
can create several orders, every row in the customer table can be linked to numerous rows in the
orders table. But an individual order in the orders table can only be associated with one customer
in the customers' table.

Many to many relationship

When many rows in table 1 can be linked to many rows in table 2, and many rows in table 2 can
be related to many rows in table 1, there is a many-to-many relationship. Students and Courses
share many-to-many relationships in the example table below. A single student may enroll in a
number of course, and there could be several people enrolled in a given course. A third table is
usually created and contains the reference (typically the main key) for the two tables in issue as
columns in order to manage many-to-many relationships between them. The Join table is
different designation for this third table. A join table named Enrolled courses was created
between Students and Courses in the example below. Here we are.

16
17
Data validation
Before using, importing, or processing data in any other way, data validation is the act to make
sure the source data is reliable and accurate. A variety of validation techniques can be used,
depending on the goals or restrictions of the destination. Data cleansing includes validation. A
crucial aspect of data transfer and merging is making sure that the data obtained from various

18
repositories and sources complies with business requirements and isn't tainted by incompatible
type or context.

Types of data validation

i. Data type check
Verifying that the data entered is of the correct information type is done by an information type check.
For example, a field could accept numerical data. If so, the framework should reject any data that
contains characters other than those found in letters or unusual visuals.

ii. Code check

A code check verifies that a field has been structured correctly or is chosen from a valid list of values. For
instance, comparing a postal code to a list of valid codes makes it simpler to verify that it is valid.
Applying the same notion to additional elements, including country codes and NAICS industry codes, is
possible.

iii. Range check

If input data is inside a predetermined range, it will be confirmed by a reach check. In geographic
information, for example, scope and longitude are typically used. The acceptable range for a scope value
should be -90 to 90, while the range for a longitude value is -180 to 180. Qualities outdoors this range
are useless

iv. Format check

A predetermined design is followed by several different forms of information. Date sections stored in a
respectable arrangement, such as "YYYY-MM-DD" or "DD-MM-YYYY," are a common use case. An
approval process for information that ensures dates are in the right organization maintains consistency
across time and across information.

v. Consistency check
A consistency check is a type of logical check that confirms the data’s been entered in a logically
consistent way. An example is checking if the delivery date is after the shipping date for a parcel.

vi. Uniqueness check

19
Certain data, such as email addresses or IDs, are naturally distinctive. These fields should ideally have
unique entries in a database. An object is not entered into a database more than once thanks to a
uniqueness check.

Data normalization
A methodical strategy to removing data redundancy (repetition) and unfavorable features like Insertion
deviations, Update deviations, and Delete anomalies in database management systems is called DBMS
normalization. Transferring data into tabular form, avoiding duplicate data, and building a connection
between tables are all carried out over multiple steps.

Types of normalization
i. First normal form (1NF)
A relation violates the first normal form if it contains composite or multi-valued attributes. Therefore, in
order to remove the repetition of values, we convert it into the first normal form. In the first normal
form, the attribute values are single-valued and there are no repeating groups. By using the primary key
and foreign key, the first normal form creates a functional dependency between the two tables.

Example

20
Due to the many values in the Phone No. area, the table for employees is not in its initial normal form.

The Employee table is broken out as follows in order to convert it to 1NF:

ii. Second normal form (2NF)

A relationship cannot have partial dependencies and must first be in the first normal form in order to be
in the second normal form. There less redundant data in the memory when the second normal form is
used. Future updates could demonstrate aberrations for those relations whose were left out of the
second normal form.

21
Example

In the given table, the non-prime attribute AGE depends on TEACHER ID, an acceptable subset of a
potential key. This is why it violates the 2NF rule.

The second normal form is created by splitting the provided table into two tables:

22
 iii. Third normal form (3rd)
Prior to being in the third normal form, the relation must first exist in the first and second normal types.
By shifting the non-primary key attributes and the copy of the attribute they depend on to a new
relation, the third normal form negates the non-primary key attributes' transitive dependency on the
primary key. Data duplication is decreased and data reliability is enhanced by removing transitive
relationships between characteristics. Anomalies pertaining to insertions, updates, and deletions are
missing from the majority of tables in the third normal form (Azad, 2018).

Example

TO decompose the given table into the third normal form

We can do the following

23
 iv. Boyce – codd normal form (BCNF)
The Boyce-Codd Normal Form (BCNF) is the fourth form of normalization and is an updated version of
the third normal form. The relation first must be in the third normal form to be in BCNF. As per BCNF, if
Q is determined by P, then P should be a super key or candidate key for any functional dependency.
When we use the third normal form, we can achieve lossless decomposition, but with BCNF, it is very
difficult. BCNF is a more restrictive form of normalization, so there are no anomalous results in the
database.

EXAMPLE

Imagine an attribute-rich relation R (student, subject, and teacher). The subject "teacher" breaches the
BCNF because it are not candidate keys.

If X->Y breaks the BCNF (R-Y), divide R into R1 (X, Y) and R2. Hence, R is split into R2 (Relation) (student,
Teacher) and R1 (Teacher, subject

24
 v. Fifth normal form
If a relation in a database management system operates in the Fourth Normal Form but lacking join
dependencies, it is in the Fifth Normal Form. Free joining is required. As a means to minimize
redundancy, the Fifth Normal Form is satisfied when every table in the DBMS is divided into as many
smaller tables as feasible. The Project Join Normal Form is another name for the Fifth Normal Form

Example

25
Sorting
An ordered list of instructions is all that a sorting algorithm is. In this instance, the sorting
algorithm accepts an array as input and uses it to perform operations on the array to generate a
sorted array. In their computer science lessons, a lot of people would have studied how to sort
data structures. An early introduction is extended to eager adolescents to assist them understand
more complex computer science concepts, involving as heaps, binary trees, and divide-and-
conquer methodologies.

Types of sorting

Quick Sort
A sorting algorithm called Quick Sort applies the divide and conquer strategy. To perform the
operation, first choose a pivot element from the list or array, and then split the elements around
the pivot into two subgroups. As a result, each sub-set is smaller and it is simpler to identify the
subsequent pivot element. Until every element is sorted, the process is repeated.

Bubble sort
One sorting method employed by data structure algorithms is called bubble sort, which compares
neighboring elements and switches them if and when they are out of order. Until every element
is sorted, this process is repeated.

26
Merge sort
One sorting method employed by data structure algorithms is called bubble sort that compares
neighboring elements and switches them if and when they are out of order. Until every element
is sorted, this process is repeated.

Insertion sort
Placement Sort is one of the various types of sorting used in data structure sorting algorithms. It
functions through placing each element in an array or list in its proper location. This sorting
method takes the second member from the array's beginning, compares it to the first element, and
continues. They are switched if it is less than the first element. Until the array is sorted, the same
procedure is carried out for each additional element (Taniar, 2022).

Selection Sort
Selection Sort is a sorting algorithm that selects the smallest or largest element from an unsorted
array and places it at the beginning of the array. This process continues until all elements in the
array are sorted. Although similar to Bubble Sort, Selection Sort is more efficient for sorting
large datasets.

Heap Sort
An algorithm for sorting data structures that is based on the heap data structure is called
heapsort. In order to function, an unsorted array is utilized to create a max or min heap. The root
element will be eliminated and appended to the end of the sorted list.

Radix sort
A calculation known as Radix Sort groups parts into groups according to their mathematical
worth. It starts with the smallest number and then advances to the highest digit. This cycle is
repeated until every digit is ordered, resulting in a diverse set of arranged elements. Radix Sort is
a useful organizing technique for large datasets.

27
Entity relational diagram

28
ACTIVITY2

Integrated Development Environment

A software tool termed an integrated development environment (IDE) aids programmers in
creating code more effectively. By merging features like software editing, building, testing, and
packaging into a user-friendly program, it boosts developer productivity. Software developers
use IDEs, or integrated development platforms, to simplify their work, much like writers use text
editors and economists use spreadsheets (Guckenheimer, 2021).

29
Login Page
Regarding guest data enrollment, the framework effectively captures guest characteristics from
the Staff table, such as name, division, and profession title. The Calls database collects this data
to link each signed call, enabling efficient follow-up and solving of helpdesk inquiries.

30
31
32
CRUD OPERATATION
Additionally, it can represent user interface displays that allow data to be seen, searched, and
altered using PC-based reports and structures. Elements are essentially consume, created,
renewed, and removed. By taking the information from a help and updating the hindering
properties before sending the information to the assistance for an update, those analogous aspects

33
can be altered. In addition, Muck organizes information and leverages HTTP activity phrases in
an established manner.

Create and Read Operation

34
Update Operation

UPDATE is used to modify existing records in the database. For example, this can be the
change of address in a customer database or price change in a product database. Similar to
READ, UPDATEs can be applied across all records or only a few, based on criteria. An
UPDATE operation can modify and persist changes to a single field or to multiple fields of
the record. If multiple fields are to be updated, the database system ensures they are all
updated or not at all. Some big data systems don’t implement UPDATE but allow only a
timestamped CREATE operation, adding a new version of the row each time.

35
36
Delete operation
The DELETE method enables the user to remove entries from the database. A soft elimination
marks the record but leaves it in place, while a hard delete entirely deletes the record. This is
crucial, for example in payroll, where it's necessary to keep employment data up to date even
after an employee leaves the organization.

37
38
39
Caller Information Registration

40
41
42
43
44
45
Check for User Information
This proposal lays out an extensive strategy for managing the design, development, testing, and
reporting of the new IT Helpdesk knowledge base framework for Hinea Telecom Restricted. It
refers to truly satisfying client and framework needs while ensuring ease, security, and viability.

46
47
48
49
50
51
52
53
Problem Registration
This proposal describes a thorough methodology for planning, creating, testing, and documenting
the new database system for the IT Helpdesk of Hinea Telecom Limited. It attempts to efficiently
satisfy system and user needs while guaranteeing usability, security, and maintainability.

54
55
56
57
58
59
60
61
Check for Equipment Information
The database system for Hinea Telecom Limited's IT Helpdesk can be efficiently developed,
built, examined, and documented by following these procedures, guaranteeing that it satisfies the
company's needs for seamless operation and client satisfaction.

62
63
64
65
66
67
68
Specialist Entity
By following to this comprehensive plan, the course of events and the execution of the data set
framework for Hinea Telecom Restricted IT Helpdesk will ensure competent administration and
resolution of customer inquiries, ultimately leading to enhanced customer loyalty as well as
outstanding service to clients.

69
70
71
72
73
74
75
Conclusion
The user and system requirements mentioned by Hinea Telecom Limited for their IT Helpdesk
are successfully fulfilled by the proposed database system. By means of exhaustive evaluation
and analysis, the system exhibits resilience in managing many circumstances and furnishing
major insights into helpdesk operations. To improve system efficiency and meet changing user
needs, however, constant improvement is advised. All things accounted for, the database solution
presents a strong framework for effective helpdesk management and customer support delivery
within the framework of the company objectives for growth.

Bibliography
Azad, S. K., 2018. Database normalization design pattern. [Online]
Available at: https://ieeexplore.ieee.org/abstract/document/8251067
[Accessed 01 04 2024].

Christudas, B., 2019. MySQL. [Online]

Available at: https://link.springer.com/chapter/10.1007/978-1-4842-4501-9_27
[Accessed 20 04 2024].

Codeacademy Team, 2021. What Is an IDE?. [Online]

Available at: https://www.codecademy.com/article/what-is-an-ide
[Accessed 27 03 2024].

Guckenheimer, S., 2021. What Is an IDE?. [Online]

Available at: https://www.codecademy.com/article/what-is-an-ide
[Accessed 09 04 2024].

Halvorsen, H.-P., 2019. Structured Query Language. [Online]

Available at: https://iqratechnology.com/wp-content/uploads/2021/07/Structured-Query-Language.pdf
[Accessed 46 04 2024].

Hendrawan, E., 2019. Asia Information Journal System. [Online]

Available at: http://ejournal.radenintan.ac.id/index.php/AISJ/article/view/18227
[Accessed 20 04 2024].

Satapathy, S. C., 2020. RDBMS to NoSQL: Reviewing Some Next-Generation Non-Relational Database's.
[Online]
Available at:
https://d1wqtxts1xzle7.cloudfront.net/61537369/2011_RDBMS_to_NoSQL_Reviewing_Some_Next-
Generation_Non-20191217-38072-pk5ltv.pdf?1576570202=&response-content-disposition=inline
%3B+filename%3DRDBMS_to_NoSQL_Reviewing_Some_Next_Gener.pdf&Expires=1714220340&S
[Accessed 06 04 2024].

Taniar, D., 2022. Parallel database sorting. [Online]

Available at: https://www.sciencedirect.com/science/article/abs/pii/S0020025502001962
[Accessed 07 04 2024].

76
Taylor, E., 2015. Types of Attributes in DBMS: An Ultimate Guide. [Online]
Available at: https://www.theknowledgeacademy.com/blog/types-of-attributes-in-dbms/
[Accessed 25 03 2024].

77