sections ds graphs and trees ds discrete probability appendix and sections listing the for this course are organized to provide pedagogical path that starts with the basics of java programming and object-oriented designmoves to concrete structures like arrays and linked listsadds foundational techniques like recursion and algorithm analysisand then presents the fundamental data structures and algorithmsconcluding with discussion of memory management (that isthe architectural underpinnings of data structuresspecificallythe for this book are organized as follows java programming basics object-oriented design arrayslinked listsand recursion analysis tools stacks and queues lists and iterators trees priority queues maps and dictionaries search trees sortingsetsand selection text processing graphs