Assignment
CS 205 Data Structures
1 Write an algorithm to convert infix to prefix
2 Implementation of Dqueue using Singly linked List
3 Write an algorithm to multiply two Polynomials
4 Write an algorithm to check validity of expression( check brackets correctly closed)
5 Write an algorithm to implement 'k' number of stacks using single array
6 Write an algorithm to delete 'n' number of nodes after 'm'th Node in a Singly LL
7 Write an algorithm to delete all duplicate elements in a doubly LL
8 Wite an algorithm to compare two linked list.Return true if they are equal
9 Implement a queue using two stacks
10 Write an algorithm to delete all duplicate elements in a circcular doubly LL
11 Write an algorithm to convert infix to prefix
12 Implementation of Dqueue using Singly linked List
13 Write an algorithm to multiply two Polynomials
14 Write an algorithm to check validity of expression( check brackets correctly closed)
15 Write an algorithm to implement 'k' number of stacks using single array
16 Write an algorithm to delete 'n' number of nodes after 'm'th Node in a Singly LL
17 Write an algorithm to delete all duplicate elements in a doubly LL
18 Wite an algorithm to compare two linked list.Return true if they are equal
19 Implement a queue using two stacks
20 Write an algorithm to delete all duplicate elements in a circcular doubly LL
21 Write an algorithm to convert infix to prefix
22 Implementation of Dqueue using Singly linked List
23 Write an algorithm to multiply two Polynomials
24 Write an algorithm to check validity of expression( check brackets correctly closed)
25 Write an algorithm to implement 'k' number of stacks using single array
26 Write an algorithm to delete 'n' number of nodes after 'm'th Node in a Singly LL
27 Write an algorithm to delete all duplicate elements in a doubly LL
28 Wite an algorithm to compare two linked list.Return true if they are equal
29 Implement a queue using two stacks
30 Write an algorithm to delete all duplicate elements in a circcular doubly LL
0 comments:
Post a Comment