C program to implement linked list using array abstract data type

Sep 16, 2019Download as docx, pdf

0 likes2,954 views

loyola ICAM college of engineering and technology

This document contains C code to implement a linked list and array-based list data structure (ADT). It includes functions to create, insert, delete, search and display elements in the list. For the linked list implementation, nodes containing data and pointer to next node are used. Functions like create, insert, delete manipulate the pointers to manage the list. The array implementation uses an array to store elements and tracks the number of elements. Functions perform similar operations of adding, removing and searching elements in the array representing the list.

C Program To Implement Linked List Using Array Abstract Data Type
#include<stdio.h>
#include<conio.h>
#include<alloc.h>
#include<stdlib.h>
voidcreate( )
voidinsert( )
voiddelete()
voiddisplay( )
struct node
{
intdata;
struct node *link;
};
struct node *first= NULL, *last= NULL, *next,*prev,*cur;
voidmain( )
{
intch;
clrscr( );
printf ("nSINGLYLINKED LIST");
do
{
printf ("n1.CREATE n 2.INSERTn 3.DELETE n 4.EXIT n");
printf ("nENTER YOUR CHOICE: ");
scanf ("%d",&ch );
switch(ch)
{
case 1:
create( );
display( );
break;
case 2:
insert( );
display( );
break;
case 3:
delete( );
display( );
break;
case 4:
exit(0);
}
} while( ch<= 3)
}
voidcreate( )
{
cur = ( struct node*)malloc(sizeof (structnode));
printf ("nENTER THE DATA:");

scanf ("%d", &cur?data);
cur?link= NULL;
first= cur;
last= cur;
}
voidinsert( )
{
intpos,c = 1;
cur = (structnode*)malloc(sizeof (structnode) );
printf (“ENTERTHE DATA :”);
scanf (“%d”,&cur?data);
printf(“ENTERTHE POSITION:”);
scanf (“%d”,&pos );
if ( (pos= = 1)&& (first!= NULL) )
{
cur?link= first;
first= cur;
}
else
{
next= first;
while (c< pos )
{
prev= next;
next= prev?link;
c++;
}
if ( prev= = NULL)
{
printf (“nINVALIDPOSITION n”);
}
else
{
cur?link= prev?link;
prev?link =cur;
if (cur?link= = NULL)
{
last= cur;
}
}
}
}
voiddelete()
{
intpos,c=1;
printf (“ENTERTHE POSITION :”);
scanf (“%d”,&pos);
if (first= = NULL)
{
printf (“nLIST IS EMPTY n”);

Most read

}
else if (pos= = 1&& first?link== NULL)
{
printf(“Ndeletedelementis%dn”,cur?data);
free(cur);
}
else
{
next= first;
while (c< pos )
{
prev= next;
next= next?link;
c++;
}
prev?link =next?link;
next?link=NULL;
if (next= = NULL)
{
printf (“nINVALIDPOSITION n“);
}
else
{
printf (“nDELETED ELEMENT IS%dn”,next?data);
free (next);
if(prev?link== NULL)
{
last= prev;
}
}
}
}
voiddisplay( )
{
cur = first;
while (cur!= NULL)
{
printf (“n%d”,cur?data);
cur = cur?link;
}
}

