Pinned Repositories
convexhull
This project implements two essential computational geometry algorithms: Convex Hull: Computes the smallest convex polygon enclosing a set of 2D points using the Graham Scan algorithm. Line Intersection: Detects intersections among line segments using the Bentley-Ottmann sweep-line algorithm.
Dijkstra-route-finding
In this data structure project, Dijkstra's algorithm is used to find the shortest path in a graph. It iteratively selects the node with the smallest distance, updates its neighbors' distances, and marks it as visited, using a priority queue for efficiency.
e-commerce-website
This project implements two essential computational geometry algorithms: Convex Hull: Computes the smallest convex polygon enclosing a set of 2D points using the Graham Scan algorithm. Line Intersection: Detects intersections among line segments using the Bentley-Ottmann sweep-line algorithm.
Machine-learning-HMM-model-
A machine learning project using a Hidden Markov Model (HMM) involves modeling sequences with hidden states to analyze and predict patterns in data. Applications include speech recognition, bioinformatics, and financial analysis.
Mern-Stack
Open-mp-pairwise-sequence-allignment-
This project implements pairwise sequence alignment using OpenMP for parallel processing. It optimizes computational efficiency in bioinformatics by aligning DNA, RNA, or protein sequences rapidly. Ideal for researchers needing high-performance sequence analysis.
Socket-Programming
web sockets communications using middle ware and authorized with json web token
sudoku-solver-Assembly-language-
A C++ Sudoku solver utilizing a backtracking algorithm to efficiently solve any 9x9 Sudoku puzzle. Input puzzles via a simple interface and receive instant solutions, enhancing your puzzle-solving experience.
Unity-Project
tayabakhuwaja's Repositories
tayabakhuwaja/e-commerce-website
This project implements two essential computational geometry algorithms: Convex Hull: Computes the smallest convex polygon enclosing a set of 2D points using the Graham Scan algorithm. Line Intersection: Detects intersections among line segments using the Bentley-Ottmann sweep-line algorithm.
tayabakhuwaja/Mern-Stack
tayabakhuwaja/Socket-Programming
web sockets communications using middle ware and authorized with json web token
tayabakhuwaja/sudoku-solver-Assembly-language-
A C++ Sudoku solver utilizing a backtracking algorithm to efficiently solve any 9x9 Sudoku puzzle. Input puzzles via a simple interface and receive instant solutions, enhancing your puzzle-solving experience.
tayabakhuwaja/Machine-learning-HMM-model-
A machine learning project using a Hidden Markov Model (HMM) involves modeling sequences with hidden states to analyze and predict patterns in data. Applications include speech recognition, bioinformatics, and financial analysis.
tayabakhuwaja/Dijkstra-route-finding
In this data structure project, Dijkstra's algorithm is used to find the shortest path in a graph. It iteratively selects the node with the smallest distance, updates its neighbors' distances, and marks it as visited, using a priority queue for efficiency.
tayabakhuwaja/convexhull
This project implements two essential computational geometry algorithms: Convex Hull: Computes the smallest convex polygon enclosing a set of 2D points using the Graham Scan algorithm. Line Intersection: Detects intersections among line segments using the Bentley-Ottmann sweep-line algorithm.
tayabakhuwaja/Open-mp-pairwise-sequence-allignment-
This project implements pairwise sequence alignment using OpenMP for parallel processing. It optimizes computational efficiency in bioinformatics by aligning DNA, RNA, or protein sequences rapidly. Ideal for researchers needing high-performance sequence analysis.