Dergiler / The Eurasia Proceedings of Educational and Social Sciences / 2014 / Volume: 1

EVALUATION OF ALGORITHM IMPLEMENTATION ASSESSMENT METHODS BASED ON A DATA STRUCTURE COURSE

Sayfa
—
Yayın Tarihi
2014-09-01
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

The correlation between students’ programming capabilities and their theoretical knowledge were analyzed in order to state whether or not their performance in theoretical exams are authentic when compared to their practical exams. 

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:Implementing algorithms and making abstractions are two integral parts of computer programming.
📊
Temel Bulgular & Veri:The aim of the study was to understand whether or not there was a significant relationship between the theoretical and practical exam results.
💡
Sonuç & Katkı:The correlation between students’ programming capabilities and their theoretical knowledge were analyzed in order to state whether or not their performance in theoretical exams are authentic when compared to their practical exams. 
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Algorithm implementation · programming assessment · assessment methodologies

Abstract

Implementing algorithms and making abstractions are two integral parts of computer programming. Algorithm implementation process involves understanding a business problem, designing the most appropriate solution and abstracting this in a programming environment. Thinking within the syntax of a programming language and generating algorithms simultaneously are often found challenging by students. More importantly, majority of students do not necessarily understand the underlying reasons behind the multiple assessment methods used in the evaluation of algorithm implementation. Some students believe that the theoretical measurements for algorithm implementation are not directly related to the practical development of solutions and hence, they do not see the point of theoretical exams particularly in algorithm implementation process. In this paper, we analyze the methodologies used for the evaluation of algorithm implementation. The Data Structures and Data Organization course thought at the Faculty of Engineering in Cyprus International University (CIU) has been selected as a pilot course to perform a rigorous study in order to compare the theoretical and the practical exam results of students. The aim of the study was to understand whether or not there was a significant relationship between the theoretical and practical exam results. The raw data of the study came from 100 students who were randomly selected without considering their previous background or programming knowledge. The correlation between students’ programming capabilities and their theoretical knowledge were analyzed in order to state whether or not their performance in theoretical exams are authentic when compared to their practical exams. 

🔖

Bu Makaleye Atıf Yap

Yurtkan, K., Kazimoglu, C., Tekguc, U. (2014). EVALUATION OF ALGORITHM IMPLEMENTATION ASSESSMENT METHODS BASED ON A DATA STRUCTURE COURSE. The Eurasia Proceedings of Educational and Social Sciences, Volume: 1. https://ajindex.com/articles/1550545

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (4)

  1. Ala-Mutka, K. M. (2005). A survey of automated assessment approaches for programming assignments. Computer Science Education, 15(2), 83-102.
  2. Barros, J. P., Estevens, L., Dias, R., Pais, R., & Soeiro, E. (2003, June). Using lab exams to ensure programming practice in an introductory prog. course. In ACM SIGCSE Bulletin (Vol. 35, No. 3, pp. 16-20).
  3. ACM. Chamillard, A. T., & Braun, K. A. (2000). Evaluating programming ability in an introductory computer science course. ACM SIGCSE Bulletin, 32(1), 212-216.
  4. Daly, C., & Waldron, J. (2004, March). Assessing the assessment of programming ability. In ACM SIGCSE Bulletin (Vol. 36, No. 1, pp. 210-213). ACM.