

<feed xmlns="http://www.w3.org/2005/Atom">
  <id>https://225-mt-prep-chirpy-16186868686186168.pages.dev//</id>
  <title>CMPT 225 Midterm 1 Prep</title>
  <subtitle>Preparing for Midterm 1 in SFU Burnaby. Could be hard.</subtitle>
  <updated>2023-06-15T18:35:04-07:00</updated>
  <author>
    <name>ENTPRESTIGIOUS</name>
    <uri>https://225-mt-prep-chirpy-16186868686186168.pages.dev//</uri>
  </author>
  <link rel="self" type="application/atom+xml" href="https://225-mt-prep-chirpy-16186868686186168.pages.dev//feed.xml"/>
  <link rel="alternate" type="text/html" hreflang="en"
    href="https://225-mt-prep-chirpy-16186868686186168.pages.dev//"/>
  <generator uri="https://jekyllrb.com/" version="4.3.2">Jekyll</generator>
  <rights> © 2023 ENTPRESTIGIOUS </rights>
  <icon>/assets/img/favicons/favicon.ico</icon>
  <logo>/assets/img/favicons/favicon-96x96.png</logo>


  
  <entry>
    <title>sumQueue.cpp</title>
    <link href="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/sumQueue/" rel="alternate" type="text/html" title="sumQueue.cpp" />
    <published>2023-06-15T18:30:00-07:00</published>
  
    <updated>2023-06-15T18:30:00-07:00</updated>
  
    <id>https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/sumQueue/</id>
    <content src="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/sumQueue/" />
    <author>
      <name>ENTPRESTIGIOUS</name>
    </author>

  
    
    <category term="Practice Midterm" />
    
  

  
    <summary>
      





      sumQueue.cpp
This is from the practice midterm.

Go Back


#include &amp;lt;iostream&amp;gt;

using namespace std;

class Queue{
    private:

    public:

        struct node{
            int data;
            node* next;
        };

        node* head = nullptr;

        node* current = nullptr;

        Queue(){

        }

        Queue(int a){
            enqueue(a);
        }

        void enqueu...
    </summary>
  

  </entry>

  
  <entry>
    <title>copying.cpp</title>
    <link href="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/Copying/" rel="alternate" type="text/html" title="copying.cpp" />
    <published>2023-06-15T18:14:00-07:00</published>
  
    <updated>2023-06-15T18:14:00-07:00</updated>
  
    <id>https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/Copying/</id>
    <content src="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/Copying/" />
    <author>
      <name>ENTPRESTIGIOUS</name>
    </author>

  
    
    <category term="Practice Midterm" />
    
  

  
    <summary>
      





      copying.cpp
This is from the practice midterm.

Go Back


#include &amp;lt;iostream&amp;gt;

using namespace std;

class LList{
    private:

        struct node{
            int data;
            node* next;
        };

        node* head = nullptr;

        node* current = nullptr;

    public:

        LList(){

        }

        LList(int a){
            push(a);
        }

        void push(int a...
    </summary>
  

  </entry>

  
  <entry>
    <title>tailDeletion.cpp</title>
    <link href="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/tailDeletion/" rel="alternate" type="text/html" title="tailDeletion.cpp" />
    <published>2023-06-15T12:20:00-07:00</published>
  
    <updated>2023-06-15T12:20:00-07:00</updated>
  
    <id>https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/tailDeletion/</id>
    <content src="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/tailDeletion/" />
    <author>
      <name>ENTPRESTIGIOUS</name>
    </author>

  
    
    <category term="Practice Midterm" />
    
  

  
    <summary>
      





      tailDeletion.cpp
This is from the practice midterm.

Go Back


#include &amp;lt;iostream&amp;gt;

using namespace std;

class LList{
    private:
        
        struct node{
            int data;
            node* next;
        };

        node* head = nullptr;

        node* current = nullptr;


    public:

        LList(){

        }

        LList(int a){
            head = new node{a, nullptr};
...
    </summary>
  

  </entry>

  
  <entry>
    <title>queue20.cpp</title>
    <link href="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/queue20/" rel="alternate" type="text/html" title="queue20.cpp" />
    <published>2023-06-15T10:59:00-07:00</published>
  
    <updated>2023-06-15T10:59:00-07:00</updated>
  
    <id>https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/queue20/</id>
    <content src="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/queue20/" />
    <author>
      <name>ENTPRESTIGIOUS</name>
    </author>

  
    
    <category term="W3Resource" />
    
  

  
    <summary>
      





      queue20.cpp
Go Back


// Link to Challenge: https://www.w3resource.com/cpp-exercises/queue/index.php

#include &amp;lt;iostream&amp;gt;
#include &amp;lt;vector&amp;gt;

using namespace std;

class Queue{
    private:

        struct node{
            int data;
            node* next;
        };

        node* head = nullptr;

        node* current = nullptr; // current has to be on the global side
            ...
    </summary>
  

  </entry>

  
  <entry>
    <title>queue12.cpp</title>
    <link href="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/queue12/" rel="alternate" type="text/html" title="queue12.cpp" />
    <published>2023-06-15T10:10:00-07:00</published>
  
    <updated>2023-06-15T10:10:00-07:00</updated>
  
    <id>https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/queue12/</id>
    <content src="https://225-mt-prep-chirpy-16186868686186168.pages.dev//posts/queue12/" />
    <author>
      <name>ENTPRESTIGIOUS</name>
    </author>

  
    
    <category term="W3Resource" />
    
  

  
    <summary>
      





      queue12.cpp
Go Back


// Link to Challenge: https://www.w3resource.com/cpp-exercises/queue/index.php

#include &amp;lt;iostream&amp;gt;
#include &amp;lt;vector&amp;gt;

using namespace std;

class Queue{
    private:

        struct node{
            int data;
            node* next;
        };

        node* head = nullptr;
    public:

        Queue(){

        }

        Queue(std::vector&amp;lt;int&amp;gt; arr){
 ...
    </summary>
  

  </entry>

</feed>


