C program to implement linked list using array abstract data type

Sep 16, 2019Download as DOCX, PDF0 likes2,947 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”);

}
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]);
}
}

Two dimensional arrays in C can be declared and initialized similarly to one dimensional arrays, with the first subscript specifying the row and second subscript specifying the column. Elements are stored in contiguous memory locations in row-major order. The document then presents a sample problem of reading a 2D array of integers from a file, finding the largest element, and printing it out. It also discusses using typedef to define custom data types like matrices and strings.

Pointers C programmingAppili Vamsi Krishna

A pointer is a variable that stores the memory address of another variable. Pointers allow functions to modify variables in the caller and are useful for handling arrays and dynamic memory allocation. Pointers contain the address of the memory location they point to. Pointer variables can be declared to hold these memory addresses and can then be used to indirectly access the value at the addressed location.

C programming - StringAchyut Devkota

1. A string is a one-dimensional array of characters terminated by a null character. Strings can be initialized during compilation or at runtime. 2. Common string functions like scanf(), gets(), getchar() are used to input strings while printf(), puts(), putchar() are used to output strings. 3. Library functions like strcpy(), strcat(), strcmp(), strlen() allow manipulation of strings like copying, concatenation, comparison and finding length.

C++ classes tutorialsMayank Jain

The document discusses object-oriented programming (OOP) concepts in C++. It defines key OOP concepts like classes, objects, encapsulation, inheritance and polymorphism. It explains that in OOP, classes encapsulate both data and functions that operate on that data. Classes define public and private sections to control access to members. The document also provides examples to demonstrate class definition, object creation, member functions and destructors.

Basics of Object Oriented Programming in PythonSujith Kumar

The document discusses key concepts of object-oriented programming (OOP) including classes, objects, methods, encapsulation, inheritance, and polymorphism. It provides examples of classes in Python and explains OOP principles like defining classes with the class keyword, using self to reference object attributes and methods, and inheriting from base classes. The document also describes operator overloading in Python to allow operators to have different meanings based on the object types.

Data Structures Using C Practical File Rahul Chugh

classes and objects in C++HalaiHansaika

Classes allow users to bundle data and functions together. A class defines data members and member functions. Data members store data within each object, while member functions implement behaviors. Classes support access specifiers like public and private to control access to members. Objects are instances of classes that allocate memory for data members. Member functions can access object data members and are called on objects using dot notation. Friend functions allow non-member functions to access private members of classes.

Data Structures Practical File Harjinder Singh

The document describes programs to implement various operations on singly linked lists including insertion, deletion, counting nodes, creating a list, traversing a list, and copying a list. It provides functions for insertion at the beginning, end, and before/after a given node. Deletion functions remove from the beginning, end, or by item value. Counting returns the total nodes or occurrences of a value. Traversal and copying print or duplicate the list.

Strings in CKamal Acharya

Strings are arrays of characters that are null-terminated. They can be manipulated using functions like strlen(), strcpy(), strcat(), and strcmp(). The document discusses initializing and reading strings, passing strings to functions, and using string handling functions to perform operations like copying, concatenating, comparing, and reversing strings. It also describes arrays of strings, which are 2D character arrays used to store multiple strings. Examples are provided to demonstrate reading and sorting arrays of strings.

String cthirumalaikumar3

This document discusses strings in C programming. It explains that a string in C is an array of characters that ends with a null character. Common string functions like strcpy(), strcat(), strcmp() are presented for copying, concatenating, and comparing strings. The document also discusses declaring and initializing string variables, storing strings in memory, input/output of strings, and justification of strings using printf(). Library functions for manipulating strings from the string.h header file are described.

DSC program.pdfProf. Dr. K. Adisesha

