<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><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-04T06:36:30Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/96984" metadataPrefix="marc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/96984</identifier><datestamp>2025-07-17T11:20:12Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><record xmlns="http://www.loc.gov/MARC21/slim" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
   <leader>00925njm 22002777a 4500</leader>
   <datafield ind2=" " ind1=" " tag="042">
      <subfield code="a">dc</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">Pérez Vidal, Lluís</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">Pla García, Núria</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="260">
      <subfield code="c">1997-09</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="520">
      <subfield code="a">This memorandum contains the detailed solution to four classroom problems of Elementary Computer Science. They are adequate for second semester students. The first problem is a simple stocks control application. It involves the use of sequential text files. And the design calls also for the use of several data structures: Tables and lists. The second problem is a very simplified version of printed circuit design. It involves some geometric calculations: straight segment intersections. The third problem is a pattern recognition problem. It deals with the detection of given patterns inside a bitmap&#xd;
 table, which presumably has been obtained through digitization of a picture. The fourth problem is a path planning problem. It takes some of the ideas of the travelling salesman problem, but the specification is much more relaxed and, therefore, the problem and its resolution are easier and shorter. The last three problems are strongly related to Computer Graphics.</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="520">
      <subfield code="a">Preprint</subfield>
   </datafield>
   <datafield tag="653" ind2=" " ind1=" ">
      <subfield code="a">ETSEIB</subfield>
   </datafield>
   <datafield tag="653" ind2=" " ind1=" ">
      <subfield code="a">Elementary Computer Science</subfield>
   </datafield>
   <datafield tag="653" ind2=" " ind1=" ">
      <subfield code="a">Computer graphics</subfield>
   </datafield>
   <datafield ind2="0" ind1="0" tag="245">
      <subfield code="a">Informàtica ETSEIB. Resolució d'alguns problemes. Curs 1996-97</subfield>
   </datafield>
</record></metadata></record></GetRecord></OAI-PMH>