Scribd
Upload
48 views4 pages

Data Structure IC-309: Submitted BY: Praveen Rathi ICE-2

This document contains a table of contents for 15 programs related to data structures and algorithms. The programs cover topics like polynomial operations, recursion, stacks, queues, sparse matrices, postfix expressions, linked lists, binary search trees, and various sorting algorithms. The document was submitted by Praveen Rathi for the course IC-309 at NSIT.

Uploaded by

Ayush Bhatnagar
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
48 views4 pages

Data Structure IC-309: Submitted BY: Praveen Rathi ICE-2

This document contains a table of contents for 15 programs related to data structures and algorithms. The programs cover topics like polynomial operations, recursion, stacks, queues, sparse matrices, postfix expressions, linked lists, binary search trees, and various sorting algorithms. The document was submitted by Praveen Rathi for the course IC-309 at NSIT.

Uploaded by

Ayush Bhatnagar
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
You are on page 1/ 4

DATA

STRUCTURE
IC-309

SUBMITTED
BY:
PRAVEEN RATHI
ICE-2

510/IC/13
NSIT

CONTENTS
Program Name
Page No.
1. Write a program to find addition of two polynomials.
1
2. Write a program to find multiplication of two polynomials.
4
3. Write a program to find a factorial of a number using
recursion
8
and without recursion.
4. Write a program to implement stack data structure.
10
5. Write a program to implement queue data structure.
14
6. Write a program to find the transpose of a sparse matrix.
18
7. Write a program to find the transpose of a sparse matrix
using
18
the fast transpose algorithm.
8. Write a program to evaluate the postfix expression.
28
9. Write a program to convert infix to postfix expression using
stack.
31
10. Create a linked list of words and do the following
operations on it:
35

a) Traversing b) Counting no. of nodes c) Inserting a new


node
d) Deleting an existing list e) Reverse the linked list f) Sorting
the
words in the linked list g) Combining the two linked list.
11. Implement singly circular linked list with the following
operation:42
a) Insertion b) Deletion c) Counting number of nodes
d) Reverse a linked list.
12. Implement double linked list with the following
operations:
57
a) Insertion b) Deletion c) Traversing of nodes.
13. Write a program for binary search tree with operations:
a) Creation
60
b) Traversal c) Insertion d) Deletion.
14. Write a program to: a) Compare two binary trees
72
b) Copy one binary tree into another binary tree
c) Create mirror image of binary tree.
15. Implement sorting for algorithms: a) Bubble sort
77
b) Radix sort c) Insertion d) Selection sort e) Heap sort f)
Merge sort.

You might also like