- WAP to insert an element into Linear Array at specific position.
- WAP to delete an element into Linear Array at specific position.
- WAP to delete duplicates from a linear array.
- WAP to search largest and smallest element in a linear array.
- WAP to add, subtract and multiply matrices
- WAP to insert a node into simple linked list at the beginning.
- WAP to insert a node into a simple linked list at the end of the list.
- WAP to search an element from linked list.
- WAP to delete an element from a simple linked list.
- WAP to insert a node into the right of node in doubly linked list.
- WAP to insert a node into the left most node in doubly linked list.
- WAP to insert an element at particular location in doubly linked list.
- WAP to delete a node at particular location in doubly linked list.
- WAP to merge two-sorted single linked list.
- WAP to reverse a link list.
- WAP to sort an unsorted single linked list
- WAP to implement STACK using array.
- WAP to implement STACK using Linked List.
- WAP to check Parenthesis in an arithmetic expression using STACK
- WAP to convert completely parenthesized expression to postfix expression.
- WAP to implement QUEUE using Circular Array.
- WAP to implement QUEUE using Single Linked List.
- WAP to implement Linear Search
- WAP to implement Binary Search
- WAP to implement Bubble Sort.
- WAP to implement Insertion Sort.
- WAP to impalement QUICK Sort.
- WAP to implement Selection sort.
- Implement following operations on binary search tree
· Insert a node
· Delete a node
· Traverse tree using recursion
· Search a node - Implement heap sort algorithm in C++.
Monday, October 15, 2007
Data Structures using C++
Posted by Prof. Sukhdev Singh at 9:59 AM
Subscribe to:
Post Comments (Atom)
3 comments:
provide code for this please
delete an element into Linear Array at specific position.
Good words.
provide code also plzzzzz
Post a Comment