Program 1 // Program to Convert infix to Postfix #include<iostream> #include<ctype.h> #define clrscr() system(“cls”) using namespace std; char stack[50]; int top = -1; void push(char ch) { stack[++top] = ch; } char pop() {...
Program 1 // Stack Implementation #include<iostream> #define MAXSIZE 10 using namespace std; class Stack { private: int stack[MAXSIZE]; int top; public: Stack() { top=-1; } void push(); void pop(); void display(); }; void Stack::push()...
Program 1 //Friend Recommendation System in Social Media using graphs //System that recommends new friends to users in a social network by analyzing their mutual friends /* Features 1. Add user 2. Create Friendship...
Program 1 //Project Title: City Map Navigation using Graphs /* Objective: To build a simple navigation system that finds the shortest path between a source city and all other cities using Dijkstra’s Algorithm —...
Program 1 // Project: Family Tree Builder (Based on BT and Linked list) /* Objective: To create a basic system that allows users to build, manage, and explore a family tree structure, where each...
Program 1 // Project: Traffic Light Simulation Using Queue Linked List //———————————————————- // Features: // Add vehicles to queue (simulating arrival) // Process vehicles when the signal turns green // Show vehicles in the...
Program 1 // Project: Restaurant Order Processing System(Based on Doubly linked list and DQUEUE) /* Features: 1. Add order at the end of the queue (new order) 2. Serve the first order (remove from...
Program 1 // Project — Movie Ticket Booking System (2D Array) #include <iostream> #include <string> using namespace std; const int ROWS = 5; const int COLS = 10; class Seat { public: bool booked;...
Program 1 // Music Play List Based on Duobly Linked List #include <iostream> #include <string> using namespace std; // Node representing a song struct Song { Song* prev; string title; Song* next; //Song(string t)...
Program 1 // TO DO List Project Based on Linked List #include <iostream> #include <string> using namespace std; struct Task { int id; string description; bool completed; Task* next; // Task(int id, const string&...
