0% found this document useful (0 votes)

5 views38 pages

Practical - 07 OBJECTIVE - Write A C Program To Implement Operations On Singly

The document describes implementing various operations on doubly linked lists like insert at front, insert after, insert at end, and delete a node. It includes functions for these operations and a main function that tests them by adding some nodes to the list, displaying it, deleting a node and displaying it again.

Uploaded by

rocknau123

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

5 views38 pages

Practical - 07 OBJECTIVE - Write A C Program To Implement Operations On Singly

Uploaded by

rocknau123

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 38

NAME: SUMAN

PAGE NO. 18
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

PRACTICAL – 07
OBJECTIVE -Write a C program to Implement operations on Singly
linked list.
PROGRAM –
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
void append(struct node**);
void addatbeg(struct node**);
void addatend(struct node**);
void addafter(struct node**);
void display(struct node **);
int count(struct node**);
void beg_delete(struct node **);
void end_delete(struct node **);
void loc_delete(struct node **);

struct node{
int data;
struct node *next;
};
struct node *head=NULL;
int main(){
int loc;
append(&head);
addatbeg(&head);
NAME: SUMAN
COURSE: BCA PAGE NO. 19
SEC: C
SEMESTER: 2
ROLL NO: 2392304

append(&head);
addatend(&head);
addatbeg(&head);
addafter(&head);
addatend(&head);

printf("Number of nodes = %d\n",count(&head));

display (&head);
beg_delete(&head);
end_delete(&head);
loc_delete(&head);
printf("after deletion at beginning,end, and specified position
data :\n");

display (&head);
}
void append(struct node **q){
int num;
printf("enter data you want to insert :");

scanf("%d",&num);
if(*q==NULL){
struct node *temp=(struct node *)malloc(sizeof(struct
node));
temp->data=num;
temp->next=*q;
*q=temp;
}
Else{
NAME: SUMAN
COURSE: BCA
SEC: C PAGE NO. 20
SEMESTER: 2
ROLL NO: 2392304

struct node p=q;

while(p->next!=NULL){
p=p->next;
}
struct node *temp=(struct node*)malloc(sizeof(struct
node));
temp->data=num;
temp->next=p->next;
p->next=temp;
}
}
void addatbeg(struct node **q){
struct node *temp;
int num;
printf("enter data you want to add at beginning :");
scanf("%d",&num);
temp=(struct node *)malloc(sizeof(struct node));
temp->data=num;
temp->next=*q;
*q=temp;
}
void addatend(struct node **q){
struct node *r,*p=*q;
int num;
printf("enter data you want to add at end : ");
scanf("%d",&num);
r=(struct node*)malloc(sizeof(struct node));
r->data=num;
while(p->next!=NULL){
NAME: SUMAN
COURSE: BCA PAGE NO. 21
SEC: C
SEMESTER: 2
ROLL NO: 2392304

p=p->next;
}
r->next=NULL;
p->next=r;
}
void addafter(struct node **q){
struct node *temp,*r;
temp=*q;
int num,loc;
printf("enter location for insertion of node : ");

scanf("%d",&loc);
printf("enter data you want to add at specific position : ");
scanf("%d",&num);
for(int i=1;i<loc;i++){
temp=temp->next;
if(temp==NULL){
printf("There are less no. of nodes\n");
return;
}
}
r=(struct node*)malloc(sizeof(struct node));
r->data=num;
r->next=temp->next;
temp->next=r;
}
void display(struct node **q){
struct node *ptr=head;
printf("data elements are : \n");
NAME: SUMAN
COURSE: BCA PAGE NO. 22
SEC: C
SEMESTER: 2
ROLL NO: 2392304

while(ptr->next!=NULL){
printf("%d\n",ptr->data);
ptr=ptr->next;
}
printf("%d\n",ptr->data);
}
int count(struct node **q){
int c=1;
struct node *d=head;
while(d->next!=NULL){
c++;
d=d->next;
}
return c;
}
void beg_delete(struct node **q){
struct node *temp=*q;
head=temp->next;
delete(temp);
}
void end_delete(struct node **q){
struct node *old,*temp=*q;
while(temp->next!=NULL){
old=temp;
temp=temp->next;
}
old->next=NULL;
delete(temp);
NAME: SUMAN PAGE NO. 23
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

void loc_delete(struct node **q){

struct node *old,*temp=*q;
int loc;
printf("enter location of the node in which you want to delete
node : ");
scanf("%d",&loc);
for(int i=1;i<=loc;i++){
old=temp;
temp=temp->next;
if(temp==NULL){
printf("less number of nodes");
return;
}
}
old->next=temp->next;
delete(temp);
}
OUTPUT –
enter data you want to insert :45
enter data you want to add at beginning :2
enter data you want to insert :67
enter data you want to add at end : 8
enter data you want to add at beginning :35
enter location for insertion of node : 3
enter data you want to add at specific position : 57
enter data you want to add at end : 82
Number of nodes = 7
NAME: SUMAN
PAGE NO. 24
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

data elements are :

35
2
45
57
67
8
82
enter location of the node in which you want to delete node : 2
after deletion at beginning,end, and specified position data :
data elements are :
2
45
67
8
NAME: SUMAN
COURSE: BCA PAGE NO. 25
SEC: C
SEMESTER: 2
ROLL NO: 2392304

PRACTICAL – 08

OBJECTIVE – Implement all operations on queue using circular linked

list.

PROGRAM –

#include<stdio.h>

#include<stdlib.h>

struct node{

int data;

struct node *link;

};

void add_cirq(struct node,struct node);

int del_cirq(struct node,struct node);

void display(struct node**);

int main(){

struct node f,r;

f=r=NULL;
NAME: SUMAN
COURSE: BCA PAGE NO. 26
SEC: C
SEMESTER: 2
ROLL NO: 2392304

int i;

add_cirq(&f,&r);

i=del_cirq(&f,&r);

printf("item deleted =%d\n",i);

display(&f);

void add_cirq(struct nodef,struct noder){

struct node *q;

int num;

printf("enter number to add at link : ");

scanf("%d",&num);

q=(struct node*)malloc(sizeof(struct node));

q->data=num;

if(*f==NULL){

*f=q;

}
NAME: SUMAN
COURSE: BCA PAGE NO. 27
SEC: C
SEMESTER: 2
ROLL NO: 2392304

else{

(*r)->link=q;

*r=q;

(*r)->link=*f;

int del_cirq(struct nodef,struct noder){

struct node *q;

int item;

if(*f==NULL){

printf("queue is empty");

else{

if(*f==*r){

item=(*f)->data;

free(*f);

*f=NULL;
NAME: SUMAN
COURSE: BCA PAGE NO. 28
SEC: C
SEMESTER: 2
ROLL NO: 2392304

*r=NULL;

else{

q=*f;

item=q->data;

*f=(*f)->link;

(*r)->link=*f;

free(q);

return (item);

return NULL;

void display(struct node **f){

struct node q=f,*p=NULL;

printf("data elements are :\n");

while(q!=p){
NAME: SUMAN
COURSE: BCA PAGE NO. 29
SEC: C
SEMESTER: 2
ROLL NO: 2392304

printf("%d\n",q->data);

q=q->link;

p=*f;

OUTPUT –

enter number to add at link : 675

enter number to add at link : 46

enter number to add at link : 876

item deleted =675

data elements are :

876
NAME: SUMAN
COURSE: BCA PAGE NO. 30
SEC: C
SEMESTER: 2
ROLL NO: 2392304

PRACTICAL – 9
OBJECTIVE: Implement all the operations on doubly linked list.
PROGRAM
#include <stdio.h>
#include <stdlib.h>
Struct Node {
Int data;
Struct Node* next;
Struct Node* prev;
};
Void insertFront(struct Node** head, int data) {
Struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = (*head);
newNode->prev = NULL;
if ((*head) != NULL)
(*head)->prev = newNode;
(*head) = newNode;
}
Void insertAfter(struct Node* prev_node, int data) {
If (prev_node == NULL) {
Printf(“previous node cannot be null”);
Return;
}
Struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = prev_node->next;
prev_node->next = newNode;
newNode->prev = prev_node;
NAME: SUMAN
COURSE: BCA PAGE NO. 31
SEC: C
SEMESTER: 2
ROLL NO: 2392304

if (newNode->next != NULL)
newNode->next->prev = newNode;
}
Void insertEnd(struct Node** head, int data) {
Struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = NULL;
struct Node* temp = *head;
if (*head == NULL) {
newNode->prev = NULL;
*head = newNode;
Return;
}
While (temp->next != NULL)
Temp = temp->next;
Temp->next = newNode;
newNode->prev = temp;
}
Void deleteNode(struct Node** head, struct Node* del_node) {
If (*head == NULL || del_node == NULL)
Return;
If (*head == del_node)
*head = del_node->next;
If (del_node->next != NULL)
Del_node->next->prev = del_node->prev;
If (del_node->prev != NULL)
Del_node->prev->next = del_node->next;
Free(del_node);
}
NAME: SUMAN
COURSE: BCA PAGE NO. 32
SEC: C
SEMESTER: 2
ROLL NO: 2392304

Void displayList(struct Node* node) {

Struct Node* last;
While (node != NULL) {
Printf(“%d->”, node->data);
Last = node;
Node = node->next;
}
If (node == NULL)
Printf(“NULL\n”);
}
Int main() {
Struct Node* head = NULL;
insertEnd(&head, 5);
insertFront(&head, 1);
insertFront(&head, 6);
insertEnd(&head, 9);
insertAfter(head, 11);
insertAfter(head->next, 15);
displayList(head);
deleteNode(&head, head->next->next->next->next->next);
displayList(head);
}

OUTPUT –
6->11->15->1->5->9->NULL
6->11->15->1->5->NULL
NAME: SUMAN
COURSE: BCA PAGE NO. 33
SEC: C
SEMESTER: 2
ROLL NO: 2392304

PRACTICAL – 10
OBJECTIVE: C program that implements a stack using an array.
PROGRAM
#include <stdio.h>
#include <stdlib.h>

#define MAX 100 // Maximum size of the stack

typedef struct Stack {

int data[MAX];
int top;
} Stack;

// Function to initialize the stack

void initialize(Stack *s) {
s->top = -1;
}

// Function to check if the stack is empty

int isEmpty(Stack *s) {
return s->top == -1;
}

// Function to check if the stack is full

int isFull(Stack *s) {
return s->top == MAX - 1;
NAME: SUMAN
COURSE: BCA PAGE NO. 34
SEC: C
SEMESTER: 2
ROLL NO: 2392304

// Function to push an element onto the stack

void push(Stack *s, int value) {
if (isFull(s)) {
printf("Stack overflow!\n");
} else {
s->data[++(s->top)] = value;
printf("%d pushed to stack\n", value);
}
}

// Function to pop an element from the stack

int pop(Stack *s) {
if (isEmpty(s)) {
printf("Stack underflow!\n");
return -1;
} else {
return s->data[(s->top)--];
}
}

// Function to display the elements of the stack

void display(Stack *s) {
if (isEmpty(s)) {
printf("Stack is empty\n");
} else {
printf("Stack elements are:\n");
for (int i = s->top; i >= 0; i--) {
NAME: SUMAN
COURSE: BCA PAGE NO. 35
SEC: C
SEMESTER: 2
ROLL NO: 2392304

printf("%d\n", s->data[i]);
}
}
}

int main() {
Stack s;
initialize(&s);

int choice, value;

while (1) {
printf("\n1. Push\n2. Pop\n3. Display\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch (choice) {
case 1:
printf("Enter the value to push: ");
scanf("%d", &value);
push(&s, value);
break;
case 2:
value = pop(&s);
if (value != -1) {
printf("%d popped from stack\n", value);
}
break;
case 3:
display(&s);
break;
NAME: SUMAN
COURSE: BCA PAGE NO. 36
SEC: C
SEMESTER: 2
ROLL NO: 2392304

case 4:
exit(0);
default:
printf("Invalid choice!\n");
}
}

return 0;
}

OUTPUT
1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 1
Enter the value to push: 10
10 pushed to stack

1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 1
Enter the value to push: 20
20 pushed to stack

1. Push
NAME: SUMAN
COURSE: BCA PAGE NO. 37
SEC: C
SEMESTER: 2
ROLL NO: 2392304

2. Pop
3. Display
4. Exit
Enter your choice: 1
Enter the value to push: 30
30 pushed to stack

1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 3
Stack elements are:
30
20
10

1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 2
30 popped from stack

1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 3
NAME: SUMAN
COURSE: BCA PAGE NO. 38
SEC: C
SEMESTER: 2
ROLL NO: 2392304

Stack elements are:

20
10

1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 4
NAME: SUMAN
PAGE NO. 39
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

PRACTICAL – 10(B)
OBJECTIVE: C program that implements a stack using a linked list.
PROGRAM
#include <stdio.h>
#include <stdlib.h>

// Node structure definition

typedef struct Node {
int data;
struct Node *next;
} Node;

// Function to create a new node

Node* createNode(int data) {
Node *newNode = (Node*)malloc(sizeof(Node));
if (!newNode) {
printf("Memory allocation error\n");
exit(1);
}
newNode->data = data;
newNode->next = NULL;
return newNode;
}

// Function to check if the stack is empty

int isEmpty(Node *top) {
return top == NULL;
}
NAME: SUMAN
PAGE NO. 40
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

// Function to push an element onto the stack

void push(Node **top, int data) {
Node *newNode = createNode(data);
newNode->next = *top;
*top = newNode;
printf("%d pushed to stack\n", data);
}

// Function to pop an element from the stack

int pop(Node **top) {
if (isEmpty(*top)) {
printf("Stack underflow!\n");
return -1;
}
Node *temp = *top;
*top = (*top)->next;
int popped = temp->data;
free(temp);
return popped;
}

// Function to display the elements of the stack

void display(Node *top) {
if (isEmpty(top)) {
printf("Stack is empty\n");
return;
}
Node *temp = top;
NAME: SUMAN
COURSE: BCA PAGE NO. 41
SEC: C
SEMESTER: 2
ROLL NO: 2392304

while (temp != NULL) {

printf("%d -> ", temp->data);
temp = temp->next;
}
printf("NULL\n");
}

int main() {
Node *top = NULL;
int choice, value;

while (1) {
printf("\n1. Push\n2. Pop\n3. Display\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);

switch (choice) {
case 1:
printf("Enter the value to push: ");
scanf("%d", &value);
push(&top, value);
break;
case 2:
value = pop(&top);
if (value != -1) {
printf("%d popped from stack\n", value);
}
break;
case 3:
NAME: SUMAN
COURSE: BCA PAGE NO. 42
SEC: C
SEMESTER: 2
ROLL NO: 2392304

display(top);
break;
case 4:
exit(0);
default:
printf("Invalid choice!\n");
}
}

return 0;
}
OUTPUT
1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 1
Enter the value to push: 10
10 pushed to stack

1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 1
Enter the value to push: 20
20 pushed to stack

1. Push
NAME: SUMAN
COURSE: BCA PAGE NO. 43
SEC: C
SEMESTER: 2
ROLL NO: 2392304

2. Pop
3. Display
4. Exit
Enter your choice: 3
20 -> 10 -> NULL

1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 2
20 popped from stack

1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 3
10 -> NULL

1. Push
2. Pop
3. Display
4. Exit
Enter your choice: 4
NAME: SUMAN
COURSE: BCA PAGE NO. 44
SEC: C
SEMESTER: 2
ROLL NO: 2392304

PRACTICAL – 11(a)
OBJECTIVE: C program that implements QUEUE as a LINK LIST.
PROGRAM
#include <stdio.h>
#include <stdlib.h>

// Node structure definition

typedef struct Node
{
int data;
struct Node *next;
}
Node;

// Function to create a new node

Node* createNode(int data)
{
Node *newNode = (Node*)malloc(sizeof(Node));
if (!newNode) {
printf("Memory allocation error\n");
exit(1);
}
newNode->data = data;
newNode->next = NULL;
return newNode;
}

// Function to check if the queue is empty

int isEmpty(Node *front)
NAME: SUMAN
PAGE NO. 45
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

{
return front == NULL;
}

// Function to enqueue an element to the queue

void enqueue(Node **front, Node **rear, int data)
{
Node *newNode = createNode(data);
if (*rear == NULL) {
*front = *rear = newNode;
}
else
{
(*rear)->next = newNode;
*rear = newNode;
}
printf("%d enqueued to queue\n", data);
}

// Function to dequeue an element from the queue

int dequeue(Node **front, Node **rear)
{
if (isEmpty(*front)) {
printf("Queue underflow!\n");
return -1;
}
Node *temp = *front;
*front = (*front)->next;
if (*front == NULL)
NAME: SUMAN
PAGE NO. 46
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

{
*rear = NULL;
}
int dequeued = temp->data;
free(temp);
return dequeued;
}

// Function to display the elements of the queue

void display(Node *front)
{
if (isEmpty(front))
{
printf("Queue is empty\n");
return;
}
Node *temp = front;
while (temp != NULL)
{
printf("%d -> ", temp->data);
temp = temp->next;
}
printf("NULL\n");
}

int main()
{
Node *front = NULL;
Node *rear = NULL;
NAME: SUMAN
COURSE: BCA PAGE NO. 47
SEC: C
SEMESTER: 2
ROLL NO: 2392304

int choice, value;

while (1)
{
printf("\n1. Enqueue\n2. Dequeue\n3. Display\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);

switch (choice)
{
case 1:
printf("Enter the value to enqueue: ");
scanf("%d", &value);
enqueue(&front, &rear, value);
break;
case 2:
value = dequeue(&front, &rear);
if (value != -1) {
printf("%d dequeued from queue\n", value);
}
break;
case 3:
display(front);
break;
case 4:
exit(0);
default:
printf("Invalid choice!\n");
}
NAME: SUMAN PAGE NO. 48
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

return 0;
}
OUTPUT
1. Enqueue
2. Dequeue
3. Display
4. Exit
Enter your choice: 1
Enter the value to enqueue: 10
10 enqueued to queue

1. Enqueue
2. Dequeue
3. Display
4. Exit
Enter your choice: 1
Enter the value to enqueue: 20
20 enqueued to queue

1. Enqueue
2. Dequeue
3. Display
4. Exit
Enter your choice: 3
10 -> 20 -> NULL

1. Enqueue
NAME: SUMAN PAGE NO. 49
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

2. Dequeue
3. Display
4. Exit
Enter your choice: 2
10 dequeued from queue

1. Enqueue
2. Dequeue
3. Display
4. Exit
Enter your choice: 3
20 -> NULL

1. Enqueue
2. Dequeue
3. Display
4. Exit
Enter your choice: 4
NAME: SUMAN
COURSE: BCA
PAGE NO. 50
SEC: C
SEMESTER: 2
ROLL NO: 2392304

PRACTICAL – 11(B)
OBJECTIVE: C program that implements QUEUE as an ARRAY.
PROGRAM
#include <stdio.h>
#include <stdlib.h>

#define MAX 100 // Maximum size of the queue

typedef struct Queue {

int data[MAX];
int front;
int rear;
} Queue;

// Function to initialize the queue

void initialize(Queue *q) {
q->front = -1;
q->rear = -1;
}

// Function to check if the queue is empty

int isEmpty(Queue *q) {
return q->front == -1;
}

// Function to check if the queue is full

int isFull(Queue *q) {
return q->rear == MAX - 1;
NAME: SUMAN PAGE NO. 51
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

// Function to enqueue an element to the queue

void enqueue(Queue *q, int value) {
if (isFull(q)) {
printf("Queue overflow!\n");
return;
}
if (isEmpty(q)) {
q->front = 0;
}
q->data[++(q->rear)] = value;
printf("%d enqueued to queue\n", value);
}

// Function to dequeue an element from the queue

int dequeue(Queue *q) {
if (isEmpty(q)) {
printf("Queue underflow!\n");
return -1;
}
int dequeued = q->data[q->front];
if (q->front == q->rear) {
q->front = q->rear = -1;
} else {
q->front++;
}
return dequeued;
}
NAME: SUMAN
COURSE: BCA PAGE NO. 52
SEC: C
SEMESTER: 2
ROLL NO: 2392304

// Function to display the elements of the queue

void display(Queue *q) {
if (isEmpty(q)) {
printf("Queue is empty\n");
return;
}
for (int i = q->front; i <= q->rear; i++) {
printf("%d -> ", q->data[i]);
}
printf("NULL\n");
}

int main() {
Queue q;
initialize(&q);

int choice, value;

while (1) {
printf("\n1. Enqueue\n2. Dequeue\n3. Display\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);

switch (choice) {
case 1:
printf("Enter the value to enqueue: ");
scanf("%d", &value);
enqueue(&q, value);
break;
NAME: SUMAN
COURSE: BCA PAGE NO. 53
SEC: C
SEMESTER: 2
ROLL NO: 2392304

case 2:
value = dequeue(&q);
if (value != -1) {
printf("%d dequeued from queue\n", value);
}
break;
case 3:
display(&q);
break;
case 4:
exit(0);
default:
printf("Invalid choice!\n");
}
}

return 0;
}

OUTPUT
1. Enqueue
2. Dequeue
3. Display
4. Exit
Enter your choice: 1
Enter the value to enqueue: 10
10 enqueued to queue

1. Enqueue
NAME: SUMAN PAGE NO. 54
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

2. Dequeue
3. Display
4. Exit
Enter your choice: 1
Enter the value to enqueue: 20
20 enqueued to queue

1. Enqueue
2. Dequeue
3. Display
4. Exit
Enter your choice: 3
10 -> 20 -> NULL

1. Enqueue
2. Dequeue
3. Display
4. Exit
Enter your choice: 2
10 dequeued from queue

1. Enqueue
2. Dequeue
3. Display
4. Exit
Enter your choice: 3
20 -> NULL

1. Enqueue
NAME: SUMAN
PAGE NO. 55
COURSE: BCA
SEC: C
SEMESTER: 2
ROLL NO: 2392304

2. Dequeue
3. Display
4. Exit
Enter your choice: 4

DS LAB Manual R22
No ratings yet
DS LAB Manual R22
90 pages
Data Structures Lab Manual Modified
No ratings yet
Data Structures Lab Manual Modified
87 pages
Lab 1
No ratings yet
Lab 1
92 pages
DSLAB
No ratings yet
DSLAB
49 pages
Data Structure Lab Manual Naresh
No ratings yet
Data Structure Lab Manual Naresh
72 pages
DS LAB Observation
No ratings yet
DS LAB Observation
79 pages
DSA File
No ratings yet
DSA File
72 pages
Ds Updated2 Lab Manual
No ratings yet
Ds Updated2 Lab Manual
59 pages
Circular Linked List Operations
No ratings yet
Circular Linked List Operations
20 pages
DSA Program File1
No ratings yet
DSA Program File1
76 pages
Exp No: Date
No ratings yet
Exp No: Date
56 pages
DS (1 To 20) - Compressed
No ratings yet
DS (1 To 20) - Compressed
74 pages
Program (Dsa)
No ratings yet
Program (Dsa)
44 pages
Lab Record Assignment 2024
No ratings yet
Lab Record Assignment 2024
57 pages
Notes CP
No ratings yet
Notes CP
46 pages
Ds Lab Record2022!23!2
No ratings yet
Ds Lab Record2022!23!2
47 pages
Sachin DS Assignment Linked List
No ratings yet
Sachin DS Assignment Linked List
45 pages
Data Structure LabManual GECP Manish Yadav345!33!67
No ratings yet
Data Structure LabManual GECP Manish Yadav345!33!67
35 pages
Data Structure Code 2
No ratings yet
Data Structure Code 2
28 pages
Ds Lab Manual-1 - Merged
No ratings yet
Ds Lab Manual-1 - Merged
85 pages
Ctsdlabmanual Dhairya
No ratings yet
Ctsdlabmanual Dhairya
32 pages
Docfile
No ratings yet
Docfile
44 pages
Exp-4 & 5
No ratings yet
Exp-4 & 5
23 pages
Ready Project Shreenivas
No ratings yet
Ready Project Shreenivas
22 pages
Linked List - Module 3
No ratings yet
Linked List - Module 3
24 pages
Suraj Dsa
No ratings yet
Suraj Dsa
31 pages
FTP Server Technology
97% (33)
FTP Server Technology
35 pages
ZY7669彩 (A4) CGP 13+ English Workbook
No ratings yet
ZY7669彩 (A4) CGP 13+ English Workbook
142 pages
Exercise 3
No ratings yet
Exercise 3
23 pages
Experiment 5 DS Student
No ratings yet
Experiment 5 DS Student
14 pages
Dsa Manual (2022) - 1-16
No ratings yet
Dsa Manual (2022) - 1-16
16 pages
Single Linkedlist Operations
No ratings yet
Single Linkedlist Operations
25 pages
Arcana Saitica - Masonic Tracing Boards (1879) PDF
100% (3)
Arcana Saitica - Masonic Tracing Boards (1879) PDF
38 pages
Data Structure 1B, C
No ratings yet
Data Structure 1B, C
18 pages
9818 Dsa Exp2
No ratings yet
9818 Dsa Exp2
12 pages
Doublylinked List Operations
No ratings yet
Doublylinked List Operations
31 pages
Data Structures & Algorithms DA5: Lab Assessment-5
No ratings yet
Data Structures & Algorithms DA5: Lab Assessment-5
21 pages
CTSD C03 &co4
No ratings yet
CTSD C03 &co4
38 pages
Lecture 3
No ratings yet
Lecture 3
33 pages
DSA Lab 5b and 7 Programs
No ratings yet
DSA Lab 5b and 7 Programs
15 pages
Dsuc Assignment 2
No ratings yet
Dsuc Assignment 2
40 pages
Circular Singly Linkedlists
No ratings yet
Circular Singly Linkedlists
10 pages
It0501 Data Structures and Algorithms Lab Manual
No ratings yet
It0501 Data Structures and Algorithms Lab Manual
54 pages
Assignement Ds
No ratings yet
Assignement Ds
8 pages
DS Lab Program 7
No ratings yet
DS Lab Program 7
4 pages
DS Lab-5
No ratings yet
DS Lab-5
12 pages
Linkedlist C
No ratings yet
Linkedlist C
7 pages
Practical 8 To 12
No ratings yet
Practical 8 To 12
16 pages
Linked List
No ratings yet
Linked List
6 pages
CLL
No ratings yet
CLL
6 pages
Exercise 3 4
No ratings yet
Exercise 3 4
11 pages
9842 DSA Exp3
No ratings yet
9842 DSA Exp3
7 pages
21bce1716 - DSA LAB ASSIGNMENT
No ratings yet
21bce1716 - DSA LAB ASSIGNMENT
10 pages
Dsaexp 5
No ratings yet
Dsaexp 5
6 pages
Doubly Linked List
No ratings yet
Doubly Linked List
12 pages
Experiment 13
No ratings yet
Experiment 13
3 pages
Data Structures & Algorithms Lab
No ratings yet
Data Structures & Algorithms Lab
51 pages
Program Linked List
No ratings yet
Program Linked List
6 pages
Data - Structure Lab - 04
No ratings yet
Data - Structure Lab - 04
3 pages
LList
No ratings yet
LList
4 pages
Circular Singly Link List
No ratings yet
Circular Singly Link List
3 pages
1100DW Manual Guide V2.0
No ratings yet
1100DW Manual Guide V2.0
24 pages
Struct Int Struct: #Include #Include
No ratings yet
Struct Int Struct: #Include #Include
3 pages
Ms Excel: Essential Training For The 70-779 EXAM
No ratings yet
Ms Excel: Essential Training For The 70-779 EXAM
11 pages
Math Grade 7 DLL Q2 W7 JAN
No ratings yet
Math Grade 7 DLL Q2 W7 JAN
4 pages
New+Interchange+1+ +Teacher+Book +u07
0% (1)
New+Interchange+1+ +Teacher+Book +u07
7 pages
Coldplay - Yellow: Were Came Wrote Was Took Was
No ratings yet
Coldplay - Yellow: Were Came Wrote Was Took Was
2 pages
Computer Engineering Laboratory Solution Primer
From Everand
Computer Engineering Laboratory Solution Primer
Karan Bhandari
No ratings yet
Barracuda Web Filter AG PDF
No ratings yet
Barracuda Web Filter AG PDF
86 pages
CSE 325 Numerical Methods: Sadia Tasnim Barsha Lecturer, CSE, SU
No ratings yet
CSE 325 Numerical Methods: Sadia Tasnim Barsha Lecturer, CSE, SU
13 pages
Definite Ness
No ratings yet
Definite Ness
398 pages
V English Ahmedabad
No ratings yet
V English Ahmedabad
19 pages
Ap2120 Datasheet Eng
No ratings yet
Ap2120 Datasheet Eng
2 pages
Lesson Plan - Computer Architecture: Data Representation, Micro-Operations Organization and Design
No ratings yet
Lesson Plan - Computer Architecture: Data Representation, Micro-Operations Organization and Design
6 pages
The Passive Voice
No ratings yet
The Passive Voice
8 pages
Algebra 1.formulas
No ratings yet
Algebra 1.formulas
27 pages
English FAL NSC P2 May June 2021
No ratings yet
English FAL NSC P2 May June 2021
27 pages
SBI Clerk Prelims Memory Based Paper (Held On - 12 Jan, 2024 Shift 1)
No ratings yet
SBI Clerk Prelims Memory Based Paper (Held On - 12 Jan, 2024 Shift 1)
29 pages
Going Away PART 2: It S +adjective +to
100% (1)
Going Away PART 2: It S +adjective +to
12 pages
Speaking-Sample 2
No ratings yet
Speaking-Sample 2
3 pages
H.265 1HDD 20ch NVR: TC-R3120 Spec: I/B/K/V3.0
No ratings yet
H.265 1HDD 20ch NVR: TC-R3120 Spec: I/B/K/V3.0
3 pages
Composition Touch (R 340G) : Radio
No ratings yet
Composition Touch (R 340G) : Radio
43 pages
CL Alv Bds Cu
No ratings yet
CL Alv Bds Cu
5 pages
Entity Extraction System
No ratings yet
Entity Extraction System
6 pages
Software Development
No ratings yet
Software Development
3 pages
Hamza
No ratings yet
Hamza
2 pages
Kod Paint
No ratings yet
Kod Paint
8 pages
11222حفیظ تائب کی پنجابی نعتیہ شاعری کا موضوعاتی مطالعہ
No ratings yet
11222حفیظ تائب کی پنجابی نعتیہ شاعری کا موضوعاتی مطالعہ
2 pages
Kajian Pemanfaatan Silika Dari Sekam Padi Dalam Pengolahan Limbah Tekstil
No ratings yet
Kajian Pemanfaatan Silika Dari Sekam Padi Dalam Pengolahan Limbah Tekstil
6 pages

Practical - 07 OBJECTIVE - Write A C Program To Implement Operations On Singly

Uploaded by

Practical - 07 OBJECTIVE - Write A C Program To Implement Operations On Singly

Uploaded by

NAME: SUMAN

printf("Number of nodes = %d\n",count(&head));

struct node *p=*q;

void loc_delete(struct node **q){

data elements are :

OBJECTIVE – Implement all operations on queue using circular linked

struct node *link;

void add_cirq(struct node**,struct node**);

int del_cirq(struct node**,struct node**);

void display(struct node**);

struct node *f,*r;

printf("item deleted =%d\n",i);

void add_cirq(struct node**f,struct node**r){

struct node *q;

printf("enter number to add at link : ");

q=(struct node*)malloc(sizeof(struct node));

int del_cirq(struct node**f,struct node**r){

struct node *q;

void display(struct node **f){

struct node *q=*f,*p=NULL;

printf("data elements are :\n");

enter number to add at link : 675

enter number to add at link : 46

enter number to add at link : 876

item deleted =675

data elements are :

Void displayList(struct Node* node) {

#define MAX 100 // Maximum size of the stack

typedef struct Stack {

// Function to initialize the stack

// Function to check if the stack is empty

// Function to check if the stack is full

// Function to push an element onto the stack

// Function to pop an element from the stack

// Function to display the elements of the stack

int choice, value;

Stack elements are:

// Node structure definition

// Function to create a new node

// Function to check if the stack is empty

// Function to push an element onto the stack

// Function to pop an element from the stack

// Function to display the elements of the stack

while (temp != NULL) {

// Node structure definition

// Function to create a new node

// Function to check if the queue is empty

// Function to enqueue an element to the queue

// Function to dequeue an element from the queue

// Function to display the elements of the queue

int choice, value;

#define MAX 100 // Maximum size of the queue

typedef struct Queue {

// Function to initialize the queue

// Function to check if the queue is empty

// Function to check if the queue is full

// Function to enqueue an element to the queue

// Function to dequeue an element from the queue

// Function to display the elements of the queue

int choice, value;

You might also like

struct node p=q;

void add_cirq(struct node,struct node);

int del_cirq(struct node,struct node);

struct node f,r;

void add_cirq(struct nodef,struct noder){

int del_cirq(struct nodef,struct noder){

struct node q=f,*p=NULL;