The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Fundamentals of Data Structures: Stacks, Queues, Linked Lists, and Graphs
Abstract
Computer science encompasses various subfields, with data structures and algorithms being important. This chapter aims to enhance proficiency in constructing and analyzing data structures effectively. Studying data structures equips students with the skills to solve real-world problems using suitable structures. The study of data structures offers diverse programming techniques for complex problems yet introduces challenges due to intricate complexities that reshape program architecture. Covering all aspects in a single semester is impractical, as data structures receive extensive attention in graduate, upper-division, and lower-division programs. This text is an introductory resource for the stack, queue, linked list, graph, trees, searching, and sorting algorithms. It also offers insights into their Python implementation and its complexities, applications, and sample code.
Related Content
|
Rashmi Gupta, Jeetendra Kumar, Suvarna Sharma.
© 2026.
32 pages.
|
|
Yashodeep Bharat Deshmukh, Abhishek Mukhopadhyay.
© 2026.
42 pages.
|
|
Suriya Murugan, Anandakumar Haldorai.
© 2026.
20 pages.
|
|
Meetu Malhotra, Rahul Awasthy.
© 2026.
34 pages.
|
|
Ismail Lamaakal, Bentaleb Youssef, Yassine Maleh, Ibrahim Ouahbi, Khalid El Makkaoui.
© 2026.
34 pages.
|
|
Muthmainnah Muthmainnah, Besse Darmawati, Abd. Rasyid, Sutejo Sutejo, Sri Haryatmo, Nurweni Saptawuryandari, Ahmad Al Yakin, Ismail Lamaakal.
© 2026.
28 pages.
|
|
Wasswa Shafik.
© 2026.
32 pages.
|
|
|