Se está descargando tu SlideShare. ×

# AAT PPT format - oRGINAL.pptx

Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Próximo SlideShare
Cargando en…3
×

1 de 12 Anuncio

# AAT PPT format - oRGINAL.pptx

gfdrtfyuiopo

gfdrtfyuiopo

Anuncio
Anuncio

Anuncio

### AAT PPT format - oRGINAL.pptx

1. 1. AAT-1 Linked Lists Data Structures and Applications-21CS35 Students Names: PRAGATI BAIRAGI(1BY21IS107) PRAMOD KUMAR(1BY21IS108) PRATYUSH RAJ(1BY21IS115) Under the guidance of: Dr. SHANTHI D L ASSISTANT PROFESSOR, 2022-23 ODD Semester Department of Information Science & Engineering 1
2. 2. Contents • Introduction • Motivation • List of applications • Detailed description of an application • Results and discussion • References Department of Information Science & Engineering 2
3. 3. 3 A linked list is a linear data structure that stores a collection of data elements dynamically.Nodes represent those data elements, and links or pointers connect each node.Each node consists of two fields, the information stored in a linked list and a pointer that stores the address of its next node.The last node contains null in its second field because it will point to no node.A linked list can grow and shrink its size, as per the requirement.It does not waste memory space Introduction: What is a Linked List?
4. 4. 30.11.2021 4 A linked list depicts that each node consists of two fields. The first field consists of data, and the second field consists of pointers that point to another node.representation-of-linked-listHere, the start pointer stores the address of the first node, and at the end, there is a null pointer that states the end of the Linked List Representation of Linked list:
5. 5. 30.11.2021 5 Representation of Linked ListA linked list is a chain of nodes, and each node has the following parts: Data – Stores the information Next – Stores the address to next node
6. 6. 30.11.2021 6 Motivation The main motivation of linked list is that we can make arrays, but their functionality is slightly limited and can be difficult to work with Biggest issue: size management We can do dynamic arrays but can be cumbersome to add more cells if needed Internal re structuring is difficult: To insert or delete elements after array creation and population we must move potentially many elements around