C Program to implement List ADT using Arrays
#include<stdio.h>
#include<conio.h>
#define MAX 10
void create();
void insert();
void deletion();
void search();
void display();
int a,b[20], n, p, e, f, i, pos;
void main()
{
//clrscr();
int ch;
char g='y';
do
{
printf("n main Menu");
printf("n 1.Create n 2.Delete n 3.Search n 4.Insert n 5.Displayn 6.Exit n");
printf("n Enter your Choice");
scanf("%d", &ch);
switch(ch)
{
case 1:
create();
break;
case 2:
deletion();
break;
case 3:
search();
break;
case 4:
insert();
break;
case 5:
display();
break;
case 6:
exit();
break;
default:
printf("n Enter the correct choice:");
}
printf("n Do u want to continue:::");
scanf("n%c", &g);

}
while(g=='y'||g=='Y');
getch();
}
void create()
{
printf("n Enter the number of nodes");
scanf("%d", &n);
for(i=0;i<n;i++)
{
printf("n Enter the Element:",i+1);
scanf("%d", &b[i]);
}
}
void deletion()
{
printf("n Enter the position u want to delete::");
scanf("%d", &pos);
if(pos>=n)
{
printf("n Invalid Location::");
}
else
{
for(i=pos+1;i<n;i++)
{
b[i-1]=b[i];
}
n--;
}
printf("n The Elements after deletion");
for(i=0;i<n;i++)
{
printf("t%d", b[i]);
}
}
void search()
{
printf("n Enter the Element to be searched:");
scanf("%d", &e);
for(i=0;i<n;i++)
{
if(b[i]==e)
{
printf("Value is in the %d Position", i);
}
else
{
printf("Value %d is not in the list::", e);
continue;

}
}
}
void insert()
{
printf("n Enter the position u need to insert::");
scanf("%d", &pos);
if(pos>=n)
{
printf("n invalid Location::");
}
else
{
for(i=MAX-1;i>=pos-1;i--)
{
b[i+1]=b[i];
}
printf("n Enter the element to insert::n");
scanf("%d",&p);
b[pos]=p;
n++;
}
printf("n The list after insertion::n");
display();
}
void display()
{
printf("n The Elements of The list ADT are:");
for(i=0;i<n;i++)
{
printf("nn%d", b[i]);
}
}

The document discusses different types of linked lists including: - Singly linked lists that can only be traversed in one direction. - Doubly linked lists that allow traversal in both directions using forward and backward pointers. - Circular linked lists where the last node points back to the first node allowing continuous traversal. - Header linked lists that include a header node at the beginning for simplified insertion and deletion. Header lists can be grounded where the last node contains a null pointer or circular where the last node points to the header. - Two-way or doubly linked lists where each node contains a forward and backward pointer allowing bidirectional traversal through the list.

Abstract class in c++Sujan Mia

This document discusses abstract classes in C++. It defines an abstract class as a class designed to be used as a base class that cannot be instantiated and must contain at least one pure virtual function. It provides an example of how to declare an abstract class with a pure virtual function and how to derive a class from an abstract class, overriding the pure virtual functions. The importance of abstract classes is that they allow common functionality to be defined for derived classes while leaving implementation details to the derived classes.

Recursive FunctionHarsh Pathak

Data Structures Using C Practical File Rahul Chugh

Stack using Linked ListSayantan Sur

Hashing PPTSaurabh Kumar

This document discusses hashing and different techniques for implementing dictionaries using hashing. It begins by explaining that dictionaries store elements using keys to allow for quick lookups. It then discusses different data structures that can be used, focusing on hash tables. The document explains that hashing allows for constant-time lookups on average by using a hash function to map keys to table positions. It discusses collision resolution techniques like chaining, linear probing, and double hashing to handle collisions when the hash function maps multiple keys to the same position.

Applications of stackeShikshak

The document discusses applications of stacks, including reversing strings and lists, Polish notation for mathematical expressions, converting between infix, prefix and postfix notations, evaluating postfix and prefix expressions, recursion, and the Tower of Hanoi problem. Recursion involves defining a function in terms of itself, with a stopping condition. Stacks can be used to remove recursion by saving local variables at each step.

Linked listKalaivaniKS1

Linked lists are linear data structures where elements are linked using pointers. The three main types are singly, doubly, and circular linked lists. Linked lists allow dynamic memory allocation and fast insertion/deletion compared to arrays but slower access. A linked list contains nodes, each with a data field and pointer to the next node. Basic operations on linked lists include insertion, deletion, traversal, and search. Doubly linked lists include pointers to both the next and previous nodes.

Join operationJeeva Nanthini

Different algorithms can be used to implement joins in a database, including nested loop, block nested loop, indexed nested loop, merge, and hash joins. The optimal algorithm depends on factors like whether indexes are available on the joined attributes and the relative sizes and block distributions of the relations. Database tuning involves monitoring performance and adjusting aspects like indexes, queries, and design to improve response times and throughput.

