Scribd
Upload
1 views1 page

DSA Assignment

The document outlines an assignment focused on data structures and algorithms (DSA). It includes tasks such as explaining asymptotic notations, converting infix expressions to postfix, evaluating postfix expressions, and implementing sorting algorithms like bubble and insertion sort. Additionally, it requires functions for data insertion in linked lists and stack operations.

Uploaded by

samratmathur10
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
1 views1 page

DSA Assignment

The document outlines an assignment focused on data structures and algorithms (DSA). It includes tasks such as explaining asymptotic notations, converting infix expressions to postfix, evaluating postfix expressions, and implementing sorting algorithms like bubble and insertion sort. Additionally, it requires functions for data insertion in linked lists and stack operations.

Uploaded by

samratmathur10
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

DSA Assignment

1.​ Why do we need Asymptotic notations? Explain the different Asymptotic


notations with definitions and examples.
2.​ Write a function to convert the given infix expression into the postfix form
3.​ Write a function to evaluate the postfix expression
4.​ Write a function to sort given array using bubble sort
5.​ Write a function to sort given array using insertion sort
6.​ Write a function to insert the new data before the given data
7.​ Write a function to insert the new data in the already sorted linked list
8.​ Write push and pop operations of a stack.

You might also like