LINKED LIST

-
What is a LINKED LIST?
A linked list, or one-way list, is a linear collection of data elements, called nodes, where the linear order is given by means of pointers.
That each pointer is divided into two parts :
 The first part contains the information of the element, The second part called link field or next_pointer contains the address of the next node in the list.
The next pointer of last node of linked list pointing towards null.

A linked list, whose node contains two fields i) integer value ii) Next Pointer.

Applications of linked list : -

  • Linked List can be used to implements stack, queues.
  • Data in a hard drive is stored as a linked list.
Advantages : -

  • Linked list is a dynamic data structure.
  • It allocate the needed memory while program is running in Main Memory (RAM) or in virtual memory.
  • Insertion and deletion operation on linked list node are easily implemented.
  • Linear data structure are easily executed with a linked list. Ex Stack and Queue.
  • Linked List can reduce access time and may expand in real time without memory overhead.
Disadvantages : -

  • Linked List waste memory dye to pointers requiring extra storage space.
  • Nodes in linked list are only traversed from begin to end or end to begin.
  • Nodes in linked list are stored in-contiguously, greatly increasing the time required to access individual elements within the list.
  • Can't easily perform binary search on linked list. 

Popular posts from this blog

Shutdown Pc

-
Image
#include<iostream> #include<stdlib.h> #include<conio.h> using namespace std; int main() {    int ch;   while(1)   {   cout<<"1. Shutdown\n2. Open TaskManager\n3. Open My Documents.\n4. Exit\nChoice : ";   cin>>ch;     switch (ch)   {   case 1:       system("C:\\WINDOWS\\System32\\shutdown /s");       break; case 2: system("C:\\WINDOWS\\System32\\taskmgr /s"); break; case 3: system("C:\\WINDOWS\\explorer /s"); break; case 4: return 0; } }   getch();     return 0; } Output:
Read more

Ellipse using OpenGl

-
#include<gl/glut.h> #include<gl/glu.h> #include<gl/gl.h> #include<iostream> using namespace std; int xc=0,yc=0,rx=40,ry=60; void display() { float rxsq=rx*rx; float rysq=ry*ry; float x=0,y=ry,p; float px=0,py=2*rxsq*y; glClear(GL_COLOR_BUFFER_BIT); glPointSize(1); glBegin(GL_POINTS); glVertex2i(xc+x,yc+y); glVertex2i(-(xc+x),-(yc+y)); cout<<xc+x<<" "<<yc+y<<endl; p=rysq-(rxsq-ry)+(0.25*rxsq); while(px<py) { x++; px=px+2*rysq; if(p<0) p=p+rysq+px; else { y--; py=py-2*rxsq; p=p+rysq+px-py; } glVertex2i(xc+x,yc+y); glVertex2i(xc+x,-(yc+y)); glVertex2i(-(xc+x),yc+y); glVertex2i(-(xc+x),-(yc+y)); cout<<xc+x<<" "<<yc+y<<endl; } p=rysq*(x+0.5)*(x+0.5) + rxsq*(y-1)*(y-1) -rxsq*rysq; while(y>0) { y--; py=py-2*rxsq; if(p>0) { p=p+rxsq-py; } else { x++; px=px+2*rysq...
Read more

Program to plot Quadrant strip

-
Image
#include<GL/glut.h> #include<GL/glu.h> #include<GL/gl.h> void quadstrip() { glClear(GL_COLOR_BUFFER_BIT); glColor3f(1,0,0); glBegin(GL_QUAD_STRIP); glVertex2i(-60,0); glVertex2i(-40,50); glVertex2i(60,30); glColor3f(0,1,0); glVertex2i(60,-50); glVertex2f(45,61); glEnd(); glFlush(); } void init() { glMatrixMode(GL_PROJECTION); glLoadIdentity(); gluOrtho2D(-65,65,-65,65); } int main(int argc,char **argv) { glutInitDisplayMode(GLUT_RGB|GLUT_SINGLE); glutInitWindowSize(500,500); glutCreateWindow("QUAD STRIP"); init(); glutDisplayFunc(quadstrip); glutMainLoop(); }
Read more