Pinned Repositories
AnuragUmale
Big_Integer
BigInteger class is used for the mathematical operation which involves very big integer calculations that are outside the limit of all available primitive data types. In this way, BigInteger class is very handy to use because of its large method library and it is also used a lot in competitive programming.
bookstore
BST_Cpp
A binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.
buckshot-rollutee
Conways_Game_Of_Life
The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input.
cpp-practice
data-structures
DSA
Data Structure and Algorithm (DSA) contributions
game-verse
AnuragUmale's Repositories
AnuragUmale/AnuragUmale
AnuragUmale/Big_Integer
BigInteger class is used for the mathematical operation which involves very big integer calculations that are outside the limit of all available primitive data types. In this way, BigInteger class is very handy to use because of its large method library and it is also used a lot in competitive programming.
AnuragUmale/bookstore
AnuragUmale/BST_Cpp
A binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.
AnuragUmale/buckshot-rollutee
AnuragUmale/Conways_Game_Of_Life
The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input.
AnuragUmale/cpp-practice
AnuragUmale/data-structures
AnuragUmale/DSA
Data Structure and Algorithm (DSA) contributions
AnuragUmale/game-verse
AnuragUmale/Graphs_BFS_C
The Breadth First Search (BFS) algorithm is used to search a graph data structure for a node that meets a set of criteria. It starts at the root of the graph and visits all nodes at the current depth level before moving on to the nodes at the next depth level.
AnuragUmale/Graphs_DFS_C
Depth-first search is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.
AnuragUmale/Huffman_Coding_In_C
Huffman code is a way to encode information using variable-length strings to represent symbols depending on how frequently they appear. The idea is that symbols that are used more frequently should be shorter while symbols that appear more rarely can be longer.
AnuragUmale/java-practice
AnuragUmale/Lempel_Ziv_Welch_Data_Compression
Lempel–Ziv–Welch is a universal lossless data compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was published by Welch in 1984 as an improved implementation of the LZ78 algorithm published by Lempel and Ziv in 1978.
AnuragUmale/List_C
The list is a sequence data type which is used to store the collection of data.
AnuragUmale/List_Cpp
The list is a sequence data type which is used to store the collection of data.
AnuragUmale/Matrix_C
A matrix is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object.
AnuragUmale/my_language
In thiis repositor I will be adding the files required for the making another (my own) programming language
AnuragUmale/proxy_server
AnuragUmale/RBT_Cpp
Red Black Trees are self-balancing, meaning that the tree adjusts itself automatically after each insertion or deletion operation. It uses a simple but powerful mechanism to maintain balance, by coloring each node in the tree either red or black. Red-Black tree is a binary search tree in which every node is colored with either red or black.
AnuragUmale/RSA_Cryptography_In_C
RSA is a public-key cryptosystem that is widely used for secure data transmission. It is also one of the oldest. The acronym "RSA" comes from the surnames of Ron Rivest, Adi Shamir and Leonard Adleman, who publicly described the algorithm in 1977.
AnuragUmale/SS_Cryptography_In_C
The Schmidt-Samoa cryptosystem is an asymmetric cryptographic technique, whose security, like Rabin depends on the difficulty of integer factorization.
AnuragUmale/The_Great_Firewall_of_Santa_Cruz
AnuragUmale/TicTacToe
A game in which two players alternately put Xs and Os in compartments of a figure formed by two vertical lines crossing two horizontal lines and each tries to get a row of three Xs or three Os before the opponent does