tag:blogger.com,1999:blog-38437489184603199792012-01-24T08:35:57.272-08:00<b><u>www.computergurus.co.cc<br> computergurus.blogspot.com</u></b>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.comBlogger201100tag:blogger.com,1999:blog-3843748918460319979.post-35667055127690466052008-05-15T19:14:00.001-07:002008-05-15T19:15:20.891-07:00<span style="font-weight:bold;">Program</span> - Sorting using Radix Sort Method<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Sort<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Sort-Radix.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-3566705512769046605?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-17523699615671242822008-05-15T19:13:00.000-07:002008-05-15T19:15:20.892-07:00<span style="font-weight:bold;">Program</span> - Sorting using Quick Sort Method<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Sort<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Sort-Quick.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-1752369961567124282?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-68495897874535493462008-05-15T19:12:00.000-07:002008-05-15T19:15:20.893-07:00<span style="font-weight:bold;">Program</span> - Sorting using Heap Sort Method<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Sort<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Sort-Heap.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-6849589787453549346?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-12926293113657331592008-05-15T19:11:00.000-07:002008-05-15T19:15:20.893-07:00<span style="font-weight:bold;">Program</span> - Bubble Sort on Array<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Sort<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Sort-Bubble.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-1292629311365733159?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-7715415337577785132008-05-15T19:10:00.000-07:002008-05-15T19:15:20.894-07:00<span style="font-weight:bold;">Program</span> - Selection Sort on Array<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Sort<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Sort-Selectin.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-771541533757778513?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-68997799974188412712008-05-15T19:07:00.000-07:002008-05-15T19:15:20.895-07:00<span style="font-weight:bold;">Program</span> - Insertion Sort on Array<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Sort<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Sort-Insertion.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-6899779997418841271?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-7554282357986368652008-05-15T19:05:00.000-07:002008-05-15T19:15:20.895-07:00<span style="font-weight:bold;">Program</span> - Implementaion of Circular Double Linked List<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - <br />Insert at front<br />Insert at rear<br />Insert at a particular position<br />Delete from front <br />Delete from rear<br />Delete from a particular position<br />Delete an element having a certain value<br />Reverse the linked list<br />Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/LinkedList-Double-Circular.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-755428235798636865?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-55880400520350932822008-05-15T19:04:00.000-07:002008-05-15T19:15:20.896-07:00<span style="font-weight:bold;">Program</span> - Implementaion of Circular Single Linked List<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - <br />Insert at front<br />Insert at rear<br />Insert at a particular position<br />Delete from front <br />Delete from rear<br />Delete from a particular position<br />Delete an element having a certain value<br />Reverse the linked list<br />Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/LinkedList-Single-Circular.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-5588040052035093282?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-11302099252513022232008-05-15T19:02:00.000-07:002008-05-15T19:15:20.896-07:00<span style="font-weight:bold;">Program</span> - Implementaion of Double Linked List<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - <br />Insert at front<br />Insert at rear<br />Insert at a particular position<br />Delete from front <br />Delete from rear<br />Delete from a particular position<br />Delete an element having a certain value<br />Reverse the linked list<br />Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/LinkedList-Double.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-1130209925251302223?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-13517600069367591662008-05-15T18:59:00.000-07:002008-05-15T19:15:20.897-07:00<span style="font-weight:bold;">Program</span> - Implementaion of Single Linked List<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - <br />Insert at front<br />Insert at rear<br />Insert at a particular position<br />Delete from front <br />Delete from rear<br />Delete from a particular position<br />Delete an element having a certain value<br />Reverse the linked list<br />Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/LinkedList-Single.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-1351760006936759166?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-10969669327042713062008-05-15T18:57:00.000-07:002008-05-15T19:15:20.898-07:00<span style="font-weight:bold;">Program</span> - Implementaion of Linked List using Arrays<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Insert, Delete, Search, Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/LinkedList-Array.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-1096966932704271306?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-13040597519878836372008-05-15T18:52:00.000-07:002008-05-15T19:15:20.898-07:00<span style="font-weight:bold;">Program</span> - Implementaion of Input Restricted and Output REstricted Dequeue using Array<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Insert at front, Insert at rear, Delete from front, Delete from rear<br />(For both Input / Output Restricted Dequeue)<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/DeQueue-Array.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-1304059751987883637?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-44756199114902301212008-05-15T18:49:00.000-07:002008-05-15T19:15:20.898-07:00<span style="font-weight:bold;">Program</span> - Implementaion of Circular Queue using Linked List<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Insert, Delete, Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Queue-Circular-LL.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-4475619911490230121?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-7551416955332006052008-05-15T18:47:00.000-07:002008-05-15T19:15:20.899-07:00<span style="font-weight:bold;">Program</span> - Implementaion of Circular Queue using Arrays<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Insert, Delete, Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Queue-Circular-Array.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-755141695533200605?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-18814135476346803592008-05-15T18:41:00.000-07:002008-05-15T19:15:20.899-07:00<span style="font-weight:bold;">Program</span> - Implementation of Queue using Linked List<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Insert, Delete, Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Queue-LL.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-1881413547634680359?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-79726284132673231102008-05-15T09:59:00.001-07:002008-05-15T19:15:20.900-07:00<span style="font-weight:bold;">Program</span> - Queue Implementation using Arrays<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Insert, Delete, Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Queue-Array.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-7972628413267323110?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-80823295806840304332008-05-14T13:20:00.000-07:002008-05-14T13:25:26.941-07:00<span style="font-weight:bold;">Program</span> - Program for conversion of infix to postfix using Stacks and evaluation of postfix expression<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Conversion of Infix to Postfix, Evaluation of Postfix expression<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Infix-Postfix.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-8082329580684030433?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-24209736158142638552008-05-14T13:05:00.000-07:002008-05-14T13:15:10.605-07:00<span style="font-weight:bold;">Program</span> - Implementation of Stacks using Arrays<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Display, Push, Pop<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Array.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-2420973615814263855?l=programming-computergurus.blogspot.com' alt='' /></div>Gary Sanethttps://profiles.google.com/115065388474819332626noreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-91225084923589135672008-05-13T23:52:00.001-07:002008-05-14T13:15:10.605-07:00<span style="font-weight:bold;">Program</span> - Implementation of Stacks using Linked Lists<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Display, Push, Pop<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Stacks-LL.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-9122508492358913567?l=programming-computergurus.blogspot.com' alt='' /></div>Guru Sanket Biswalnoreply@blogger.com0tag:blogger.com,1999:blog-3843748918460319979.post-79234570168472625842008-05-13T13:37:00.000-07:002008-05-15T09:53:09.812-07:00<span style="font-weight:bold;">Program</span> - Implementation of Arrays<br /><span style="font-weight:bold;">Language</span> - C<br /><span style="font-weight:bold;">Topic</span> - Data Structures using 'C'<br /><span style="font-weight:bold;">Functions</span> - Create, Insert, Sort, Search, Display<br /><br /><center><span style="font-weight: bold; color: rgb(255, 0, 0);"><span style="font-style: italic;">Click on the upper left corner of the window below and scroll to read the program !!</span></span><br /><iframe id="urlframe" src="http://gurusanketbiswal.googlepages.com/Array.htm" frameborder="1" height="550" width="100%">ComputerGurus.blogspot.com .... </iframe></center><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/3843748918460319979-7923457016847262584?l=programming-computergurus.blogspot.com' alt='' /></div>Guru Sanket Biswalnoreply@blogger.com0