<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Abdullah Ismail on Medium]]></title>
        <description><![CDATA[Stories by Abdullah Ismail on Medium]]></description>
        <link>https://medium.com/@whalewalker?source=rss-afa8f3b12d92------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*U9KWRSzfOqJNlFNu7TCwJA.png</url>
            <title>Stories by Abdullah Ismail on Medium</title>
            <link>https://medium.com/@whalewalker?source=rss-afa8f3b12d92------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 20 Nov 2026 10:35:35 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@whalewalker/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Difference between Encryption, Hashing and Encoding]]></title>
            <link>https://whalewalker.medium.com/difference-between-encryption-hashing-and-encoding-e3e58c6a65d0?source=rss-afa8f3b12d92------2</link>
            <guid isPermaLink="false">https://medium.com/p/e3e58c6a65d0</guid>
            <category><![CDATA[cybersecurity]]></category>
            <category><![CDATA[technical-interview]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[technical-skills]]></category>
            <category><![CDATA[data-science]]></category>
            <dc:creator><![CDATA[Abdullah Ismail]]></dc:creator>
            <pubDate>Thu, 25 Aug 2022 15:57:25 GMT</pubDate>
            <atom:updated>2022-08-25T17:37:54.619Z</atom:updated>
            <content:encoded><![CDATA[<p>To begin, <strong>Encryption</strong>, <strong>Hashing</strong>, and <strong>Encoding</strong> are technical terminologies used in the computing system. They are used to describe the process of transforming a message, data or information from a certain format to another for usage or storage. What makes them different?</p><p>Over the years, I have used those terms indiscriminately without realizing that the words are completely different from each other.</p><p>I found out about this when my brother asked me a question that left me in total confusion, which prompted the research to understand what these technical terms mean. After doing some reading for some days, I want to share what I have learned.</p><h3>Encryption</h3><p>Encryption is a method of protecting data so that only the user who has the <strong>key</strong> can access it; <strong>decryption</strong> is the process of recovering the original data using the <strong>key</strong>.</p><p><em>A </em><strong><em>KEY</em></strong><em> is a piece of information that is used in conjunction with an algorithm to convert plain text into cypher text.</em></p><p><strong>Type of Encryption</strong></p><ol><li>Symmetric →</li></ol><figure><img alt="" src="https://cdn-images-1.medium.com/max/782/0*t2V2sqVE23lt2ZAj" /><figcaption>diagram of how symmetric encryption works</figcaption></figure><p><strong><em>Symmetric encryption — Using the same key for encryption and decryption.</em></strong></p><p>Asymmetric →</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/799/0*l2qhUPoc4l6R8881" /><figcaption>diagram of how Asymmetric encryption works</figcaption></figure><p><strong><em>Asymmetric encryption — Using a different key for the encryption and decryption process</em></strong></p><p><em>Image source:</em> <a href="https://ico.org.uk/for-organisations/guide-to-data-protection/guide-to-the-general-data-protection-regulation-gdpr/encryption/what-types-of-encryption-are-there/#:~:text=There%20are%20two%20types%20of,used%20for%20encryption%20and%20decryption"><em>https://ico.org.uk/for-organisations/guide-to-data-protection/guide-to-the-general-data-protection-regulation-gdpr/encryption/what-types-of-encryption-are-there/#:~:text=There are two types of, used for encryption and decryption</em></a><em>.</em></p><blockquote><strong><em>EXAMPLE</em></strong><em>: When you browse through a website that is secure (HTTPS) encryption had occurred using the protocol called </em><strong><em>TLS</em></strong><em> (Transport layer security) or </em><strong><em>SSL</em></strong><em>(Secure socket layer). This protocol secures communications by using what’s known as an </em><a href="https://www.cloudflare.com/learning/ssl/how-does-public-key-encryption-work/"><em>asymmetric public key infrastructure</em></a><em>.</em></blockquote><ol><li>The private key — this key is controlled by the owner of a website and it is kept, as the reader may have speculated, private. This key lives on a web server and is used to decrypt information encrypted by the public key.</li><li>The public key — this key is available to everyone who wants to interact with the server securely. Information that’s encrypted by the public key can only be decrypted by the private key.</li></ol><blockquote><strong>Source:</strong><em> </em><a href="https://www.cloudflare.com/en-gb/learning/ssl/what-is-https/"><em>https://www.cloudflare.com/en-gb/learning/ssl/what-is-https/</em></a></blockquote><h3>Hashing</h3><p>Hashing is the process of converting one set of data (plain text) into another set of data (hashed data) using a hash function.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1010/0*NAZlq66h6aBJsmVQ" /></figure><blockquote><strong><em>HASH FUNCTION</em></strong><em> is a mathematical function that takes an arbitrary length of input and gives out a fixed length of the hash value.<br></em> <strong>Hashing is not easily reversible, it is majorly used for data integrity.</strong></blockquote><blockquote><strong><em>EXAMPLE</em></strong><em>: </em>When you want to save your password on the database you don’t save the plain text in case there is a data bridge on the database you save the hash value. This way you can hash the incoming password and compare it with the hash value stored in the database.</blockquote><h3>ENCODING</h3><p>Encoding is the process of converting data into a specialised format for data transmission or storage.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/225/0*-ZITlrdVVPeTcUIx" /><figcaption>An example of how a computer works using binary code</figcaption></figure><blockquote><strong><em>EXAMPLE</em></strong><em>: </em>When you transfer data from your computer to another computer it cannot transfer the data you see directly, for example, if you are sending “Hello World” from one computer to another computer, it cannot transfer it as “Hello World”, it converts the “Hello World” in to binary, might be something like this “010010000110010101101100011011000110111100100000010101110110111101110010011011000110010000001010” and transfers it because wires can transmit only binary data.<br><strong><em>Source</em></strong>: <a href="https://www.quora.com/Why-is-encoding-needed">https://www.quora.com/Why-is-encoding-needed</a></blockquote><p><strong>Useful Resource :</strong> <a href="https://www.packetlabs.net/posts/encryption-encoding-and-hashing/#:~:text=In">https://www.packetlabs.net/posts/encryption-encoding-and-hashing/#:~:text=In</a> Summary%3A,to protect confidentiality of data.</p><p><a href="https://cheapsslsecurity.com/blog/explained-hashing-vs-encryption-vs-encoding/">https://cheapsslsecurity.com/blog/explained-hashing-vs-encryption-vs-encoding/</a></p><p><strong>If you find this article helpful, follow me on my social media accounts:</strong></p><p><a href="http://www.linkedin.com/in/whalewalker">www.linkedin.com/in/whalewalker</a></p><ul><li><a href="https://github.com/whalewalker">whalewalker - Overview</a></li><li><a href="https://twitter.com/whale_walker">JavaScript is not available.</a></li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=e3e58c6a65d0" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Linked List Part 1: Singly Linked List.]]></title>
            <link>https://whalewalker.medium.com/linked-list-part-1-singly-linked-list-a0d38280fb59?source=rss-afa8f3b12d92------2</link>
            <guid isPermaLink="false">https://medium.com/p/a0d38280fb59</guid>
            <dc:creator><![CDATA[Abdullah Ismail]]></dc:creator>
            <pubDate>Mon, 08 Mar 2021 14:03:36 GMT</pubDate>
            <atom:updated>2021-03-08T14:03:36.631Z</atom:updated>
            <content:encoded><![CDATA[<p>Arrays are great for storing things in a certain order, but they have drawbacks. The capacity of the array must be fixed when it is created, and adding item and deleting item at the inner positions of an array can be time consuming if many item must be shifted.</p><p>I will introduce a data structure known as a<strong> Linked list, </strong>which provide an alternative to an array-based structure.</p><p>A <strong>Linked list</strong>, is a collection of <strong><em>nodes </em></strong>that collectively form<em> </em><strong><em>linear sequence</em></strong>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/276/1*IaFh61d-jrG--D8u_ZREmg.png" /><figcaption>Singly linked list</figcaption></figure><p><strong>Type of linked list:</strong><br>1. Singly Linked List<br>2. Doubly Linked List<br>3. Circular Linked List</p><p>A <strong>node</strong> is a container that provides the ability to both store data and store the address location to other nodes.</p><p>In its simplest form , a Node class that contains a generics look like this.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/391/1*odtKG2R6g0oldlq3ZpP7XQ.png" /><figcaption>A generic node class in java</figcaption></figure><p><strong><em>What is generics</em></strong><br><strong><em>generics</em></strong> <em>enable types (classes and interfaces) to be parameters when defining classes, interfaces and methods. Much like the more familiar formal parameters used in method declarations, type parameters provide a way for you to re-</em><strong><em>use</em></strong><em> the same code with different inputs.</em></p><p>A singly linked list instance(object) must keep a reference to the first node and the last node of the list, known as the <strong><em>head</em></strong> and <strong><em>tail.</em></strong></p><p>The <strong><em>Head</em></strong> node, hold the first value and the reference to the next node of any singly linked list.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/491/1*xeBUnvzISLhv9w_x-xTVNA.png" /><figcaption>Image show the head of a singly linked list</figcaption></figure><p>The <strong><em>Tail node</em></strong>, hold the last value and its reference point to null of any singly linked list.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/727/1*sYjqXLMIknRfblXmbarBZQ.png" /><figcaption>image show the head and tail of a linked list.</figcaption></figure><p>In this section. we present a complete implementation of a singly linked list class using generics.</p><p>Singly linked list support the following methods:<br>1. <strong><em>size()</em></strong>: Returns the number of element in the list.<br>2. <strong><em>isEmpty()</em></strong>: Returns true if the list is empty, and false otherwise.<br>3. <strong><em>first()</em></strong>: Returns (but does not remove) the first element in the list.<br>4. <strong><em>last()</em></strong>: Returns (but does not remove) the last element in the list.<br>5.<strong><em> insertFront()</em></strong>: Adds new element to the front of the list.<br>6. <strong><em>insertEnd()</em></strong>: Adds new element to the end of the list.<br>7.<strong><em> removeFirst()</em></strong>: Removes and return the value removed from the list.</p><h3>Implementing singly linked list using generics.</h3><p>Node class consist of the data and the a object that reference the next node in a singly linked list.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/391/1*odtKG2R6g0oldlq3ZpP7XQ.png" /><figcaption>A generic node class in java</figcaption></figure><p>Node getters and setters allows us to access and mutate the instance variables in our node class.<br>very soon you’ll see them in action.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/456/1*5HGni1aS_cf93hF7baV1-w.png" /><figcaption>Node getters and setters</figcaption></figure><p>Singly linked list class consist of head, tail and size of list and a constructor that instantiate the instance variables.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/708/1*FdVlP0ySefE6Rb8IbrSEMw.png" /><figcaption>Singly linked list using generics .</figcaption></figure><blockquote>Inserting a data to the beginning of a singly linked list</blockquote><figure><img alt="" src="https://cdn-images-1.medium.com/max/564/1*56q0AT1sy0_SpJSRgtx52g.png" /><figcaption>Inserting node at the beginning of a singly linked list.</figcaption></figure><p>The above diagram show how to insert a data at the beginning of a linked list.<br>(a) Before insertion (b) After a new node is created and linked to the existing head (c) After reassignment of the head reference to the newest node.<br><strong><em>Where ∅ :</em></strong> means null;</p><p><strong><em>Algorithm</em></strong> (insertFront(data)):<br><strong>newest = Node(data) </strong>{<em>create new node instance storing reference to element data}<br></em><strong>newest.next = head </strong><em>{set new node’s next to reference to the old head node}<br></em><strong>head = newest </strong><em>{set variable head to reference the new node}<br></em><strong>size = size + 1</strong><em> {Increment node count}</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/565/1*aI3lppNsUnMRdrrV210-hw.png" /><figcaption>Code snippet for inserting data at the front of a singly linked list</figcaption></figure><blockquote>Inserting a data to the end of a singly linked list</blockquote><figure><img alt="" src="https://cdn-images-1.medium.com/max/604/1*48-39SJQZclzQbDktWRf-Q.png" /><figcaption>Inserting node at the end of a singly linked list.</figcaption></figure><p>The above diagram shows how to insert a data at the end of a linked list.<br>(a) Before the inserting; (b)After creating a new node and linked to null; (c) After reassignment of the tail reference . Note that we must set the next link of the tail node in;</p><p><strong><em>Algorithm</em></strong> (insertEnd(data)): <br>newest = Node(data) <em>{create new node instance storing reference storing to element data}</em><br>newest.next = null <em>{set new node’s next to reference the null object}</em><br>tail.next = newest <em>{make old tail node point to new node}</em><br>tail = newest <em>{set variable tail to reference the new node}</em><br>size = size + 1 <em>{increment the node count}</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/563/1*TiUVNUvUEff5a7krodvHog.png" /><figcaption>Code snippet for inserting data at the end of a singly linked list</figcaption></figure><blockquote>Check if linked list is empty</blockquote><p><strong><em>Algorithm</em></strong> (isEmpty()):<br>To check if singly linked list is empty is to check if the linked list size count is zero.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/264/1*sAC-1pXgRSQ2dv5MKb_7lg.png" /><figcaption>linked list is empty</figcaption></figure><blockquote>Get first data in singly linked list</blockquote><p><strong><em>Algorithm</em></strong> (first()):<br><em>Check if singly linked list is empty</em><br><em> if true throw an exception</em>(<strong><em>linked list underflow exception</em></strong>)<br>else:<br><em>return the first element</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/656/1*6KFLuvYysztgpdI4ZnLguQ.png" /><figcaption>Exception class that is thrown</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/809/1*4YLO3x99sEjEI7zHAykQsg.png" /><figcaption>Get first data in a singly linked list</figcaption></figure><blockquote>Get last data in singly linked list</blockquote><p>Algorithm (last()):<br><em>Check if singly linked list is empty</em><br><em> if true throw an exception</em>(<strong><em>linked list underflow exception</em></strong>)<br>else:<br><em>return the last element</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/831/1*N4s19lzFORQEBqK-k-lmDg.png" /><figcaption>Get last data in a singly linked list</figcaption></figure><blockquote>Remove the first element in a singly linked list</blockquote><figure><img alt="" src="https://cdn-images-1.medium.com/max/592/1*4VxUCMo1bL4wMMsaUjRWyg.png" /><figcaption>remove a node from the beginning of singly linked list</figcaption></figure><p>The above diagram show how to remove a node at the beginning of a linked list.<br>(a) Before the removal; (b) After “linking out” the old head; (c) Final configuration;</p><p><strong><em>Algorithm</em></strong> (removeFirst()):<br><em>if</em> <strong><em>head == null</em></strong> then<br>throw an exception(<strong><em>linked list underflow exception)<br>else:<br>head = head.next </em></strong><em>{make head point to next node (or null))</em><strong><em><br>size = size — 1 </em></strong><em>{decrement the node count)<br>if </em><strong><em>size == 0 </em></strong><em>{check if size is zero, if true make tail point to null}<br></em><strong><em>tail = null;</em></strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/807/1*YwkcCbxL3xiVPoxp-I6jVQ.png" /><figcaption>remove a node from the beginning of singly linked list</figcaption></figure><h3><strong>In summary all our code :</strong></h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/616/1*3v85cM8i3NgeOd_y4bj-cQ.png" /><figcaption>Node code snippet</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/967/1*0YRh5FpAVvD7zI26uEeR0g.png" /><figcaption>Singly linked list code snippet</figcaption></figure><blockquote>Thanks for reading. <br>Endeavour to like, share, comment and follow me love you.<br>Twitter handle: <a href="https://twitter.com/Whale_walker">https://twitter.com/Whale_walker</a><br>LinkedIn handle: <a href="https://www.linkedin.com/in/abdullah-ismail-183a001a1/">https://www.linkedin.com/in/abdullah-ismail-183a001a1/</a></blockquote><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=a0d38280fb59" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>