Structure of a C programDavid Livingston J

This document provides an overview of the basic structure and components of a C program. It discusses the main parts including preprocessor directives like #include and #define, comments, data types, variables, statements, functions, and input/output functions like printf, scanf, getchar and putchar. It explains that a C program requires a main function and can declare global variables and functions. The document also covers format specifiers and escape sequences used with functions like printf.

Linked lists aKhuram Shahzad

Method overridingAzaz Maverick

Method overriding allows a subclass to provide a specific implementation of a method that is already provided by its superclass. The subclass method must have the same name, parameters and return type as the superclass method. This allows the subclass to modify the behavior as needed and is how polymorphism is implemented. The super keyword can be used to call the superclass method from the overriding method.

Call by valueDharani G

The document discusses call by value and call by reference in functions. Call by value passes the actual value of an argument to the formal parameter, so any changes made to the formal parameter do not affect the actual argument. Call by reference passes the address of the actual argument, so changes to the formal parameter do directly modify the actual argument. An example program demonstrates call by value, where changing the formal parameter does not change the original variable.

11 constructors in derived classesDocent Education

1. Constructors in derived classes are executed after the base class constructor. When an object of a derived class is created, the base class constructor is executed first, followed by the derived class constructor. 2. Destructors in a class hierarchy are invoked in the reverse order of constructor execution. The destructor of the class whose constructor was executed last is called first when the object goes out of scope. 3. The document provides examples of constructors and destructors in single inheritance, multiple inheritance, and multilevel inheritance hierarchies. It demonstrates the order of constructor and destructor execution in various scenarios.

Data Structure (Queue)Adam Mukharil Bachtiar

Queue is a first-in first-out (FIFO) data structure where elements can only be added to the rear of the queue and removed from the front of the queue. It has two pointers - a front pointer pointing to the front element and a rear pointer pointing to the rear element. Queues can be implemented using arrays or linked lists. Common queue operations include initialization, checking if empty/full, enqueue to add an element, and dequeue to remove an element. The document then describes how these operations work for queues implemented using arrays, linked lists, and circular arrays. It concludes by providing exercises to implement specific queue tasks.

Ppt on Linked list,stack,queueSrajan Shukla

This document discusses different types of linked lists, including singly linked lists, circular linked lists, and doubly linked lists. It provides examples of circular linked lists and explains that in a circular linked list, the last node contains the address of the first node so that the list can be traversed repeatedly. The document also discusses common linked list operations like insertion and deletion of nodes. Finally, it covers stacks and queues, defining them as LIFO and FIFO data structures, respectively, and providing examples of their implementation and different types.

Modular Programming in Cbhawna kol

The document discusses modular programming in C. Modular programming involves breaking a large program into smaller sub-programs or modules. This makes the program easier to use, maintain and reuse code. Functions are a key part of modular programming in C. Functions allow breaking a program into reusable modules that perform specific tasks. Functions can be called anywhere in a program to perform tasks without rewriting code. Modular programming improves readability, reduces errors and makes programs easier to maintain and modify.

Tree - Data StructureAshim Lamichhane

This document provides an overview of trees as a non-linear data structure. It begins by discussing how trees are used to represent hierarchical relationships and defines some key tree terminology like root, parent, child, leaf, and subtree. It then explains that a tree consists of nodes connected in a parent-child relationship, with one root node and nodes that may have any number of children. The document also covers tree traversal methods like preorder, inorder, and postorder traversal. It introduces binary trees and binary search trees, and discusses operations on BSTs like search, insert, and delete. Finally, it provides a brief overview of the Huffman algorithm for data compression.

Kruskal's algorithmRaj Kumar Ranabhat

Circular queueLovely Professional University

A circular queue is a fixed size data structure that follows FIFO (first in, first out) principles. Elements are added to the rear of the queue and removed from the front. When the rear reaches the end, it wraps around to the beginning so the queue space is used efficiently. Common circular queue operations include enqueue to add an element, dequeue to remove an element, and display to output all elements.

