Some innovations of teaching the course on Data structures and algorithms

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.

[1]  Jung-Shyr Wu,et al.  Integrating weighted LCS and SVM for 3D handwriting recognition on handheld devices using accelerometers , 2010 .

[2]  Hsin-Hsi Chen,et al.  Exploring the use of unsupervised query modeling techniques for speech recognition and summarization , 2016, Speech Commun..

[3]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[4]  Alexandros Nanopoulos,et al.  Hubs in Space: Popular Nearest Neighbors in High-Dimensional Data , 2010, J. Mach. Learn. Res..

[5]  Eugene Semenkin,et al.  Speech-recognition cloud harvesting for improving the navigation of cyber-physical wheelchairs for disabled persons , 2019, Microprocess. Microsystems.

[7]  Mohammad Taghi Hajiaghayi,et al.  Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence , 2019, SODA.

[8]  Daniel S. Hirschberg,et al.  Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[9]  N. Balakrishnan,et al.  A FAST Pattern Matching Algorithm , 2004, J. Chem. Inf. Model..

[10]  C. Pandu Rangan,et al.  A linear space algorithm for the LCS problem , 2004, Acta Informatica.

[11]  Alfred V. Aho,et al.  Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[12]  Ján Perháč,et al.  Resource oriented BDI architecture for IDS , 2017, 2017 IEEE 14th International Scientific Conference on Informatics.

[13]  Thomas G. Szymanski,et al.  A fast algorithm for computing longest common subsequences , 1977, CACM.

[14]  Paulien Hogeweg,et al.  The Roots of Bioinformatics in Theoretical Biology , 2011, PLoS Comput. Biol..

[15]  D. Nath.  A Survey on Longest Common Subsequence , 2018 .

[16]  Sayyed Rasoul Mousavi,et al.  A hyper-heuristic for the Longest Common Subsequence problem , 2012, Comput. Biol. Chem..

[17]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[18]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[19]  Ján Turán,et al.  Deployment of the PON with an optical fibre G-652.B , 2017, 2017 IEEE 14th International Scientific Conference on Informatics.

[20]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[21]  Guy N. Rothblum,et al.  Fine-grained Complexity Meets IP = PSPACE , 2018, SODA.

[22]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[23]  E. Malichova,et al.  MODELS OF APPLICATION ECONOMIC VALUE ADDED IN AUTOMOTIVE COMPANY , 2017 .

[24]  I. Scott MacKenzie,et al.  Measuring errors in text entry tasks: an application of the Levenshtein string distance statistic , 2001, CHI Extended Abstracts.

[25]  Marvin Künnemann,et al.  Multivariate Fine-Grained Complexity of Longest Common Subsequence , 2018, SODA.

[26]  William Steingartner,et al.  A LOOK AT OBSERVE, ORIENT, DECIDE AND ACT FEEDBACK LOOP, PATTERN-BASED STRATEGY AND NETWORK ENABLED CAPABILITY FOR ORGANIZATIONS ADAPTING TO CHANGE , 2013 .

[27]  M. Tibayrenc.  Genetics and evolution of infectious diseases , 2011 .

[28]  M. W. Du,et al.  New Algorithms for the LCS Problem , 1984, J. Comput. Syst. Sci..

[29]  Edson Cáceres,et al.  A BSP/CGM algorithm for the all-substrings longest common subsequence problem , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[30]  Tetsuya Nakatoh,et al.  Plagiarism detection using document similarity based on distributed representation , 2017 .

[31]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .