Precourse1_solution

Exercise_1.java

@@ -1,35 +1,62 @@
 class Stack { 
     //Please read sample.java file before starting.
   //Kindly include Time and Space complexity at top of each file
+  //timecomplexity
+  //isEmpty() ->O(1)
+  //push()->O(1)
+  //pop()->O(1)
+  //peek()->O(1)
+  //Spece Complexity: O(MAX)
     static final int MAX = 1000; 
     int top; 
     int a[] = new int[MAX]; // Maximum size of Stack 
 
     boolean isEmpty() 
     { 
         //Write your code here 
+        return(top < 0);
     } 
 
     Stack() 
     { 
         //Initialize your constructor 
+        top = -1; //stack is empty
     } 
 
     boolean push(int x) 
     { 
         //Check for stack Overflow
         //Write your code here
+        //push : first increment top then store value
+        if(top >= MAX-1){
+            System.out.println("Stack is overflow");
+            return false;
+        }else{
+            a[++top] = x;
+            return true;
+        }
     } 
 
     int pop() 
     { 
         //If empty return 0 and print " Stack Underflow"
         //Write your code here
+        if(isEmpty()){
+            System.out.println("Stack underflow");
+            return 0;
+        }else{
+            return a[top--];
+        }
     } 
 
     int peek() 
     { 
-        //Write your code here
+        if(isEmpty()){
+            System.out.println("Stack underflow");
+            return 0;
+        }else{
+            return a[top];
+        }
     } 
 } 
 

Exercise_2.java

@@ -1,52 +1,64 @@
-public class StackAsLinkedList { 
-
-    StackNode root; 
-
-    static class StackNode { 
-        int data; 
-        StackNode next; 
-
-        StackNode(int data) 
-        { 
-            //Constructor here 
-        } 
-    } 
-
-
-    public boolean isEmpty() 
-    { 
-        //Write your code here for the condition if stack is empty. 
-    } 
-
-    public void push(int data) 
-    { 
-        //Write code to push data to the stack. 
-    } 
-
-    public int pop() 
-    { 	
-	//If Stack Empty Return 0 and print "Stack Underflow"
-        //Write code to pop the topmost element of stack.
-	//Also return the popped element 
-    } 
-
-    public int peek() 
-    { 
-        //Write code to just return the topmost element without removing it.
-    } 
-
-	//Driver code
-    public static void main(String[] args) 
-    { 
-
-        StackAsLinkedList sll = new StackAsLinkedList(); 
-
-        sll.push(10); 
-        sll.push(20); 
-        sll.push(30); 
-
-        System.out.println(sll.pop() + " popped from stack"); 
-
-        System.out.println("Top element is " + sll.peek()); 
-    } 
-} 
+public class Exercise_2 {
+
+    // Time Complexity:
+    // isEmpty() -> O(1)
+    // push()    -> O(1)
+    // pop()     -> O(1)
+    // peek()    -> O(1)
+    //
+    // Space Complexity:
+    // O(n)
+
+    StackNode root;
+
+    static class StackNode {
+        int data;
+        StackNode next;
+
+        StackNode(int data) {
+            this.data = data;
+            this.next = null;
+        }
+    }
+
+    public boolean isEmpty() {
+        return root == null;
+    }
+
+    public void push(int data) {
+        StackNode newNode = new StackNode(data);
+        newNode.next = root;
+        root = newNode;
+    }
+
+    public int pop() {
+        if (isEmpty()) {
+            System.out.println("Stack Underflow");
+            return 0;
+        }
+
+        int popped = root.data;
+        root = root.next;
+        return popped;
+    }
+
+    public int peek() {
+        if (isEmpty()) {
+            System.out.println("Stack Underflow");
+            return 0;
+        }
+
+        return root.data;
+    }
+
+    public static void main(String[] args) {
+        Exercise_2 sll = new Exercise_2();
+
+        sll.push(10);
+        sll.push(20);
+        sll.push(30);
+
+        System.out.println(sll.pop() + " popped from stack");
+        System.out.println("Top element is " + sll.peek());
+    }
+}

Exercise_3.java

@@ -1,70 +1,63 @@
-import java.io.*; 
-
-// Java program to implement 
-// a Singly Linked List 
-public class LinkedList { 
-
-    Node head; // head of list 
-
-    // Linked list Node. 
-    // This inner class is made static 
-    // so that main() can access it 
-    static class Node { 
-
-        int data; 
-        Node next; 
-
-        // Constructor 
-        Node(int d) 
-        { 
-            //Write your code here 
-        } 
-    } 
-
-    // Method to insert a new node 
-    public static LinkedList insert(LinkedList list, int data) 
-    { 
-        // Create a new node with given data 
-
-        // If the Linked List is empty, 
-        // then make the new node as head 
-
-            // Else traverse till the last node 
-            // and insert the new_node there 
+import java.io.*;
 
-            // Insert the new_node at last node 
-        // Return the list by head 
-
-    } 
-
-    // Method to print the LinkedList. 
-    public static void printList(LinkedList list) 
-    {  
-        // Traverse through the LinkedList 
-
-            // Print the data at current node 
-
-            // Go to next node 
-    } 
-
-    // Driver code 
-    public static void main(String[] args) 
-    { 
-        /* Start with the empty list. */
-        LinkedList list = new LinkedList(); 
-
-        // 
-        // ******INSERTION****** 
-        // 
-
-        // Insert the values 
-        list = insert(list, 1); 
-        list = insert(list, 2); 
-        list = insert(list, 3); 
-        list = insert(list, 4); 
-        list = insert(list, 5); 
-
-        // Print the LinkedList 
-        printList(list); 
-    } 
+// Time Complexity:
+// insert()    -> O(n)
+// printList() -> O(n)
+//
+// Space Complexity:
+// O(n)
+
+public class Exercise_3 {
+
+    Node head; // head of list
+
+    static class Node {
+        int data;
+        Node next;
+
+        Node(int d) {
+            this.data = d;
+            this.next = null;
+        }
+    }
+
+    // Method to insert a new node
+    public static Exercise_3 insert(Exercise_3 list, int data) {
+        Node new_node = new Node(data);
+
+        if (list.head == null) {
+            list.head = new_node;
+        } else {
+            Node last = list.head;
+            while (last.next != null) {
+                last = last.next;
+            }
+            last.next = new_node;
+        }
+
+        return list;
+    }
+
+    // Method to print the LinkedList
+    public static void printList(Exercise_3 list) {
+        Node currNode = list.head;
+
+        while (currNode != null) {
+            System.out.print(currNode.data + " ");
+            currNode = currNode.next;
+        }
+    }
+
+    // Driver code
+    public static void main(String[] args) {
+        Exercise_3 list = new Exercise_3();
+
+        list = insert(list, 1);
+        list = insert(list, 2);
+        list = insert(list, 3);
+        list = insert(list, 4);
+        list = insert(list, 5);
+
+        printList(list);
+    }
 }