For each lecture, there is a related problem solving session. Below is a list of recommended problems to each problem solving session:

Boldface means that this part is fixed. Otherwise recommended problems to solve may change.

HT 1

Lecture	Part	Topic	Problems
1	2.2	Introduction	2.1-2.4 Exercises
2	2.1-2.2	Finite state machines	2.5, 2.6, 2.8, 2.12, 2.13 Övningsanteckningar
3	2.3	Sequential circuits	2.16a, 2.17, 2.19, 2.20, 2.23, 2.26
4	3.1	Computing with integers	3.1-3.5
5	3.2-3.3	Rings and Boolean rings	3.7, 3.8, 3.11, 3.13
6	3.3	Boolean algebra	3.21-3.24, 3.28
7	4.5	Arithmetic	4.18-4.20
8	4.1-4.2	Boolean functions and normal forms	4.1, 4.3, 4.5-4.6 Övningsanteckningar
9	5.1.1-5.1.2	Minimal functions	5.1b, 5.2b, 5.4-5.6
10	5.1.2	Karnaugh maps	5.8ab, 5.9, 5.11, 5.13b, 5.14e
11	6.1	State minimisation	6.1
12	6.2	State assignment	6.5-6.7
13	6.3, 6.4, 5.3	Asynchronous seq.circ. and Mealy-Moore	6.3, 6.4, 6.11, 6.12, 6.14
14	5.4+	Standard components	5.19, Exam Aug 2005 P:4,5 Solution

HT 2

Lecture	Part	Topic	Problems
15	6	Nyttiga uppgifter som sammanfattar lp1	6.16, 6.17, 6.22-6.24, 5.21b-e
16		Datorns uppbyggnad	Uppgift 1 och 2 (s. 7-8) i anteckningar, Lösningar
17		VHDL	Uppgifter, Lösningar
18		Digital integrated circuits	Uppgift 1 i Problems, Solutions Extra problems Problems, Solutions Some brief notes about ROM memory required to solve assignment 1
19	7.1-7.2	Linear seq. circ. (time domain)	5.21a, 7.1-7.4, 7.7
20	7.2	Linear seq. circ. (D domain)	7.13, 7.14, 7.6
21	7.3	LFSR, cyclic complexity	7.12, 7.15, 7.17, 7.19