<?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-07-23T16:36:44Z</responseDate>
  <request identifier="16609" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:16609</identifier>
        <datestamp>2024-03-06T10:31:45Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Feedback Systems for Students Solving Problems Related to Polynomials of Degree Two or Lower</dc:title>
          <dc:creator>Bayzid, Luke Adrian Gubbins</dc:creator>
          <dc:creator>Breda, Ana Maria Reis D'Azevedo</dc:creator>
          <dc:creator>Rocha, Eugénio Alexandre Miguel</dc:creator>
          <dc:creator>Dos Santos, José Manuel Dos Santos</dc:creator>
          <dc:subject>Automatic feedback</dc:subject>
          <dc:subject>Algorithms</dc:subject>
          <dc:subject>Algebraic systems</dc:subject>
          <dc:description>In this paper, we present the first attempts to design and implement an algorithm that effectively responds to errors in a student’s resolution in problems related to polynomials of degree two or lower. The algorithm analyzes the student’s input by comparing pre-established resolution patterns. The obtained results of the implementation show that the algorithm is effective at the classes of problems created within the project’s scope. Future work will concern the expansion of the number of classes to other common types of problems, such as higher-degree polynomials, and its use at a large scale using open-source software with CAS capabilities.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Luke Adrian Gubbins Bayzid and Ana Maria Reis D'Azevedo Breda and Eugénio Alexandre Miguel Rocha and José Manuel Dos Santos Dos Santos</dc:contributor>
          <dc:date>2022</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 102, Third International Computer Programming Education Conference (ICPEC 2022)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/OASIcs.ICPEC.2022.5</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-166094</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2022.5</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
