onkarbartakke Goto Github PK

a-star-search-implementation-on-tsp-using-mst-as-heuristic

acm-website

ACM Website revamped

bi-directional-search-algorithm-implementation-on-n-tile-problem

Searching a graph is quite famous problem and have a lot of practical use. We have already discussed here how to search for a goal vertex starting from a source vertex using BFS. In normal graph search using BFS/DFS we begin our search in one direction usually from source vertex toward the goal vertex, but what if we start search from both direction simultaneously. Bidirectional search is a graph search algorithm which find smallest path from source to goal vertex. It runs two simultaneous search – Forward search from source/initial vertex toward goal vertex Backward search from goal/target vertex toward source vertex Bidirectional search replaces single search graph(which is likely to grow exponentially) with two smaller sub graphs – one starting from initial vertex and other starting from goal vertex. The search terminates when two graphs intersect.

blog-website-

Blog website made by using javascript , node js, html , css. bootstrap , EJS

chating-web-applicatin-using-react-node-socket-io-express

coronaviurs-tracker

crypto-world

This website provides all the info related to cryptocurrencies, details of top 100 cryptocurrencies, their exchanges, can track their rates visually on graphs, and also get the latest news regarding the cryptocurrencies. Technologies used - Redux toolkit for creating endpoints, Chart js for graphs, ant design for styling and the most important crux is React practices

demo-repo

back to basics for revison

discussion-forum

Full stack Discussion Forum

dsa-marathon

This Repo includes core DSA problem solutions, which I solved for my internship and Placement preparation, in Summer of 2nd year. This really helped in understanding the implementation of Data Structures. I learned a lot while solving this problems.

first-contributions

🚀✨ Help beginners to contribute to open source projects

first-fit-heap-algo-implementation

This is first fit implementation Algo in Heap implemented

flip-kart-clone

Synopsis: This was just a front end clone of filpcart using html, css, Bootstrap only, made just after brushing up web-dev skills

flutter-start-dicee-app-basic

Starting flutter project to develop a dicee game app in Flutter

genetic-search-algorithm-in-ai-for-travelling-salesman-problem

googlekickstart2020_solutions

:octocat: This repository will contain solutions of "Google Kick Start 2020" in C/C++/Java/Python. If you loved it, give a 🌟!

hello-world

home-page-of-coding-school-website

implementation-of-a-game-theoretic-approach-to-energy-trading-in-the-smart-grid

iterative-deepening-search-algorithm-implementation-on-n-tile-problem

There are two common ways to traverse a graph, BFS and DFS. Considering a Tree (or Graph) of huge height and width, both BFS and DFS are not very efficient due to following reasons. DFS first traverses nodes going through one adjacent of root, then next adjacent. The problem with this approach is, if there is a node close to root, but not in first few subtrees explored by DFS, then DFS reaches that node very late. Also, DFS may not find shortest path to a node (in terms of number of edges). BFS goes level by level, but requires more space. The space required by DFS is O(d) where d is depth of tree, but space required by BFS is O(n) where n is number of nodes in tree (Why? Note that the last level of tree can have around n/2 nodes and second last level n/4 nodes and in BFS we need to have every level one by one in queue). IDDFS combines depth-first search’s space-efficiency and breadth-first search’s fast search (for nodes closer to root).

iwp-webdev-assg-1

Assignment 1 of IWP for practice of html Css

keeper-app

Created with CodeSandbox

linux-shell

Command shell using OS system calls to execute built-in Linux commands

live-weather-according-to-location-using-api

multi_threaded_webserver

This is Multi_threaded_webserver made using in C for Linux environment

my-own-shell-program-for-standard-linux-commands

My own shell program for standard linux commands, this supports single commands, parallel commands, sequential commands and also command redirection

note-app-using-php-and-mysql

This is a note keeping app made using PHP and MySQlL . This was developed in Ubuntu environment using Lamp Stack. where you can do all the CRUD operations.

pratice

react-django-to-do-app

sensor-network-database-using-btrees-and-avl-trees

This was a sensor data base which was keeping track of various properties at that location, which were recorded after fix interval of time. Data-structures used here were AVL-Trees and B-Trees. There was also a central repository where the data from all the sensors was stored.