Student Performance Evaluation of Distributed Algorithms Assignment in an Undergraduate Algorithms Course

Abstract

Distributed algorithms are now present in many computing activities. The price decline of computer hardware, increase in speed of communication, the versatility of the Internet, and the advancement of network technology all have contributed immensely to the incredible growth and importance of distributed computing. Therefore, even an undergraduate is now expected to know at least the basics of distributed algorithms. This paper describes the experience and performance of students who are introduced to distributed algorithms in an undergraduate Algorithms course. The paper shows that for teaching new concepts, providing in-class examples should be emphasized more for effective student learning. It is more important compared to prior knowledge of similar concepts.