NDLI: Structural Analysis of Source Code Collected from Programming Contests

Content Provider	IEEE Xplore Digital Library
Author	Bokuk Park Haesung Tak Hwan Gue Cho
Copyright Year	2014
Description	Author affiliation: Dept. of Comput. Sci. & Eng., Pusan Nat. Univ., Pusan, South Korea (Bokuk Park; Haesung Tak; Hwan Gue Cho)
Abstract	Programming contests such as the International Olympiad for Informatics (IOI) and the International Collegiate Programming Contest (ICPC) are effective for encouraging young and bright programmers. These contests require contestants to complete a few tasks (between three and nine) related to algorithmic problems within a limited time. For this study, we collected a set of 2,400 programming codes submitted to the KOI (Korea Olympiad for Informatics) in 2011 and 2012 as well as 2,300 programming codes submitted at the preliminary contest session for the ICPC in 2009, 2011, and 2012 at the East-Asia regional contest. Because submitted source codes were evaluated with blind test cases, we can define a criteria to separate the high- and low-scoring students in the order of their respective scores. The main objective of this paper is to reveal the relationship between the task's proposed features, its difficulty, the school grade (elementary, middle-, and high-school), and the score. We do so with the data-mining tool WEKA. The ultimate goal of this study is to predict the score of some particular code with static analysis. We propose a simple and straightforward complexity measure based on the block-tree structure. We considered the high scoring student group as a positive class and the low scoring student group as negative class. The performance of the data mining classifier named Naïve Bayes are evaluated based on 10-fold cross validation test. We decided that the meaningful classification for a harmonic mean of sensitivity and specificity is empirically larger than 0.6 empirically. Among the codes acquired through the KOI, we found a set of outlier codes that attempt to reply with the correct response to receive extra points. Among the codes acquired through the ICPC, we discovered that good collegiate programmers (i.e., Those with high score) attempt to keep their code more compact, both lexically and structurally. We used WEKA to analyze the code using code-features proposed in this study, and the results are detailed quantitatively.
Starting Page	571
Ending Page	576
File Size	369591
Page Count	6
File Format	PDF
ISBN	9781479962396
DOI	10.1109/CIT.2014.171
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-09-11
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Sensitivity Programming Educational institutions Harmonic analysis Complexity theory Data mining
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Source code similarity detection by using data mining methods

Identification of programmers from typing patterns

Source Code Analysis: A Road Map

Mining source code descriptions from developer communications

A data mining based method: Detecting software defects in source code

Automatic Inference of Programming Performance and Experience from Typing Patterns

How Much Do Code Repositories Include Peripheral Modifications?

An Improved CURD Algorithm for Source Code Mining

A tool for detecting dependency violation of layered architecture in source code

Structural Analysis of Source Code Collected from Programming Contests

Similar Documents

Source code similarity detection by using data mining methods

Identification of programmers from typing patterns

Source Code Analysis: A Road Map

Mining source code descriptions from developer communications

A data mining based method: Detecting software defects in source code

Automatic Inference of Programming Performance and Experience from Typing Patterns

How Much Do Code Repositories Include Peripheral Modifications?

An Improved CURD Algorithm for Source Code Mining

A tool for detecting dependency violation of layered architecture in source code

Structural Analysis of Source Code Collected from Programming Contests