Scribd
Upload
4 views1 page

Python Data Structures and Algorithms Guide

The document outlines a class assignment that covers various topics in algorithm analysis, including Big-Oh, Big-Omega, and Big-Theta notations. It also discusses Python arrays, dynamic arrays, and requires the implementation of stack and queue operations, as well as programs for manipulating linked lists. Additionally, it includes tasks for evaluating expressions using stacks and comparing different data structures.

Uploaded by

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

Python Data Structures and Algorithms Guide

The document outlines a class assignment that covers various topics in algorithm analysis, including Big-Oh, Big-Omega, and Big-Theta notations. It also discusses Python arrays, dynamic arrays, and requires the implementation of stack and queue operations, as well as programs for manipulating linked lists. Additionally, it includes tasks for evaluating expressions using stacks and comparing different data structures.

Uploaded by

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

Class Assignment

1. Discuss the Analysis of Algorithm. What do you mean by “Big-Oh”, “Big-Omega” and
“Big-Theta”.
2. What do you mean by arrays in Python. Discuss the low-level arrays in Python.
3. Define dynamic array in Python. Write a Python program to remove all the
occurrence of duplicate arrays elements.
4. Write the diHerence between:
a. Array and stack
b. Array and Queue
c. Stack and Queue
d. Singly Link List and Circular Link List
5. Evaluate the infix expression using Stack:
a. (A + B) *(C-D)%F^G
6. Evaluate the Prefix Using Stack:
a. * + 10 5 - 15 7
7. Implement Stack operations in Python:
a. Pop
b. Push
c. IsEmpty
d. Seek
8. Implement Queue with the help of Array and analyze the performance of its given
operations i.e. enqueue, dequeue, Lenth, first.
9. Write a Program to reverse a single link list.
10. Write a Program to implement stack using singly link list.
11. Write a program to implement queue using single link list.

You might also like