Zobrazit v EDS

DATA STRUCTURES AND ALGORITHMS

Uloženo v:
Podrobná bibliografie
Název: DATA STRUCTURES AND ALGORITHMS
Autoři: Monu Sharma, Amit Dhiman, Ms. Nitya, Mr Shubneet, Anushka Raj Yadav
Zdroj: Intelligent Shields: Artificial Intelligence and Machine Learning for Cybersecurity ISBN: 9789370208926
Informace o vydavateli: Iterative International Publishers (IIP), Selfypage Developers Pvt Ltd., 2025.
Rok vydání: 2025
Popis: Data structures and algorithms serve as the cornerstone of efficient computational problemsolving, enabling the organization and manipulation of data with optimal resource utilization. This chapter delves into foundational data structures, including arrays, linked lists, stacks, queues, and trees, alongside critical algorithms for sorting (e.g., quicksort, bubble sort) and searching (e.g., binary search). Theoretical principles such as time/space complexity analysis and memory management are examined to underscore their impact on algorithmic efficiency [1, 2]. Practical applications—such as hash tables for database indexing and graph algorithms for social network analysis—illustrate the real-world relevance of these concepts [3, 4]. Visual aids, including memory diagrams for linked lists and recursion call stacks, clarify intricate operations and enhance conceptual understanding. By bridging abstract data types with concrete implementations, the chapter equips readers to design scalable solutions for complex computational challenges.
Druh dokumentu: Part of book or chapter of book
DOI: 10.58532/nbennurasai6
Přístupové číslo: edsair.doi...........e1f79330b356da31bb0a12c64c0cf9a8
Databáze: OpenAIRE
Popis
Abstrakt:Data structures and algorithms serve as the cornerstone of efficient computational problemsolving, enabling the organization and manipulation of data with optimal resource utilization. This chapter delves into foundational data structures, including arrays, linked lists, stacks, queues, and trees, alongside critical algorithms for sorting (e.g., quicksort, bubble sort) and searching (e.g., binary search). Theoretical principles such as time/space complexity analysis and memory management are examined to underscore their impact on algorithmic efficiency [1, 2]. Practical applications—such as hash tables for database indexing and graph algorithms for social network analysis—illustrate the real-world relevance of these concepts [3, 4]. Visual aids, including memory diagrams for linked lists and recursion call stacks, clarify intricate operations and enhance conceptual understanding. By bridging abstract data types with concrete implementations, the chapter equips readers to design scalable solutions for complex computational challenges.
DOI:10.58532/nbennurasai6