<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Programming Concepts (PRCO) by ISC all users</title>
      <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v</link>
      <description>Module Map</description>
      <language>en-us</language>
      <pubDate>2022-01-19 13:52:07 UTC</pubDate>
      <lastBuildDate>2022-01-19 14:12:42 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>Introduction to Algorithms</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000452863</link>
         <description><![CDATA[<ul><li>Control Structures</li><li>Combining Control Structures, Example:&nbsp;<ul><li>Bubble Sort</li><li>Flowcharts</li><li>Modular design with Procedures/Subroutines</li><li>Recursion structures&nbsp;</li></ul></li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 13:59:39 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000452863</guid>
      </item>
      <item>
         <title>Introduction to Data Structures</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000468613</link>
         <description><![CDATA[<ul><li>Data Types and Data Structures</li><li>Variables</li><li>Lists</li><li>Arrays</li><li>Queues</li><li>Stacks</li><li>Trees, Example:&nbsp;<ul><li>Tree Sort</li></ul></li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:05:39 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000468613</guid>
      </item>
      <item>
         <title>Problem Solving Techniques</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000470388</link>
         <description><![CDATA[<ul><li>Polya’s problem solving techniques applied to algorithm design</li><li>Top Down Methodology including:&nbsp;<ul><li>breaking a problem into sub-problems</li><li>choosing a suitable data structure</li><li>construction of loops</li><li>establishing initial conditions for loops</li><li>finding the iterative construct, and termination of loops</li></ul></li><li>Bottom Up Methodology</li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:06:23 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000470388</guid>
      </item>
      <item>
         <title>The use of iterative structures to solve problems</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000472904</link>
         <description><![CDATA[<div>Learning to use iterative structures to design the following example algorithms:&nbsp;</div><ul><li>Sequential Search</li><li>Insertion Sort</li><li>Selection Sort</li><li>Bubble Sort</li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:07:22 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000472904</guid>
      </item>
      <item>
         <title>The use of recursive structures to solve problems</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000474417</link>
         <description><![CDATA[<ul><li>Linear Recursion</li><li>Binary Recursion</li><li>Non-linear Recursion</li><li>Mutual Recursion, Examples:&nbsp;<ul><li>Binary Search</li><li>Binary Tree Traversal</li><li>Recursive Quick Sort</li></ul></li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:07:57 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000474417</guid>
      </item>
      <item>
         <title>Propositional Calculus</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000475306</link>
         <description><![CDATA[<ul><li>Logical Form and Logical Equivalences</li><li>Conditional Statements</li><li>Valid and Invalid arguments</li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:08:15 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000475306</guid>
      </item>
      <item>
         <title>Predicate Calculus</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000476093</link>
         <description><![CDATA[<ul><li>Introduction to Predicates and Quantified Statements</li><li>Statements containing Multiple Quantifiers</li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:08:33 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000476093</guid>
      </item>
      <item>
         <title>Predicate Calculus, Proof Techniques</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000482734</link>
         <description><![CDATA[<ul><li>Arguments with quantified statements</li><li>Proof of correctness of algorithms with assertions</li><li>Assignment rule and Conditional rule</li><li>General proof Techniques including:&nbsp;</li><li>Exhaustive proof</li><li>Direct proof</li><li>Contraposition, and Contradiction</li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:10:58 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000482734</guid>
      </item>
      <item>
         <title>Proof Techniques, Recursive Definitions</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000483774</link>
         <description><![CDATA[<div>Using induction to prove loop rule, Example:&nbsp;</div><ul><li>Euclidean Algorithm</li><li>Recursively Defined Sequences</li><li>Recursively Defined Sets</li><li>Recursively defined operations</li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:11:23 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000483774</guid>
      </item>
      <item>
         <title>Recurrence relations, Analysis of Algorithm Efficiency</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000485818</link>
         <description><![CDATA[<ul><li>Linear First Order Recurrence Relations</li><li>Linear Second-order Relations</li><li>Divide-and-Conquer Recurrence Relations</li><li>Real valued functions of a real variable and their graphs</li><li>Big-O</li><li>Big-Omega and Big-Theta notations</li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:12:09 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000485818</guid>
      </item>
      <item>
         <title>Analysis of Algorithm Efficiency</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000486594</link>
         <description><![CDATA[<ul><li>Time efficiency of Sequential Sort, Insertion Sort,&nbsp;</li><li>Exponential and Logarithmic Functions: their Graphs and Orders, Application to Binary Search, Merge Sort algorithms</li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:12:28 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000486594</guid>
      </item>
      <item>
         <title>Consolidation</title>
         <author>sussex_isc1</author>
         <link>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000487194</link>
         <description><![CDATA[<div>Review and consolidation of the module content</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-19 14:12:42 UTC</pubDate>
         <guid>https://padlet.com/sussex_isc1/mpaq61dbgubssu3v/wish/2000487194</guid>
      </item>
   </channel>
</rss>
