Book ChapterDOI
Detecting Similarity in Multi-procedure Student Programs Using only Static Code Structure
Karen Bradshaw,Vongai Chindeka +1 more
- pp 211-226
TLDR
Plagiarism is prevalent in most undergraduate programming courses, including those where more advanced programming is taught, and typical strategies used to avoid detection include changing variable names and adding empty spaces or comments to the code.Abstract:
Plagiarism is prevalent in most undergraduate programming courses, including those where more advanced programming is taught. Typical strategies used to avoid detection include changing variable names and adding empty spaces or comments to the code. Although these changes affect the visual components of the source code, the underlying structure of the code remains the same. This similarity in structure can indicate the presence of plagiarism.read more
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Proceedings ArticleDOI
Winnowing: local algorithms for document fingerprinting
TL;DR: The class of local document fingerprinting algorithms is introduced, which seems to capture an essential property of any finger-printing technique guaranteed to detect copies, and a novel lower bound on the performance of any local algorithm is proved.
Proceedings Article
Efficient Graphlet Kernels for Large Graph Comparison
TL;DR: In this article, two theoretically grounded speedup schemes are introduced, one based on sampling and the second specifically designed for bounded degree graphs, to efficiently compare large graphs that cannot be tackled by existing graph kernels.
Proceedings ArticleDOI
YAP3: improved detection of similarities in computer program and other texts
TL;DR: YAP3, the third version of YAP, is reviewed, focusing on its novel underlying algorithm - Running-Karp-Rabin Greedy-String-Tiling (or RKS-GST), whose development arose from the observation with YAP and other systems that students shuffle independent code segments.
Journal ArticleDOI
Obtaining common pruned trees
C. R. Finden,A. D. Gordon +1 more
TL;DR: The tree obtained by regrafting branches on to a largest common pruned tree is shown to contain all the classes present in the strict consensus tree.