Algorithms and Data Structures
Exercises (Japanese)

Contents Date Deadline E-mail Submisson Subject
1st Introduction / / @u-aizu.ac.jp [alg1-ex01]
2nd List / / @u-aizu.ac.jp [alg1-ex02]
3rd Stacks and Queues / / @u-aizu.ac.jp [alg1-ex03]
4th Recursion / / @u-aizu.ac.jp [alg1-ex04]
5th Calculation Cost / / @u-aizu.ac.jp [alg1-ex05]
6th Tree 1 (Parse Tree) / / @u-aizu.ac.jp [alg1-ex06]
7th Tree 2 (Binary Search Tree) / / @u-aizu.ac.jp [alg1-ex07]
8th Sort 1 (Slow Method) / / @u-aizu.ac.jp [alg1-ex08]
9th Sort 2 (The Fastest Method) / / @u-aizu.ac.jp [alg1-ex09]
10th Search 1 (Binary Search) / / @u-aizu.ac.jp [alg1-ex10]
11th Search 2 (Balanced Tree) / / @u-aizu.ac.jp [alg1-ex11]
12th Search 3 (Hash) / / @u-aizu.ac.jp [alg1-ex12]
instruction : Please send only program cord by e-mail. Do not include unrelated texts and the signature.

Purpose

Understanding basic algorithms, and running it. Use C language for programming.

Policy

There are 3 questions every week. Contents are as follows.

Question 1
Base question about algorithm (Required)
This is a question for checking if you understand the algorithm. If you don't understand the algorithm, you can't write program. Please print out a PostScript file, and have TAs check your answer within exercise time. We don't collect papers.
Question 2
This is a question for writing the algorithm in C.
Write the algorithm which you have understood with question 1. If you don't understand the algorithm, you can't write program. Please write program after understanding. Please send your answer by e-mail. Do your best to able to finish within the exercise time.
Question 3
Optional Question (Extra)
This is a difficult question. This question is not required, but if you have motivation, try it please. Please send your answer by e-mail, and add Optional string in Subject
Example:Subject: [alg1-ex01] Optional

The example of answers and program are prepared to all questions, but we don't open to the public. If you want to see them, ask teachers of TAs.

Textbooks

We show helpful pages in textbooks. The textbook is only No.1, but No2 have helpful pages, too. So ask teachers or TAs, if you don't have No2.

You might refer to functions written in textbooks, but the functions have different point from skeleton files. Please make them reference after understanding program well. If you refer to program written in textbook, don't mistake l (L) and 1 (one). They are very alike.
int l = 1;

When you have trouble about programming

When you can't understand error messages or you can't find wrong points of program, see following sites.


If you have opinions, impressions, or questions, please talk or send e-mail to teachers of TAs.


Japanese original written by Naoki Wakamatsu.

Valid XHTML 1.0! Valid CSS!