Activity assignment 1 - Revision history

Beh01 at 13:16, 20 August 2020

2020-08-20T13:16:49Z

2019-11-11T10:36:26Z

Activity assignments

2019-11-11T10:23:06Z

2019-11-11T10:18:35Z

2019-11-11T10:14:58Z

2019-11-11T10:12:01Z

2019-11-08T13:51:01Z

Activity assignments

2019-11-08T13:50:22Z

Activity assignments

2019-11-08T13:49:41Z

Activity assignments

2019-11-08T13:46:02Z

Activity assignments

@@ Line 1: / Line 1: @@
 == Activity assignments ==
-Implement following functions. There will be 5 points for each of these functions.
+Implement following functions.
 * Create a function that gets a list of tuples  - <code>[(Int, Char)]</code>. This function takes these pairs and for each of these pairs <code>(n, a)</code> generates a string where the character <code>a</code> is multiplied <code>n</code> times. The function result is a concatenation of these sub-strings.

@@ Line 26: / Line 26: @@
 swapIt "ABC" [(0,2)] = "CBA"
 swapIt "ABCD" [(0,2), (1,3),(0,1),(2,3)] = "DCBA"
 </syntaxhighlight>

@@ Line 21: / Line 21: @@
 * Create a function that gets a string <code>line</code> and a list of pairs - <code>[(Int,Int)]</code>. Each of these pairs contain two indexes (starting from 0) ant it describes a swap between two positions in the original string <code>line</code>. Function returns the original string where all these swaps have been applied.
 <syntaxhighlight lang="Haskell" >
-count :: String -> String -> Int
+swapIt :: String -> [(Int,Int)] -> String
 </syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark" >
-count "AbcAbcabcAbc" "Abc" = 3
+swapIt "ABC" [(0,2)] = "CBA"
 </syntaxhighlight>

@@ Line 12: / Line 12: @@
 * Create a function that takes two strings - <code>a</code> and <code>b</code>. It will print how many times the string <code>a</code> contains the string <code>b</code>.
 <syntaxhighlight lang="Haskell" >
 count :: String -> String -> Int

← Older revision		Revision as of 10:14, 11 November 2019
Line 11:		Line 11:
	</syntaxhighlight>		</syntaxhighlight>

−	* Create	+	* Create a function that takes two strings - <code>a</code> and <code>b</code>. It will print how many times the string <code>a</code> contains the string <code>b</code>.
		+	<syntaxhighlight lang="Haskell" >
		+	count :: String -> String -> Int
		+	</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark" >
		+	count "AbcAbcabcAbc" "Abc" = 3
		+	</syntaxhighlight>

@@ Line 3: / Line 3: @@
 Implement following functions. There will be 5 points for each of these functions.
-Create a function that gets a list of tuples (Int, Char). This function takes these pair and for each of these pairs (n, a) generates a string where
+Create a function that gets a list of tuples (Int, Char). This function takes these pair and for each of these pairs (n, a) generates a string where the character <code>a</code> is multiplied <code>n</code> times. The function result is a concatenation of these sub-strings.
-  the character
 <syntaxhighlight lang="Haskell" >
 create :: [(Int, Char)] -> String