This document provides C programs to implement various data structures and algorithms. It is divided into two parts. Part A includes programs to find GCD using recursion, generate Pascal's triangle using binomial coefficients, find Fibonacci numbers recursively, implement Towers of Hanoi recursively, find the largest and smallest element in an array, write even and odd numbers to separate files, store student records in a file, and sort city names alphabetically. Part B includes programs to sort arrays using insertion, quick, merge, selection and bubble sort and perform linear and binary searches recursively. It also includes programs to implement stacks, queues, linked lists and binary trees.

Constructor and destructor in C++Lovely Professional University

Constructors and destructors are special member functions in C++ that are used to initialize and cleanup objects. Constructors are called automatically when an object is created and are used to set initial values for object attributes. Destructors are called automatically when an object is destroyed and can perform cleanup tasks. There are different types of constructors like default, parameterized, and copy constructors. Destructors do not have parameters and are used to deallocate memory when objects are destroyed.

Lab manual data structure (cs305 rgpv) (usefulsearch.org) (useful search)Make Mannan

This document provides a lab manual for experiments on data structures. It includes 20 experiments covering topics like arrays, matrices, recursion, strings, stacks, queues, linked lists, trees, graphs and sorting algorithms. Each experiment contains the aim, introduction, source code, sample output and questions. The experiments provide hands-on practice with commonly used data structures and algorithms.

Enums in cVijayananda Ratnam Ch

What are variables and keywords in c++Abdul Hafeez

Hi I am Abdul Hafeez ,I made this videos for Beginner and intermediate students, they can easily understand basic structure of c++ programming. In this lecture students can understand easily: * what is variables in c++ Programming? * variables and data types in c++ Programming * how to declare variables in c++ Programming * how to initialize variables in c++ Programming * keywords in c programming * keywords in c++ programming * variables and data types in c++ Programming * size of data types in c++ Programming * range of data types in c++ programming * how are variables stored in memory? C++ tutorials in URDU - HINDI Basic concepts and advance concepts

Arrays in cJeeva Nanthini

The document discusses arrays in C programming. It defines arrays as fixed-size collections of elements of the same data type that allow storing and processing large amounts of data. Arrays can be one-dimensional, two-dimensional or multi-dimensional. One-dimensional arrays use a single subscript to identify elements, while two-dimensional arrays use two subscripts to represent rows and columns. The document provides examples of declaring, initializing, and using one-dimensional and two-dimensional arrays in C code.

Dynamic Memory allocationGrishma Rajput

The document discusses dynamic memory allocation in C. It explains that dynamic allocation allows programs to obtain more memory while running or release unused memory. The main dynamic memory functions in C are malloc(), calloc(), free(), and realloc(). Malloc allocates memory, calloc allocates and initializes to zero, free deallocates memory, and realloc changes the size of allocated memory. Examples of using each function are provided.

design and analysis of algorithm Lab filesNitesh Dubey

