done

Author: Ashutosh Trivedi

lec06/program33-m.cpp

@@ -4,17 +4,18 @@ using namespace std;
 
 int main(int argc, char* argv[]) {
   int x = 7;
+  
   //int& y; // error
   //int& y = 7; // error
   int& y = x; // once and for all bound to x
 
   cout << "x = " << x << " Add of x:" << &x << endl;
-  cout << "y = " << x << " Add of y: " << &y << endl;
+  cout << "y = " << y << " Add of y: " << &y << endl;
 
   y++;
 
   cout << "x = " << x << " Add of x:" << &x << endl;
-  cout << "y = " << x << " Add of y: " << &y << endl;
+  cout << "y = " << y << " Add of y: " << &y << endl;
 
   return 0;
 }

lec08/a.out

@@ -0,0 +1,14 @@
+#include<iostream>
+#include "second.hpp"
+
+using namespace std;
+
+
+int main() {
+
+cout << " Inside main" << endl;
+foo();
+
+return 0;
+
+}

lec08/fancy

@@ -0,0 +1,7 @@
+#include<iostream>
+using namespace std;
+
+void foo() {
+    cout << "Inside function foo()" << endl;
+
+}

lec08/first.cpp

@@ -0,0 +1,12 @@
+#ifndef __SECOND_HPP__
+#define __SECOND_HPP__
+
+// declaring function foo
+void foo();
+static int x = 0;
+
+
+
+
+
+#endif // __SECOND_HPP__

lec08/first.o

@@ -0,0 +1,3 @@
+#include<iostream>
+#include "LinkedList.hpp"
+

lec08/second.cpp

@@ -0,0 +1,21 @@
+#ifndef __LINKEDLIST_HPP__
+#define __LINKEDLIST_HPP__
+
+// Define data-type of a single node
+struct Node {
+    int data; // value of the current node
+    Node* next; // address of the next node
+};
+
+class LinkedList {
+    private:
+        Node* head;
+        Node* tail;
+    public: 
+        LinkedList();
+        ~LinkedList();
+        void traverse();
+
+}
+
+#endif /* __LINKEDLIST_HPP__*/

lec08/second.hpp

@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+
+struct Node {
+    int value;
+    Node* next;
+};
+int main() {
+
+    Node* tmp = new Node();
+    (*tmp).value = 20; 
+    (*tmp).next=0;
+
+    Node* tmp2 = new Node();
+    tmp2->value = 30; 
+    tmp2->next= tmp;
+
+    Node* tmp3 = new Node();
+    tmp3->value = 40; 
+    tmp3->next= tmp2;
+
+    Node* head = tmp3;
+    while (head != 0) {
+        cout << head->value << " ";
+        head = head->next;
+    }
+    cout << endl;
+
+
+    return 0;
+
+}

lec08/second.o

@@ -0,0 +1,64 @@
+#include<iostream>
+#include "LinkedList.hpp"
+using namespace std;
+
+LinkedList::LinkedList() {
+    head = 0;
+    tail = 0;   
+}
+    
+LinkedList::~LinkedList() {
+
+    for (Node* curr = head; curr !=0;) {  
+        Node* tmp = curr->next;
+        delete curr;
+        curr = tmp;
+    }
+
+    head = 0;
+    tail = 0;
+
+}
+
+void LinkedList::traverse() {
+    cout << "[ ";
+    for (Node* tmp = head; tmp != 0; tmp = tmp->next) {
+        cout << tmp->data << " ";
+    }
+    cout << "]" << endl;
+}
+
+Node* LinkedList::search(int item) {
+
+    for (Node* tmp = head; tmp != 0; tmp = tmp->next) {
+        if (tmp->data == item) return tmp;
+    }
+
+    return 0;
+}
+
+void LinkedList::insert(Node* left, int item) {
+    Node* tmp = new Node(item, 0);
+
+    if (left == 0) {
+        tmp->next = head;
+        head = tmp;
+        if (tail == 0) tail = head;
+    }
+    else if (left == tail) {
+        tail->next = tmp;
+        tail = tmp;    
+    }
+    else {
+
+    }
+
+
+    return;    
+}
+
+void LinkedList::remove(Node* pos) {
+    
+    
+    return;
+   }

lec09/LinkedList.cpp

