Educationally effective teaching of design and analysis of algorithms

Abstract

Algorithms are the foundation of Computer Science and Engineering, which instruct the computer to do the required task efficiently. Design and Analysis of Algorithms (DAA) course is aimed to develop problem solving skills, choose appropriate design strategy and analyze given algorithm for its performance in the student community. In this paper authors propose active learning methodologies like Manifold Problem Assignment, Inspection of Algorithms, Technique Based Learning, Identification and Designing Method and Realization of Algorithm to meet above mentioned objectives. Since the course is taught along with tutorial, different set of problems are given across the batches to develop and analyze an algorithm by choosing appropriate design technique. Tests are conducted on each design strategy, which helped the students to apply them to the design process. At the end of the semester students are given set of problems, where they are expected to choose suitable design strategy like divide and conquer, decrease and conquer and transform and conquer to write and analyze the algorithm. Through this pedagogical activity, the Program Outcomes 3a and 3c of ABET 3a-3k are achieved. 70% of learners strongly agreed that their problem solving ability is enhanced and 30% of learners agreed that there is an improvement in algorithm design ability.