Understanding Basic Data Structures and Recursion in Programming

Slide Note
Embed
Share

Explore basic data structures and recursion in programming through a series of lectures covering abstract data types, list operations, array characteristics, linked lists, doubly linked lists, and circular linked lists. Dive into concepts such as array indexing, resizing, and various list implementations to gain a comprehensive understanding of foundational programming principles.


Uploaded on Sep 22, 2024 | 0 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

E N D

Presentation Transcript


  1. Lecture 2 Basic Data Structures and Recursion Review

  2. Online Students Tell me what your plan is in-class exam proctoring

  3. Participation 1 Blue Eyes Problem Due Thursday

  4. Abstract Data Type Motivation Grouping Abstraction Definition

  5. List Operations

  6. List: array Characteristics Index calculation (constant)

  7. List: array 1D array index calculation (constant)

  8. List: array (contd) 2D array (RMO)

  9. List: array (contd) 2D array (CMO)

  10. List: array (contd) 3D array

  11. List: array

  12. List: array Resizing: what s the cost? Increase capacity by 1 Increase capacity by 100%

  13. List: linked list Characteristics

  14. List: doubly-linked list Characteristics

  15. List: doubly-linked list

  16. List: Circular linked list Characteristics

  17. List: Circular linked list

  18. List: Multi-List Characteristics

  19. List: Multi-List

  20. Stacks Operations

  21. Stacks: arrays Push()

  22. Stacks: arrays Pop()

  23. Stacks: arrays

  24. Stacks: linked lists Push()

  25. Stacks: linked lists Pop()

  26. Queues Characteristics

  27. Queues: linked list enqueue

  28. Queues: linked list dequeue

  29. Queues: array enqueue

  30. Queue: array dequeue

  31. Dictionary Characteristics

  32. Dictionary: implementations Hash Table B+ Trees

  33. Other data structures Trees Graphs

  34. Recursion Review Definition

  35. Recursion Review Example: factorial

  36. Recursion Review

  37. Recursion Review Any recursive function can be rewritten as a loop.

  38. Recursion Review Recursion vs loops

  39. Recursion Review Reverse Linked List (iterative)

  40. Recursion Review Reverse Linked List (recursive)

  41. Recursion Review Reverse Linked List (recursive)

  42. Recursion Review

  43. Recursion Review: Towers of Hanoi image from wikipedia

  44. Recursion Review: Towers of Hanoi image from mathworld.wolfram.com

  45. Recursion Review Solving Towers of Hanoi Recursively

  46. Lecture 2 Basic Data Structures and Recursion Review

  47. Online Students Tell me what your plan is in-class exam proctoring

  48. Participation 1 Blue Eyes Problem Due Thursday

  49. Abstract Data Type Motivation Grouping Abstraction Definition

Related


More Related Content