Scribd
Upload
18 views1 page

List of PGM

This document lists 13 data structure and algorithm programs including implementations of linked lists, stacks, queues, trees, hashing, and algorithms for expression evaluation, shortest paths, and knapsack problems. It directs the user to reference lab manuals for implementations of linked lists, stacks, queues, trees, and priority queues and leaves the remaining programs for the user to complete on their own.

Uploaded by

dhinaads
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
18 views1 page

List of PGM

This document lists 13 data structure and algorithm programs including implementations of linked lists, stacks, queues, trees, hashing, and algorithms for expression evaluation, shortest paths, and knapsack problems. It directs the user to reference lab manuals for implementations of linked lists, stacks, queues, trees, and priority queues and leaves the remaining programs for the user to complete on their own.

Uploaded by

dhinaads
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

LIST OF PROGRAMS

1. Implementation of singly linked lists.


2. Implementation of doubly linked lists.
3. Represent a polynomial as a linked list and write functions for polynomial
addition.
4. Array Implementation of stack
5. Application Of Stack – Conversion Of Infix To Postfix expression
6. Implementation of linear queue using arrays
7. Array Implementation of a Circular Queue

8. Implement an expression tree. Produce its pre-order, in-order, and post-


order traversals.
9. Implement binary search tree.
10.Implement priority queue using heaps
11.Implement hashing techniques.
12.Implement Dijkstra's algorithm using priority queues
13.Implement a backtracking algorithm for Knapsack problem

NOTE:
 USE REC LABMANUAL FOR THE PROGRAMS HIGHLIGHTED IN
RED.
 USE IIET LABMANUAL FOR THE PROGRAMS HIGHLIGHTED IN
GREEN.
 ITS UP TO U TO FINISH THIS WORK.

You might also like