<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">

  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie</loc>
    <lastmod>2026-06-06T16:49:39.633Z</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie</loc>
    <lastmod>2026-06-06T16:49:39.633Z</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/chto-takoe-programma-dannye-instruktsii-vypolnenie</loc>
    <lastmod>2026-02-12T12:57:04.788480Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/peremennye-i-tipy-dannyh-chisla-stroki-bulevy-znacheniya-1</loc>
    <lastmod>2026-02-12T12:57:12.157987Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/operatory-i-vyrazheniya-prioritet-preobrazovaniya-tipov-1</loc>
    <lastmod>2026-02-12T12:57:31.514049Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/usloviya-ifelse-vlozhennost-ternarnyy-operator</loc>
    <lastmod>2026-02-12T12:57:41.247099Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/tsikly-forwhile-breakcontinue</loc>
    <lastmod>2026-02-12T12:57:53.313410Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/funktsii-parametry-vozvraschaemye-znacheniya-oblast-vidimosti</loc>
    <lastmod>2026-02-12T12:58:02.058918Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/vvodvyvod-konsol-formaty-obrabotka-oshibok-vvoda</loc>
    <lastmod>2026-02-12T12:58:10.555894Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/kollektsii-massivyspiski-indeksatsiya-srezy</loc>
    <lastmod>2026-02-12T12:58:20.499396Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/rabota-so-strokami-metody-formatirovanie</loc>
    <lastmod>2026-02-12T12:58:27.731375Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/fayly-chteniezapis-kodirovki-jsoncsv</loc>
    <lastmod>2026-02-12T12:58:39.869740Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/otladka-logi-trassirovka-tipichnye-oshibki-novichkov</loc>
    <lastmod>2026-02-12T12:58:53.922259Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/vvedenie-v-programmirovanie/stil-koda-imenovanie-formatirovanie-prostaya-arhitektura</loc>
    <lastmod>2026-02-12T12:59:10.832806Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh</loc>
    <lastmod>2026-06-06T16:49:39.636Z</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/vremennaya-i-prostranstvennaya-slozhnost-big-o</loc>
    <lastmod>2026-02-13T10:15:52.557246Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/rekursiya-stek-vyzovov-hvostovaya-rekursiya</loc>
    <lastmod>2026-02-13T10:16:02.112380Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/massivy-i-spiski-operatsii-i-stoimost</loc>
    <lastmod>2026-02-13T10:16:09.923863Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/stek-i-ochered-realizatsii-i-zadachi</loc>
    <lastmod>2026-02-13T10:16:18.040052Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/hesh-tablitsy-kollizii-nagruzochnyy-faktor</loc>
    <lastmod>2026-02-13T10:16:29.097334Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/derevya-binarnye-derevya-obhody-dfsbfs</loc>
    <lastmod>2026-02-13T10:16:35.202938Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/sbalansirovannye-derevya-avlred-black-ideya-zachem-nuzhny</loc>
    <lastmod>2026-02-13T10:16:45.771816Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/kuchi-i-priority-queue</loc>
    <lastmod>2026-02-13T10:16:53.956748Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/grafy-predstavleniya-obhody-komponenty-svyaznosti</loc>
    <lastmod>2026-02-13T10:17:03.442926Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/sortirovki-puzyryokvstavkivybor-i-pochemu-oni-medlennye</loc>
    <lastmod>2026-02-13T10:17:12.428422Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/bystrye-sortirovki-quicksort-mergesort-heapsort</loc>
    <lastmod>2026-02-13T10:17:20.231019Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/poisk-binarnyy-poisk-i-variatsii</loc>
    <lastmod>2026-02-13T10:17:29.361059Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/kratchayshie-puti-dijkstra-bellmanford-obzor</loc>
    <lastmod>2026-02-13T10:17:39.836613Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/algoritmy-i-struktury-dannyh/zhadnye-dinamika-backtracking-kak-vybirat-podhod</loc>
    <lastmod>2026-02-13T10:17:52.003923Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika</loc>
    <lastmod>2026-06-06T16:49:39.637Z</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/logika-vyskazyvaniya-tablitsy-istinnosti-implikatsiya</loc>
    <lastmod>2026-02-13T11:49:17.184797Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/normalnye-formy-dnfknf-i-preobrazovaniya</loc>
    <lastmod>2026-02-13T11:49:28.150310Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/mnozhestva-operatsii-dekartovo-proizvedenie</loc>
    <lastmod>2026-02-13T20:03:02.457617Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/otnosheniya-ekvivalentnost-poryadok-klassy</loc>
    <lastmod>2026-02-13T11:49:52.499122Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/funktsii-i-otobrazheniya-inektsiyasyurektsiyabiektsiya</loc>
    <lastmod>2026-02-13T11:50:01.089700Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/kombinatorika-pravila-summy-i-proizvedeniya</loc>
    <lastmod>2026-02-13T11:50:12.702839Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/perestanovki-razmescheniya-sochetaniya</loc>
    <lastmod>2026-02-13T11:50:24.606918Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/binomialnye-koeffitsienty-i-formula-nyutona</loc>
    <lastmod>2026-02-13T11:50:35.445695Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/induktsiya-dokazatelstvo-i-tipovye-shablony</loc>
    <lastmod>2026-02-13T11:50:52.473405Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/rekurrentnye-sootnosheniya-primery-i-resheniya</loc>
    <lastmod>2026-02-13T11:51:12.787107Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/grafy-ponyatiya-stepeni-svyaznost</loc>
    <lastmod>2026-02-13T11:51:20.580893Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/diskretnaya-matematika/buleva-algebra-v-tsifrovoy-logike</loc>
    <lastmod>2026-02-13T11:51:31.547623Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie</loc>
    <lastmod>2026-06-06T16:49:39.639Z</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/klassy-i-obekty-sostoyanie-i-povedenie</loc>
    <lastmod>2026-02-18T09:57:29.502757Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/inkapsulyatsiya-modifikatory-dostupa-i-interfeysy</loc>
    <lastmod>2026-02-18T09:57:42.726709Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/nasledovanie-kogda-polezno-a-kogda-vredno</loc>
    <lastmod>2026-02-18T09:57:52.614167Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/polimorfizm-virtualnye-metody-podstanovki</loc>
    <lastmod>2026-02-18T09:58:06.263789Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/abstraktsiya-abstraktnye-klassy-vs-interfeysy</loc>
    <lastmod>2026-02-18T09:58:16.695717Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/kompozitsiya-vs-nasledovanie-prakticheskie-pravila</loc>
    <lastmod>2026-02-18T09:58:27.626215Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/solid-obzor-i-primery-narusheniy</loc>
    <lastmod>2026-02-18T09:58:36.762598Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/isklyucheniya-proektirovanie-oshibok-i-obrabotka</loc>
    <lastmod>2026-02-18T09:58:44.499163Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/kollektsii-i-generics-tipobezopasnost</loc>
    <lastmod>2026-02-18T09:58:53.270434Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/serializatsiya-json-dto-modeli-domena</loc>
    <lastmod>2026-02-18T09:58:59.742331Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/testiruemost-oop-zavisimosti-i-inversiya-upravleniya</loc>
    <lastmod>2026-02-18T09:59:07.437151Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/obektno-orientirovannoe-programmirovanie/mini-proekt-modelirovanie-predmetnoy-oblasti</loc>
    <lastmod>2026-02-18T09:59:16.304082Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy</loc>
    <lastmod>2026-06-06T16:49:39.641Z</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/operatsionnaya-sistema-arhitektura-yadra-i-prostranstvo-polzovatelya</loc>
    <lastmod>2026-02-18T09:22:47.825316Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/protsessy-v-operatsionnoy-sisteme-zhiznennyy-tsikl-sostoyaniya-i-planirovanie</loc>
    <lastmod>2026-02-18T09:22:55.758844Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/potoki-i-mnogopotochnost-modeli-potokov-i-sinhronizatsiya-v-os</loc>
    <lastmod>2026-02-18T09:23:06.379269Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/planirovschik-operatsionnoy-sistemy-algoritmy-fcfs-sjf-round-robin-cfs</loc>
    <lastmod>2026-02-18T09:23:13.292990Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/upravlenie-pamyatyu-v-os-virtualnaya-pamyat-stranitsy-i-segmenty</loc>
    <lastmod>2026-02-18T09:23:20.825925Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/podkachka-i-zameschenie-stranits-algoritmy-lru-fifo-clock-v-operatsionnyh-sistemah</loc>
    <lastmod>2026-02-18T09:23:27.532733Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/faylovye-sistemy-struktura-indeksatsiya-i-zhurnalirovanie-v-os</loc>
    <lastmod>2026-02-18T09:23:35.625093Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/vvod-vyvod-v-operatsionnoy-sisteme-drayvery-buferizatsiya-i-dma</loc>
    <lastmod>2026-02-18T09:23:49.419754Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/mezhprotsessnoe-vzaimodeystvie-kanaly-sokety-razdelyaemaya-pamyat-v-os</loc>
    <lastmod>2026-02-18T09:24:01.003434Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/sinhronizatsiya-protsessov-myuteksy-semafory-i-problema-deadlock</loc>
    <lastmod>2026-02-18T09:24:08.883764Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/bezopasnost-operatsionnyh-sistem-prava-dostupa-izolyatsiya-i-konteynerizatsiya</loc>
    <lastmod>2026-02-18T09:24:17.319419Z</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://nikolskypomosh.ru/lectorium/informacionnye-tehnologii-i-programmirovanie/operacionnye-sistemy/sovremennye-operatsionnye-sistemy-linux-windows-mikroyadra-i-unikernel</loc>
    <lastmod>2026-02-18T09:24:26.011566Z</lastmod>
    <priority>0.6</priority>
  </url>
</urlset>