Simplest Codings

Search This Blog

Featured Post

Trie implementation in C

Posted by Unknown Trie

57

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Suggestions

Posted by Unknown

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Ads

To implement the kind of storage which stores strings as the search keys , there is a need to have special data structures which can store the strings efficiently and the searching of data based on the string keys is easier, efficient and faster. One such data structure is a tree based implementation called Trie. Trie is a data structure which can be used to implement a dictionary kind of application. It provides all the functionality to insert a string, search a string and delete a string from the dictionary. The insertion and deletion operation takes O(n) time where n is the length of the string to be deleted or inserted. Some of the application of tries involve web based search engines, URL completion in autocomplete feature, Spell checker etc. Structure of Trie(Specific to this implementation): The trie implemented here consists of nodes. Each node has these fields: Key - Part of the string to be serached,inserted or deleted. Value - The value associated with a str

Ternary Search Tree Implementation in C++

A Ternary Search Tree is a trie which leverages concepts of Binary Search Tree as well. A Ternary Search Tree is as memory efficient as Binary Search Trees and time efficient as a Trie. It is an efficient data structure to store and search large number of strings. A node in a Ternary Search Tree comprises of these fields : Left pointer - Points to Ternary Search Tree containing all strings alphabetically lesser than current node's data Right pointer - Points to Ternary Search Tree containing all strings alphabetically greater than current node's data Equal pointer - Points to Ternary Search Tree containing all strings alphabetically equal to current node's data End of string flag - Flag indicating the end of string Data - Actual data in the form of single character Ternary Search Tree Node For example, consider adding these strings in the same order into a Ternary Search Tree : "Lead" "Leader" "Leads" "Late"

Secure Server Client using OpenSSL in C

Overview of the SSL handshake Courtesy: http://www-01.ibm.com/support/knowledgecenter Steps involved in SSL handshake (Courtesy: http://www.pierobon.org ) : The client sends the server the client's SSL version number, cipher settings, randomly generated data, and other information the server needs to communicate with the client using SSL. The server sends the client the server's SSL version number, cipher settings, randomly generated data, and other information the client needs to communicate with the server over SSL. The server also sends its own digital certificate and, if the client is requesting a server resource that requires client authentication, requests the client's digital certificate. The client uses the information sent by the server to authenticate the server. If the server cannot be authenticated, the user is warned of the problem that an encrypted and authenticated connection cannot be established. If the server can be successfully authentica

View Counter

Powered by Blogger