EmbLogic's Blog

Category Archives: Data Structures with C

Code for finding out the middle node in a single linked list in C language.

RCS file: middle_of_linked_list.c,v Working file: middle_of_linked_list.c head: 1.15 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 15;    selected revisions: 15 description: Code to demonstrate how to find the middle of a linked list in C langauge. … Continue reading →

Posted in Data Structures with C | Leave a comment

creating linked list using structures and function

RCS file: header.h,v Working file: header.h head: 1.10 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 10; selected revisions: 10 description: created a header file including all predefined header files. learnt that header file “string.h” is … Continue reading →

Posted in Data Structures with C | Leave a comment

Linklist using functions

1 2 RCS file: heaher.h,v 3 Working file: heaher.h 4 head: 1.1 5 branch: 6 locks: strict 7 access list: 8 symbolic names: 9 keyword substitution: kv 10 total revisions: 1; selected revisions: 1 11 description: 12 gave parameters for … Continue reading →

Posted in Data Structures with C, Project 2: Multiple Data Compression and Encryption | Leave a comment

Code to demonstrate how to delete an alternate number of nodes in the single linked list in C.

RCS file: delete_linked_list.c,v Working file: delete_linked_list.c head: 1.13 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 13;    selected revisions: 13 description: Code to demonstrate how to delete alternate nodes in a single linked list in C … Continue reading →

Posted in Data Structures with C | Leave a comment

Code to demonstrate how to delete M nodes after N nodes in a single linked list in C .

RCS file: delete_M_nodes_after_N.c,v Working file: delete_M_nodes_after_N.c head: 1.9 branch: locks: strict root: 1.9 access list: symbolic names: keyword substitution: kv total revisions: 9;    selected revisions: 9 description: Code to demonstrate how to delete M nodes after N nodes in a … Continue reading →

Posted in Data Structures with C | Leave a comment

Display elements of a linked list using recursion in C language

RCS file: display_linked_list.c,v Working file: display_linked_list.c head: 1.10 branch: locks: strict root: 1.10 access list: symbolic names: keyword substitution: kv total revisions: 10;    selected revisions: 10 description: Code to demonstrate how to display a linked list using recursion in C … Continue reading →

Posted in Data Structures with C | Leave a comment

Program to delete a node at a specified position and also to delete the entire linked list in C language.

RCS file: delete_n_nodes.c,v Working file: delete_n_nodes.c head: 1.11 branch: locks: strict root: 1.11 access list: symbolic names: keyword substitution: kv total revisions: 11;    selected revisions: 11 description: Code to demonstrate how to delete a node at specified position and also … Continue reading →

Posted in Data Structures with C | Leave a comment

Program to remove duplicates from a sorted linked list in C language.

RCS file: remove_duplicate_sort.c,v Working file: remove_duplicate_sort.c head: 1.9 branch: locks: strict root: 1.9 access list: symbolic names: keyword substitution: kv total revisions: 9;    selected revisions: 9 description: Code to demonstrate how to remove duplicates in a sorted linked list. —————————- … Continue reading →

Posted in Data Structures with C | Leave a comment

Program to compare two single linked lists in C language.

RCS file: compare_linked_list.c,v Working file: compare_linked_list.c head: 1.9 branch: locks: strict root: 1.9 access list: symbolic names: keyword substitution: kv total revisions: 9;    selected revisions: 9 description: Code to demonstrate how to compare the two single linked lists in C. … Continue reading →

Posted in Data Structures with C | Leave a comment

Program that inserts a node at the Nth position in a single linked list in C language.

RCS file: insert_at_n_pos.c,v Working file: insert_at_n_pos.c head: 1.12 branch: locks: strict root: 1.12 access list: symbolic names: keyword substitution: kv total revisions: 12;    selected revisions: 12 description: Developing a general code that inserts a node at the N-position specified by … Continue reading →

Posted in Data Structures with C | Leave a comment

Code to demonstrate how to create a copy of a single linked list in C.

RCS file: copy_linked_list.c,v Working file: copy_linked_list.c head: 1.14 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 14;    selected revisions: 14 description: Code to demonstrate how to copy an already existing linked list. —————————- revision 1.14 date: … Continue reading →

Posted in Data Structures with C | Leave a comment

Appending a linked list at the end of another linked list in C

RCS file: append_list.c,v Working file: append_list.c head: 1.17 branch: locks: strict root: 1.17 access list: symbolic names: keyword substitution: kv total revisions: 17;    selected revisions: 17 description: Program that appends a linked list to another linked list. —————————- revision 1.17   … Continue reading →

Posted in Data Structures with C | Leave a comment

Sorting of values in the linked list in C language.

RCS file: Sorting_linked_list.c,v Working file: Sorting_linked_list.c head: 1.5 branch: locks: strict root: 1.5 access list: symbolic names: keyword substitution: kv total revisions: 5;    selected revisions: 5 description: Program to sort the info. in the linked list. Main menu is prepared … Continue reading →

Posted in Data Structures with C | Leave a comment

Program to count the number of nodes in the singly linked list in C

RCS file: countnodes.c,v Working file: countnodes.c head: 1.6 branch: locks: strict root: 1.6 access list: symbolic names: keyword substitution: kv total revisions: 6;    selected revisions: 6 description: Count the total number of nodes in the linked list. —————————- revision 1.6   … Continue reading →

Posted in Data Structures with C | Leave a comment

Reversing a Linked list using four pointers in C Language

RCS file: reverse_linked_list.c,v Working file: reverse_linked_list.c head: 1.16 branch: locks: strict root: 1.16 access list: symbolic names: keyword substitution: kv total revisions: 16;    selected revisions: 16 description: Program for reverse of a linked list in C language. —————————- revision 1.16   … Continue reading →

Posted in Data Structures with C | Leave a comment