CAP 205 Data structures Sec-D3002

DOA:2/02/11 DOS:15/04/11

Term Paper topics:

S.No. Topic ROLL NO

1,85
1 Implementation of Computer Dictionary
2,89
2 Implementation of Telephone Directory
3,30
3 Implementation of Address Book
Building a mini search engine using a data 4,31
4
structure
5,33
5 Simulation of Scheduling Algorithms
6,34
6 Design of an Editor
Role of Data Structures in Programming 7,35
7
languages
8,37
8 Role of Data Structures in Compiler Design
9,38
9 Data Management In a Digital Computer
Implementation of Databases with Data 12,40
10
Structures
13,41
11 Problem solving with Data Structures
14,42
12 Analysis of algorithms of search engines

Dynamic Programming and its implementation 17,43

13

Comparison of Linear and Non-Linear Data 18,44

14 Structures

20,46
Role of data structure in graphics and artificial
15
intelligence

Dynamic Memory Management also discuss 21,47

16
the various memory management functions
22,48
17 AVL trees and their implementation

23,50
18 B + Trees and its implementations
 In depth comparisons of all sorting algorithms 24,51
19 and considering the cases in which a particular
sorting algorithm most suitable to use..
25,53
20 Importance of Recursion and its applications

26,55
21 Various applications of Queues

27,56
22 Various Hashing Methods and applications

Implementation of Doubly Linked Lists and its 28,60

23
Applications
29,64
24 Applications and implementation of Heaps

Importance of Algorithm complexity and various 61,65

25
notations
63,66
Various applications of Stacks and queue in
26
real life

Implementation of Stack and queue using 75,68

27
Arrays and pointers
79,69
Why we use pointers? Advantages and
28
disadvantages of using pointers.
82,70
29 Various applications and operations of graphs

83,71
Implementation of the various operations on
30
one way link list.

Implementation Various traversing techniques 73,78

31
of binary trees.
74,81
32 Various operations on AVL Trees

Implementation of the various infix to postfix 77,84

33
notation using stacks