<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>MKS1083 by Ramlah Mailok</title>
      <link>https://padlet.com/ramlahmailok/MKS1083-soalan</link>
      <description>Soalan tutorial</description>
      <language>en-us</language>
      <pubDate>2015-07-28 05:25:26 UTC</pubDate>
      <lastBuildDate>2026-03-07 21:07:26 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>Soalan- Ramlah Mailok</title>
         <author>ramlahmailok</author>
         <link>https://padlet.com/ramlahmailok/MKS1083-soalan/wish/65096855</link>
         <description><![CDATA[<p>Perbincangan dalam kelas Jumaat ini</p><p>1.&nbsp;
Describe the output for the following sequence of
stack operations:</p>
<p>Push(5), push(3), pop(), push(8), pop(),
pop(), push(9), push(1), pop(), push(7), push(6), pop(), push(4), pop(), pop()</p>
2.&nbsp;
Give a recursive method for removing all the elements
in a stack

<p>3. Convert to infix</p><p>i.    2 4 5 * +

</p><p>ii.  2&nbsp; 4 +&nbsp; 7 * 3 9 5 - * + </p>4. Define this node<br><br><br>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/51495926/3e23d52a01d7eec3bec4567f032d9f0871f56c58/717fb86b8f9c47852680174c8f9fe343.jpg" />
         <pubDate>2015-07-29 08:03:56 UTC</pubDate>
         <guid>https://padlet.com/ramlahmailok/MKS1083-soalan/wish/65096855</guid>
      </item>
   </channel>
</rss>
