# HG changeset patch
# User Puneeth Chaganti <punchagan@fossee.in>
# Date 1289303124 -19800
# Node ID c193744340ba297eaec0da295571ae845c937a24
# Parent  d6787f9e47408b4453f8d0c8e96a6ce33002b663
Cleaned up sets LO.

diff -r d6787f9e4740 -r c193744340ba sets/script.rst
--- a/sets/script.rst	Tue Nov 09 16:51:41 2010 +0530
+++ b/sets/script.rst	Tue Nov 09 17:15:24 2010 +0530
@@ -22,15 +22,15 @@
 Script
 ------
 
-Hello friends and welcome to the tutorial on Sets
+{{{ Show the slide containing title }}}
 
-{{{ Show the slide containing title }}}
+Hello friends and welcome to the tutorial on Sets
 
 {{{ Show the slide containing the outline slide }}}
 
 In this tutorial, we shall learn
 
- * sets
+ * sets 
  * operations on sets
 
 Sets are data structures which contain unique elements. In other words,
@@ -40,7 +40,7 @@
 type
 ::
  
-    a_list = [1, 2, 1, 4, 5, 6, 7]
+    a_list = [1, 2, 1, 4, 5, 6, 2]
     a = set(a_list)
     a
      
@@ -55,7 +55,7 @@
 p10 is the set of prime numbers from 1 to 10.
 
 Various operations that we do on sets are possible here also.
-The | character stands for union
+The | (pipe) character stands for union
 ::
 
     f10 | p10
@@ -89,19 +89,19 @@
     b = set([1, 2])
     b < f10
 
-gives a True since b is a proper subset of f10.
+gives a ``True`` since b is a proper subset of f10.
 Similarly,
 ::
 
     f10 < f10
 
-gives a False since f10 is not a proper subset.
+gives a ``False`` since f10 is not a proper subset.
 hence the right way to do would be
 ::
 
     f10 <= f10
 
-and we get a True since every set is a subset of itself.
+and we get a ``True`` since every set is a subset of itself.
 
 Sets can be iterated upon just like lists and tuples. 
 ::
@@ -122,7 +122,7 @@
     1 in f10
     2 in f10
 
-prints True and False respectively
+prints ``True`` and ``False`` respectively
 
 The order in which elements are organised in a set is not to be relied upon 
 since sets do not support indexing. Hence, slicing and striding are not valid
@@ -161,7 +161,6 @@
 
 {{{ Show the "sponsored by FOSSEE" slide }}}
 
-#[Nishanth]: Will add this line after all of us fix on one.
 This tutorial was created as a part of FOSSEE project, NME ICT, MHRD India
 
 Hope you have enjoyed and found it useful.
diff -r d6787f9e4740 -r c193744340ba sets/slides.org
--- a/sets/slides.org	Tue Nov 09 16:51:41 2010 +0530
+++ b/sets/slides.org	Tue Nov 09 17:15:24 2010 +0530
@@ -43,8 +43,10 @@
     for mark in marks_set:
         marks.remove(mark)
     
-    # we are now left with only duplicates in the list marks
+    # we are now left with only duplicates
+    # in the list marks
     duplicates = set(marks)
+        
   #+end_src
 * Summary
   You should now be able to --
diff -r d6787f9e4740 -r c193744340ba sets/slides.tex
--- a/sets/slides.tex	Tue Nov 09 16:51:41 2010 +0530
+++ b/sets/slides.tex	Tue Nov 09 17:15:24 2010 +0530
@@ -1,4 +1,4 @@
-% Created 2010-10-10 Sun 23:53
+% Created 2010-11-09 Tue 17:14
 \documentclass[presentation]{beamer}
 \usepackage[latin1]{inputenc}
 \usepackage[T1]{fontenc}
@@ -67,7 +67,8 @@
 for mark in marks_set:
     marks.remove(mark)
 
-# we are now left with only duplicates in the list marks
+# we are now left with only duplicates
+# in the list marks
 duplicates = set(marks)
 \end{lstlisting}
 \end{frame}