Aleezeh Usman (aleezeh611)

aleezeh611

Geek Repo

Company:SDE @ Securiti

Location:Ashburn, VA, USA

Github PK Tool:Github PK Tool

Aleezeh Usman's starred repositories

contribute-to-open-source

[STILL ACTIVE] Learn the GitHub workflow by contributing code in a fun simulation project

Language:JavaScriptLicense:MITStargazers:1342Issues:28Issues:6

TrainYourOwnYOLO

Train a state-of-the-art yolov3 object detector from scratch!

Language:Jupyter NotebookLicense:NOASSERTIONStargazers:646Issues:8Issues:196

CISCO-Packet-Tracer---Design-A-Complete-Network-With-All-Routing-Protocols-And-Servers

I had to design a complete network in CISCO Packet Tracer using every routing protocols (RIP, OSPF, EIGRP) and every type of server (DHCP, TFTP, Web Server and Data Server).

License:MITStargazers:22Issues:1Issues:0

Graphical-Password-Authentication-System

Graphical Password Authentication System. This is used to increase the protection/security of a website. Our system is divided into further 4 layers of protection. Each layer is totally different and diverse than the others. This not only increases protection, but also makes sure that no non-human can log in to your account using different activities such as Brute Force Algorithm and so on.

Language:PythonLicense:MITStargazers:19Issues:3Issues:1

Fake-News-Detection-Using-Naive-Bayes

Fake news detection using NaĂŻve Bayes in Python along with confusion matrix calculated using sklearn.

Language:Jupyter NotebookLicense:MITStargazers:10Issues:1Issues:0

Hadoop-MapReduce-Sentiment-Analysis-Through-Keywords

A MapReduce program to conduct sentiment analysis of a keyword from a list of comments.

Language:JavaLicense:MITStargazers:10Issues:1Issues:0

RFID-Smart-Card-using-Raspberry-Pi

Implementation of RFID Smart Card using Raspberry Pi 3

Language:PythonStargazers:10Issues:0Issues:0

Finding-Optimal-Path-of-Map-of-Romania-Using-A-Star

A* is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency

Language:PythonLicense:MITStargazers:7Issues:1Issues:0

n-queens-with-local-search

Classic N-Queens problem, solved using local search algorithms hill climbing and simulated annealing. Perfect solution not guaranteed :)

Language:PythonLicense:MITStargazers:6Issues:1Issues:0
Language:Jupyter NotebookLicense:MITStargazers:5Issues:0Issues:0

8-Queen-Problem-Solver-in-Python

The 8-queens problems asks us to place 8 queens on a chessboard so that no two can capture one another; that is, no two are on the same row, column, or diagonal.

Language:PythonLicense:MITStargazers:5Issues:1Issues:0

AI-Based-Tic-Tac-Toe-Game-using-Minimax

In this task, i implemented an AI based Tic Tac Toe Game using Minimax algorithm.

Language:PythonLicense:MITStargazers:5Issues:1Issues:0

Dependency-Analysis-and-Speedup

In this task, we were given some code snippets and we had to calculate the Dependencies in the code and if resolveable, we needed to re-write the code to remove any sort of dependencies. Furthermore, we had to calculate the speedup graphs too.

Language:CLicense:MITStargazers:4Issues:1Issues:0

Exam-Schedling-using-Backtracking-Algorithm

Backtracking is a general algorithm for finding solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate as soon as it determines that the candidate cannot possibly be completed to a valid solution.

Language:PythonLicense:MITStargazers:4Issues:1Issues:0

Hadoop-MapReduce-to-Find-Average-Length-of-Comments

In this task, we had to find the average length of comments given in the dataset. It was done using Hadoop MapReduce and Hadoop HDFS.

Language:JavaLicense:MITStargazers:4Issues:1Issues:0

Implementing-a-DNS-Server

DNS stands for Domain Name System. We have implemented DNS in this project. The basic task of DNS is to resolve a destination name hosted against some IP Address.

Language:C++License:MITStargazers:4Issues:1Issues:0

Implementing-Knapsack-Algorithm

The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible

Language:PythonLicense:MITStargazers:4Issues:1Issues:0

Searching-a-Number-among-Slave-Processes-using-OpenMP-and-MPI

In this task, I wrote the code using both OpenMP and MPI inorder to parallelize it. What it does is that the master process distributes a chunk of number equally among the slave processes. Each slave process then searches for the number to find. When one slave process finds the number, it sends a message to the master process who then sends a "terminating message" to the slave processes who then abort their search.

Language:C++License:MITStargazers:4Issues:1Issues:0
Language:C++License:MITStargazers:3Issues:1Issues:0

Air-Plane-Flight-Management-System-Using-Dijkstra-Algorithm

Air Plane Flight Management System implementing Data Structures Concepts and utilizing Dijkstra's Algorithm

Language:C++Stargazers:3Issues:0Issues:0

chess-game-using-GBFS-Algorithm

Beginner Level Chess Game implementing Greedy Best First Search Algorithm using an intelligent evaluation score as heauristic

Language:Jupyter NotebookStargazers:3Issues:0Issues:0

Hadoop-MapReduce-To-Find-Average-Length-Of-Comments

A MapReduce program to calculate the average length of comments.

Language:JavaLicense:MITStargazers:3Issues:1Issues:0

K-Means-And-KNN-On-MultiClass-Dataset

Applying K Means and KNN on a multiclass dataset to make clusters and find nearest neighbours.

Language:Jupyter NotebookLicense:MITStargazers:3Issues:1Issues:0

Calculating-Entropy-of-IRIS-Dataset

This is perhaps the best known database to be found in the pattern recognition literature. Fisher's paper is a classic in the field and is referenced frequently to this day. (See Duda & Hart, for example.) The data set contains 3 classes of 50 instances each, where each class refers to a type of iris plant. One class is linearly separable from the other 2; the latter are NOT linearly separable from each other.

Language:Jupyter NotebookLicense:MITStargazers:3Issues:1Issues:0

Implementing-Linear-Regression-in-Python

Linear regression is a linear model, e.g. a model that assumes a linear relationship between the input variables (x) and the single output variable (y)

Language:Jupyter NotebookLicense:MITStargazers:3Issues:1Issues:0

K-Means-on-IRIS-Dataset

k-means clustering is a method of vector quantization, originally from signal processing, that aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster.

Language:Jupyter NotebookLicense:MITStargazers:3Issues:1Issues:0

classification-with-kmeans-and-knn-

A python implementation of the k-means clustering algorithm and the k-nearest-neighbours classification algorithm.

Language:Jupyter NotebookLicense:MITStargazers:3Issues:1Issues:0

distributed-password-cracker

Applying brute force passwords cracking techniques with a twist - using OpenMP and MPICH to distribute the tasks in a clustered computing environment.

Language:C++License:MITStargazers:2Issues:1Issues:0