1052234230

DATA STRUCTURES USING PYTHON

Practicum
UNIT I INTRODUCTION TO DATA STRUCTURES
Data structures – Introduction, classification of data structures : primitive and
non-primitive data structures with python examples – linear and nonlinear data
structures with python examples. Operations on data structures.
Abstract data types – Introduction, abstractions, Abstract data types, example of
abstract data type (student, date), Defining the ADT, Using the ADT, Implementing
the ADT.
Algorithm Analysis – space complexity, time complexity, Asymptomatic
notations: Big-O notation.

9

Ex.No Name of the Experiment

1
Write a program to implement any one python data structure with the
following operations
A) Create B) Add elements C) Access elements
D) Remove elements

2

UNIT II LINEAR DATA STRUCTURES – LINKED LISTS
Linked List – Terminology: node, address, information, null pointer, empty list,
Types – singly linked lists: creating nodes, traversing the nodes, searching for a
node, prepending nodes, removing nodes – doubly linked list & circular linked list –
organization – operations: traversal, searching, adding nodes, removing nodes
(concepts only, no implementations)

8

Ex.No Name of the Experiment

2
Write a python program to implement a singly linked list
a) create a singly linked list
b) add element to singly linked list
c) Remove element from singly linked list

4

UNIT III LINEAR DATA STRUCTURES – STACK & QUEUE
Stacks- Overview of stack, Implementation of stack using python list: push, pop,
display. Stack applications: balanced delimiters, evaluating postfix expressions.
Recursion – Properties of recursion – Recursive functions: Factorials, Recursive
10

call tree.
Queues- Overview of queue – Implementing the queue and its operations using
python list – Applications of queues – Circular queue and Priority queue (concepts
only)
Ex.No Name of the Experiment
3 Write a python program to implement stack

8

4 Write a python program to implement queue
UNIT IV NON-LINEAR DATA STRUCTURES – TREES
Tree – Terminology: node, edge, parent, children, path, level of a node, depth of a
node, height of a tree – Binary tree: full binary tree, complete binary tree – Linear

representation of binary tree – binary tree traversals: in-order, pre-order, post-
order. Binary Search Tree – Introduction, Creation of a Binary Search tree without

duplicate node, Applications.

9

Ex.No Name of the Experiment
5 Write the python program for pre-order traversal of a binary tree 4
UNIT V

SEQUENTIAL STORAGE REPRESENTATION –
SORTING & SEARCHING

Sorting- Introduction to different sorting techniques – Bubble sort, Insertion sort,
Quick sort and Merge Sort. Searching- Introduction to different searching
techniques – Linear search and Binary search.

9

Ex.No Name of the Experiment
6 Write a python program to implement bubble sort
7 Write a python program to implement linear search 12
8 Write a python program to implement binary search