Please use this identifier to cite or link to this item:
Title: Service personalization and customer loyalty
Authors: Koh, Daniel Jun Rong
Keywords: DRNTU::Engineering
Issue Date: 2016
Abstract: With the rise of the mobile applications, consumers are heading toward technologies reliance era, where they can use their smartphone to shop for products. Besides shopping, those mobile applications are able to personalize to the consumers’ needs, and provide loyalty programs to reward for their support. Hence, the objective for this project is to design and develop a mobile application with some new concepts that can further enhance those existing shopping mobile applications in the market. New concepts include an educational quiz, which the questions are based on the products in the store, and treasure-hunting like missions. On top of these, some personalization and loyalty features will be present as well. Though these features, the project aims to provide shoppers with new experience while shopping, and provides educational knowledge about the products in the store as well. The project was started off with some planning and design to identify the requirements needed and the estimate time taken for each of the functions. This can be further made into task-oriented plan, which contains the stipulated dateline for each of the tasks. The implementation of the project application was done using Android Studio, which is an Integrated Development Environment (IDE) for developing Android applications. Some of the external libraries used in this project include Volley, Estimote SDK and Zxing (“Zebra Crossing”).
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
CZ4079 FYP Final Report (Final).pdf
  Restricted Access
2.11 MBAdobe PDFView/Open

Page view(s) 50

checked on Oct 23, 2020

Download(s) 50

checked on Oct 23, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.