This document contains details of experiments conducted as part of a "Design and Analysis of Algorithm Lab" course. It includes 10 experiments covering algorithms like binary search, heap sort, merge sort, selection sort, insertion sort, quick sort, knapsack problem, travelling salesman problem, minimum spanning tree (using Kruskal's algorithm), and N queen problem (using backtracking). For each experiment, it provides the objective, program code implementation, and result. The document is submitted by a student to their professor for the lab session.

structure and unionstudent

- A structure is a user-defined data type that groups logically related data items of different data types into a single unit. Structures allow related data to be accessed and managed together. - Structures can contain nested structures as members. Nested structure members are accessed using two period operators (e.g. e1.doj.day). - Structures can be passed to functions as parameters and returned from functions. Pointers to structures are declared and accessed using arrow (->) operator instead of period operator. - A union shares the same memory space for multiple data types, allocating only enough space for its largest member. Unions allow different types to share the same memory location.

File handling in cDavid Livingston J

The document discusses files and file operations in C/C++. It defines a file as a collection of bytes stored on a secondary storage device. There are different types of files like text files, data files, program files, and directory files. It describes opening, reading, writing, appending, and closing files using functions like fopen(), fread(), fwrite(), fclose(), etc. It also discusses random and sequential file access and modifying file contents using functions like fseek(), fread(), fwrite().

RECURSION IN C v_jk

Functions allow programmers to break programs into smaller, reusable parts. There are two types of functions in C: library functions and user-defined functions. User-defined functions make programs easier to understand, debug, test and maintain. Functions are declared with a return type and can accept arguments. Functions can call other functions, allowing for modular and structured program design.

Data Structure in C (Lab Programs)Saket Pathak

Object Oriented Programming Using C++ Practical FileHarjinder Singh

This document contains a practical file submitted by Jasbir Singh for an Object Oriented Programming course using C++. It includes an acknowledgement page thanking various people for their support and guidance. The document then provides a table of contents listing 53 programs with their page numbers and brief descriptions. The programs demonstrate various C++ concepts like classes, objects, inheritance, polymorphism, operator overloading and more.

Final JAVA Practical of BCA SEM-5.Nishan Barot

The document contains code snippets for various Java programs that perform tasks like calculating the area of a circle, finding the factorial of a number, displaying prime numbers, sorting an array, counting characters in a string, reversing a string, creating and running threads, handling exceptions, and creating a simple applet with buttons to change the background color. The code examples demonstrate basic Java programming concepts like classes, methods, loops, arrays, exceptions, threads, applets, and event handling.

C++ Files and Streams Ahmed Farag

This document discusses files and streams in C++. It explains that the fstream library allows reading from and writing to files using ifstream, ofstream, and fstream objects. It covers opening, closing, writing to, and reading from files, noting that files must be opened before use and should be closed after. The standard openmode arguments and open(), close(), write, and read syntax are provided. Examples of reading from and writing to files are included.

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.

Function in c programumesh patil

The document discusses functions in C programming. It defines functions as self-contained blocks of code that perform a specific task. Functions make a program modular and easier to debug. There are four main types of functions: functions with no arguments and no return value, functions with no arguments but a return value, functions with arguments but no return value, and functions with both arguments and a return value. Functions are called by their name and can pass data between the calling and called functions using arguments.

Python listMohammed Sikander

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)

Strings in CKamal Acharya

String cthirumalaikumar3

DSC program.pdfProf. Dr. K. Adisesha

Constructor and destructor in C++Lovely Professional University

Lab manual data structure (cs305 rgpv) (usefulsearch.org) (useful search)Make Mannan

Enums in cVijayananda Ratnam Ch

What are variables and keywords in c++Abdul Hafeez

Arrays in cJeeva Nanthini

Dynamic Memory allocationGrishma Rajput

design and analysis of algorithm Lab filesNitesh Dubey

structure and unionstudent

File handling in cDavid Livingston J

RECURSION IN C v_jk

Data Structure in C (Lab Programs)Saket Pathak

Object Oriented Programming Using C++ Practical FileHarjinder Singh

Final JAVA Practical of BCA SEM-5.Nishan Barot

C++ Files and Streams Ahmed Farag

Call by valueDharani G

Function in c programumesh patil

Python listMohammed Sikander

Strings in CKamal Acharya

String cthirumalaikumar3

DSC program.pdfProf. Dr. K. Adisesha

Constructor and destructor in C++Lovely Professional University

Lab manual data structure (cs305 rgpv) (usefulsearch.org) (useful search)Make Mannan

Enums in cVijayananda Ratnam Ch

What are variables and keywords in c++Abdul Hafeez

Arrays in cJeeva Nanthini

Dynamic Memory allocationGrishma Rajput

design and analysis of algorithm Lab filesNitesh Dubey

structure and unionstudent

File handling in cDavid Livingston J

RECURSION IN C v_jk

Data Structure in C (Lab Programs)Saket Pathak

Object Oriented Programming Using C++ Practical FileHarjinder Singh

Final JAVA Practical of BCA SEM-5.Nishan Barot

C++ Files and Streams Ahmed Farag

