PA 8001 2014 Practical 1 - Revision history

Ceres at 01:11, 21 September 2014

2014-09-21T01:11:55Z

Ceres at 08:39, 20 September 2014

2014-09-20T08:39:33Z

Ceres at 00:36, 15 September 2014

2014-09-15T00:36:58Z

Ceres at 01:42, 14 September 2014

2014-09-14T01:42:47Z

Ceres at 01:42, 14 September 2014

2014-09-14T01:42:11Z

Ceres at 00:48, 14 September 2014

2014-09-14T00:48:54Z

Ceres at 00:42, 14 September 2014

2014-09-14T00:42:55Z

Ceres at 00:31, 14 September 2014

2014-09-14T00:31:40Z

Ceres at 18:26, 13 September 2014

2014-09-13T18:26:04Z

Ceres: Created page with "== Objectives == There are three objectives for this practical: * Experiment with concurrency (without any underlying support) and observe its issues * Experiment with a u..."

2014-09-13T18:16:57Z

Created page with "== Objectives == There are three objectives for this practical: * Experiment with concurrency (without any underlying support) and observe its issues * Experiment with a u..."

New page

== Objectives ==

There are three objectives for this practical:

* Experiment with concurrency (without any underlying support) and observe its issues

* Experiment with a unit testing framework (such as CUnit)
* Get more insight into the working of the Raspberry Pi, particularly with respect to input and output

== Instructions ==

Submit a single .zip file on blackboard with separate folders, each containing the solutions to the below-specified parts.

For each function in the code, you need to write evidence of test-driven development, both in terms of comments (description, pre- and post-condition and properties) and unit testing test suites (e.g., in CUnit, see below).

=== Part 1: Prime Factorization ===

'''Part 1.1.''' Write the specification (description, pre- and post-condition, test-cases) for the function factorize() with the following signature:

struct factorization {
int factor;
struct factorisation *next;
};

factorization * factrorize ( int );

'''Part 1.2.''' Implement its test suite using a unit testing framework such as CUnit.

Note that different development environments come with their built in unit testing framework and
you can use any of those instead of CUnit.

If you decide to use CUnit, please download it from [http://sourceforge.net/projects/cunit/files/CUnit/2.1-2/ its sourceforge repository],
unpack it and install it in your local directory.
Here is a useful [http://sourceforge.net/projects/cunit/files/CUnit/2.1-2/ discussion about installing CUnit].

Review the [http://cunit.sourceforge.net/example.html examples provided at the CUnit repository] or [http://people.cs.aau.dk/~bnielsen/TOV07/lektioner/cunit-intro-07.pdf the tutorial by Nielsen and Skou].

Implement a test suite for factorization, based on the description provided in part 1.1.

'''Part 1.3''' Implement factorize(int) and run all your tests.

← Older revision		Revision as of 01:11, 21 September 2014
Line 14:		Line 14:
	Submit a single .zip file on blackboard with separate folders, each containing the solutions to the below-specified parts.		Submit a single .zip file on blackboard with separate folders, each containing the solutions to the below-specified parts.

−	For each function in the code, you need to write evidence of test-driven development, both in terms of comments (description, pre- and post-condition and properties) and unit testing test suites (e.g., in CUnit, see below).	+	For each function in the code, you need to write evidence of test-driven development, both in terms of comments (description, pre- and post-condition and properties) and unit testing test suites (e.g., in CUnit, see below). To show the successful execution of your test suite, also include the XML file resulting from its execution.

@@ Line 66: / Line 66: @@
   void writeLong(long i);
   void showPrimeFactorization(void);
+Note: showPrimeFactorization() function does not have to stop printing. When you get to the last line of the screen, go to the first line and replace it with the prime factorization of the next integer.
 After you finish implementing the above-mentioned functions, insert the SD-card into a computer using the USB reader, empty the SD card, and copy the files from  [[media:Boot.zip|boot.zip]] into it, then perform the following sequence of actions:
@@ Line 74: / Line 79: @@
 # remove the SD card
 # insert the SD card into a computer using the usb reader
-# open a command line terminal (cmd in Windows)
+# open GCC Command Prompt (click start and go to GNU Tools ARM Embedded 4.7 2013q3)
 # go to your working path (screen folder)
 # run build.bat

@@ Line 71: / Line 71: @@
 After you finish implementing the above-mentioned functions, insert the SD-card into a computer using the USB reader, empty the SD card, and copy the files from  [[media:Boot.zip|boot.zip]] into it, then perform the following sequence of actions:
-# power off rasberry pi
+# power off the Raspberry Pi
 # remove the SD card
 # insert the SD card into a computer using the usb reader
-# open a command line termina (cmd in Windows)
+# open a command line terminal (cmd in Windows)
 # go to your working path (screen folder)
 # run build.bat
 # copy kernel.img to the SD card
-# remove the sd card and insert it into the Rasberry Pi
+# remove the SD card and insert it into the Raspberry Pi
-# power on the Rasberry Pi.
+# power on the Raspberry Pi.
 You should now be able to see the outcome of prime factorization on the screen.

@@ Line 60: / Line 60: @@
-Download the [screen [[File:screen.zip]]] and complet the implementation for the functions specified in numbers.c, i.e
+Download the [[media:screen.zip|screen.zip]] and complete the implementation for the functions specified in numbers.c, i.e.,
   void writeChar(unsigned int pos, char ch);
@@ Line 69: / Line 69: @@
-After you finish the functions, insert sd card into computer using the usb reader and empty the sd card and put the files from [boot.zip [[File:Boot.zip]]] then
+After you finish implementing the above-mentioned functions, insert the SD-card into a computer using the USB reader, empty the SD card, and copy the files from  [[media:Boot.zip|boot.zip]] into it, then perform the following sequence of actions:
-) power off rasberry pi
+# power off rasberry pi
-) remove sd card
+# remove the SD card
-) insert sd card into computer using the usb reader
+# insert the SD card into a computer using the usb reader
-) open cmd
+# open a command line termina (cmd in Windows)
-) go to your working path (screen folder)
+# go to your working path (screen folder)
-) run build.bat
+# run build.bat
-) copy kernel.img to sd card
+# copy kernel.img to the SD card
-) remove the sd card and insert it to rasberry pi
+# remove the sd card and insert it into the Rasberry Pi
-) power on the rasberry pi.
+# power on the Rasberry Pi.
 === Part 3: Interleaving ===
 '''Part 3.1.''' Take the blinking program from Lab0, and the factorization program from Part 2.
 Make an interleaving of the two programs.
 '''Part 3.2.''' Observe that the LEDs blink more and more slowly as the factorized number grows;
 devise a fair interleaving of the tasks such that the blinking speed remains constant.

