<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Replit.cpp on vhmp.dev</title><link>https://vhmp.dev/programming/teaching/replit-cpp/</link><description>Recent content in Replit.cpp on vhmp.dev</description><generator>Hugo</generator><language>en-us</language><copyright>© 2026 Vu Huy Minh Pham · Text: [CC BY 4.0](https://creativecommons.org/licenses/by/4.0/legalcode) · Code: [MIT](https://mit-license.org/)</copyright><atom:link href="https://vhmp.dev/programming/teaching/replit-cpp/index.xml" rel="self" type="application/rss+xml"/><item><title>Stack (WIP)</title><link>https://vhmp.dev/programming/teaching/replit-cpp/stack/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://vhmp.dev/programming/teaching/replit-cpp/stack/</guid><description>&lt;h2 id="what-is-a-stack"&gt;What is a Stack?&lt;a class="anchor" href="#what-is-a-stack"&gt;&lt;/a&gt;&lt;/h2&gt;&#10;&lt;p&gt;Stack is an abstract data type that collects data.&#10;The basic operation contract for this project details: O(1) for push, pop, peek.&#10;The student will decide the backing data structure on his own. Possible options are: singly linked list, dynamic array.&lt;/p&gt;&#10;&lt;blockquote class='book-hint tip'&gt;&#10;&lt;p&gt;&lt;strong&gt;What kind of Stack?&lt;/strong&gt;&lt;/p&gt;&#10;&lt;p&gt;In this project, we&amp;rsquo;re making a Stack abstract data type that stores only integers.&lt;/p&gt;&lt;/blockquote&gt;&lt;h2 id="prerequisites"&gt;Prerequisites&lt;a class="anchor" href="#prerequisites"&gt;&lt;/a&gt;&lt;/h2&gt;&#10;&lt;p&gt;The student has to know how to write a class that will own a data structure that deals with allocation on the free store or heap. They should obviously know pointers and follow the rule of three. If they wish to implement the move assignment operator or the move constructor then that would be fulfill the move of 5 and make memory more efficient.&lt;/p&gt;</description></item></channel></rss>