Phu Xuan University Library
|
PXU E-LIB
Sign in
CISP 430: Data Structures

External

CISP 430: Data Structures

This course applies object-oriented techniques for systematic problem analysis and the managing of program complexity using abstraction. Specifications, design, coding, testing, and documentation of large multi-file programs are covered. It uses advanced language features such as classes, strings, non-text files, pointers, and recursion. Abstract data types such as stacks, queues, lists, binary trees, heaps/priority queues, hash tables, and graphs are examined.

Engineering
Author
Suha Aljuboori
Publisher
Folsom Lake College
Source
LibreTexts
Language
EN
Category
Information Technology
Read online Download PDF (open licence)
Contents· 52 sections
  1. 01: Introduction
  2. 1.01: The Need for Efficiency
  3. 1.02: Stanley Milgram
  4. 1.03: Watts and Strogatz
  5. 02: Recursion
  6. 2.01: Activity 1 - Recursive Algorithm
  7. 2.02: Unit Summary
  8. 03: Stacks and Queues
  9. 3.01: Stacks
  10. 3.02: Applications of Stacks
  11. 3.03: Queues
  12. 3.04: Deques
  13. 04: Linked Lists
  14. 4.01: SLList - A Singly-Linked List
  15. 4.02: DLList - A Doubly-Linked List
  16. 4.03: SEList - A Space-Efficient Linked List
  17. 4.04: Discussion and Exercises
  18. 05: Trees
  19. 5.01: Traversal
  20. 5.02: Sample implementations for Tree Traversal
  21. 5.03: Examples of Tree Traversals
  22. 5.04: Balancing
  23. 5.05: Binary Search Trees
  24. 5.06: Example extract of Java code for binary tree delete operation
  25. 5.07: Red-Black trees
  26. 5.08: B Trees
  27. 5.09: Treaps
  28. 5.10: References
  29. 06: Graphs
  30. 6.01: Representing a Graph by a Matrix
  31. 6.02: A Graph as a Collection of Lists
  32. 6.03: Graph Traversal
  33. 6.04: Discussion and Exercises
  34. 07: Hash Tables
  35. 7.01: Time complexity and common uses of hash tables
  36. 7.02: Choosing a good hash function
  37. 7.03: Collision resolution
  38. 7.04: Table resizing
  39. 7.05: Ordered retrieval issue
  40. 7.06: Problems with hash tables
  41. 7.07: Other hash table algorithms
  42. 7.08: Implementations
  43. 08: Searching Binary Search Trees and Heaps
  44. 8.01: Activity 1 - Searching Techniques
  45. 8.02: Activity 2 - Binary Search Tree
  46. 8.03: Activity 3 - Heaps
  47. 8.04: Unit Summary
  48. 09: Sorting Algorithms
  49. 9.01: Activity 1 - Sorting Algorithms by insertion method
  50. 9.02: Activity 2 - Sorting Algorithms by selection method
  51. 9.03: Activity 3 - Sorting Algorithms by Merge and Partition methods
  52. 9.04: Unit Summary