Call by valueDharani G

Function in c programumesh patil

Python listMohammed Sikander

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)

aset and manufacturing optimization and connecting edgealilamisse

Building Security Systems in Architecture.pdfrabiaatif2

Building security systems are essential for protecting people, property, and assets within a structure. These systems include a range of technologies and strategies such as surveillance cameras (CCTV), access control systems, alarm systems, security lighting, and motion detectors. Modern security solutions often integrate smart technology, allowing remote monitoring and real-time alerts through mobile devices. Access control systems, like key cards or biometric scanners, ensure that only authorized individuals can enter certain areas, enhancing both safety and privacy. Alarm systems, whether triggered by unauthorized entry, fire, or environmental hazards, play a critical role in emergency response. Additionally, video surveillance acts as both a deterrent and a tool for investigating incidents. An effective building security system is carefully planned during the design phase, taking into account the building's size, purpose, and potential risks. Ultimately, robust security systems are vital for ensuring peace of mind, protecting lives, and preserving valuable assets.

211421893-M-Tech-CIVIL-Structural-Engineering-pdf.pdfinmishra17121973

Lecture 13 (Air and Noise Pollution and their Control) (1).pptxhuzaifabilalshams

MAQUINARIA MINAS CEMA 6th Edition (1).pdfssuser562df4

IntroSlides-April-BuildWithAI-VertexAI.pdfLuiz Carneiro

BTech_CSE_LPU_Presentation.pptx.........jinny kaur

The B.Tech in Computer Science and Engineering (CSE) at Lovely Professional University (LPU) is a four-year undergraduate program designed to equip students with strong theoretical and practical foundations in computing. The curriculum is industry-aligned and includes core subjects like programming, data structures, algorithms, operating systems, computer networks, databases, and software engineering. Students can also choose specializations such as Artificial Intelligence, Data Science, Cybersecurity, and Cloud Computing. LPU emphasizes hands-on learning through modern labs, live projects, and internships. The university has collaborations with tech giants like Google, Microsoft, and IBM, offering students excellent exposure and placement opportunities. With a vibrant campus life, international diversity, and a strong placement record, LPU's B.Tech CSE program prepares students to become future-ready professionals in the fast-evolving tech world.

Unit III.pptx IT3401 web essentials presentatiolakshitakumar291

Machine learning project on employee attrition detection using (2).pptxrajeswari89780

"Heaters in Power Plants: Types, Functions, and Performance Analysis"Infopitaara

This presentation provides a detailed overview of heaters used in power plants, focusing mainly on feedwater heaters, their types, construction, and role in improving thermal efficiency. It explains the difference between open and closed feedwater heaters, highlights the importance of low-pressure and high-pressure heaters, and describes the orientation types—horizontal and vertical. The PPT also covers major heater connections, the three critical heat transfer zones (desuperheating, condensing, and subcooling), and key performance indicators such as Terminal Temperature Difference (TTD) and Drain Cooler Approach (DCA). Additionally, it discusses common operational issues, monitoring parameters, and the arrangement of steam and drip flows. Understanding and maintaining these heaters is crucial for ensuring optimum power plant performance, reducing fuel costs, and enhancing equipment life.

Reagent dosing (Bredel) presentation.pptxAlejandroOdio

Smart_Storage_Systems_Production_Engineering.pptxrushikeshnavghare94

RESORT MANAGEMENT AND RESERVATION SYSTEM PROJECT REPORT.Kamal Acharya

