<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">infoschool</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика в школе</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics in school</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2221-1993</issn><publisher><publisher-name>Publishing House Education and Informatics</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">infoschool-156</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>НАМ 15 ЛЕТ</subject></subj-group></article-categories><title-group><article-title>МНОЖЕСТВА В ЗАДАЧАХ С АНАЛИЗОМ БИТОВЫХ ЦЕПОЧЕК</article-title><trans-title-group xml:lang="en"><trans-title>SETS IN THE TASKS WITH BIT CHAIN ANALYSIS</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Босова</surname><given-names>Л. Л.</given-names></name><name name-style="western" xml:lang="en"><surname>Bosova</surname><given-names>L. L.</given-names></name></name-alternatives><email xlink:type="simple">akulll@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Мирончик</surname><given-names>Е. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Mironchik</surname><given-names>E. A.</given-names></name></name-alternatives><email xlink:type="simple">mironch-elena@yandex.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Московский педагогический государственный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Moscow State University of Education</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>лицей № 111</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Lyceum 111, Novokuznetsk, Kemerovo Region</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2017</year></pub-date><pub-date pub-type="epub"><day>04</day><month>10</month><year>2018</year></pub-date><volume>0</volume><issue>7</issue><fpage>44</fpage><lpage>47</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Босова Л.Л., Мирончик Е.А., 2018</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="ru">Босова Л.Л., Мирончик Е.А.</copyright-holder><copyright-holder xml:lang="en">Bosova L.L., Mironchik E.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://school.infojournal.ru/jour/article/view/156">https://school.infojournal.ru/jour/article/view/156</self-uri><abstract><p>Удачный выбор графического образа или схемы позволяет эффективно решать сложные задачи. В статье рассматриваются примеры схем, обеспечивающих простое решение задач на определение мощности множества; приводится алгоритм решения задач, в которых используются поразрядные логические операции с целыми неотрицательными числами.</p></abstract><trans-abstract xml:lang="en"><p>A successful choice of a graphic image or a scheme allows you to effectively solve complex tasks. The article contains the examples of schemes that provide a simple solution of tasks on determining the cardinality of a set; an algorithm for solving the tasks in which bit-by-bit logical operations with non-negative integer numbers are used.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>наглядно-образное мышление</kwd><kwd>множества</kwd><kwd>предикаты</kwd><kwd>логические выражения</kwd><kwd>логические преобразования</kwd><kwd>информатика в старшей школе</kwd></kwd-group><kwd-group xml:lang="en"><kwd>visual-figurative thinking</kwd><kwd>sets</kwd><kwd>predicates</kwd><kwd>logical expressions</kwd><kwd>logical conversions</kwd><kwd>informatics in upper school</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Босова Л. Л., Босова А. Ю. Информатика. 10 класс: учебник. М.: БИНОМ. Лаборатория знаний, 2016.</mixed-citation><mixed-citation xml:lang="en">Босова Л. Л., Босова А. Ю. Информатика. 10 класс: учебник. М.: БИНОМ. Лаборатория знаний, 2016.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Лещинер В. Р. ЕГЭ 2017. Информатика. Типовые тестовые задания. М.: Экзамен, 2016.</mixed-citation><mixed-citation xml:lang="en">Лещинер В. Р. ЕГЭ 2017. Информатика. Типовые тестовые задания. М.: Экзамен, 2016.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Психология: учебник / под ред. А. А. Крылова. М.: Проспект, 2012.</mixed-citation><mixed-citation xml:lang="en">Психология: учебник / под ред. А. А. Крылова. М.: Проспект, 2012.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