Union in C programmingKamal Acharya

Unions allow a variable to hold objects of different types in the same memory location. All members of a union share the same memory location, which is the size of the largest member. This means unions save memory by storing all members in one block, but the programmer must ensure the correct member is being accessed based on the data currently stored. The example program defines a union called Student containing different data types, reads values into members, and displays the members to demonstrate unions share the same memory location.

Data Structure and Algorithms ArraysManishPrajapati78

Nested queries in databaseSatya P. Joshi

Data types in c++Venkata.Manish Reddy

The document discusses various data types in C++ including built-in, user-defined, and derived types. Structures and unions allow grouping of dissimilar element types. Classes define custom data types that can then be used to create objects. Enumerated types attach numeric values to named constants. Arrays define a collection of elements of the same type in sequence. Functions contain blocks of code to perform tasks. Pointers store memory addresses.

Functions in csunila tharagaturi

The document discusses functions in C programming. The key points are: 1. A function is a block of code that performs a specific task. Functions allow code reusability and modularity. 2. main() is the starting point of a C program where execution begins. User-defined functions are called from main() or other functions. 3. Functions can take arguments and return values. There are different ways functions can be defined based on these criteria. 4. Variables used within a function have local scope while global variables can be accessed from anywhere. Pointers allow passing arguments by reference.

Central processing unit and stack organization r013arunachalamr16

The document discusses various aspects of computer architecture including the central processing unit (CPU), components of the CPU, register organization, control unit operation, addressing modes, and instruction formats. It provides details on general register organization, ALU control, register and memory stack organization, one-address, two-address, and three-address instructions, and different types of addressing modes like direct, indirect, relative, indexed, and register addressing modes. Examples are given to illustrate these concepts.

Operator OverloadingNilesh Dalvi

Operator overloading allows user-defined types in C++ to behave similarly to built-in types when operators are used on them. It allows operators to have special meanings depending on the context. Some key points made in the document include: - Operator overloading enhances the extensibility of C++ by allowing user-defined types to work with operators like addition, subtraction, etc. - Common operators that can be overloaded include arithmetic operators, increment/decrement, input/output, function call, and subscript operators. - To overload an operator, a member or friend function is declared with the same name as the operator being overloaded. This function performs the desired operation on the class type. -

Threaded Binary Treekhabbab_h

One dimensional operation of Array in C- language 9096308941

This C program allows the user to perform various operations on arrays, including insertion, deletion, sorting, searching, and displaying elements. The user is prompted to enter the number of values to store in an integer array. A menu is then displayed listing the available array operations. Based on the user's selection, the appropriate operation is performed, such as inserting a new element at a specified position, deleting an element, sorting the array, searching for a given value, or displaying all elements. This continues in a loop until the user chooses to exit the program.

C basicsMSc CST

The document contains 20 programs demonstrating various C programming concepts like data types, operators, control structures, functions, arrays, structures, pointers and data structures. Program 1 shows the use of arithmetic operators to add two numbers. Program 2 demonstrates logical operators in an if-else statement to find the greatest of three numbers. Program 3 uses relational operators in an if-else statement to check if a number is even or odd.

More Related Content

What's hot (20)

Join operationJeeva Nanthini

Structure of a C programDavid Livingston J

Linked lists aKhuram Shahzad

Method overridingAzaz Maverick

Call by valueDharani G

11 constructors in derived classesDocent Education

Data Structure (Queue)Adam Mukharil Bachtiar

Ppt on Linked list,stack,queueSrajan Shukla

Modular Programming in Cbhawna kol

Tree - Data StructureAshim Lamichhane

Kruskal's algorithmRaj Kumar Ranabhat

Circular queueLovely Professional University

Union in C programmingKamal Acharya

Data Structure and Algorithms ArraysManishPrajapati78

Nested queries in databaseSatya P. Joshi

Data types in c++Venkata.Manish Reddy

Functions in csunila tharagaturi

Central processing unit and stack organization r013arunachalamr16

Operator OverloadingNilesh Dalvi

Threaded Binary Treekhabbab_h

