DSpace Repository

Verification of Offline Security: A Case Study on SAT

Show simple item record

dc.contributor.advisor Phan Minh, Dung
dc.contributor.author Ramya, Parupudi Swathi
dc.contributor.other Erik L.J., Bohez
dc.contributor.other Anutariya, Chutiporn
dc.date.accessioned 2018-08-17T04:18:52Z
dc.date.available 2018-08-17T04:18:52Z
dc.date.issued 2018-08
dc.identifier.citation APA en_US
dc.identifier.uri http://www.cs.ait.ac.th/xmlui/handle/123456789/913
dc.description Fifty two pages en_US
dc.description.abstract SAT exam has been recognized for more than seven decades. It gives a standardized platform for both college and students. Universities can determine which student will shine on their campus and students can showcase their skills and aptitude so that the universities can approach them. Though SAT tries to give a standard platform, some of the test takers or organizations seeking profit try to sabotage it with trickery. SAT security’s main objective is to ensure authentic students write the exam on their own without gaining any unfair advantage. In this Research study, we study the rules and violation and see if we can model them. After the system is modelled into state transition and relational model, an implementation using LOGIC programming language, PROLOG, is done. We finally conclude it with partial satisfactory of rules for SAT security on Communication module. en_US
dc.description.sponsorship AIT en_US
dc.language.iso en en_US
dc.subject SAT en_US
dc.subject Exam en_US
dc.subject Cheating en_US
dc.subject Communication en_US
dc.subject PROLOG en_US
dc.title Verification of Offline Security: A Case Study on SAT en_US
dc.type Research report en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account