raghav831 Goto Github PK

-an-efficient-parallel-algorithm-for-sequence-search-over-large-genomic-sequence

angularfinalassignment

atlantis_q1

facebook annimation

hackerrank-solutions

hackerrank solutions

hacktoberfest

Participate in Hacktoberfest by contributing to any Open Source project on GitHub! Here is a starter project for first time contributors. #hacktoberfest

hacktoberfest-1

Make your first PR! ~ A beginner friendly repository made specifically for open source beginners. Add any program under any language (it can be anything from a hello-world program to a complex data structure algorithm) or update the existing one. Just make sure you add the program under the correct language directory. Happy coding

hacktoberfest-2020

:octocat: Simply add your details to readme and stand a chance to earn a free tee! ✅

hacktoberfest-2021

Make this Hacktoberfest a learning period and contribute to Great Open Source Projects.

hacktoberfest2020

Make your first Pull Request and earn a free tee from GitHub!

hacktoberfest2020-1

Contribute for hacktoberfest 2020

hacktoberfest2020-2

Submit Just 4 PRs to earn SWAGS and Tshirts🔥

hacktoberfestforbeginners

New to open-source? Contribute here!!!

hactoberfest2020

Submit 4 pull requests to earn swags (Tshirts + badges)

hostel_management_using-mysql

html5

this resporatory provides knowledge of hml5 database,html5 electron,html5 ajax with --> pure javascript --> new version of jquery and --> old version of jquery mostly used or easy in handle; html5_database-->

intelense_test

view live streaming on web page of cctv cameras

milestone1

java assignment

network-analysis-of-stack-overflow-using-gephi

online-food-ordering-

persisted-redux-q4

phone-directory-using-linked-list-binary-search-tree

Trie is an ordered tree data structure that uses strings as keys. Unlike Binary Trees, Tries do not store keys associated with the node. The key is actually determined based on the position of the node on the tree. Any descendants of a node shares a common prefix of the key string associated with that node. Hence, trie is also called as Prefix Tree. The word "trie" comes from Retrieval, and it is pronounced as "try". To read more about Trie click here. Since this data structure is a prefix tree, trie is commonly used in Dictionaries, Phone Directories and matching algorithms. Trie is best-suited for phone directory (any matching application for that matter) because it is very efficient in matching strings.

python

this resporatory have ml,ai,nlp,data science etc.python language related material from many websites eg. datacamp,geeksforgeeks,linkedin,youtube,udemy etc. also it include programming challange/competion solutions

raghav831.github.io

Coursera assignments solution

shopping-mall-management-system-using-mysql

to make a database management system for a shopping mall which will help in maintaining the day-to-day state of the mall, its shops, owners, employees, items etc. The basic objective of our project is the understanding and implementation of Mall database system using various front-end and back-end tools. This project requires the basic understanding of DBMS modules, programming tools, ER Diagrams, etc. This project also helps to understand the real-life applications of database systems.

vehicle-number-plate-recognition-system-using-matla

Number plates are used for identification of vehicles all over the nations. Automatic vehicle identification is an image processing technique of identify vehicles by their number plates. Automatic vehicle identification systems are used for the purpose of effective traffic control and security applications such as access control to restricted areas and tracking of wanted vehicles. Number plate recognition (NPR) is easier method for Vehicle identification. NPR system for Indian license plate is difficult compared to the foreign license plate as there is no standard followed for the aspect ratio of license plate. The identification task is challenging because of the nature of the light. .Number plate detection system investigates an input image to identify some local patches containing license plates. Since a plate can exist anywhere in an image with various sizes, it is infeasible to check every pixel of the image to locate it.

web-scrapping-python