Join operationJeeva Nanthini

Structure of a C programDavid Livingston J

Linked lists aKhuram Shahzad

Method overridingAzaz Maverick

Call by valueDharani G

11 constructors in derived classesDocent Education

Data Structure (Queue)Adam Mukharil Bachtiar

Ppt on Linked list,stack,queueSrajan Shukla

Modular Programming in Cbhawna kol

Tree - Data StructureAshim Lamichhane

Kruskal's algorithmRaj Kumar Ranabhat

Circular queueLovely Professional University

Union in C programmingKamal Acharya

Data Structure and Algorithms ArraysManishPrajapati78

Nested queries in databaseSatya P. Joshi

Data types in c++Venkata.Manish Reddy

Functions in csunila tharagaturi

Central processing unit and stack organization r013arunachalamr16

Operator OverloadingNilesh Dalvi

Threaded Binary Treekhabbab_h

Similar to C program to implement linked list using array abstract data type (20)

One dimensional operation of Array in C- language 9096308941

C basicsMSc CST

Array imp of listElavarasi K

This document describes an array implementation of a list data structure in C. It defines functions to create, insert, delete, search, and display elements in an array representing a list. The main function uses a menu-driven system to call these functions and allow the user to test the list operations by entering their choices and inputs. The functions implement basic list operations like adding elements to empty positions, deleting by shifting elements, linear searching, and displaying the current list.

Circular linked listSayantan Sur

This document describes a menu driven C program that implements operations on a circular linked list. The main menu allows the user to perform operations like create, display, insert, delete, count, sort, and reverse the circular linked list. Functions are defined to implement each operation - such as the create() function allocates a new node, the display() function prints the list, and insert functions add a node to the beginning, middle or end of the list.

Double linked listSayantan Sur

This document describes a menu-driven C program that implements a doubly linked list. The program allows the user to perform operations like creation, insertion, deletion, sorting, and searching of nodes in the doubly linked list. The main functions include create() to create nodes, display() to print the list, insert() to add nodes at different positions, delete() to remove nodes, sort() to sort the list, and find() to search for a node. The program uses a menu to allow the user to select the desired operation on the doubly linked list.

Single linked listSayantan Sur

C programmsMukund Gandrakota

The document contains code snippets for several C programs including: 1) A program to add complex numbers by defining a structure for complex numbers and taking user input for real and imaginary parts of two numbers and printing their sum. 2) A binary search algorithm implementation to search a sorted array for a key and return its index. 3) A bubble sort algorithm implementation to sort an array of long integers in ascending order by swapping adjacent elements.

Data Structure in C Programming LanguageArkadeep Dey

This document contains program code in C language for various operations on arrays, linked lists, and recursion. It includes programs for 1) creating and manipulating 1D and 2D arrays, 2) basic singly linked list operations like creation, traversal, counting nodes, insertion, deletion and reversal, 3) recursion based programs for factorial, GCD, Fibonacci series, tower of Hanoi and 4) menu driven programs to perform linked list operations like insertion and deletion at different positions. The programs demonstrate basic data structures concepts in C.

ADA FILEGaurav Singh

1. The document contains 10 code snippets implementing various data structures and algorithms in C/C++ like linear search, binary search, merge sort, quick sort, selection sort, bubble sort, stack implementation using array, Fibonacci series using recursion, queue implementation using array, and binary search tree operations like insertion, deletion, display and traversal. 2. The codes include functions for searching an element, sorting arrays, implementing stacks and queues as well as common operations on binary search trees. 3. Main functions are included to accept user input, call the relevant functions and output the results of operations like searching, sorting or tree traversals.

QueueUsingArray-1.pptxnansbsbssnsnxbxbhsabhinandpk2405

week-6xKITE www.kitecolleges.com

Data Structure using CBilal Mirza

DataStructures notesLakshmi Sarvani Videla

Data struture labkrishnamurthy Murthy.Tt