@@ Line 60: / Line 60: @@
-Download the [screen [[File:screen.zip]] and complet the implementation for the functions specified in numbers.c, i.e
+Download the [screen [[File:screen.zip]]] and complet the implementation for the functions specified in numbers.c, i.e
   void writeChar(unsigned int pos, char ch);
@@ Line 68: / Line 68: @@
 === Part 3: Interleaving ===

@@ Line 36: / Line 36: @@
 If you decide to use CUnit, please download it from [http://sourceforge.net/projects/cunit/files/CUnit/2.1-2/ its sourceforge repository],
 unpack it and install it in your local directory.
-Here is a useful [http://sourceforge.net/projects/cunit/files/CUnit/2.1-2/ discussion about installing CUnit].
+Here is a useful [http://ubuntuforums.org/archive/index.php/t-1727067.html discussion about installing CUnit].
 Review the [http://cunit.sourceforge.net/example.html examples provided at the CUnit repository] or [http://people.cs.aau.dk/~bnielsen/TOV07/lektioner/cunit-intro-07.pdf the tutorial by Nielsen and Skou].

← Older revision		Revision as of 00:42, 14 September 2014
Line 60:		Line 60:


−	Download the [screen [screen.zip]] and complet the implementation for the functions specified in numbers.c, i.e	+	Download the [screen [[File:screen.zip]] and complet the implementation for the functions specified in numbers.c, i.e

	void writeChar(unsigned int pos, char ch);		void writeChar(unsigned int pos, char ch);

@@ Line 46: / Line 46: @@
 === Part 2: Prime Factorization on Raspberry Pi ===
 Write a program that shows the prime factorization of natural numbers, starting from 1 and moving upwards, on the monitor screen connected through the HDMI port to Raspberri Pi.
 The output of the program should look like the following:
@@ Line 61: / Line 60: @@

← Older revision		Revision as of 18:26, 13 September 2014
Line 41:		Line 41:

	Implement a test suite for factorization, based on the description provided in part 1.1.		Implement a test suite for factorization, based on the description provided in part 1.1.
		+	In the implementation, you may use your own helper functions, but for each function, you need to provide evidence of test-driven development.

	'''Part 1.3''' Implement factorize(int) and run all your tests.		'''Part 1.3''' Implement factorize(int) and run all your tests.
		+
		+	=== Part 2: Prime Factorization on Raspberry Pi ===
		+
		+	Write a program that shows the prime factorization of natural numbers, starting from 1 and moving upwards, on the monitor screen connected through the HDMI port to Raspberri Pi.
		+	The output of the program should look like the following:
		+
		+	1: 1,
		+	2: 2,
		+	3: 3,
		+	4: 2 2,
		+	5: 5,
		+	6: 2 3,
		+	.
		+	.
		+	.
		+
		+
		+
		+
		+
		+	=== Part 3: Interleaving ===
		+
		+	'''Part 3.1.''' Take the blinking program from Lab0, and the factorization program from Part 2.
		+	Make an interleaving of the two programs.
		+
		+	'''Part 3.2.''' Observe that the LEDs blink more and more slowly as the factorized number grows;
		+	devise a fair interleaving of the tasks such that the blinking speed remains constant.