1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
• Updating :‐ In this operation modify and update the data in the data
structure.
Example:‐ suppose a member moved and has a new address and
telephone number. Given the name of the member one need to search
for the record in the file. Then one would perform the”update”i.e.change
item in the record with the new item
• Sorting :‐ arranging the records in some logical record(i.e. the arranging all
data item in a data structure in a particular order either in accending
order or in decending order).
• Merging :‐ The process of combination the data item of two different
sorted list into a single sorted list.
Applications of data structure :‐
Arrays
Lists
Stack
Queues
Trees
Graphs
Run Time of a Program
Run‐time means the time it takes the CPU to execute an implementation of the
algorithm. The number of C++ instructions should give us a good measure of the
number of machine instructions. This is how we will measure the run‐time
efficiency of an algorithm. Usually the "number of steps" depends on the
number n of inputs to the algorithm. For instance, if you are searching an array,
it will usually take less steps if the size n of the array is smaller.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 54 ‐