The document is a lab manual for data structures using C programming. It contains 12 programs related to data structures and algorithms including linear search, binary search, sorting algorithms like bubble sort, selection sort, insertion sort, quick sort and merge sort. Each program contains the aim, code and output for a different data structure operation or algorithm implementation. The manual provides examples and step-by-step instructions for students to complete various exercises to learn data structures and algorithms using the C programming language.

C lab manaualmanoj11manu

systems programming lab programs in cMeghna Roy

This document contains code for a direct linking loader in two passes. The first pass loader reads the input file, stores the section information in a table, and generates an output file with the section table. The second pass loader reads the section table, resolves symbol references, and generates an executable file with the linked object code and resolved addresses. It opens input files, reads section headers, symbols and addresses, resolves symbols, and writes linked output to files at specified memory locations.

Circular queueShobhaHiremath8

This document describes a program that implements a circular queue data structure in C using an array. It defines functions for inserting elements into the queue, deleting elements from the queue, and displaying the contents of the queue. The main part of the program runs a menu loop that allows the user to test the insertion, deletion, and display functions and observe overflow and underflow conditions.

C programKomal Singh

This document contains code snippets for various operations on linked lists and polynomials in C programming language. It includes 9 questions covering topics like: 1. Counting characters, words, digits in a string 2. Squeezing a string by removing spaces 3. Swapping values using pointers 4. Comparing two strings 5. Concatenating two strings 6. Multiplying two matrices 7. Reversing a string 8. Performing insertion, deletion and traversal on singly linked lists 9. Implementing polynomial addition and multiplication by representing polynomials as linked lists For each question, the C code to implement the operation is provided along with sample input/output.

C Programming labVikram Nandini

This document contains C programming code examples and exercises provided by Vikram Neerugatti, an assistant professor. It includes multiple code snippets demonstrating various programming concepts like data types, operators, control structures, functions, arrays, strings, pointers, structures and file handling. The document is divided into sections with labels like 1(A), 2(B) etc. and each section contains 1-3 code examples/exercises on different C programming topics.

SaraPICSara Sahu

One dimensional operation of Array in C- language 9096308941

C basicsMSc CST

Array imp of listElavarasi K

Circular linked listSayantan Sur

Double linked listSayantan Sur

Single linked listSayantan Sur

C programmsMukund Gandrakota

Data Structure in C Programming LanguageArkadeep Dey

ADA FILEGaurav Singh

QueueUsingArray-1.pptxnansbsbssnsnxbxbhsabhinandpk2405

week-6xKITE www.kitecolleges.com

Data Structure using CBilal Mirza

DataStructures notesLakshmi Sarvani Videla

Data struture labkrishnamurthy Murthy.Tt

C lab manaualmanoj11manu

systems programming lab programs in cMeghna Roy

Circular queueShobhaHiremath8

C programKomal Singh

C Programming labVikram Nandini

SaraPICSara Sahu

Recently uploaded (20)

operationg systemsdocumentmemorymanagementSNIGDHAAPPANABHOTLA

Semi-Conductor ppt ShubhamSeSemi-Con.pptxstudyshubham18

FINAL 2013 Module 20 Corrosion Control and Sequestering PPT Slides.pptxkippcam

362 Alec Data Center Solutions-Slysium Data Center-AUH-ABB Furse.pdfdjiceramil

WIRELESS COMMUNICATION SECURITY AND IT’S PROTECTION METHODSsamueljackson3773

In this paper, the author discusses the concerns of using various wireless communications and how to use them safely. The author also discusses the future of the wireless industry, wireless communication security, protection methods, and techniques that could help organizations establish a secure wireless connection with their employees. The author also discusses other essential factors to learn and note when manufacturing, selling, or using wireless networks and wireless communication systems.

ACEP Magazine Fifth Edition on 5june2025Rahul

This document provides information about the Fifth edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.

IntroSlides-June-GDG-Cloud-Munich community gathering@Netlight.pdf

IntroSlides-June-GDG-Cloud-Munich community [email protected]Luiz Carneiro

The first edition of the AIAG-VDA FMEA.pptxMayank Mathur

New Microsoft Office Word Documentfrf.docxmisheetasah

Structure of OS ppt Structure of OsS pptWahajch

