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.
Algorithm implementation programming assessment assessment methodologies data structures c programming
Journal Section | Articles |
---|---|
Authors | |
Publication Date | September 1, 2014 |
Published in Issue | Year 2014 Volume: 1 |