Understanding Basic Data Structures and Recursion in Programming

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.

• Data Structures
• Recursion
• Programming Concepts
• Abstract Data Types
• List Implementations

forseth_m Follow

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.

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

15. List: doubly-linked list Characteristics

16. List: doubly-linked list

17. List: Circular linked list Characteristics

18. List: Circular linked list

19. List: Multi-List Characteristics

20. List: Multi-List

21. Stacks Operations

22. Stacks: arrays Push()

23. Stacks: arrays Pop()

24. Stacks: arrays

25. Stacks: linked lists Push()

26. Stacks: linked lists Pop()

27. Queues Characteristics

28. Queues: linked list enqueue

29. Queues: linked list dequeue

30. Queues: array enqueue

31. Queue: array dequeue

32. Dictionary Characteristics

33. Dictionary: implementations Hash Table B+ Trees

34. Other data structures Trees Graphs

35. Recursion Review Definition

36. Recursion Review Example: factorial

37. Recursion Review

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

39. Recursion Review Recursion vs loops

40. Recursion Review Reverse Linked List (iterative)

41. Recursion Review Reverse Linked List (recursive)

42. Recursion Review Reverse Linked List (recursive)

43. Recursion Review

44. Recursion Review: Towers of Hanoi image from wikipedia

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

46. Recursion Review Solving Towers of Hanoi Recursively

47. Lecture 2 Basic Data Structures and Recursion Review

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

49. Participation 1 Blue Eyes Problem Due Thursday

50. Abstract Data Type Motivation Grouping Abstraction Definition

Load More ...