IT-højskolen

  Uddannelser   Stillinger   Aktiviteter

Home   Personer   SiteMap   Intranet   English  

Programming problems

The assignments will be corrected and returned the following Monday with a green, yellow, or red card. Not handing in an assignment gives a red card. Two yellow cards together make a red card. Admission to the final examination requires that no more than two red cards have been given.Many of the assignments require writing programs in an imperative language of your choice (C, C++, Java, Pascal,...).

Week Homework Handed in the Solution
2 Read a graph 7/9 Two C-solutions
3 Dijkstras algorithm 21/9 Java, C and C++ kode
4 Minimum spanning tree 28/9 Java and C kode
5 Floyd-Warshalls algorithm 5/10 C kode
6 Hashing 12/10 C code
7 Exercise Sheet 7 (no homework)    
8 ROBDD package (part 1) 2/11  
9 ROBDD package (part 2) 5/11  
10 BDDs for combinational circuits 9/11  
11 Old NP exam problems 16/11 Solution
12 Misc. old exam problems 23/11 Opg 1 Opg 2 Opg 3

Related links

  • The graphs to be used for assignments 1 to 5 can be found here.

  • The file words to be used in Assignment 5.

  • The circuits to be used for assignment 9 can be found here (the .crt-files are in unix-format; the .txt-files in dos/windows-format).



opdateret 21/08-2000
henrik@it-c.dk

til top