kb5029 Goto Github PK

bfs-in-python

# BFS-in-python Breadth-First Search is a recursive algorithm to search all the vertices of a graph or a tree. BFS in python can be implemented by using data structures like a dictionary and lists

default-routing

file-compression-huffman

Python script that uses Huffman Coding to compress text files.

github-slideshow

A robot powered training repository :robot:

linked-list-operations

Execution of all LinkedList operations had been done in single code

load-balancer-using-multithtreading

mailbuzz

simple mailchip clone app made for Hackathon 9.0

map-colouring-problem

maze-solver

To create a maze solver with Python, we need to choose a data structure to represent the maze and to represent the rollback algorithm that will be used to find the path from the start point to the endpoint. The best choice for choosing a data structure to store the maze is a two-dimensional array.

n-queen-problem

Python Program for N Queen Problem.

password-generator

Here is the simple python code where you can generate maximum number of passwords using alphabets and symbols with certain number of digits which one can set by their own.

resume-classification

river-crossing-problem

rock-paper-scissors

simple python program where the random module is used to generate numbers and few statements and while loop.

routing-information-protocol-ripv1

routing-information-protocol-ripv2

smart-home-network

We desiged a wireless network at home with remote access from office.We used cisco software to design the network

snake_game

A snake eater game written in Python using the Pygame library.

suduko-solver

Python script that uses backtracking to solve any sudoku input.

sum

threat-detection

tic-tac-toe

# TIC_TAC_TOE_AI Play tic_tac_toe with an AI opponent! This project uses a minimax algorithm to create an unbeatable ai to play tic tac toe.Player can choose to play first or second only to end the game in a draw at best.

vacuum-cleaner-problem

# Vacuum-cleaner-problem-AI Developed a simple problem solving reflex agent program in Python for the vacuum-cleaner world problem. This program defines the States, intial state, Actions,sucessor function,goal test and Path Cost. For each possible initial state, the program returns a sequence of actions that leads to the goal state, along with the path cost. Generates two test cases.