# Data Structures Using Python

Programming Language 1 student

data structure is a particular way of organizing data in a computer so that it can be used effectively.

For example, we can store a list of items having the same data-type using the array data structure.

Course Outcomes

Understand the concept of data structures, python and apply algorithm for solving problems like Sorting, searching, insertion and deletion of data.

Implement linear and non-linear data structures for processing of ordered or unordered data.

Analyze various algorithms based on their time and space complexity.

LIST OF EXPERIMENTS

1. Python program to create an array of 5 elements and display the array items. Access each individual element through indexes.
2. Python program to reverse the order of the items in the array.
3. Python program to append a new item to the end of the array.
4. Python program to remove a specified item using the index from an array.
5. Python program to get the length of an array.
6. Python program for binary search.
7. Python program for sequential or linear search.
8. Python program to sort a list of elements using the bubble sort algorithm.
9. Python program to sort a list of elements using the selection sort algorithm.
10. Python program to sort a list of elements using the insertion sort algorithm.
11. Python program to sort a list of elements using the quick sort algorithm.
12. Write a Python program to create a singly linked list, append some items and iterate through the list.
13. Write a Python program to find the size of a singly linked list.
14. Write a Python program to search a specific item in a singly linked list and return true if the item is found otherwise return false.
15. Write a Python program to delete the first item from a singly linked list.
16. Write a Python program to create circular single linked lists.
17. Write Python programs to implement stack and its operations using list.
18. Write Python programs to implement queue and its operations using list.
19. Write a Python program to create a Balanced Binary Search Tree (BST) using an array (given) elements where array elements are sorted in ascending order.
20. Write a Python program to find the kth smallest element in a given a binary search tree.
21. Write a Python program to traverse the binary tree using pre-order, post-order and in-order traversals.
22. Write a Python program to count the number of nodes in binary search tree.
23. Write a Python program to traverse the graph using Depth First Search and Breadth First Search
24. Write a Python program to create Red Black Tree and perform operations of Insertion and Deletion in it.
25. Write a Python program to implement AVL Trees as well as various operations of searching, insertion and deletion on AVL Trees.

5 Star
100%
4 Star
0%
3 Star
0%
2 Star
0%
1 Star
0%
4,500.00₹