Add files via upload

Author: AdityaSeth777

18 - Queues and Stacks/Soln_Queue.c

@@ -0,0 +1,85 @@
+#include <stdio.h>
+#define MAX 50
+
+void insert();
+void delete();
+void display();
+
+int queue_array[MAX];
+int rear = - 1;
+int front = - 1;
+//Aditya Seth
+int main(){
+    int choice;
+    while (1){
+        printf("1.Insert element to queue. \n");
+        printf("2.Delete element from queue. \n");
+        printf("3.Display all elements of queue. \n");
+        printf("4.Quit. \n");
+        printf("Enter your choice : ");
+        scanf("%d", &choice);
+
+        switch (choice){
+
+            case 1:
+                insert();
+                break;
+
+            case 2:
+                delete();
+                break;
+
+            case 3:
+                display();
+                break;
+
+            case 4:
+                exit(1);
+
+            default:
+                printf("Wrong choice. \n");
+
+        } 
+    }
+ return 0;
+} 
+
+void insert(){
+    int add_item;
+    if (rear == MAX - 1)
+    printf("Queue Overflow. \n");
+
+    else{
+
+        if (front == - 1)
+        front = 0;
+        printf("Inset the element in queue : ");
+        scanf("%d", &add_item);
+        rear = rear + 1;
+        queue_array[rear] = add_item;
+    }
+} 
+
+void delete(){
+    if (front == - 1 || front > rear){
+        printf("Queue Underflow. \n");
+        return ;
+    }
+    else{
+        printf("Element deleted from queue is : %d\n", queue_array[front]);
+        front = front + 1;
+    }
+} 
+ 
+void display(){
+    int i;
+    if (front == - 1)
+        printf("Queue is empty. \n");
+    else
+    {
+        printf("Queue is : \n");
+        for (i = front; i <= rear; i++)
+            printf("%d ", queue_array[i]);
+        printf("\n");
+    }
+}

18 - Queues and Stacks/Soln_Stacks.c

@@ -0,0 +1,72 @@
+#include <stdio.h>
+#include <conio.h>
+int ch, n, x, top = -1, i, stack[100];
+void push();
+void pop();
+void display();
+//Aditya Seth
+int main()
+{
+	printf("Enter Number:\n");
+	scanf("%d", &n);
+	do
+	{
+		printf("1. Push\n 2. Pop\n 3. Display\n 4. Exit\n");
+		scanf("%d", &ch);
+		switch (ch)
+		{
+		case 1:
+			push();
+			break;
+		case 2:
+			pop();
+		case 3:
+			display();
+			break;
+		case 4:
+			printf("bye:\n");
+			break;
+		default:
+			printf("wrong choice. \n");
+		}
+	} while (ch != 4);
+	return 0;
+}
+
+void push()
+{
+	if (top == n - 1)
+	{
+		printf("Full\n");
+	}
+	else
+	{
+		printf("Enter elements: \n");
+		scanf("%d", &x);
+		top++;
+		stack[top] = x;
+	}
+}
+
+void pop()
+{
+	if (top == -1)
+	{
+		top--;
+		x = stack[top];
+	}
+	else
+	{
+		printf("Empty\n");
+	}
+}
+void display()
+{
+	if (top > 0)
+	{
+		for (i = 0; i < top; i++)
+		{
+			printf("%d", stack[i]);
+		}
+	}
+}

18 - Queues and Stacks/Solution.cpp

@@ -0,0 +1,63 @@
+#include <iostream>
+#include <queue>
+#include <stack>
+
+using namespace std;
+
+class Solution {
+private:
+    queue<char> q;
+    stack<char> s;
+
+public:
+    char popCharacter() {
+        char tmp = s.top();
+        s.pop();
+        return tmp;
+    }
+
+    void pushCharacter(char ch) {
+        s.push(ch);
+    }
+
+    char dequeueCharacter() {
+        char tmp = q.front();
+        q.pop();
+        return tmp;
+    }
+
+    void enqueueCharacter(char ch) {
+        q.push(ch);
+    }
+};
+
+int main() {
+
+    string s;
+    getline(cin, s);
+    //Aditya Seth
+    Solution obj;
+
+    for (int i = 0; i < s.length(); i++) {
+        obj.pushCharacter(s[i]);
+        obj.enqueueCharacter(s[i]);
+    }
+
+    bool isPalindrome = true;
+
+    for (int i = 0; i < s.length() / 2; i++) {
+        if (obj.popCharacter() != obj.dequeueCharacter()) {
+            isPalindrome = false;
+
+            break;
+        }
+    }
+
+    if (isPalindrome) {
+        cout << "The word, " << s << ", is a palindrome.";
+    } else {
+        cout << "The word, " << s << ", is not a palindrome.";
+    }
+
+    return 0;
+}

18 - Queues and Stacks/Solution.py

@@ -0,0 +1,46 @@
+class Solution:
+    def __init__(self):
+        self.stack = []
+        self.queue = []
+
+    def popCharacter(self):
+        return self.stack.pop()
+
+    def pushCharacter(self, char):
+        self.stack.append(char)
+
+    def dequeueCharacter(self):
+        char = self.queue[0]
+        self.queue = self.queue[1:]
+        return char
+
+    def enqueueCharacter(self, char):
+        self.queue.append(char)
+
+#Aditya Seth
+
+s = input()
+
+obj = Solution()
+
+l = len(s)
+
+for i in range(l):
+    obj.pushCharacter(s[i])
+    obj.enqueueCharacter(s[i])
+
+isPalindrome = True
+'''
+pop the top character from stack
+dequeue the first character from queue
+compare both the characters
+'''
+for i in range(l // 2):
+    if obj.popCharacter() != obj.dequeueCharacter():
+        isPalindrome = False
+        break
+
+if isPalindrome:
+    print("The word, " + s + ", is a palindrome.")
+else:
+    print("The word, " + s + ", is not a palindrome.")

18 - Queues and Stacks/Solution.rb

@@ -0,0 +1,46 @@
+class Solution
+    def initialize
+        @queue = Queue.new
+        @stack = []
+    end
+
+    def push_character(char)
+        @stack << char
+    end
+    def pop_character
+        @stack.pop
+    end
+    def enqueue_character(char)
+        @queue << char
+    end
+    def dequeue_character
+        @queue.pop
+    end
+end
+
+solution = Solution.new
+
+input = gets
+
+input.split('').each do |c|
+
+    solution.push_character c
+    
+    solution.enqueue_character c
+end
+
+is_palindrome = true
+
+(input.length / 2).times do
+    if solution.pop_character != solution.dequeue_character
+        is_palindrome = false
+        break
+    end
+end
+
+
+if is_palindrome
+    puts "The word, #{input}, is a palindrome."
+else
+    puts "The word, #{input}, is not a palindrome."
+end