Projects Inventory – Page 142 – Projects Inventory Management Systems and Source Codes PHP, C#, C, Android and many others

Gaming Project in C++

Leave a Comment / C++ Projects / By Projects Inventory

#include <iostream>
#include <cstdlib>
#include <ctime>

using namespace std;

int main() {
    // Initialize random seed
    srand(static_cast<unsigned>(time(0)));

    // Generate a random number between 1 and 100
    int numberToGuess = rand() % 100 + 1;
    int userGuess = 0;
    int numberOfTries = 0;

    cout << "Welcome to Guess the Number Game!" << endl;
    cout << "I have selected a number between 1 and 100." << endl;
    cout << "Can you guess what it is?" << endl;

    while (userGuess != numberToGuess) {
        cout << "Enter your guess: ";
        cin >> userGuess;
        numberOfTries++;

        if (userGuess > numberToGuess) {
            cout << "Too high! Try again." << endl;
        } else if (userGuess < numberToGuess) {
            cout << "Too low! Try again." << endl;
        } else {
            cout << "Congratulations! You guessed the number in " << numberOfTries << " tries." << endl;
        }
    }

    return 0;
}

#include <iostream>

#include <cstdlib>

#include <ctime>

using namespace std;

int main() {

// Initialize random seed

srand(static_cast<unsigned>(time(0)));

// Generate a random number between 1 and 100

int numberToGuess = rand() % 100 + 1;

int userGuess = 0;

int numberOfTries = 0;

cout << "Welcome to Guess the Number Game!" << endl;

cout << "I have selected a number between 1 and 100." << endl;

cout << "Can you guess what it is?" << endl;

while (userGuess != numberToGuess) {

cout << "Enter your guess: ";

cin >> userGuess;

numberOfTries++;

if (userGuess > numberToGuess) {

cout << "Too high! Try again." << endl;

} else if (userGuess < numberToGuess) {

cout << "Too low! Try again." << endl;

} else {

cout << "Congratulations! You guessed the number in " << numberOfTries << " tries." << endl;

}

return 0;

}

Explanation Initialize Random Seed: srand(static_cast<unsigned>(time(0))); initializes the random number generator with the current time to ensure different sequences of random numbers each time the program runs. Generate Random Number: int numberToGuess = rand() % 100 + 1; generates a random number between 1 and 100 for the player to guess. Game Loop: The loop …

Gaming Project in C++ Read More »

Functional requirements of Project Management System with non-functional

Leave a Comment / Functional Non Functional Requirements of Projects / By Projects Inventory

Functional Requirements Project Planning and Scheduling Allow users to create and define projects, including project objectives, scope, timelines, and deliverables. Provide tools for creating and managing project schedules with tasks, milestones, and dependencies. Support Gantt charts, Kanban boards, and other visual scheduling tools. Task Management Enable task creation, assignment, and tracking within projects. Allow task …

Functional requirements of Project Management System with non-functional Read More »

Maze Solver Gaming Project in C++

Leave a Comment / C++ Projects / By Projects Inventory

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

const int ROW = 5;
const int COL = 5;

// Function to check if a cell is within bounds and not yet visited
bool isValid(int row, int col, vector<vector<int>>& maze, vector<vector<bool>>& visited) {
    return (row >= 0 && row < ROW && col >= 0 && col < COL && maze[row][col] == 0 && !visited[row][col]);
}

// Function to print the solution path
void printPath(const vector<vector<int>>& path) {
    for (const auto& row : path) {
        for (int cell : row) {
            cout << (cell ? '*' : ' ') << ' ';
        }
        cout << endl;
    }
}

// Function to solve the maze using BFS
bool solveMaze(vector<vector<int>>& maze) {
    // Directions for moving in the maze (right, down, left, up)
    vector<pair<int, int>> directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
    
    vector<vector<bool>> visited(ROW, vector<bool>(COL, false));
    vector<vector<int>> path(ROW, vector<int>(COL, 0));

    queue<pair<int, int>> q;
    q.push({0, 0});
    visited[0][0] = true;
    path[0][0] = 1;

    while (!q.empty()) {
        auto [currentRow, currentCol] = q.front();
        q.pop();

        if (currentRow == ROW - 1 && currentCol == COL - 1) {
            printPath(path);
            return true;
        }

        for (const auto& dir : directions) {
            int newRow = currentRow + dir.first;
            int newCol = currentCol + dir.second;

            if (isValid(newRow, newCol, maze, visited)) {
                q.push({newRow, newCol});
                visited[newRow][newCol] = true;
                path[newRow][newCol] = 1;
            }
        }
    }
    return false;
}

int main() {
    // Define a maze where 0 represents a free cell and 1 represents a blocked cell
    vector<vector<int>> maze = {
        {0, 1, 0, 0, 0},
        0, 1, 0, 1, 0,
        0, 0, 0, 1, 0,
        1, 1, 0, 1, 0,
        0, 0, 0, 0, 0
    };

    cout << "Maze Path:" << endl;
    if (!solveMaze(maze)) {
        cout << "No path found!" << endl;
    }

    return 0;
}

#include <iostream>

#include <vector>

#include <queue>

using namespace std;

const int ROW = 5;

const int COL = 5;

// Function to check if a cell is within bounds and not yet visited

bool isValid(int row, int col, vector<vector<int>>& maze, vector<vector<bool>>& visited) {

return (row >= 0 && row < ROW && col >= 0 && col < COL && maze[row][col] == 0 && !visited[row][col]);

}

// Function to print the solution path

void printPath(const vector<vector<int>>& path) {

for (const auto& row : path) {

for (int cell : row) {

cout << (cell ? '*' : ' ') << ' ';

}

cout << endl;

}

// Function to solve the maze using BFS

bool solveMaze(vector<vector<int>>& maze) {

// Directions for moving in the maze (right, down, left, up)

vector<pair<int, int>> directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

vector<vector<bool>> visited(ROW, vector<bool>(COL, false));

vector<vector<int>> path(ROW, vector<int>(COL, 0));

queue<pair<int, int>> q;

q.push({0, 0});

visited[0][0] = true;

path[0][0] = 1;

while (!q.empty()) {

auto [currentRow, currentCol] = q.front();

q.pop();

if (currentRow == ROW - 1 && currentCol == COL - 1) {

printPath(path);

return true;

}

for (const auto& dir : directions) {

int newRow = currentRow + dir.first;

int newCol = currentCol + dir.second;

if (isValid(newRow, newCol, maze, visited)) {

q.push({newRow, newCol});

visited[newRow][newCol] = true;

path[newRow][newCol] = 1;

}

return false;

}

int main() {

// Define a maze where 0 represents a free cell and 1 represents a blocked cell

vector<vector<int>> maze = {

{0, 1, 0, 0, 0},

0, 1, 0, 1, 0,

0, 0, 0, 1, 0,

1, 1, 0, 1, 0,

0, 0, 0, 0, 0

};

cout << "Maze Path:" << endl;

if (!solveMaze(maze)) {

cout << "No path found!" << endl;

}

return 0;

}

Explanation Maze Representation: 0 represents a free cell. 1 represents a blocked cell. isValid Function: Checks if a cell is within maze bounds, not blocked, and not yet visited. printPath Function: Prints the solution path where 1 represents the path and 0 represents non-path cells. solveMaze Function: Uses Breadth-First Search (BFS) to find the …

Maze Solver Gaming Project in C++ Read More »

Functional requirements of Construction Management System with non-functional

Leave a Comment / Functional Non Functional Requirements of Projects / By Projects Inventory

Functional Requirements Project Management Allow users to create and manage construction projects, including defining project scope, objectives, timelines, and budgets. Provide tools for project planning, scheduling, and task management. Support project milestones, deadlines, and dependencies. Document Management Manage and store project-related documents, such as blueprints, contracts, permits, and change orders. Provide version control and document …

Functional requirements of Construction Management System with non-functional Read More »

Matrix Operations (Addition, Multiplication) Gaming Project in C++

Leave a Comment / C++ Projects / By Projects Inventory

#include <iostream>
#include <vector>

using namespace std;

// Function to add two matrices
vector<vector<int>> addMatrices(const vector<vector<int>>& mat1, const vector<vector<int>>& mat2) {
    int rows = mat1.size();
    int cols = mat1[0].size();
    vector<vector<int>> result(rows, vector<int>(cols));

    for (int i = 0; i < rows; ++i) {
        for (int j = 0; j < cols; ++j) {
            result[i][j] = mat1[i][j] + mat2[i][j];
        }
    }
    return result;
}

// Function to multiply two matrices
vector<vector<int>> multiplyMatrices(const vector<vector<int>>& mat1, const vector<vector<int>>& mat2) {
    int rows1 = mat1.size();
    int cols1 = mat1[0].size();
    int rows2 = mat2.size();
    int cols2 = mat2[0].size();

    if (cols1 != rows2) {
        throw invalid_argument("Matrix dimensions do not match for multiplication.");
    }

    vector<vector<int>> result(rows1, vector<int>(cols2, 0));

    for (int i = 0; i < rows1; ++i) {
        for (int j = 0; j < cols2; ++j) {
            for (int k = 0; k < cols1; ++k) {
                result[i][j] += mat1[i][k] * mat2[k][j];
            }
        }
    }
    return result;
}

// Function to print a matrix
void printMatrix(const vector<vector<int>>& mat) {
    for (const auto& row : mat) {
        for (int val : row) {
            cout << val << " ";
        }
        cout << endl;
    }
}

int main() {
    // Define two matrices
    vector<vector<int>> mat1 = {
        {1, 2},
        {3, 4}
    };

    vector<vector<int>> mat2 = {
        {5, 6},
        {7, 8}
    };

    // Add matrices
    vector<vector<int>> sum = addMatrices(mat1, mat2);
    cout << "Sum of matrices:" << endl;
    printMatrix(sum);

    // Multiply matrices
    try {
        vector<vector<int>> product = multiplyMatrices(mat1, mat2);
        cout << "Product of matrices:" << endl;
        printMatrix(product);
    } catch (const invalid_argument& e) {
        cerr << e.what() << endl;
    }

    return 0;
}

#include <iostream>

#include <vector>

using namespace std;

// Function to add two matrices

vector<vector<int>> addMatrices(const vector<vector<int>>& mat1, const vector<vector<int>>& mat2) {

int rows = mat1.size();

int cols = mat1[0].size();

vector<vector<int>> result(rows, vector<int>(cols));

for (int i = 0; i < rows; ++i) {

for (int j = 0; j < cols; ++j) {

result[i][j] = mat1[i][j] + mat2[i][j];

}

return result;

}

// Function to multiply two matrices

vector<vector<int>> multiplyMatrices(const vector<vector<int>>& mat1, const vector<vector<int>>& mat2) {

int rows1 = mat1.size();

int cols1 = mat1[0].size();

int rows2 = mat2.size();

int cols2 = mat2[0].size();

if (cols1 != rows2) {

throw invalid_argument("Matrix dimensions do not match for multiplication.");

}

vector<vector<int>> result(rows1, vector<int>(cols2, 0));

for (int i = 0; i < rows1; ++i) {

for (int j = 0; j < cols2; ++j) {

for (int k = 0; k < cols1; ++k) {

result[i][j] += mat1[i][k] * mat2[k][j];

}

return result;

}

// Function to print a matrix

void printMatrix(const vector<vector<int>>& mat) {

for (const auto& row : mat) {

for (int val : row) {

cout << val << " ";

}

cout << endl;

}

int main() {

// Define two matrices

vector<vector<int>> mat1 = {

{1, 2},

{3, 4}

};

vector<vector<int>> mat2 = {

{5, 6},

{7, 8}

};

// Add matrices

vector<vector<int>> sum = addMatrices(mat1, mat2);

cout << "Sum of matrices:" << endl;

printMatrix(sum);

// Multiply matrices

try {

vector<vector<int>> product = multiplyMatrices(mat1, mat2);

cout << "Product of matrices:" << endl;

printMatrix(product);

} catch (const invalid_argument& e) {

cerr << e.what() << endl;

}

return 0;

}

Explanation Matrix Addition (addMatrices): Takes two matrices mat1 and mat2 as input. Assumes that both matrices have the same dimensions. Creates a result matrix with the same dimensions. Adds corresponding elements from both matrices to fill the result matrix. Matrix Multiplication (multiplyMatrices): Takes two matrices mat1 and mat2 as input. Checks if the number …

Matrix Operations (Addition, Multiplication) Gaming Project in C++ Read More »

Functional requirements of Bakery Management System with non-functional

Leave a Comment / Functional Non Functional Requirements of Projects / By Projects Inventory

Functional Requirements User Management Allow bakery staff and administrators to create and manage user accounts with different roles (e.g., manager, cashier, baker). Implement role-based access controls for accessing different features and data. Product Management Enable the creation, updating, and deletion of bakery products, including breads, pastries, cakes, and other items. Support product categorization, pricing, and …

Functional requirements of Bakery Management System with non-functional Read More »

Linked List Implementation Gaming Project in C++

Leave a Comment / C++ Projects / By Projects Inventory

#include <iostream>

using namespace std;

// Node structure for the linked list
struct Node {
    int data;
    Node* next;

    Node(int value) : data(value), next(nullptr) {}
};

// Linked list class
class LinkedList {
private:
    Node* head;

public:
    LinkedList() : head(nullptr) {}

    ~LinkedList() {
        Node* current = head;
        while (current != nullptr) {
            Node* nextNode = current->next;
            delete current;
            current = nextNode;
        }
    }

    // Add a node to the end of the list
    void append(int value) {
        Node* newNode = new Node(value);
        if (head == nullptr) {
            head = newNode;
        } else {
            Node* current = head;
            while (current->next != nullptr) {
                current = current->next;
            }
            current->next = newNode;
        }
    }

    // Print all nodes in the list
    void printList() const {
        Node* current = head;
        while (current != nullptr) {
            cout << current->data << " -> ";
            current = current->next;
        }
        cout << "nullptr" << endl;
    }

    // Delete a node with a specific value
    void deleteValue(int value) {
        Node* current = head;
        Node* prev = nullptr;

        // Check if the node to be deleted is the head
        if (current != nullptr && current->data == value) {
            head = current->next;
            delete current;
            return;
        }

        // Search for the node to be deleted
        while (current != nullptr && current->data != value) {
            prev = current;
            current = current->next;
        }

        // If the value was not found
        if (current == nullptr) {
            cout << "Value not found in the list." << endl;
            return;
        }

        // Unlink the node from the linked list
        prev->next = current->next;
        delete current;
    }
};

int main() {
    LinkedList list;

    // Append values to the list
    list.append(10);
    list.append(20);
    list.append(30);
    list.append(40);

    // Print the list
    cout << "Linked List: ";
    list.printList();

    // Delete a node and print the list again
    list.deleteValue(20);
    cout << "After deleting 20: ";
    list.printList();

    return 0;
}

100

101

102

103

#include <iostream>

using namespace std;

// Node structure for the linked list

struct Node {

int data;

Node* next;

Node(int value) : data(value), next(nullptr) {}

};

// Linked list class

class LinkedList {

private:

Node* head;

public:

LinkedList() : head(nullptr) {}

~LinkedList() {

Node* current = head;

while (current != nullptr) {

Node* nextNode = current->next;

delete current;

current = nextNode;

}

// Add a node to the end of the list

void append(int value) {

Node* newNode = new Node(value);

if (head == nullptr) {

head = newNode;

} else {

Node* current = head;

while (current->next != nullptr) {

current = current->next;

}

current->next = newNode;

}

// Print all nodes in the list

void printList() const {

Node* current = head;

while (current != nullptr) {

cout << current->data << " -> ";

current = current->next;

}

cout << "nullptr" << endl;

}

// Delete a node with a specific value

void deleteValue(int value) {

Node* current = head;

Node* prev = nullptr;

// Check if the node to be deleted is the head

if (current != nullptr && current->data == value) {

head = current->next;

delete current;

return;

}

// Search for the node to be deleted

while (current != nullptr && current->data != value) {

prev = current;

current = current->next;

}

// If the value was not found

if (current == nullptr) {

cout << "Value not found in the list." << endl;

return;

}

// Unlink the node from the linked list

prev->next = current->next;

delete current;

}

};

int main() {

LinkedList list;

// Append values to the list

list.append(10);

list.append(20);

list.append(30);

list.append(40);

// Print the list

cout << "Linked List: ";

list.printList();

// Delete a node and print the list again

list.deleteValue(20);

cout << "After deleting 20: ";

list.printList();

return 0;

}

Explanation Node Structure: Defines the building block of the linked list. data: Holds the value of the node. next: Points to the next node in the list. LinkedList Class: Manages the linked list operations. Constructor: Initializes head to nullptr, indicating an empty list. Destructor: Deletes all nodes to free up memory when the list …

Linked List Implementation Gaming Project in C++ Read More »

Functional requirements of Auction Management System with non-functional

Leave a Comment / Functional Non Functional Requirements of Projects / By Projects Inventory

Functional Requirements User Management Allow users to create and manage accounts, including registration, login, and profile updates. Implement different user roles, such as bidders, sellers, and administrators, with appropriate access controls. Auction Creation and Management Enable sellers to create and manage auctions, including setting auction parameters such as start/end dates, reserve prices, and item descriptions. …

Functional requirements of Auction Management System with non-functional Read More »

Library Management System Gaming Project in C++

Leave a Comment / C++ Projects / By Projects Inventory

#include <iostream>
#include <vector>
#include <string>

using namespace std;

class Book {
public:
    string title;
    string author;
    bool isAvailable;

    Book(const string& t, const string& a) : title(t), author(a), isAvailable(true) {}
};

class Library {
private:
    vector<Book> books;

public:
    void addBook(const string& title, const string& author) {
        books.emplace_back(title, author);
        cout << "Book added: " << title << " by " << author << endl;
    }

    void borrowBook(const string& title) {
        for (auto& book : books) {
            if (book.title == title) {
                if (book.isAvailable) {
                    book.isAvailable = false;
                    cout << "You have borrowed: " << title << endl;
                    return;
                } else {
                    cout << "Sorry, the book is not available right now." << endl;
                    return;
                }
            }
        }
        cout << "Book not found." << endl;
    }

    void returnBook(const string& title) {
        for (auto& book : books) {
            if (book.title == title) {
                if (!book.isAvailable) {
                    book.isAvailable = true;
                    cout << "You have returned: " << title << endl;
                    return;
                } else {
                    cout << "This book was not borrowed." << endl;
                    return;
                }
            }
        }
        cout << "Book not found." << endl;
    }

    void listBooks() const {
        cout << "Library Books:" << endl;
        for (const auto& book : books) {
            cout << "Title: " << book.title << ", Author: " << book.author
                 << ", " << (book.isAvailable ? "Available" : "Not Available") << endl;
        }
    }
};

int main() {
    Library library;

    library.addBook("1984", "George Orwell");
    library.addBook("To Kill a Mockingbird", "Harper Lee");

    library.listBooks();

    library.borrowBook("1984");
    library.listBooks();

    library.returnBook("1984");
    library.listBooks();

    return 0;
}

#include <iostream>

#include <vector>

#include <string>

using namespace std;

class Book {

public:

string title;

string author;

bool isAvailable;

Book(const string& t, const string& a) : title(t), author(a), isAvailable(true) {}

};

class Library {

private:

vector<Book> books;

public:

void addBook(const string& title, const string& author) {

books.emplace_back(title, author);

cout << "Book added: " << title << " by " << author << endl;

}

void borrowBook(const string& title) {

for (auto& book : books) {

if (book.title == title) {

if (book.isAvailable) {

book.isAvailable = false;

cout << "You have borrowed: " << title << endl;

return;

} else {

cout << "Sorry, the book is not available right now." << endl;

return;

}

cout << "Book not found." << endl;

}

void returnBook(const string& title) {

for (auto& book : books) {

if (book.title == title) {

if (!book.isAvailable) {

book.isAvailable = true;

cout << "You have returned: " << title << endl;

return;

} else {

cout << "This book was not borrowed." << endl;

return;

}

cout << "Book not found." << endl;

}

void listBooks() const {

cout << "Library Books:" << endl;

for (const auto& book : books) {

cout << "Title: " << book.title << ", Author: " << book.author

<< ", " << (book.isAvailable ? "Available" : "Not Available") << endl;

}

};

int main() {

Library library;

library.addBook("1984", "George Orwell");

library.addBook("To Kill a Mockingbird", "Harper Lee");

library.listBooks();

library.borrowBook("1984");

library.listBooks();

library.returnBook("1984");

library.listBooks();

return 0;

}

Explanation Book Class: Represents a book with attributes for the title, author, and availability status. title: The title of the book. author: The author of the book. isAvailable: A boolean indicating if the book is available for borrowing. Library Class: Manages a collection of books and provides functionality for adding, borrowing, returning, and listing …

Library Management System Gaming Project in C++ Read More »

Functional requirements of Employee Attendance System with non-functional

Leave a Comment / Functional Non Functional Requirements of Projects / By Projects Inventory

Functional Requirements User Authentication and Authorization Allow employees to log in and access their attendance records. Provide different access levels for administrators, managers, and employees. Implement role-based access controls for viewing and managing attendance data. Attendance Tracking Track employee attendance in real-time, including clock-in and clock-out times. Support various methods for recording attendance, such as …

Functional requirements of Employee Attendance System with non-functional Read More »