The project developers created a system entitled Resort Management and Reservation System; it will provide better management and monitoring of the services in every resort business, especially D’ Rock Resort. To accommodate those out-of-town guests who want to remain and utilize the resort's services, the proponents planned to automate the business procedures of the resort and implement the system. As a result, it aims to improve business profitability, lower expenses, and speed up the resort's transaction processing. The resort will now be able to serve those potential guests, especially during the high season. Using websites for faster transactions to reserve on your desired time and date is another step toward technological advancement. Customers don’t need to walk in and hold in line for several hours. There is no problem in converting a paper-based transaction online; it's just the system that will be used that will help the resort expand. Moreover, Gerard (2012) stated that “The flexible online information structure was developed as a tool for the reservation theory's two primary applications. Computer use is more efficient, accurate, and faster than a manual or present lifestyle of operation. Using a computer has a vital role in our daily life and the advantages of the devices we use.

Gas Power Plant for Power Generation SystemJourneyWithMe1

Smart Storage Solutions.pptx for production engineeringrushikeshnavghare94

QA/QC Manager (Quality management Expert)rccbatchplant

ADVXAI IN MALWARE ANALYSIS FRAMEWORK: BALANCING EXPLAINABILITY WITH SECURITYijscai

With the increased use of Artificial Intelligence (AI) in malware analysis there is also an increased need to understand the decisions models make when identifying malicious artifacts. Explainable AI (XAI) becomes the answer to interpreting the decision-making process that AI malware analysis models use to determine malicious benign samples to gain trust that in a production environment, the system is able to catch malware. With any cyber innovation brings a new set of challenges and literature soon came out about XAI as a new attack vector. Adversarial XAI (AdvXAI) is a relatively new concept but with AI applications in many sectors, it is crucial to quickly respond to the attack surface that it creates. This paper seeks to conceptualize a theoretical framework focused on addressing AdvXAI in malware analysis in an effort to balance explainability with security. Following this framework, designing a machine with an AI malware detection and analysis model will ensure that it can effectively analyze malware, explain how it came to its decision, and be built securely to avoid adversarial attacks and manipulations. The framework focuses on choosing malware datasets to train the model, choosing the AI model, choosing an XAI technique, implementing AdvXAI defensive measures, and continually evaluating the model. This framework will significantly contribute to automated malware detection and XAI efforts allowing for secure systems that are resilient to adversarial attacks.

Mirada a 12 proyectos desarrollados con BIM.pdftopitodosmasdos

Data Structures_Searching and Sorting.pptxRushaliDeshmukh2

Level 1-Safety.pptx Presentation of Electrical SafetyJoseAlbertoCariasDel

aset and manufacturing optimization and connecting edgealilamisse

Building Security Systems in Architecture.pdfrabiaatif2

211421893-M-Tech-CIVIL-Structural-Engineering-pdf.pdfinmishra17121973

Lecture 13 (Air and Noise Pollution and their Control) (1).pptxhuzaifabilalshams

MAQUINARIA MINAS CEMA 6th Edition (1).pdfssuser562df4

IntroSlides-April-BuildWithAI-VertexAI.pdfLuiz Carneiro

BTech_CSE_LPU_Presentation.pptx.........jinny kaur

Unit III.pptx IT3401 web essentials presentatiolakshitakumar291

Machine learning project on employee attrition detection using (2).pptxrajeswari89780

"Heaters in Power Plants: Types, Functions, and Performance Analysis"Infopitaara

Reagent dosing (Bredel) presentation.pptxAlejandroOdio

Smart_Storage_Systems_Production_Engineering.pptxrushikeshnavghare94

RESORT MANAGEMENT AND RESERVATION SYSTEM PROJECT REPORT.Kamal Acharya

Gas Power Plant for Power Generation SystemJourneyWithMe1

Smart Storage Solutions.pptx for production engineeringrushikeshnavghare94

QA/QC Manager (Quality management Expert)rccbatchplant

ADVXAI IN MALWARE ANALYSIS FRAMEWORK: BALANCING EXPLAINABILITY WITH SECURITYijscai

Mirada a 12 proyectos desarrollados con BIM.pdftopitodosmasdos

Data Structures_Searching and Sorting.pptxRushaliDeshmukh2

Level 1-Safety.pptx Presentation of Electrical SafetyJoseAlbertoCariasDel

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