Can u identify the below place

-
comment on it.

Popular posts from this blog

RESUME 2025 AUG

-
MY RESUME 01/08/2025 ========================================================================= PDF version of my resume 1/AUGUST/2025 https://drive.google.com/file/d/1VkKwQNF-m9w2_FiJ7FT0phNeY9MuQWl6/view?usp=sharing ========================================================================== DOC Version of my resume 1/AUGUST/2025 https://docs.google.com/document/d/108WiLLDZo-9l1sgaSSutkQZaE8iIma3g/edit?usp=drive_link&ouid=111069544115391871585&rtpof=true&sd=true ==========================================================================
Read more

Implementing queue datastructure using c program.

-
/*queue*/ #include<stdio.h> #include<stdlib.h> #define queue_size 5 int c,item,f,r,q[10]; void ri() {     if(r==queue_size-1)     {         printf("queue overflow\n");         return;     }     r=r+1;     q[r]=item; } void fd() {     if(f>r)     {         printf("queue underflow\n");         return;     }     printf("the element deleted is %d",q[(f)++]);     if(f>r)f=0,r=-1; } void display() {     int i;     if(f>r)     {         printf("queue is empty\n");         return;     }     printf("contents of the...
Read more

Linked List

-
Image
What is linked list? A collection of nodes, each node contains two parts, an data part and an link part. Data part:- data part of a linked list contains the data to be stored in linked list. Link part:- which contains the address of the next node. In the case of the current node is only node in the list or current node is last node in the list then address part contains NULL value in it. Such a linked allocation based structure is called Linked list. Types of linked list:- There are 3 types of linked list. 1. Single Linked List (SLL). 2. Circular Linked List (CLL). 3. Double Linked List (DLL). Some basic algorithms: 1.Design an algorithm to insert an element 'e' into a single linked list (SLL). So that the inserted element becomes first in the list. Algorithm:- Insert_First_SLL. Input:- F, address of first node of SLL.             e, element to be inserted. Output:- F, updated. Method:-      n = CreateNode();      n.data = e; ...
Read more