3. What is the principles of Teamwork_Module_V1.0.pptengaash9

362 Alec Data Center Solutions-Slysium Data Center-AUH-ABB Furse.pdfdjiceramil

02 - Ethics & Professionalism - BEM, IEM, MySET.PPTSharinAbGhani1

First Review PPT gfinal gyft ftu liu yrfut goSowndarya6

CyberShieldX provides end-to-end security solutions, including vulnerability assessment, penetration testing, and real-time threat detection for business websites. It ensures that organizations can identify and mitigate security risks before exploitation. Unlike traditional security tools, CyberShieldX integrates AI models to automate vulnerability detection, minimize false positives, and enhance threat intelligence. This reduces manual effort and improves security accuracy. Many small and medium businesses lack dedicated cybersecurity teams. CyberShieldX provides an easy-to-use platform with AI-powered insights to assist non-experts in securing their websites. Traditional enterprise security solutions are often expensive. CyberShieldX, as a SaaS platform, offers cost-effective security solutions with flexible pricing for businesses of all sizes. Businesses must comply with security regulations, and failure to do so can result in fines or data breaches. CyberShieldX helps organizations meet compliance requirements efficiently.

SEW make Brake BE05 – BE30 Brake – Repair Kitprojectultramechanix

22PCOAM16 _ML_Unit 3 Notes & Question bankGuru Nanak Technical Institutions

Research_Sensitization_&_Innovative_Project_Development.pptxniranjancse

Irja Straus - Beyond Pass and Fail - DevTalks.pdfIrja Straus

chemistry investigatory project for class 12Susis10

Computer_vision-photometric_image_formation.pdfkumarprem6767merp

operationg systemsdocumentmemorymanagementSNIGDHAAPPANABHOTLA

Semi-Conductor ppt ShubhamSeSemi-Con.pptxstudyshubham18

FINAL 2013 Module 20 Corrosion Control and Sequestering PPT Slides.pptxkippcam

362 Alec Data Center Solutions-Slysium Data Center-AUH-ABB Furse.pdfdjiceramil

WIRELESS COMMUNICATION SECURITY AND IT’S PROTECTION METHODSsamueljackson3773

ACEP Magazine Fifth Edition on 5june2025Rahul

IntroSlides-June-GDG-Cloud-Munich community [email protected]Luiz Carneiro

The first edition of the AIAG-VDA FMEA.pptxMayank Mathur

New Microsoft Office Word Documentfrf.docxmisheetasah

Structure of OS ppt Structure of OsS pptWahajch

3. What is the principles of Teamwork_Module_V1.0.pptengaash9

362 Alec Data Center Solutions-Slysium Data Center-AUH-ABB Furse.pdfdjiceramil

02 - Ethics & Professionalism - BEM, IEM, MySET.PPTSharinAbGhani1

First Review PPT gfinal gyft ftu liu yrfut goSowndarya6

SEW make Brake BE05 – BE30 Brake – Repair Kitprojectultramechanix

22PCOAM16 _ML_Unit 3 Notes & Question bankGuru Nanak Technical Institutions

Research_Sensitization_&_Innovative_Project_Development.pptxniranjancse

Irja Straus - Beyond Pass and Fail - DevTalks.pdfIrja Straus

chemistry investigatory project for class 12Susis10

Computer_vision-photometric_image_formation.pdfkumarprem6767merp

C program to implement linked list using array abstract data type

1. C Program To Implement Linked List Using Array Abstract Data Type #include<stdio.h> #include<conio.h> #include<alloc.h> #include<stdlib.h> voidcreate( ) voidinsert( ) voiddelete() voiddisplay( ) struct node { intdata; struct node *link; }; struct node *first= NULL, *last= NULL, *next,*prev,*cur; voidmain( ) { intch; clrscr( ); printf ("nSINGLYLINKED LIST"); do { printf ("n1.CREATE n 2.INSERTn 3.DELETE n 4.EXIT n"); printf ("nENTER YOUR CHOICE: "); scanf ("%d",&ch ); switch(ch) { case 1: create( ); display( ); break; case 2: insert( ); display( ); break; case 3: delete( ); display( ); break; case 4: exit(0); } } while( ch<= 3) } voidcreate( ) { cur = ( struct node*)malloc(sizeof (structnode)); printf ("nENTER THE DATA:");

