Service description
              Fundamental algorithms: 1) Search algorithms - linear search, binary search - binary search tree 2) Data structures - priority queue - hash table 3) Graph algorithms - graph properties (components, bipartite) - depth-first search - breadth-first search; dynamic programming -- in C.
Type of methodology: Combination of lecture and hands-on
Participants receive the certificate of attendance: Yes
Paid training activity for participants: Yes, for all
Participants prerequisite knowledge: Numerical methods (linear algebra, statistics) Domain-specific background knowledge
Level
          Potential users
              Scientific Domain
          Mathematics
              Category
          Training events
              Service valid until
              Audience
          Research and Academia
              Location category
              
          Language
          Slovak
              Technical Domain
          Performance analysis
          Scientific programming
          Software engineering
              Format
          In person
              Initiative
          Castiel and EuroCC
              Country