@@ -0,0 +1,30 @@
+#ifndef __LINKEDLIST_HPP__
+#define __LINKEDLIST_HPP__
+
+// Define data-type of a single node
+struct Node {
+    int data; // value of the current node
+    Node* next; // address of the next node
+
+    Node() {next = 0;}
+    Node(int d, Node* n) {data = d; next = n;}
+};
+
+class LinkedList {
+    private:
+        Node* head;
+        Node* tail;
+    
+    public: 
+        LinkedList();
+        ~LinkedList();
+        void traverse();
+        Node* search(int item);
+ 
+        void insert(Node* left, int item); // precondition: left is in the list
+ 
+        void remove(Node* pos); // precondition: pos is in the list
+
+};
+
+#endif /* __LINKEDLIST_HPP__*/

lec09/LinkedList.hpp

@@ -0,0 +1,8 @@
+all: main.o LinkedList.o
+	g++ -o lists main.o LinkedList.o
+main.o: main.cpp LinkedList.hpp
+	g++ -c main.cpp 
+LinkedList.o: LinkedList.cpp LinkedList.hpp
+	g++ -c LinkedList.cpp
+clean: 
+	rm -rf lists main.o LinkedList.o 

lec09/a.out

@@ -0,0 +1,65 @@
+#include<iostream>
+using namespace std;
+// Fun with Array Doubling
+
+//passing array normally 
+void double1(int* C, int size);
+
+//passing array by Reference 
+void double2(int* &A, int size);
+
+//passing array by pointer
+void double3(int* *A, int size);
+
+int main() {
+    int* A = new int[2];
+    A[0] = 22;
+    A[1] = 33;
+ 
+    cout << "Address of A (before):" << A << endl;
+    double1(A, 2);
+    // double2(A, 2);
+    // double3(&A, 2);
+    cout << "Address of A (after):" << A << endl;
+
+    for (int i=0; i<4; i++) cout << A[i] << " ";
+    cout << endl;
+    
+    return 0;
+}
+
+void double1(int* A, int size) {
+    int* B = new int[2*size];
+    cout << "Address of B:" << B << endl;
+    A[1] = 55;
+    for (int i=0; i < size; i++) B[i] = A[i];
+
+    delete[] A;
+    A = B;
+
+    return;
+}
+
+void double2(int* &A, int size) {
+    int* B = new int[2*size];
+    cout << "Address of B:" << B << endl;
+
+    for (int i=0; i < size; i++) B[i] = A[i];
+
+    delete[] A;
+    A = B;
+
+    return;
+}
+
+void double3(int* *A, int size) {
+    int* B = new int[2*size];
+    cout << "Address of B:" << B << endl;
+    
+    for (int i=0; i < size; i++) B[i] = (*A)[i];
+    
+    delete[] *A;
+    *A = B;
+
+    return;
+}

lec09/main.cpp

@@ -0,0 +1,77 @@
+#include<iostream>
+#include "LinkedList.hpp"
+using namespace std;
+
+LinkedList::LinkedList() {
+    head = 0;
+    tail = 0;   
+}
+    
+LinkedList::~LinkedList() {
+    for (Node* tmp = head; tmp != 0; tmp = tmp->next) {
+        delete tmp;
+    }
+    head = 0;
+    tail = 0;
+}
+
+void LinkedList::traverse() {
+    cout << "[ ";
+    for (Node* tmp = head; tmp != 0; tmp = tmp->next) {
+        cout << tmp->data << " ";
+    }
+    cout << "]" << endl;
+}
+
+Node* LinkedList::search(int item) {
+
+    for (Node* tmp = head; tmp != 0; tmp = tmp->next) {
+        if (tmp->data == item) return tmp;
+    }
+
+    return 0;
+}
+
+void LinkedList::insert(Node* left, int item) {
+    Node* tmp = new Node(item, 0);
+
+    if (left == 0) { //insert at the head
+        tmp->next = head;
+        head = tmp;
+    }
+    else if (left == tail) { //insert at the tail
+        left->next = tmp;
+        tail = tmp;
+    }
+    else { //insert in the middle
+        tmp->next = left->next;
+        left->next = tmp; 
+    }
+
+    return;    
+}
+
+void LinkedList::remove(Node* pos) {
+    Node* prev = 0;
+    
+    for (Node* curr = head; curr != 0; prev = curr, curr = curr->next) {
+        if (curr == pos) {
+            if (prev == 0) { // delete the head node
+                if (head->next != 0) head = head->next;
+                else {
+                    head = 0;
+                    tail = 0;
+                }
+                delete pos;
+            }
+            else { // delete middle or last node
+                prev->next = curr->next;
+                delete pos;
+                if (prev->next == 0) {
+                    tail = prev;
+                }
+            }
+        }
+    }
+    return;
+   }