Data Structures using C

von Nagababu Garigipati, K. Gnana Prasuna

52 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

It is possible to efficiently organise and store data using data structures in C, enabling quicker information access, modification, and retrieval. Here is a list of various C data structures that are often used: Linked Lists: Linked lists are made up of nodes, each of which has a pointer to the node after it and data. They enable efficient element insertion and deletion at any place as well as dynamic memory allocation. Last-In-First-Out (LIFO) data structures include stacks.First-In-First-Out (FIFO) data structures are called queues. Trees: Trees are node-based hierarchical data structures. Commonly used variants include binary trees and binary search trees.Graphs: Graphs have nodes (vertices) and edges connecting them. They can be applied to show intricate networks and interactions. To move through them, graph traversal techniques like depth-first search (DFS) and breadth-first search (BFS) are used. Key-value pairs are used to store data in hash tables. Each data structure has its own advantages and use cases, and understanding them is essential for effective programming and problem-solving. They employ a hash function to map keys to a specific index in an array.

• Themen: Technologie, Ingenieurswissenschaft, Landwirtschaft, Industrieprozesse
• ISBN: 9786206783985
• Sprache: Englisch
• Erscheinungsdatum: 12.09.2023
• Größe: 220 x 150 mm
• Verlag: LAP LAMBERT Academic Publishing