search
  • hy
  • en
algorithms

Theory of Algorithms

Algorithms are the programming building blocks which allow computers, websites or smartphones to function/make decisions. As the concept of an algorithm shapes the basic central concept of mathematical logic, the theory of Algorithms is tightly linked to mathematical logic. The course develops the ability to articulate problem solving processes and to efficiently implement the processes within software. You will master the ability to design algorithms for sorting, searching, optimizing and apply them for finding the answers to practical questions.

Benefits

Practical assignments

Practical assignments

Solving practical problems to implement gained skills

Stronger base for learning any programming language

Stronger base for learning any programming language

With knowledge of algorithms the learning of further programming language would be much easier and fuller

 Competitive advantage over the programmers not mastering the theory of algorithms

Competitive advantage over the programmers not mastering the theory of algorithms

You would see your advantage over others when entering the job market

Instructor

Karen Darbinyan

Karen Darbinyan

C++ software engineer

Is this course for you? Sure if

  • you have basic mathematical knowledge
  • you are hard-working and motivated
  • you have a creative mind
  • Duration: 1 month
  • Price: 35.000 AMD
  • Admission Deadline: 15/08/2021

By the end of this course you will be able to

Think algorithmically

Think algorithmically

Have the general idea on data structures

Have the general idea on data structures

Choose the right dataset for more effective problem solving

Choose the right dataset for more effective problem solving

Syllabus

Theory of Algorithms Description

  • Introduction to block diagrams and theory of algorithms

  • Basic data types

  • Differentiation of problem-solving paths: “the golden” rules

  • Types of memories (stack, heap)

  • The link between algorithms and mathematics, the complexity and effectiveness of algorithms

  • Data storage methods (stack, queue, array, matrix, tree)

  • Sorting algorithms (double, insertion, queek, heap)

  • Introduction to the function types, recursion -Reverse type functions

Information

  • Courses are held 3 times a week with 2 hour duration.
  • For additional questions feel free to contact us!
  • The educational process is full of practical tasks.