<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="et">
	<id>http://courses.cs.taltech.ee/w/index.php?action=history&amp;feed=atom&amp;title=Huffman_Encoder_%28ITS8020%29</id>
	<title>Huffman Encoder (ITS8020) - Redigeerimiste ajalugu</title>
	<link rel="self" type="application/atom+xml" href="http://courses.cs.taltech.ee/w/index.php?action=history&amp;feed=atom&amp;title=Huffman_Encoder_%28ITS8020%29"/>
	<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Huffman_Encoder_(ITS8020)&amp;action=history"/>
	<updated>2026-04-06T18:01:50Z</updated>
	<subtitle>Selle lehekülje redigeerimiste ajalugu</subtitle>
	<generator>MediaWiki 1.35.9</generator>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Huffman_Encoder_(ITS8020)&amp;diff=7516&amp;oldid=prev</id>
		<title>Irve: Uus lehekülg: &#039;&#039;&#039;The Huffman encoder assignment helps to discover the wonderful world of pointers, debugging and segmentation faults.&#039;&#039;  Your task is to implement an Hufmann encoder for statist...&#039;</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Huffman_Encoder_(ITS8020)&amp;diff=7516&amp;oldid=prev"/>
		<updated>2018-10-26T09:07:24Z</updated>

		<summary type="html">&lt;p&gt;Uus lehekülg: &amp;#039;&amp;#039;&amp;#039;The Huffman encoder assignment helps to discover the wonderful world of pointers, debugging and segmentation faults.&amp;#039;&amp;#039;  Your task is to implement an Hufmann encoder for statist...&amp;#039;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Uus lehekülg&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;The Huffman encoder assignment helps to discover the wonderful world of pointers, debugging and segmentation faults.&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
Your task is to implement an Hufmann encoder for statistical compression in C. The task is described on [http://deepthought.ttu.ee/it/vorgutarkvara/wav3050/lab1.html this old page]; ignore its presentation guidelines with Tanel Tammet: send them to me.&lt;br /&gt;
&lt;br /&gt;
[http://deepthought.ttu.ee/it/vorgutarkvara/wav3050/lab1_hufmann.html The description of the algorithm].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Grades ==&lt;br /&gt;
&lt;br /&gt;
If you want to predict your grade you might find following helpful:&lt;br /&gt;
* 10p: Compresses and decompresses some regular text files (this is mandatory)	the .c file of your program for example&lt;br /&gt;
* 10p Compresses and decompresses most input	you can have occasional errors with binary files&lt;br /&gt;
* 5p: Compresses and decompresses almost everything	program can work with all non-tricky inputs&lt;br /&gt;
* 5p: Compresses and decompresses even the wierd files	program can work with tricky inputs&lt;br /&gt;
* 5p: Accepts stdin/stdout when no options or -d are present&lt;br /&gt;
    myhuf &amp;lt; asd &amp;gt; asd.out&lt;br /&gt;
    myhuf -d &amp;lt; asd.out &amp;gt; asd2&lt;br /&gt;
* OR accepts file name arguments for both input and output files&lt;br /&gt;
    myhuf asd asd.out&lt;br /&gt;
    myhuf -d asd.out asd2&lt;br /&gt;
* 1p: Has a working makefile (or &amp;quot;make programname&amp;quot; works)&lt;br /&gt;
* 1p: Returns 0 on successful exit; nonzero on any errors&lt;br /&gt;
* 1p: Sends error messages to stderr	&lt;br /&gt;
* 1p: Program is not slow	&lt;br /&gt;
* 1p: program does not crash	&lt;br /&gt;
+1p per week up to 3, when presented earlier than the deadline&lt;/div&gt;</summary>
		<author><name>Irve</name></author>
	</entry>
</feed>