Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
2Activity

Table Of Contents

Programming Methodologies
1.1. AN INTRODUCTION TO DATA STRUCTURE
1.4. MODULAR PROGRAMMING
1.5. TOP-DOWN ALGORITHM DESIGN
1.6. BOTTOM-UP ALGORITHM DESIGN
1.7. STRUCTURED PROGRAMMING
1.8. ANALYSIS OF ALGORITHM
1.9. TIME-SPACE TRADE OFF
1.10. BIG “OH” NOTATION
1.11. LIMITATION OF BIG “OH” NOTATION
1.12. CLASSIFICATION OF DATA STRUCTURE
1.14. VECTORS
1.16. FILES AND RECORDS
1.17. CHARACTERISTICS OF STRINGS
SELF REVIEW QUESTIONS
Memory Management
2.1. MEMORY ALLOCATION IN C
2.2. DYNAMIC MEMORY ALLOCATION IN C++
2.3. FREE STORAGE LIST
2.4. GARBAGE COLLECTION
2.5. DANGLING REFERENCE
2.6. REFERENCE COUNTERS
2.7. STORAGE COMPACTION
2.8. BOUNDARY TAG METHOD
3.1. OPERATIONS PERFORMED ON STACK
3.2. STACK IMPLEMENTATION
3.3. STACK USING ARRAYS
3.4. APPLICATIONS OF STACKS
3.5. CONVERTING INFIX TO POSTFIX EXPRESSION
3.6. EVALUATING POSTFIX EXPRESSION
4.1. ALGORITHM FOR QUEUE OPERATIONS
4.2. OTHER QUEUES
1. Circular queue
4.3. CIRCULAR QUEUE
4.5. APPLICATIONS OF QUEUE
5.2. REPRESENTATION OF LINKED LIST
5.3. ADVANTAGES AND DISADVANTAGES
5.4. OPERATION ON LINKED LIST
5.5. TYPES OF LINKED LIST
1. Singly linked list
5.6. SINGLY LINKED LIST
5.7. STACK USING LINKED LIST
5.8. QUEUE USING LINKED LIST
5.9. QUEUE USING TWO STACKS
5.10. POLYNOMIALS USING LINKED LIST
5.11. DOUBLY LINKED LIST
5.12. CIRCULAR LINKED LIST
5.13. PRIORITY QUEUES
Sorting Techniques
6.1. COMPLEXITY OF SORTING ALGORITHMS
6.2. BUBBLE SORT
6.3. SELECTION SORT
6.4. INSERTION SORT
6.5. SHELL SORT
6.7. MERGE SORT
6.8. RADIX SORT
Searching and Hashing
1. Linear or Sequential Searching
7.1. LINEAR OR SEQUENTIAL SEARCHING
7.2. BINARY SEARCH
7.3. INTERPOLATION SEARCH
8.1. BASIC TERMINOLOGIES
8.3. BINARY TREE REPRESENTATION
8.5. TRAVERSING BINARY TREES RECURSIVELY
8.6. TRAVERSING BINARY TREE NON-RECURSIVELY
8.7. BINARY SEARCH TREES
8.8.THREADED BINARY TREE
8.9.EXPRESSION TREE
8.10. DECISION TREE
8.11. FIBANOCCI TREE
8.12. SELECTION TREES
8.13. BALANCED BINARY TREES
8.14. AVL TREES
8.15. M-WAY SEARCH TREES
8.16. 2-3 TREES
8.17. 2-3-4 TREES
8.18. RED-BLACK TREE
8.20. SPLAY TREES
8.21. DIGITAL SEARCH TREES
9.1. BASIC TERMINOLOGIES
9.2. REPRESENTATION OF GRAPH
9.3. OPERATIONS ON GRAPH
9.4. BREADTH FIRST SEARCH
9.5. DEPTH FIRST SEARCH
9.6. MINIMUM SPANNING TREE
9.7. SHORTEST PATH
BIBLIOGRAPHY
Index
0 of .
Results for:
No results containing your search query
P. 1
Principles of DS Using c and c++

Principles of DS Using c and c++

Ratings: (0)|Views: 2,050|Likes:
Published by Ravi Kumar

More info:

Published by: Ravi Kumar on May 25, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

12/11/2012

pdf

text

original

You're Reading a Free Preview
Pages 8 to 131 are not shown in this preview.
You're Reading a Free Preview
Pages 139 to 142 are not shown in this preview.
You're Reading a Free Preview
Pages 150 to 184 are not shown in this preview.
You're Reading a Free Preview
Pages 192 to 259 are not shown in this preview.
You're Reading a Free Preview
Pages 267 to 375 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->