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

1.1 OBJECTIVES
1.3 PROCESS OF ANALYSIS
1.4 CALCULATION OF STORAGE COMPLEXITY
1.5 CALCULATION OF TIME COMPLEXITY
1.6 SUMMARY
1.7 SOLUTIONS / ANSWERS
1.8 FURTHER READINGS
2.0 INTRODUCTION
2.1 OBJECTIVES
2.2 ARRAYS AND POINTERS
2.3 SPARSE MATRICES
2.4 POLYNOMIALS
2.5.1 Row Major Representation
2.5.2 Column Major Representation
2.6 APPLICATIONS
3.3 ARRAY IMPLEMENTATION OF LISTS
3.4 LINKED LISTS - IMPLEMENTATION
3.5 DOUBLY LINKED LISTS-IMPLEMENTATION
3.6 CIRCULARLY LINKED LISTS IMPLEMENTATION
3.7 APPLICATIONS
3.8 SUMMARY
3.10 FURTHER READINGS
4.0 INTRODUCTION
4.3.1 Implementation of Stack Using Arrays
4.3.2 Implementation of Stack Using Linked Lists
4.4 ALGORITHMIC IMPLEMENTATION OF MULTIPLE STACKS
4.5 APPLICATIONS
4.6 SUMMARY
4.7 SOLUTIONS / ANSWERS
4.8 FURTHER READINGS
5.0 INTRODUCTION
5.1 OBJECTIVES
5.2 ABSTRACT DATA TYPE-QUEUE
5.3 IMPLEMENTATION OF QUEUE
5.4 IMPLEMENTATION OF MULTIPLE QUEUES
5.5.1 Array implementation of a circular queue
5.5.2 Linked list implementation of a circular queue
5.6 IMPLEMENTATION OF DEQUEUE
5.7 SUMMARY
5.8 SOLUTIONS/ANSWERS
5.9 FURTHER READINGS
6.0 INTRODUCTION
6.1 OBJECTIVES
6.2 ABSTRACT DATA TYPE-TREE
6.3 IMPLEMENTATION OF TREE
6.4 TREE TRAVERSALS
6.5 BINARY TREES
6.6 IMPLEMENTATION OF A BINARY TREE
6.7 BINARY TREE TRAVERSALS
6.8 APPLICATIONS
6.9 SUMMARY
6.10 SOLUTIONS / ANSWERS
6.11 FURTHER READINGS
7.0 INTRODUCTION
7.1 OBJECTIVES
7.2.1 Traversing a Binary Search Tree
7.2.2 Insertion of a node into a Binary Search Tree
7.2.3 Deletion of a node from a Binary Search Tree
7.3.1 Insertion of a node into an AVL tree
7.3.2 Deletion of a node from an AVL tree
7.3.3 AVL tree rotations
7.3.4 Applications of AVL Trees
7.4.1 Operations on B-Trees
7.4.2 Applications of B-trees
7.5 SUMMARY
7.6 SOLUTIONS/ANSWERS
7.7 FURTHER READINGS
8.0 INTRODUCTION
8.1 OBJECTIVES
8.2 DEFINITIONS
8.3.1 Dijkstra’s Algorithm
8.3.3 Acyclic Graphs
8.4.1 Kruskal’s Algorithm
8.4.2 Prim’s Algorithm
8.4.3 Applications
8.5 BREADTH FIRST SEARCH (BFS)
8.6 DEPTH FIRST SEARCH (DFS)
8.7 FINDING STRONGLY CONNECTED COMPONENTS
8.8 SUMMARY
8.9 SOLUTIONS/ANSWERS
8.10 FURTHER READINGS
9.0 INTRODUCTION
9.1 OBJECTIVES
9.2 LINEAR SEARCH
9.3 BINARY SEARCH
9.4 APPLICATIONS
9.5 SUMMARY
9.6 SOLUTIONS / ANSWERS
9.7 FURTHER READINGS
10.0 INTRODUCTION
10.1 OBJECTIVES
10.2.1 Insertion Sort
10.2.2 Bubble Sort
10.2.3 Quick Sort
10.2.4 2-Way Merge Sort
10.2.5 Heap Sort
10.3 SORTING ON SEVERAL KEYS
10.4 SUMMARY
10.5 SOLUTIONS/ANSWERS
10.6 FURTHER READINGS
11.0 INTRODUCTION
11.1 OBJECTIVES
11.2.1 Splaying Steps
11.2.2 Splaying Algorithm
11.3.1 Properties of a Red-Black Tree
11.3.2 Insertion into a Red-Black Tree
11.3.3 Deletion from a Red-Black Tree
11.4 AA-Trees
11.7 FURTHER READINGS
12.0 INTRODUCTION
12.1 OBJECTIVES
12.3 FILE ORGANISATION
12.4.1 Structure
12.4.2 Operations
12.4.3 Disadvantages
12.4.4 Areas of Use
12.5 DIRECT FILE ORGANISATION
12.6 INDEXED SEQUENTIAL FILE ORGANISATION
12.7 SUMMARY
12.8 SOLUTIONS/ANSWERS
12.9 FURTHER READINGS
0 of .
Results for:
No results containing your search query
P. 1
mcs-021

mcs-021

Ratings: (0)|Views: 148 |Likes:
Published by Agnel Thomas

More info:

Published by: Agnel Thomas on Oct 20, 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

02/10/2012

pdf

text

original

You're Reading a Free Preview
Pages 4 to 25 are not shown in this preview.
You're Reading a Free Preview
Pages 29 to 51 are not shown in this preview.
You're Reading a Free Preview
Pages 55 to 113 are not shown in this preview.
You're Reading a Free Preview
Pages 117 to 160 are not shown in this preview.
You're Reading a Free Preview
Pages 164 to 171 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)//-->