Some innovations of teaching the course on Data structures and algorithms
- 1 November 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 000389-000396
Abstract
The teaching of practical foundations of computer science is still a big challenge. The course on Data Structures and Algorithms is one of the most important foundational courses that are necessary to be included in the curriculum of future IT experts. The content of this course is quite wide and it differs in many universities. In our teaching process, we identified some interesting problems that could be presented more attractively – using the visualizing software. In this paper, we present a purpose, rôle, design and methodology of our developed software tool for the convenience of teaching and studying the problem of the longest common subsequence.Keywords
This publication has 25 references indexed in Scilit:
- A hyper-heuristic for the Longest Common Subsequence problemComputational Biology and Chemistry, 2012
- The Roots of Bioinformatics in Theoretical BiologyPLOS Computational Biology, 2011
- A linear space algorithm for the LCS problemActa Informatica, 1987
- New algorithms for the LCS problemJournal of Computer and System Sciences, 1984
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950