Term Paper of Section B6803 Date of Allotment: 1st Submission Date: 27th Sep (Online only) No.

. 1 2 3 4 5 6 7 8 9 10 11 12 Topic Implementation of Computer Dictionary with the help of data structures[using c++]* Implementation of Telephone Directory with the help of data structures[using c++] Implementation of Address Book with the help of data structures[using c++] Building a mini search engine using a data structure with the help of data structures[using c++] Explain the steps for Complexity Analysis by using some examples Role of Data Structures to sort the elements in the database which one is better in which circumstances Role of Data Structures in Programming languages Maintenance of employee based database with the help of data structures[using c++] Role of Data Structures to insert an element in the database which one is better in which circumstances Role of pointers to implement different Data Structures Maintenance of reusability of space in link list Representation of traversing techniques Binary trees in memory Create a linked list[explain the steps to create that link list]. Which consisting of numerical values. Write a procedure for the following with explanation 13 1. Find the maximum values in the list 2. find the average of the values in the list 3. find the product of elements in the list Role of Data Structures to traverse elements of database which one is better in which circumstances Describe the notations of complexity of an algorithm and space time tradeoff algorithms Explain the three types of structures used for storing strings[ Fixed length storage structure, Variable length storage structure, Linked list storage. B6803A27, B6803A28 B6803A29, B6803A30 B6803B31, B6803B32 Roll No. B6803A1, B6803A2 B6803A3, B6803A4 B6803A5, B6803A6 B6803A7, B6803A8 B6803A9, B6803A10 B6803A11, B6803A12 B6803A13, B6803A14 B6803A15, B6803A16 B6803A17, B6803A18 B6803A19, B6803A20 B6803A21, B6803A22 B6803A23, B6803A24 B6803A25, B6803A26

14 15 16

17 18 19 20 21 22 23 24 25 26 27 28

Implementation of hospital management system with the help of data structures[using c++]* Role of Data Structures to delete an elements from the database which one is better in which circumstances Implement and Compare the practical performance of Fibonacci heaps and binary heaps Role of Data Structures to search an element from the database which one is better in which circumstances Implementation of Red Black Trees Applications of stacks and queues Explain the different operations on different types of data structures. Complexity of various searching and sorting data structures Compare the performance of array operations with link list operations. Explain the advantages and disadvantages of doubly link list over the singly link list Linked and array representation of queues Implementation of recursive procedures by stacks

B6803B33, B6803B34 B6803B35, B6803B36 B6803B37, B6803B38 B6803B39, B6803B40 B6803B41, B6803B42 B6803B43, B6803B44 B6803B45, B6803B46 B6803B47, B6803B48 B6803B49, B6803B50 B6803B51, B6803B52 B6803B53, B6803B54 B6803B55 B6803B56 B6803B57 B6803B58 B6803B59 B6803B60

29 30

Explain Direct addressing calculation by using hashing Traversing of graphs by using different methods, which one is better in which circumstances