Scribd
Upload
4 views1 page

Python Programming Assignment

The document outlines a Python program for a simple Data Processing System that includes operations on arrays, linked lists, stacks, queues, binary search trees, graphs, and hash tables. It specifies tasks such as traversal, insertion, deletion, searching, and sorting, along with their implementations and time complexities. Additionally, it mentions the use of an advanced data structure and its application.

Uploaded by

charlesedinoa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views1 page

Python Programming Assignment

The document outlines a Python program for a simple Data Processing System that includes operations on arrays, linked lists, stacks, queues, binary search trees, graphs, and hash tables. It specifies tasks such as traversal, insertion, deletion, searching, and sorting, along with their implementations and time complexities. Additionally, it mentions the use of an advanced data structure and its application.

Uploaded by

charlesedinoa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Write a Python program for a simple Data Processing System that

demonstrates the use of common data structures and algorithms studied in


this course.
Your program should perform the following tasks:
1. Store a set of integers in an array (Python list) and perform the
following operations:
o Traversal

o Insertion

o Deletion

o Searching

2. Convert the elements of the array into a singly linked list and display
the elements.
3. Implement a stack and use it to evaluate a simple postfix expression.
4. Implement a queue to simulate task processing in the order tasks
arrive.
5. Insert the numbers into a Binary Search Tree (BST) and display the
inorder traversal of the tree.
6. Represent a graph using an adjacency list and perform Depth First
Search (DFS).
7. Store student records using a hash table (Python dictionary) and
retrieve a record using a key.
8. Sort the array using Bubble Sort and search for an element using Binary
Search.
9. State the time complexity of Bubble Sort and Binary Search.
[Link] one advanced data structure and its application.

You might also like