Welcome to the upgraded BRAC University Institutional Repository. We are currently organizing collections after a recent system upgrade. Homepage category counters may temporarily show lower numbers while syncing, but over 27,000 repository items remain safe and accessible. Please use the search bar to find theses, scholarly outputs, and institutional documents.

Assistive Guideline of Categorization for Competitive Programming Problems

bracu.degree.levelUndergraduate
bracu.type.groupStudent Works
datacite.rightsOpen Access
dc.contributor.advisorRafi, Tahmid Ul Islam
dc.contributor.advisorMostakim, Moin
dc.contributor.authorDhrubo, Najmus Sakib
dc.contributor.authorIslam, Md Samiul
dc.contributor.departmentDepartment of Computer Science and Engineering
dc.date.accessioned2021-09-14T08:29:13Z
dc.date.available2021-09-14T08:29:13Z
dc.date.copyright2021
dc.date.issued2021-06
dc.descriptionCataloged from PDF version of thesis.
dc.descriptionIncludes bibliographical references (page 30).
dc.descriptionThis thesis is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2021.en_US
dc.description.abstractProgramming is a very useful skill nowadays. Programming contests give people the opportunity to increase their programming skills. By solving programming contest problems contestants can increase not only their programming skills but also their mathematical and algorithmic knowledge. The competitive programming problems are presented in problem statements. Sometimes they are presented in the form of a story or sometimes directly. To solve the problem contestants must read the problem statement carefully. The problems can be of many categories. We have tried to classify number theory and graph theory problems. At first, we collected data from competitive programming problem statements. Then we used different machine learning algorithms such as fully connected neural network, naive bayes classifier, support vector machine on the data to predict if the category of the problem is either number theory or graph theory. With such machine learning approaches we achieved test accuracy of about 72%, 75% and 74%.en_US
dc.description.degreeBachelor of Science in Computer Science
dc.description.statementofresponsibilityNajmus Sakib Dhrubo
dc.description.statementofresponsibilityMd Samiul Islam
dc.format.extent30 pages
dc.identifier.otherID: 16101152ID
dc.identifier.otherID: 17101419
dc.identifier.urihttp://hdl.handle.net/10361/15011
dc.language.isoenen_US
dc.publisherBRAC Universityen_US
dc.rightsBrac University theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission.
dc.subjectCompetitive Programmingen_US
dc.subjectNumber Theoryen_US
dc.subjectGraph Theoryen_US
dc.subjectNeural Networken_US
dc.subjectNaive Bayes Classifieren_US
dc.subjectSupport Vector Machineen_US
dc.subject.lcshCompetitive Programming
dc.titleAssistive Guideline of Categorization for Competitive Programming Problemsen_US
dc.typeThesisen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
16101152, 17101419_CSE.pdf
Size:
1.11 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: