{"id":28733,"date":"2026-04-22T10:08:35","date_gmt":"2026-04-22T10:08:35","guid":{"rendered":"https:\/\/hes.mephi.ru\/?page_id=28733"},"modified":"2026-04-22T10:08:35","modified_gmt":"2026-04-22T10:08:35","slug":"algorithms-and-data-structures-1","status":"publish","type":"page","link":"https:\/\/hes.mephi.ru\/?page_id=28733","title":{"rendered":"Algorithms and Data Structures -1"},"content":{"rendered":"<div id=\"pl-28733\"  class=\"panel-layout\" ><div id=\"pg-28733-0\"  class=\"panel-grid panel-has-style\" ><div class=\"siteorigin-panels-stretch panel-row-style panel-row-style-for-28733-0\" data-stretch-type=\"full\" ><div id=\"pgc-28733-0-0\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-0-0-0\" class=\"so-panel widget widget_sow-editor panel-first-child panel-last-child\" data-index=\"0\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<p><img decoding=\"async\" loading=\"lazy\" class=\"aligncenter wp-image-28479\" src=\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/04\/Logo_Vish_eng-1.png\" alt=\"\" width=\"250\" height=\"125\" \/><\/p>\n<\/div>\n<\/div><\/div><\/div><\/div><\/div><div id=\"pg-28733-1\"  class=\"panel-grid panel-has-style\" ><div class=\"siteorigin-panels-stretch panel-row-style panel-row-style-for-28733-1\" data-stretch-type=\"full-stretched\" ><div id=\"pgc-28733-1-0\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-1-0-0\" class=\"so-panel widget widget_sow-headline panel-first-child panel-last-child\" data-index=\"1\" ><div class=\"panel-widget-style panel-widget-style-for-28733-1-0-0\" ><div class=\"so-widget-sow-headline so-widget-sow-headline-default-cae038182b94-28733\"><div class=\"sow-headline-container \">\n\t<h3 class='sow-headline'>\t\t\t\t\t\t<a href=\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/04\/01.01-Algorithms-and-Data-Structures.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">\n\t\t\t\t\tDOWNLOAD THE FULL COURSE SYLLABUS<\/a><\/h3><\/div><\/div><\/div><\/div><\/div><div id=\"pgc-28733-1-1\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-1-1-0\" class=\"so-panel widget widget_sow-headline panel-first-child panel-last-child\" data-index=\"2\" ><div class=\"so-widget-sow-headline so-widget-sow-headline-default-cae038182b94-28733\"><div class=\"sow-headline-container \">\n\t<h3 class='sow-headline'>\t\t\t\t\t\t<a href=\"https:\/\/hes.mephi.ru\/?page_id=28339\" >\n\t\t\t\t\tBACK TO THE CURRICULUM<\/a><\/h3><\/div><\/div><\/div><\/div><div id=\"pgc-28733-1-2\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-1-2-0\" class=\"so-panel widget widget_sow-headline panel-first-child panel-last-child\" data-index=\"3\" ><div class=\"so-widget-sow-headline so-widget-sow-headline-default-cae038182b94-28733\"><div class=\"sow-headline-container \">\n\t<h3 class='sow-headline'>\t\t\t\t\t\t<a href=\"https:\/\/hes.mephi.ru\/?page_id=28855\" target=\"_blank\" rel=\"noopener noreferrer\">\n\t\t\t\t\tBACK TO MASTER'S PROGRAM<\/a><\/h3><\/div><\/div><\/div><\/div><div id=\"pgc-28733-1-3\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-1-3-0\" class=\"so-panel widget widget_sow-headline panel-first-child panel-last-child\" data-index=\"4\" ><div class=\"so-widget-sow-headline so-widget-sow-headline-default-cae038182b94-28733\"><div class=\"sow-headline-container \">\n\t<h3 class='sow-headline'>\t\t\t\t\t\t<a href=\"https:\/\/hes.mephi.ru\/?page_id=28947\" target=\"_blank\" rel=\"noopener noreferrer\">\n\t\t\t\t\tABOUT HES MEPHI<\/a><\/h3><\/div><\/div><\/div><\/div><\/div><\/div><div id=\"pg-28733-2\"  class=\"panel-grid panel-has-style\" ><div class=\"siteorigin-panels-stretch panel-row-style panel-row-style-for-28733-2\" data-stretch-type=\"full\" ><div id=\"pgc-28733-2-0\"  class=\"panel-grid-cell panel-grid-cell-empty\" ><\/div><div id=\"pgc-28733-2-1\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-2-1-0\" class=\"so-panel widget widget_sow-headline panel-first-child\" data-index=\"5\" ><div class=\"so-widget-sow-headline so-widget-sow-headline-default-664267c7ac08-28733\"><div class=\"sow-headline-container \">\n\t<h2 class='sow-headline'>Algorithms and Data Structures<\/h2><\/div><\/div><\/div><div id=\"panel-28733-2-1-1\" class=\"so-panel widget widget_sow-editor panel-last-child\" data-index=\"6\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">The course creates a shared algorithmic framework, frames data structures as architectural building blocks, and fosters a culture of formal reasoning and proof. It builds the groundwork for advanced studies in software engineering and AI, guiding students from intuitive coding to structured engineering thinking.<\/span><\/span><\/h3>\n<\/div>\n<\/div><\/div><\/div><\/div><\/div><div id=\"pg-28733-3\"  class=\"panel-grid panel-has-style\" ><div class=\"siteorigin-panels-stretch panel-row-style panel-row-style-for-28733-3\" data-stretch-type=\"full\" ><div id=\"pgc-28733-3-0\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-3-0-0\" class=\"so-panel widget widget_sow-editor panel-first-child panel-last-child\" data-index=\"7\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t&nbsp;\n<p style=\"text-align: justify; font-family: 'Open Sans';\">This course delivers fundamental knowledge of data structures and algorithms as the architectural building blocks of software. It emphasises task formalisation, complexity analysis, and smart decision\u2011making for scalable system design.<\/p>\n\n<p style=\"text-align: justify; font-family: 'Open Sans';\">Combining theory with hands\u2011on practice, the course leverages the LLM (Large Language Model) to assess formalisation skills, generate practice tasks and counterexamples, check description completeness and analyse complexity, simulate how algorithms run and how structures degrade with growing data. <\/p>\n\n<p style=\"text-align: justify; font-family: 'Open Sans';\">Through practical assignments, students learn to formalise tasks of various natures and refine them based on feedback from the LLM, implement algorithms using different data structures, build operation and complexity tables, and justify the choice of structure and strategy for a specific task.<\/p>\n\n<p style=\"text-align: justify; font-family: 'Open Sans';\">As a result of mastering the discipline, the student must know the concept of an algorithm and its formal properties, abstract data types (ADTs) and their invariants, basic data structures and their asymptotic complexity, fundamental algorithmic strategies, principles of complexity analysis, the role of invariants in proving correctness, and the nature of algorithmic trade\u2011offs (e.g., time vs. memory). <\/p>\n\n<p style=\"text-align: justify; font-family: 'Open Sans';\">The student must also be able to formalise a problem as an algorithmic model, select an appropriate data structure for a given task, justify the choice of an algorithmic strategy, evaluate time and space complexity, prove the correctness of an algorithm, critically analyse alternative solutions (including those proposed by LLMs \u2014 Large Language Models), and apply formal reasoning to engineering decisions. <\/p>\n\n<p style=\"text-align: justify; font-family: 'Open Sans';\">Finally, the student must be proficient in methods of algorithmic analysis, skills for well\u2011reasoned engineering argumentation, the professional culture of working with intelligent assistants (LLMs), and the ability to transition from formalisation to architectural thinking.<\/p>\n<\/div>\n<\/div><\/div><\/div><\/div><\/div><div id=\"pg-28733-4\"  class=\"panel-grid panel-has-style\" ><div class=\"siteorigin-panels-stretch panel-row-style panel-row-style-for-28733-4\" data-stretch-type=\"full\" ><div id=\"pgc-28733-4-0\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-4-0-0\" class=\"so-panel widget widget_sow-headline panel-first-child\" data-index=\"8\" ><div class=\"so-widget-sow-headline so-widget-sow-headline-default-4e1b8d3af015-28733\"><div class=\"sow-headline-container \">\n\t<h3 class='sow-headline'>OBJECTIVES<\/h3><\/div><\/div><\/div><div id=\"panel-28733-4-0-1\" class=\"so-panel widget widget_sow-editor panel-last-child\" data-index=\"9\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Formation of algorithmic autonomy of thinking;<\/span><\/span><\/h3>\n<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Mastering data structures as architectural primitives of digital systems;<\/span><\/span><\/h3>\n<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Develop skills in formalizing tasks and proving correctness;<\/span><\/span><\/h3>\n<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Creating a culture of analyzing the complexity and scalability of solutions;<\/span><\/span><\/h3>\n<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Mastering the model of conscious interaction with LLM in an engineering context.<\/span><\/span><\/h3>\n<\/div>\n<\/div><\/div><\/div><div id=\"pgc-28733-4-1\"  class=\"panel-grid-cell panel-grid-cell-empty\" ><\/div><div id=\"pgc-28733-4-2\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-4-2-0\" class=\"so-panel widget widget_sow-headline panel-first-child\" data-index=\"10\" ><div class=\"so-widget-sow-headline so-widget-sow-headline-default-4e1b8d3af015-28733\"><div class=\"sow-headline-container \">\n\t<h3 class='sow-headline'>KEY TASKS<\/h3><\/div><\/div><\/div><div id=\"panel-28733-4-2-1\" class=\"so-panel widget widget_sow-editor panel-last-child\" data-index=\"11\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Formalization of engineering tasks without reference to a specific programming language;<\/span><\/span><\/h3>\n<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Mastering abstract data types and their implementations;<\/span><\/span><\/h3>\n<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Analysis of the relationship between the data structure and the algorithmic strategy;<\/span><\/span><\/h3>\n<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Developing skills to prove the correctness of algorithms;<\/span><\/span><\/h3>\n<h3 style=\"text-align: justify;\"><span style=\"text-align: justify;\"><span style=\"color: #ffffff; font-family: 'Open Sans';\">Develop the ability to critically evaluate solutions, including LLM solutions.<\/span><\/span><\/h3>\n<\/div>\n<\/div><\/div><\/div><\/div><\/div><div id=\"pg-28733-5\"  class=\"panel-grid panel-has-style\" ><div class=\"panel-row-style panel-row-style-for-28733-5\" ><div id=\"pgc-28733-5-0\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-5-0-0\" class=\"so-panel widget widget_sow-editor panel-first-child panel-last-child\" data-index=\"12\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<h3 style=\"text-align: justify; font-family: 'Open Sans';\"><span style=\"color: #000000;\"><strong>Main topics of the course:<\/strong><\/span><\/h3>\n<p style=\"text-align: justify; font-family: 'Open Sans';\">1. Formalisation and State Model: task formulation independent of programming language, concepts of state and constraints, algorithm as a sequence of state transitions.<\/p>\n<p style=\"text-align: justify; font-family: 'Open Sans';\">2. Abstract Data Types (ADT): invariants, distinction between abstraction and implementation, operations as a contract.<\/p>\n<p style=\"text-align: justify; font-family: 'Open Sans';\">3. Basic Data Structures: arrays and linked lists (operation cost), stacks and queues (LIFO\/FIFO), sets and hash tables (collisions, memory\/time trade\u2011off).<\/p>\n<p style=\"text-align: justify; font-family: 'Open Sans';\">4. Trees and Heaps: binary search trees (BST), invariants and their preservation, priority queues.<\/p>\n<p style=\"text-align: justify; font-family: 'Open Sans';\">5. Graphs: representation methods (adjacency lists, adjacency matrices), traversals (BFS, DFS), relationship between traversal strategy and data structure.<\/p>\n<p style=\"text-align: justify; font-family: 'Open Sans';\">6. Algorithms through the Prism of Structures: search (linear and binary), sorting (O(n 2 ) vs O(nlogn)), reduction of iterations via hashing and preprocessing.<\/p>\n<p style=\"text-align: justify; font-family: 'Open Sans';\">7. Complexity Analysis and Engineering Reasoning: asymptotics, scalability, time\/memory trade\u2011off, architectural decisions.<\/p>\n<p style=\"text-align: justify; font-family: 'Open Sans';\">8. Proof of Correctness: loop invariants, counterexamples, methods of formal justification.<\/p><\/div>\n<\/div><\/div><\/div><\/div><\/div><div id=\"pg-28733-6\"  class=\"panel-grid panel-no-style\" ><div id=\"pgc-28733-6-0\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-6-0-0\" class=\"so-panel widget widget_sow-editor panel-first-child panel-last-child\" data-index=\"13\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<p><a style=\"padding: 12px 24px; background: #1e8a8a; color: white; border: none; border-radius: 8px; font-family: Arial, sans-serif; font-size: 16px; font-weight: bold; cursor: pointer; box-shadow: 0 4px 8px rgba(30, 138, 138, 0.3); transition: all 0.3s ease; width: 100%; margin: 0; display: block; text-align: left; padding-left: 16px; text-decoration: none;\" href=\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/04\/01.01-Algorithms-and-Data-Structures.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">Download the extended description &gt;&gt;<\/a><\/p>\n<\/div>\n<\/div><\/div><\/div><\/div><div id=\"pg-28733-7\"  class=\"panel-grid panel-no-style\" ><div id=\"pgc-28733-7-0\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-7-0-0\" class=\"so-panel widget widget_sow-editor panel-first-child panel-last-child\" data-index=\"14\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<p style=\"text-align: center;\"><a href=\"https:\/\/hes.mephi.ru\/?page_id=28339\">Return to the study plan overview<\/a><\/p>\n<\/div>\n<\/div><\/div><\/div><\/div><div id=\"pg-28733-8\"  class=\"panel-grid panel-has-style\" ><div class=\"siteorigin-panels-stretch panel-row-style panel-row-style-for-28733-8\" data-stretch-type=\"full\" ><div id=\"pgc-28733-8-0\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-8-0-0\" class=\"so-panel widget widget_sow-editor panel-first-child panel-last-child\" data-index=\"15\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<p>&nbsp;<\/p>\n<h3 style=\"text-align: center;\"><span style=\"color: #ffffff;\">HES MEPhI<\/span><\/h3>\n<p style=\"text-align: center;\"><span style=\"color: #ffffff;\">+7 (495) 788-56-99 \u0434\u043e\u0431. 7691, 9570<\/span><br \/>\n<span style=\"color: #ffffff;\">+7 (929) 684-71-59<\/span><br \/>\n<strong><span style=\"color: #ff6600;\"><a style=\"color: #ff6600;\" href=\"mailto:hes@mephi.ru\" target=\"_blank\" rel=\"noopener\">hes@mephi.ru<\/a><\/span><\/strong><\/p>\n<p><a style=\"padding: 12px 24px; background: #CC4E5C; color: white; border: none; border-radius: 8px; font-family: Arial,sans-serif; font-size: 16px; font-weight: bold; cursor: pointer; box-shadow: 0 4px 6px rgba(204,78,92,0.4); transition: all 0.3s ease; width: 100%; margin: 0; display: block; text-align: center; text-decoration: none; position: relative; top: 0;\" href=\"https:\/\/forms.gle\/pyuPR9hYQ36Qo58GA\" target=\"_blank\" rel=\"noopener noreferrer\">Ask a question!<\/a><\/p>\n<\/div>\n<\/div><\/div><\/div><div id=\"pgc-28733-8-1\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-8-1-0\" class=\"so-panel widget widget_sow-editor panel-first-child panel-last-child\" data-index=\"16\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<p>&nbsp;<\/p>\n<h3 style=\"text-align: center;\"><i class=\"fa-vk\"><\/i><a href=\"https:\/\/vk.com\/hesmephi\" target=\"_blank\" rel=\"noopener\">\u00a0<span style=\"color: #ff6600;\"> VK \/ Vkontakte<\/span><\/a><\/h3>\n<h3 style=\"text-align: center;\"><img decoding=\"async\" loading=\"lazy\" class=\"standard\" src=\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2022\/02\/zen-new-icon.png\" alt=\"\u0412\u0418\u0428 \u041c\u0418\u0424\u0418\" width=\"20\" height=\"20\" \/><a href=\"https:\/\/zen.yandex.ru\/id\/5e2972c4a1bb8700b092dbdd\" target=\"_blank\" rel=\"noopener\">\u00a0 <span style=\"color: #ff6600;\">Yandex.Dzen<\/span><\/a><\/h3>\n<h3 style=\"text-align: center;\"><img decoding=\"async\" loading=\"lazy\" class=\"standard\" src=\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/03\/logo-max-hes-round-corners-black.png\" alt=\"\u0412\u0418\u0428 \u041c\u0418\u0424\u0418\" width=\"20\" height=\"20\" \/><span style=\"color: #ff6600;\"><a style=\"color: #ff6600;\" href=\"https:\/\/max.ru\/id7724068140_gos27\" target=\"_blank\" rel=\"noopener\"> MAX<\/a><\/span><\/h3>\n<h3 style=\"text-align: center;\"><img decoding=\"async\" loading=\"lazy\" class=\"standard\" src=\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2022\/04\/TG-black.jpg\" alt=\"\u0412\u0418\u0428 \u041c\u0418\u0424\u0418\" width=\"20\" height=\"20\" \/><a href=\"https:\/\/t.me\/hesmephi\" target=\"_blank\" rel=\"noopener\">\u00a0 <span style=\"color: #ff6600;\">Telegram<\/span><\/a><\/h3>\n<h3 style=\"text-align: center;\"><i class=\"fa-youtube\"><\/i><a href=\"https:\/\/www.youtube.com\/channel\/UChlJQWBMqKcweInG6YJiwIA\" target=\"_blank\" rel=\"noopener\">\u00a0 <span style=\"color: #ff6600;\">Youtube<\/span><\/a><\/h3>\n<h3 style=\"text-align: center;\"><img decoding=\"async\" loading=\"lazy\" class=\"standard\" src=\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2022\/03\/rutubelogo.jpg\" alt=\"\u0412\u0418\u0428 \u041c\u0418\u0424\u0418\" width=\"20\" height=\"20\" \/><a href=\"https:\/\/rutube.ru\/channel\/23944362\/\" target=\"_blank\" rel=\"noopener\">\u00a0 <span style=\"color: #ff6600;\">Rutube<\/span><\/a><\/h3>\n<p>&nbsp;<\/p>\n<\/div>\n<\/div><\/div><\/div><div id=\"pgc-28733-8-2\"  class=\"panel-grid-cell\" ><div id=\"panel-28733-8-2-0\" class=\"so-panel widget widget_sow-editor panel-first-child panel-last-child\" data-index=\"17\" ><div class=\"so-widget-sow-editor so-widget-sow-editor-base\">\n<div class=\"siteorigin-widget-tinymce textwidget\">\n\t<p>&nbsp;<\/p>\n<h3 style=\"text-align: center;\">NRNU MEPhI\u00a0Admissions Committee:<\/h3>\n<p style=\"text-align: center;\"><strong><span style=\"color: #ff6600;\"><a style=\"color: #ff6600;\" href=\"https:\/\/admission.mephi.ru\/\" target=\"_blank\" rel=\"noopener\">admission.mephi.ru<\/a><\/span><\/strong><\/p>\n<p style=\"text-align: center;\"><span style=\"color: #ffffff;\">115409, Moscow, Kashirskoe shosse, 31<\/span><\/p>\n<\/div>\n<\/div><\/div><\/div><\/div><\/div><\/div>","protected":false},"excerpt":{"rendered":"<p>DOWNLOAD THE FULL COURSE SYLLABUS BACK TO THE CURRICULUM BACK TO MASTER&#8217;S PROGRAM ABOUT HES MEPHI Algorithms and Data Structures The course creates a shared algorithmic framework, frames data structures as architectural building blocks, and fosters a culture of formal reasoning and proof. It builds the groundwork for advanced studies in software engineering and AI, guiding students from intuitive coding [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"template-blank3.php","meta":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v18.2 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Algorithms and Data Structures -1 - \u0412\u0418\u0428 \u041c\u0418\u0424\u0418<\/title>\n<meta name=\"description\" content=\"The course creates a shared algorithmic framework, frames data structures as architectural building blocks, and fosters a culture of formal reasoning and proof. It builds the groundwork for advanced studies in software engineering and AI, guiding students from intuitive coding to structured engineering thinking.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/hes.mephi.ru\/?page_id=28733\" \/>\n<meta property=\"og:locale\" content=\"ru_RU\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Algorithms and Data Structures -1 - \u0412\u0418\u0428 \u041c\u0418\u0424\u0418\" \/>\n<meta property=\"og:description\" content=\"The course creates a shared algorithmic framework, frames data structures as architectural building blocks, and fosters a culture of formal reasoning and proof. It builds the groundwork for advanced studies in software engineering and AI, guiding students from intuitive coding to structured engineering thinking.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/hes.mephi.ru\/?page_id=28733\" \/>\n<meta property=\"og:site_name\" content=\"\u0412\u0418\u0428 \u041c\u0418\u0424\u0418\" \/>\n<meta property=\"og:image\" content=\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/04\/Logo_Vish_eng-1.png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u041f\u0440\u0438\u043c\u0435\u0440\u043d\u043e\u0435 \u0432\u0440\u0435\u043c\u044f \u0434\u043b\u044f \u0447\u0442\u0435\u043d\u0438\u044f\" \/>\n\t<meta name=\"twitter:data1\" content=\"5 \u043c\u0438\u043d\u0443\u0442\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebSite\",\"@id\":\"https:\/\/hes.mephi.ru\/#website\",\"url\":\"https:\/\/hes.mephi.ru\/\",\"name\":\"\u0412\u0418\u0428 \u041c\u0418\u0424\u0418\",\"description\":\"\u0412\u044b\u0441\u0448\u0430\u044f \u0438\u043d\u0436\u0438\u043d\u0438\u0440\u0438\u043d\u0433\u043e\u0432\u0430\u044f \u0448\u043a\u043e\u043b\u0430 \u041d\u0418\u042f\u0423 \u041c\u0418\u0424\u0418\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/hes.mephi.ru\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"ru-RU\"},{\"@type\":\"ImageObject\",\"@id\":\"https:\/\/hes.mephi.ru\/?page_id=28733#primaryimage\",\"inLanguage\":\"ru-RU\",\"url\":\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/04\/Logo_Vish_eng-1.png\",\"contentUrl\":\"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/04\/Logo_Vish_eng-1.png\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/hes.mephi.ru\/?page_id=28733#webpage\",\"url\":\"https:\/\/hes.mephi.ru\/?page_id=28733\",\"name\":\"Algorithms and Data Structures -1 - \u0412\u0418\u0428 \u041c\u0418\u0424\u0418\",\"isPartOf\":{\"@id\":\"https:\/\/hes.mephi.ru\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/hes.mephi.ru\/?page_id=28733#primaryimage\"},\"datePublished\":\"2026-04-22T10:08:35+00:00\",\"dateModified\":\"2026-04-22T10:08:35+00:00\",\"description\":\"The course creates a shared algorithmic framework, frames data structures as architectural building blocks, and fosters a culture of formal reasoning and proof. It builds the groundwork for advanced studies in software engineering and AI, guiding students from intuitive coding to structured engineering thinking.\",\"breadcrumb\":{\"@id\":\"https:\/\/hes.mephi.ru\/?page_id=28733#breadcrumb\"},\"inLanguage\":\"ru-RU\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/hes.mephi.ru\/?page_id=28733\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/hes.mephi.ru\/?page_id=28733#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u0413\u043b\u0430\u0432\u043d\u0430\u044f \u0441\u0442\u0440\u0430\u043d\u0438\u0446\u0430\",\"item\":\"https:\/\/hes.mephi.ru\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Algorithms and Data Structures -1\"}]}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Algorithms and Data Structures -1 - \u0412\u0418\u0428 \u041c\u0418\u0424\u0418","description":"The course creates a shared algorithmic framework, frames data structures as architectural building blocks, and fosters a culture of formal reasoning and proof. It builds the groundwork for advanced studies in software engineering and AI, guiding students from intuitive coding to structured engineering thinking.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/hes.mephi.ru\/?page_id=28733","og_locale":"ru_RU","og_type":"article","og_title":"Algorithms and Data Structures -1 - \u0412\u0418\u0428 \u041c\u0418\u0424\u0418","og_description":"The course creates a shared algorithmic framework, frames data structures as architectural building blocks, and fosters a culture of formal reasoning and proof. It builds the groundwork for advanced studies in software engineering and AI, guiding students from intuitive coding to structured engineering thinking.","og_url":"https:\/\/hes.mephi.ru\/?page_id=28733","og_site_name":"\u0412\u0418\u0428 \u041c\u0418\u0424\u0418","og_image":[{"url":"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/04\/Logo_Vish_eng-1.png"}],"twitter_card":"summary_large_image","twitter_misc":{"\u041f\u0440\u0438\u043c\u0435\u0440\u043d\u043e\u0435 \u0432\u0440\u0435\u043c\u044f \u0434\u043b\u044f \u0447\u0442\u0435\u043d\u0438\u044f":"5 \u043c\u0438\u043d\u0443\u0442"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebSite","@id":"https:\/\/hes.mephi.ru\/#website","url":"https:\/\/hes.mephi.ru\/","name":"\u0412\u0418\u0428 \u041c\u0418\u0424\u0418","description":"\u0412\u044b\u0441\u0448\u0430\u044f \u0438\u043d\u0436\u0438\u043d\u0438\u0440\u0438\u043d\u0433\u043e\u0432\u0430\u044f \u0448\u043a\u043e\u043b\u0430 \u041d\u0418\u042f\u0423 \u041c\u0418\u0424\u0418","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/hes.mephi.ru\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"ru-RU"},{"@type":"ImageObject","@id":"https:\/\/hes.mephi.ru\/?page_id=28733#primaryimage","inLanguage":"ru-RU","url":"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/04\/Logo_Vish_eng-1.png","contentUrl":"http:\/\/hes.mephi.ru\/wp-content\/uploads\/2026\/04\/Logo_Vish_eng-1.png"},{"@type":"WebPage","@id":"https:\/\/hes.mephi.ru\/?page_id=28733#webpage","url":"https:\/\/hes.mephi.ru\/?page_id=28733","name":"Algorithms and Data Structures -1 - \u0412\u0418\u0428 \u041c\u0418\u0424\u0418","isPartOf":{"@id":"https:\/\/hes.mephi.ru\/#website"},"primaryImageOfPage":{"@id":"https:\/\/hes.mephi.ru\/?page_id=28733#primaryimage"},"datePublished":"2026-04-22T10:08:35+00:00","dateModified":"2026-04-22T10:08:35+00:00","description":"The course creates a shared algorithmic framework, frames data structures as architectural building blocks, and fosters a culture of formal reasoning and proof. It builds the groundwork for advanced studies in software engineering and AI, guiding students from intuitive coding to structured engineering thinking.","breadcrumb":{"@id":"https:\/\/hes.mephi.ru\/?page_id=28733#breadcrumb"},"inLanguage":"ru-RU","potentialAction":[{"@type":"ReadAction","target":["https:\/\/hes.mephi.ru\/?page_id=28733"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/hes.mephi.ru\/?page_id=28733#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u0413\u043b\u0430\u0432\u043d\u0430\u044f \u0441\u0442\u0440\u0430\u043d\u0438\u0446\u0430","item":"https:\/\/hes.mephi.ru\/"},{"@type":"ListItem","position":2,"name":"Algorithms and Data Structures -1"}]}]}},"_links":{"self":[{"href":"https:\/\/hes.mephi.ru\/index.php?rest_route=\/wp\/v2\/pages\/28733"}],"collection":[{"href":"https:\/\/hes.mephi.ru\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/hes.mephi.ru\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/hes.mephi.ru\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/hes.mephi.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=28733"}],"version-history":[{"count":23,"href":"https:\/\/hes.mephi.ru\/index.php?rest_route=\/wp\/v2\/pages\/28733\/revisions"}],"predecessor-version":[{"id":29108,"href":"https:\/\/hes.mephi.ru\/index.php?rest_route=\/wp\/v2\/pages\/28733\/revisions\/29108"}],"wp:attachment":[{"href":"https:\/\/hes.mephi.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=28733"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}