Pinned Repositories
saythanks.io
Spreading Thankfulness in Open Source.
url-shortener
A useful python project for shortening links.
Block-hash-calculation
A block hash is a unique identifier for a block in a blockchain, created by applying a cryptographic hash function to the block's data. It's a digital fingerprint that represents the entire block's contents. Block hashes are important for maintaining the blockchain's immutability and trustworthiness.
Block-structure
Blockchain is a technology where multiple parties involved in communication can perform different transactions without third-party intervention. Verification and validation of these transactions are carried out by special kinds of nodes.
Create-Block
Blockchain is a time-stamped decentralized series of fixed records that contains data of any size is controlled by a large network of computers that are scattered around the globe and not owned by a single organization.
Genesis-block
The Genesis Block is the first block in a blockchain, and is also known as Block 0. It contains the original 50 bitcoins mined by Satoshi Nakamoto, the entity that started the Bitcoin network.
Binarysearch_algorithm
The time complexity of binary search is O(log n), where n is the number of elements in the list. This means that the time it takes to find an element in a list using binary search will increase logarithmically with the size of the list.
Breadh-first-search
The provided program is an implementation of the Breadth-First Search (BFS) algorithm for traversing or searching tree or graph data structures. It starts at a selected node (in this case, node 'A'), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
convert-binary-to-decimal-
C Program to Convert Binary Number to Decimal and vice-versa
Depth-first-search
The Depth-First Search is a recursive algorithm that uses the concept of backtracking. It involves thorough searches of all the nodes by going ahead if potential, else by backtracking. Here, the word backtrack means once you are moving forward and there are not any more nodes along the present path
kabilan-karthi's Repositories
kabilan-karthi/sheduling_algorithms
This Streamlit app is designed to help users visualize various operating system (OS) scheduling algorithms, such as First-Come, First-Served (FCFS), Shortest Job First (SJF), and Round Robin.
kabilan-karthi/Deadlock-detection
This Streamlit application demonstrates deadlock avoidance using a blockchain-based approach. By modeling resource allocation and lock management as a blockchain, the app ensures transparency and traceability of actions, helping to detect and prevent deadlocks in real-time.
kabilan-karthi/saythanks.io
Spreading Thankfulness in Open Source.
kabilan-karthi/cloud_medical_record
kabilan-karthi/cloudbased-medical-record
The "Patient Details Lookup" app is a web application designed to help healthcare providers search for, view, and update patient details stored in a PostgreSQL database. The app offers an intuitive interface for inputting patient information, editing their details, and saving the changes back to the database.
kabilan-karthi/medical-record-
streamlit app that helps to store the medical records
kabilan-karthi/student-database
This Solidity contract provides a simple implementation of a student database. It allows you to store and retrieve information about students and the courses they are enrolled in.
kabilan-karthi/Depth-first-search-in-C
This program generates a random maze using a depth-first search algorithm. It uses a 2D array to represent the maze, where 0s represent paths and 1s represent walls. The generateMaze function uses recursion to visit each cell in the maze, removing walls to create paths.
kabilan-karthi/smartcontract
In this contract, we define a simple storage contract with a single uint variable called contractValue. The contract has a constructor that sets the contract's owner as the address that deployed the contract. We also define a modifier onlyOwner that restricts access to certain functions only to the owner.
kabilan-karthi/A-algorithm
The A* algorithm or A star algorithm in AI is a powerful pathfinding algorithm that efficiently finds the shortest path in a graph while considering both the actual cost incurred so far and an estimate of the remaining cost.
kabilan-karthi/Recursive-Fibonacci
This Python program calculates the nth number in the Fibonacci sequence using a recursive approach. The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding ones.
kabilan-karthi/random-password-generator
This program prompts the user to enter the desired length of the password, the number of digits, and the number of special characters. It then generates a random password based on the provided criteria and prints it to the console. The password consists of a combination of lowercase and uppercase letters, digits, and special characters.
kabilan-karthi/url-shortener
A useful python project for shortening links.
kabilan-karthi/blockchain-python
This program implements a simple blockchain using a linked list data structure. It consists of two classes: Block and Blockchain. The Block class represents a single block in the blockchain, while the Blockchain class manages the blocks and provides methods for adding blocks and printing the blockchain.
kabilan-karthi/max-subarray-sum
This repository contains a Python program that finds the maximum subarray sum in a given array. The program uses a greedy algorithm to find the maximum subarray sum in O(n) time, where n is the length of the array.
kabilan-karthi/convert-binary-to-decimal-
C Program to Convert Binary Number to Decimal and vice-versa
kabilan-karthi/Binarysearch_algorithm
The time complexity of binary search is O(log n), where n is the number of elements in the list. This means that the time it takes to find an element in a list using binary search will increase logarithmically with the size of the list.
kabilan-karthi/Create-Block
Blockchain is a time-stamped decentralized series of fixed records that contains data of any size is controlled by a large network of computers that are scattered around the globe and not owned by a single organization.
kabilan-karthi/linear-Search-time-complexity
The time complexity of linear search is O(n), where n is the number of elements in the list. This is because the search algorithm must examine each element in the list in the worst case.
kabilan-karthi/nonce
A nonce is a random number that can only be used once, often used in cryptography to ensure that old communications cannot be reused in replay attacks. It is a key element in the Proof-of-Work (PoW) algorithm used in Bitcoin mining to find a new block in the Bitcoin blockchain.
kabilan-karthi/Block-hash-calculation
A block hash is a unique identifier for a block in a blockchain, created by applying a cryptographic hash function to the block's data. It's a digital fingerprint that represents the entire block's contents. Block hashes are important for maintaining the blockchain's immutability and trustworthiness.
kabilan-karthi/validhash
A valid hash in a blockchain is a deterministic hexadecimal number that is unique to a set of data.
kabilan-karthi/Block-structure
Blockchain is a technology where multiple parties involved in communication can perform different transactions without third-party intervention. Verification and validation of these transactions are carried out by special kinds of nodes.
kabilan-karthi/Genesis-block
The Genesis Block is the first block in a blockchain, and is also known as Block 0. It contains the original 50 bitcoins mined by Satoshi Nakamoto, the entity that started the Bitcoin network.
kabilan-karthi/Depth-first-search
The Depth-First Search is a recursive algorithm that uses the concept of backtracking. It involves thorough searches of all the nodes by going ahead if potential, else by backtracking. Here, the word backtrack means once you are moving forward and there are not any more nodes along the present path
kabilan-karthi/Breadh-first-search
The provided program is an implementation of the Breadth-First Search (BFS) algorithm for traversing or searching tree or graph data structures. It starts at a selected node (in this case, node 'A'), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.