Skip to main content
SpringerLink
Log in

Implementation of Complex Enumeration Computational Problems: An Approach for “Advanced” Junior Students

  • Conference paper
  • First Online:
Modern Information Technology and IT Education (SITITO 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1201))

  • 347 Accesses

Abstract

This paper deals with some issues related to the training of students of junior courses (approximately 14–19 years). At least two objectives are set. Firstly, we focus on potential participants of the programming Olympiads: according to our calculations, at least one third of the tasks of high-level Olympiads can be called exhaustive-searched. Secondly (which, apparently, is more important), mastering the proposed approach to the implementation of hard exhaustive-searched problems can (and should) serve as an “advanced” student as a first step into the “big science”: the tasks themselves, and the approach we propose to implement them, are closely connected with the set of directions of modern artificial intelligence, the analysis of large data, and similar subject areas. Several of the problems we are considering are related to different subjects. Among these problems (subjects areas) are, first, the tasks previously given at different levels of the ACM Olympiads, including at the final stage of this Olympiad. The solutions we offer for these tasks are no more complicated than the original ones, and considering that they can be quickly implemented using the approach we proposed (described in this article), we can say that they are much easier to learn by the trainees. In the article, we describe some classes implemented in C++, intended for the quick generation of programs for solving a variety of enumeration tasks. We give also some specific programming techniques for such tasks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Melnikov, B.: Multiheuristic approach to discrete optimization problems. Cybern. Syst. Anal. 42(3), 335–341 (2006). https://doi.org/10.1007/s10559-006-0070-y

    Article  MathSciNet  MATH  Google Scholar 

  2. Melnikov, B., Melnikova, E., Pivneva, S., Churikova, N., Dudnikov, V., Prus, M.: Multi-heuristic and game approaches in search problems of the graph theory. In: Information Technology and Nanotechnology Proceedings (ITNT-2018), pp. 2884–2894. Samara, Russia (2018). https://elibrary.ru/item.asp?id=34895071&

  3. Cormen, T., Leiserson, Ch., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Boston (2009)

    MATH  Google Scholar 

  4. Lipski, W.: Combinatorics for Programmers. Polish Sci. Publ. (PWN), Warsaw (1982). (in Polish)

    MATH  Google Scholar 

  5. Java Platform, Standard Edition 8, API Specification. https://docs.oracle.com/javase/8/docs/api/overview-summary.html

  6. The 2007 ACM Programming Contest World Finals. https://icpc.baylor.edu/regionals/finder/world-finals-2007

  7. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, NJ (2002)

    MATH  Google Scholar 

  8. Luger, G.: Artificial Intelligence: Structures and Strategies for Complex Problem Solving. Addison-Wesley, Boston (2003)

    Google Scholar 

  9. Hromkovič, J.: Theoretische Informatik: Formale Sprachen, Berechenbarkeit, Komplexittstheorie, Algorithmik, Kommunikation und Kryptographie. Springer Verlag, Berlin (2011). (in German). https://doi.org/10.1007/978-3-8348-9853-1

  10. Melnikov, B., Melnikova, E.: Some competition programming problems as the beginning of artificial intelligence. Inf. Educ. 6(2), 385–396 (2007). https://www.mii.lt/informatics_in_education/htm/INFE110.htm

    Google Scholar 

  11. MFC classes, https://msdn.microsoft.com/ru-ru/library/bk77x1wx.aspx

  12. Polák, L.: Minimizations of NFA using the universal automaton. Int. J. Found. Comput. Sci. 16(5), 999–1010 (2005). https://doi.org/10.1142/S0129054105003431

    Article  MATH  Google Scholar 

  13. Melnikov, B.: The complete finite automaton. Int. J. Open Inf. Technol. 5(10), 9–17 (2017). https://elibrary.ru/item.asp?id=30101608

    Google Scholar 

  14. Makarkin, S., Melnikov, B., Trenina, M.: Approach to Solve a Pseudogeometric Version of the Traveling Salesman Problem. University proceedings. Volga region. Phys. Math. Sci. 2(34), 135–147 (2015). (in Russian). https://elibrary.ru/item.asp?id=24254294

Download references

Acknowledgements

The research was partially supported by Russian State Social University.

Author information

Authors and Affiliations

  1. Russian State Social University, Wilhelm Pieck Str. 4, 129226, Moscow, Russia

    Boris Melnikov, Elena Melnikova & Svetlana Pivneva

Authors
  1. Boris Melnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elena Melnikova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Svetlana Pivneva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Svetlana Pivneva .

Editor information

Editors and Affiliations

  1. Moscow State University, Moscow, Russia

    Vladimir Sukhomlin

  2. Moscow State University, Moscow, Russia

    Elena Zubareva

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Melnikov, B., Melnikova, E., Pivneva, S. (2020). Implementation of Complex Enumeration Computational Problems: An Approach for “Advanced” Junior Students. In: Sukhomlin, V., Zubareva, E. (eds) Modern Information Technology and IT Education. SITITO 2018. Communications in Computer and Information Science, vol 1201. Springer, Cham. https://doi.org/10.1007/978-3-030-46895-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-46895-8_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-46894-1

  • Online ISBN: 978-3-030-46895-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation