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

Citation

Abstract

Programming 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%.

LC Subject Headings

Description

Cataloged from PDF version of thesis.
Includes bibliographical references (page 30).
This thesis is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2021.

Publisher Link

Type

Thesis