<divrole="region"aria-label="Skip to main content"><aclass="skipToContent_fXgn"href="#__docusaurus_skipToContent_fallback">Skip to main content</a></div><navaria-label="Main"class="navbar navbar--fixed-top"><divclass="navbar__inner"><divclass="navbar__items"><buttonaria-label="Toggle navigation bar"aria-expanded="false"class="navbar__toggle clean-btn"type="button"><svgwidth="30"height="30"viewBox="0 0 30 30"aria-hidden="true"><pathstroke="currentColor"stroke-linecap="round"stroke-miterlimit="10"stroke-width="2"d="M4 7h22M4 15h22M4 23h22"></path></svg></button><aclass="navbar__brand"href="/"><bclass="navbar__title text--truncate">mf</b></a><divclass="navbar__item dropdown dropdown--hoverable"><ahref="#"aria-haspopup="true"aria-expanded="false"role="button"class="navbar__link">Additional FI MU materials</a><ulclass="dropdown__menu"><li><aclass="dropdown__link"href="/ib002/">IB002: Algorithms</a></li><li><aaria-current="page"class="dropdown__link dropdown__link--active"href="/pb071/">PB071: C</a></li><li><aclass="dropdown__link"href="/pb161/">PB161: C++</a></li></ul></div><aclass="navbar__item navbar__link"href="/contributions">Contributions</a><aclass="navbar__item navbar__link"href="/talks">Talks</a></div><divclass="navbar__items navbar__items--right"><aclass="navbar__item navbar__link"href="/blog">Blog</a><divclass="toggle_vylO colorModeToggle_DEke"><buttonclass="clean-btn toggleButton_gllP toggleButtonDisabled_aARS"type="button"disabled=""title="Switch between dark and light mode (currently light mode)"aria-label="Switch between dark and light mode (currently light mode)"aria-live="polite"><svgviewBox="0 0 24 24"width="24"height="24"class="lightToggleIcon_pyhR"><pathfill="currentColor"d="M12,9c1.65,0,3,1.35,3,3s-1.35,3-3,3s-3-1.35-3-3S10.35,9,12,9 M12,7c-2.76,0-5,2.24-5,5s2.24,5,5,5s5-2.24,5-5 S14.76,7,12,7L12,7z M2,13l2,0c0.55,0,1-0.45,1-1s-0.45-1-1-1l-2,0c-0.55,0-1,0.45-1,1S1.45,13,2,13z M20,13l2,0c0.55,0,1-0.45,1-1 s-0.45-1-1-1l-2,0c-0.55,0-1,0.45-1,1S19.45,13,20,13z M11,2v2c0,0.55,0.45,1,1,1s1-0.45,1-1V2c0-0.55-0.45-1-1-1S11,1.45,11,2z M11,20v2c0,0.55,0.45,1,1,1s1-0.45,1-1v-2c0-0.55-0.45-1-1-1C11.45,19,11,19.45,11,20z M5.99,4.58c-0.39-0.39-1.03-0.39-1.41,0 c-0.39,0.39-0.39,1.03,0,1.41l1.06,1.06c0.39,0.39,1.03,0.39,1.41,0s0.39-1.03,0-1.41L5.99,4.58z M18.36,16.95 c-0.39-0.39-1.03-0.39-1.41,0c-0.39,0.39-0.39,1.03,0,1.41l1.06,1.06c0.39,0.39,1.03,0.39,1.41,0c0.39-0.39,0.39-1.03,0-1.41 L18.36,16.95z M19.42,5.99c0.39-0.39,0.39-1.03,0-1.41c-0.39-0.39-1.03-0.39-1.41,0l-1.06,1.06c-0.39,0.39-0.39,1.03,0,1.41 s1.03,0.39,1.41,0L19.42,5.99z M7.05,18.36c0.39-0.39,0.39-1.03,0-1.41c-0.39-0.39-1.03-0.39-1.41,0l-1.06,1.06 c-0.39,0.39-0.39,1.03,0,1.41s1.03,0.39,1.41,0L7.05,18.36z"></path></svg><svgviewBox="0 0 24 24"width="24"height="24"class="darkToggleIcon_wfgR"><pathfill="currentColor"d="M9.37,5.51C9.19,6.15,9.1,6.82,9.1,7.5c0,4.08,3.32,7.4,7.4,7.4c0.68,0,1.35-0.09,1.99-0.27C17.45,17.19,14.93,19,12,19 c-3.86,0-7-3.14-7-7C5,9.07,6.81,6.55,9.37,5.51z M12,3c-4.97,0-9,4.03-9,9s4.03,9,9,9s9-4.03,9-9c0-0.46-0.04-0.92-0.1-1.36 c-0.98,1.37-2.58,2.26-4.4,2.26c-2.98,0-5.4-2.42-5.4-5.4c0-1.81,0.89-3.42,2.26-4.4C12.92,3.04,12.46,3,12,3L12,3z"></path></svg></button></div><divclass="searchBox_ZlJk"><buttontype="button"class="DocSearch DocSearch-Button"aria-label="Search"><spanclass="DocSearch-Button-Container"><svgwidth="20"height="20"class="DocSearch-Search-Icon"viewBox="0 0 20 20"><pathd="M14.386 14.386l4.0877 4.0877-4.0877-4.0877c-2.9418 2.9419-7.7115 2.9419-10.6533 0-2.9419-2.9418-2.9419-7.7115 0-10.6533 2.9418-2.9419 7.7115-2.9419 10.6533 0 2.9419 2.9418 2.9419 7.7115 0 10.6533z"stroke="currentColor"fill="none"fill-rule="evenodd"stroke-linecap="round"stroke-linejoin="round"></path></svg><spanclass="DocSearch-Button-Placeholder">Search</span></span><spanclass="DocSearch-Button-Keys"></span></button></div></div></div><divrole="presentation"class="navbar-sidebar__backdrop"></div></nav><divid="__docusaurus_skipToContent_fallback"class="main-wrappermainWrapper_
solution.</p><p>One is focused on counting ananas or in case of generic version any substring in
the file, but with a restriction on the function you use.</p><p>Other one has a more algorithmic spirit.</p><p>For this bonus you can get at maximum 2.5 K₡.</p><h2class="anchor anchorWithStickyNavbar_LWe7"id="warning">Warning<ahref="#warning"class="hash-link"aria-label="Direct link to Warning"title="Direct link to Warning"></a></h2><p><strong>DO NOT COMMIT test data</strong> to your own git repository, since the tests include
files that exceed 10MB by themselves. Even if they are on separate branch, they
take up the space.</p><h2class="anchor anchorWithStickyNavbar_LWe7"id="testing">Testing<ahref="#testing"class="hash-link"aria-label="Direct link to Testing"title="Direct link to Testing"></a></h2><p>For testing you are provided with python script (requires <code>click</code> to be installed:
<code>pip3 install --user click</code>) and <code>Makefile</code> that provides following targets:</p><ul><li><code>check-counting</code> - runs the <code>counting</code> tests</li><li><code>check-counting-bonus</code> - runs the <code>counting</code> tests with bonus implemented</li><li><code>check</code> - runs both <code>counting</code> and <code>counting-bonus</code> tests</li><li><code>clean</code> - removes output files from the test runs</li></ul><h2class="anchor anchorWithStickyNavbar_LWe7"id="task-no-1-counting-075-k">Task no. 1: Counting (0.75 K₡)<ahref="#task-no-1-counting-075-k"class="hash-link"aria-label="Direct link to Task no. 1: Counting (0.75 K₡)"title="Direct link to Task no. 1: Counting (0.75 K₡)"></a></h2><p>Your first task is to make smallish program that counts occurences of specific
(or given) word from file and writes the number to other file.</p><p>Usage of the program is:</p><divclass="codeBlockContainer_Ckt0 theme-code-block"style="--prism-color:#000000;--prism-background-color:#ffffff"><divclass="codeBlockContent_biex"><pretabindex="0"class="prism-code language-text codeBlock_bY9V thin-scrollbar"><codeclass="codeBlockLines_e6Vv"><spanclass="token-line"style="color:#000000"><spanclass="token plain">Usage: ./counting <input-file><output-file> [string-to-be-counted]</span><br></span></code></pre><divclass="buttonGroup__atx"><buttontype="button"aria-label="Copy code to clipboard"title="Copy"class="clean-btn"><spanclass="copyButtonIcons_eSgA"aria-hidden="true"><svgviewBox="0 0 24 24"class="copyButtonIcon_y97N"><pathfill="currentColor"d="M19,21H8V7H19M19,5H8A2,2 0 0,0 6,7V21A2,2 0 0,0 8,23H19A2,2 0 0,0 21,21V7A2,2 0 0,0 19,5M16,1H4A2,2 0 0,0 2,3V17H4V3H16V1Z"></path></svg><svgviewBox="0 0 24 24"class="copyButtonSuccessIcon_LjdS"><pathfill="currentColor"d="M21,7L9,19L3.5,13.5L4.91,12.09L9,16.17L19.59,5.59L21,7Z"></path></svg></span></button></div></div></div><p>Arguments that are passed to the program represent:</p><ul><li><code><input-file></code> - path to the file where we count the words</li><li><code><output-file></code> - path to the file where we output the count</li><li>(optional argument) <code>[string-to-be-counted]</code> - in case you implement bonus,
otherwise we default to word <code>ananas</code> ;)</li></ul><p>In skeleton you are given 3 empty, but documented, functions to implement.</p><ol><li><code>count_anything</code> - function accepts input file and substring to be counted in
the file, returns the count.</li><li><code>count_ananas</code> - same as <code>count_anything</code>, but specialized for ananases, the
default implementation from the skeleton expects you to implement <code>count_anything</code>
and therefore it just calls the other function.</li><li><code>write_number</code> - function that writes the number to the file, why would you
need the function is explained later :)</li></ol><h3class="anchor anchorWithStickyNavbar_LWe7"id="requirements">Requirements<ahref="#requirements"class="hash-link"aria-label="Direct link to Requirements"title="Direct link to Requirements"></a></h3><p>For manipulation with the files you are only allowed to use <code>fopen</code>, <code>fclose</code>,
<code>fgetc</code> and <code>fputc</code>. Functions like <code>fprintf</code> (except for <code>stderr</code> or logging) and
<code>fscanf</code> are <strong>forbidden</strong>.</p><p>In case you struggle and want to use one of those functions, the solution will be
penalized by 50% of points.</p><h3class="anchor anchorWithStickyNavbar_LWe7"id="bonus-part-075-k">Bonus part (0.75 K₡)<ahref="#bonus-part-075-k"class="hash-link"aria-label="Direct link to Bonus part (0.75 K₡)"title="Direct link to Bonus part (0.75 K₡)"></a></h3><p>Bonus part of this assignment is to implement <code>count_anything</code> rather than <code>count_ananas</code>.</p><blockquote><p>Smaller hint: This task does not need dynamic allocation :) You just need one
good helper function and the right idea ;)</p></blockquote><h2class="anchor anchorWithStickyNavbar_LWe7"id="task-no-2-weird-trees-1-k">Task no. 2: Weird trees (1 K₡)<ahref="#task-no-2-weird-trees-1-k"class="hash-link"aria-label="Direct link to Task no. 2: Weird trees (1 K₡)"title="Direct link to Task no. 2: Weird trees (1 K₡)"></a></h2><p>In this task we are crossing our paths with <em>algorithms and data structures</em>.
Your task is to write a program that constructs tree from the file that is given
as an argument and pretty-prints it.</p><p>Input file consists of lines, that include <code>key</code> and <code>rank</code> in form <code>key;rank</code>
or <code>nil</code>. Why would we have <code>nil</code> in a file? The file represents pre-order iteration
through the tree. Leaves never have rank different than 0, so you can safely assume
2 non-existing <code>nil</code>s in the input after you read such node ;)</p><table><tr><th>Example input file</th><th>Tree it represents</th></tr><tr><td><divclass="codeBlockContainer_Ckt0 theme-code-block"style="--prism-color:#000000;--prism-background-color:#ffffff"><divclass="codeBlockContent_biex"><pretabindex="0"class="prism-code language-text codeBlock_bY9V thin-scrollbar"><codeclass="codeBlockLines_e6Vv"><spanclass="token-line"style="color:#000000"><spanclass="token plain">8;4</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">5;3</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">3;2</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">2;1</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">1;0</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">nil</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">4;0</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">7;1</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">6;0</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">nil</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">11;2</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">10;1</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">9;0</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">nil</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">12;0</span><br></span></code></pre><divclass="buttonGroup__atx"><buttontype="button"aria-label="Copy code to clipboard"title="Copy"class="clean-btn"><spanclass="copyButtonIcons_eSgA"aria-hidden="true"><svgviewBox="0 0 24 24"class="copyButtonIcon_y97N"><pathfill="currentColor"d="M19,21H8V7H19M19,5H8A2,2 0 0,0 6,7V21A2,2 0 0,0 8,23H19A2,2 0 0,0 21,21V7A2,2 0 0,0 19,5M16,1H4A2,2 0 0,0 2,3V17H4V3H16V1Z"></path></svg><svgviewBox="0 0 24 24"class="copyButtonSuccessIcon_LjdS"><pathfill="currentColor"d="M21,7L9,19L3.5,13.5L4.91,12.09L9,16.17L19.59,5.59L21,7Z"></path></svg></span></button></div></div></div></td><td><p><imgloading="lazy"alt="tree"src="/assets/images/tree-c9e37f87f9095c00fad33ea034485ce6.png"width="633"height="684"class="img_ev3q"></p></td></tr></table><p>In this task you are only provided with different trees in the <code>test-trees</code> directory.
Implementation and format of the pretty-print is totally up to you. :)</p><p>Example of mine for the tree above:</p><divclass="codeBlockContainer_Ckt0 theme-code-block"style="--prism-color:#000000;--prism-background-color:#ffffff"><divclass="codeBlockContent_biex"><pretabindex="0"class="prism-code language-text codeBlock_bY9V thin-scrollbar"><codeclass="codeBlockLines_e6Vv"><spanclass="token-line"style="color:#000000"><spanclass="token plain">8 (rank = 4)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">+-- 5 (rank = 3)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">| +-- 3 (rank = 2)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">| | +-- 2 (rank = 1)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">| | | +-- 1 (rank = 0)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">| | +-- 4 (rank = 0)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">| +-- 7 (rank = 1)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">| +-- 6 (rank = 0)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">+-- 11 (rank = 2)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain"> +-- 10 (rank = 1)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain"> | +-- 9 (rank = 0)</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain"> +-- 12 (rank = 0)</span><br></span></code></pre><divclass="buttonGroup__atx"><buttontype="button"aria-label="Copy code to clipboard"title="Copy"class="clean-btn"><spanclass="copyButtonIcons_eSgA"aria-hidden="true"><svgviewBox="0 0 24 24"class="copyButtonIcon_y97N"><pathfill="currentColor"d="M19,21H8V7H19M19,5H8A2,2 0 0,0 6,7V21A2,2 0 0,0 8,23H19A2,2 0 0,0 21,21V7A2,2 0 0,0 19,5M16,1H4A2,2 0 0,0 2,3V17H4V3H16V1Z"></path></svg><svgviewBox="0 0 24 24"class="copyButtonSuccessIcon_LjdS"><pathfill="currentColor"d="M21,7L9,19L3.5,13.5L4.91,12.09L9,16.17L19.59,5.59L21,7Z"></path></svg></span></button></div></div></div><blockquote><p>Can you find out what are those trees? :)</p></blockquote><h2class="anchor anchorWithStickyNavbar_LWe7"id="submitting">Submitting<ahref="#submitting"class="hash-link"aria-label="Direct link to Submitting"title="Direct link to Submitting"></a></h2><p>In case you have any questions, feel free to reach out to me.</p><hr><p>Ideally submit the assignment through the merge request. Step-by-step tutorial is
present <ahref="/pb071/mr">here</a>. For setting assignee my xlogin is <code>xfocko</code>.</p><p>In case you do not want to experiment on GitLab, send me the source code via email,
