Maemoon's repositories
Credit-Card-Fraud-Detector-using-Apache-Kafka
The credit card fraud detection system which sends transaction data to a Kafka topic, and processes this data to detect fraud using predefined rules or a machine learning model, triggering alerts for fraudulent transactions.
Ecommerce-Website
E-Commerce Website Welcome to the E-Commerce Website project! This project is built using the MERN stack (MongoDB, Express, React, Node.js). It includes essential features such as user registration, login, an admin panel, a shopping cart, and a product listing page.
Party-Management-System
Party Management System A web-based application for managing parties and events, built using HTML, CSS, Node.js with Express, and MySQL. This system allows users to create, edit, and manage party details, including guest lists, schedules, and venue information, providing a seamless and efficient way to organize and track all aspects of the events.
Maze-Game-Assembly-Language
This is a classic maze game developed using Assembly Language, designed to challenge and entertain with its intricate maze layouts and intuitive gameplay. This project showcases the capabilities of low-level programming in Assembly, highlighting efficient use of resources and direct hardware manipulation.
Amazon-Dataset-Mining
The Frequent Dataset Mining project offers a comprehensive solution for mining frequent itemsets from the extensive Amazon dataset using Apache Kafka. Leveraging the power of distributed computing, this project employs two powerful algorithms, Apriori and PCY, to efficiently process and analyze large volumes of data.
Parallel-Grayscale-Conversion-using-OpenCL-and-OpenCV
The Parallel Grayscale Conversion tool efficiently transforms RGB images into grayscale with GPU-accelerated speed using OpenCL. Seamlessly integrated with OpenCV, it facilitates rapid processing for large image batches, simplifying intricate workflows with its scalable input management and intuitive directory-based structure.
Shortest-Path-Finder-using-Parallel-Processing
Welcome to the Parallel Shortest Path Finder! This innovative tool is designed to swiftly determine the shortest routes between pairs of nodes in a graph. Leveraging the power of Dijkstra's algorithm, it navigates graph connections using an adjacency list and a hash table-based distance matrix for optimal efficiency.
helloworld
First