2. scanf ("%d", &cur?data); cur?link= NULL; first= cur; last= cur; } voidinsert( ) { intpos,c = 1; cur = (structnode*)malloc(sizeof (structnode) ); printf (“ENTERTHE DATA :”); scanf (“%d”,&cur?data); printf(“ENTERTHE POSITION:”); scanf (“%d”,&pos ); if ( (pos= = 1)&& (first!= NULL) ) { cur?link= first; first= cur; } else { next= first; while (c< pos ) { prev= next; next= prev?link; c++; } if ( prev= = NULL) { printf (“nINVALIDPOSITION n”); } else { cur?link= prev?link; prev?link =cur; if (cur?link= = NULL) { last= cur; } } } } voiddelete() { intpos,c=1; printf (“ENTERTHE POSITION :”); scanf (“%d”,&pos); if (first= = NULL) { printf (“nLIST IS EMPTY n”);

3. } else if (pos= = 1&& first?link== NULL) { printf(“Ndeletedelementis%dn”,cur?data); free(cur); } else { next= first; while (c< pos ) { prev= next; next= next?link; c++; } prev?link =next?link; next?link=NULL; if (next= = NULL) { printf (“nINVALIDPOSITION n“); } else { printf (“nDELETED ELEMENT IS%dn”,next?data); free (next); if(prev?link== NULL) { last= prev; } } } } voiddisplay( ) { cur = first; while (cur!= NULL) { printf (“n%d”,cur?data); cur = cur?link; } }

4. C Program to implement List ADT using Arrays #include<stdio.h> #include<conio.h> #define MAX 10 void create(); void insert(); void deletion(); void search(); void display(); int a,b[20], n, p, e, f, i, pos; void main() { //clrscr(); int ch; char g='y'; do { printf("n main Menu"); printf("n 1.Create n 2.Delete n 3.Search n 4.Insert n 5.Displayn 6.Exit n"); printf("n Enter your Choice"); scanf("%d", &ch); switch(ch) { case 1: create(); break; case 2: deletion(); break; case 3: search(); break; case 4: insert(); break; case 5: display(); break; case 6: exit(); break; default: printf("n Enter the correct choice:"); } printf("n Do u want to continue:::"); scanf("n%c", &g);

5. } while(g=='y'||g=='Y'); getch(); } void create() { printf("n Enter the number of nodes"); scanf("%d", &n); for(i=0;i<n;i++) { printf("n Enter the Element:",i+1); scanf("%d", &b[i]); } } void deletion() { printf("n Enter the position u want to delete::"); scanf("%d", &pos); if(pos>=n) { printf("n Invalid Location::"); } else { for(i=pos+1;i<n;i++) { b[i-1]=b[i]; } n--; } printf("n The Elements after deletion"); for(i=0;i<n;i++) { printf("t%d", b[i]); } } void search() { printf("n Enter the Element to be searched:"); scanf("%d", &e); for(i=0;i<n;i++) { if(b[i]==e) { printf("Value is in the %d Position", i); } else { printf("Value %d is not in the list::", e); continue;

6. } } } void insert() { printf("n Enter the position u need to insert::"); scanf("%d", &pos); if(pos>=n) { printf("n invalid Location::"); } else { for(i=MAX-1;i>=pos-1;i--) { b[i+1]=b[i]; } printf("n Enter the element to insert::n"); scanf("%d",&p); b[pos]=p; n++; } printf("n The list after insertion::n"); display(); } void display() { printf("n The Elements of The list ADT are:"); for(i=0;i<n;i++) { printf("nn%d", b[i]); } }

C program to implement linked list using array abstract data type

Recommended

More Related Content

What's hot (20)

Similar to C program to implement linked list using array abstract data type (20)

Recently uploaded (20)

C program to implement linked list using array abstract data type