<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-04-20T20:02:01Z</responseDate>
  <request verb="GetRecord" metadataPrefix="jpcoar_1.0" identifier="oai:ipsj.ixsq.nii.ac.jp:00232394">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00232394</identifier>
        <datestamp>2025-01-19T10:27:05Z</datestamp>
        <setSpec>581:11492:11494</setSpec>
      </header>
      <metadata>
        <jpcoar:jpcoar xmlns:datacite="https://schema.datacite.org/meta/kernel-4/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcndl="http://ndl.go.jp/dcndl/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:jpcoar="https://github.com/JPCOAR/schema/blob/master/1.0/" xmlns:oaire="http://namespace.openaire.eu/schema/oaire/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rioxxterms="http://www.rioxx.net/schema/v2.0/rioxxterms/" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns="https://github.com/JPCOAR/schema/blob/master/1.0/" xsi:schemaLocation="https://github.com/JPCOAR/schema/blob/master/1.0/jpcoar_scm.xsd">
          <dc:title>Measuring Complexity in Visual Programming for Elementary School Students</dc:title>
          <dc:title xml:lang="en">Measuring Complexity in Visual Programming for Elementary School Students</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName>Yui, Ono</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>Daisuke, Saito</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>Hironori, Washizaki</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>Yoshiaki, Fukazawa</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Yui, Ono</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Daisuke, Saito</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Hironori, Washizaki</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Yoshiaki, Fukazawa</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:subject subjectScheme="Other">[特集:創造的学習のための教育におけるコンピュータ] visual programming, complexity, programming education, elementary school</jpcoar:subject>
          <datacite:description descriptionType="Other">Visual programming languages are popular because they can be learned at an early age. Unlike text-based languages, they do not require linguistic knowledge. Visual programming languages are diverse and include block programming, flow programming, AR-based programming, and robot-based programming. Scratch and Viscuit are common visual programming tools. Because effective learning methods for these languages have yet to be clarified, we proposed a method and evaluated its learning effectiveness using Chuggington Programming, which is a visual programming game application. Although the questionnaire responses for five workshops at educational institutions were positive, quiz results for one- to two-hour workshops did not show significant differences based on Wilcoxon's signed rank test. Herein we focus on complexity in visual programming to assess the feasibility of a new evaluation method similar to a text-based evaluation method using turtle graphics. We compare traditional text-based evaluation methods such as Cyclomatic Complexity, Halstead Complexity, etc. with turtle graphics. Then we examine the relationship between data for student performance in the workshop and the complexity level. The solution time and complexity are positively correlated, while the percentage of correct responses and complexity are negatively correlated, validating the complexity has potential as an effective learning measure.
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.32(2024) (online)
DOI　http://dx.doi.org/10.2197/ipsjjip.32.103
------------------------------</datacite:description>
          <datacite:description descriptionType="Other">Visual programming languages are popular because they can be learned at an early age. Unlike text-based languages, they do not require linguistic knowledge. Visual programming languages are diverse and include block programming, flow programming, AR-based programming, and robot-based programming. Scratch and Viscuit are common visual programming tools. Because effective learning methods for these languages have yet to be clarified, we proposed a method and evaluated its learning effectiveness using Chuggington Programming, which is a visual programming game application. Although the questionnaire responses for five workshops at educational institutions were positive, quiz results for one- to two-hour workshops did not show significant differences based on Wilcoxon's signed rank test. Herein we focus on complexity in visual programming to assess the feasibility of a new evaluation method similar to a text-based evaluation method using turtle graphics. We compare traditional text-based evaluation methods such as Cyclomatic Complexity, Halstead Complexity, etc. with turtle graphics. Then we examine the relationship between data for student performance in the workshop and the complexity level. The solution time and complexity are positively correlated, while the percentage of correct responses and complexity are negatively correlated, validating the complexity has potential as an effective learning measure.
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.32(2024) (online)
DOI　http://dx.doi.org/10.2197/ipsjjip.32.103
------------------------------</datacite:description>
          <dc:publisher xml:lang="ja">情報処理学会</dc:publisher>
          <datacite:date dateType="Issued">2024-02-15</datacite:date>
          <dc:language>eng</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_6501">journal article</dc:type>
          <jpcoar:identifier identifierType="URI">https://ipsj.ixsq.nii.ac.jp/records/232394</jpcoar:identifier>
          <jpcoar:sourceIdentifier identifierType="ISSN">1882-7764</jpcoar:sourceIdentifier>
          <jpcoar:sourceIdentifier identifierType="NCID">AN00116647</jpcoar:sourceIdentifier>
          <jpcoar:sourceTitle>情報処理学会論文誌</jpcoar:sourceTitle>
          <jpcoar:volume>65</jpcoar:volume>
          <jpcoar:issue>2</jpcoar:issue>
          <jpcoar:file>
            <jpcoar:URI label="IPSJ-JNL6502008.pdf">https://ipsj.ixsq.nii.ac.jp/record/232394/files/IPSJ-JNL6502008.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>1.3 MB</jpcoar:extent>
            <datacite:date dateType="Available">2026-02-15</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
