dc.contributor.advisor | Amin, Ashok T. | |

dc.contributor.author | Doshi, Nishant | |

dc.date.accessioned | 2017-06-10T14:38:02Z | |

dc.date.available | 2017-06-10T14:38:02Z | |

dc.date.issued | 2009 | |

dc.identifier.citation | Doshi, Nishant (2009). Path complexity of the class binary search tree. Dhirubhai Ambani Institute of Information and Communication Technology, vii, 31 p. (Acc.No: T00226) | |

dc.identifier.uri | http://drsr.daiict.ac.in/handle/123456789/263 | |

dc.description.abstract | Path complexity of a program is defined as the number of program execution paths as a function of input size n. This notion of program complexity has been extended to complexity of a class as follows. Class had data members and data operations. The notion of state for the class is defined based on structural representation of a class. We are assuming only those data operations that change state of a class. The path complexity of a class is defined to be the number of valid input sequences, each of them containing n data operations.
We have analyzed the path complexity of the class Binary Search Tree (BST) based on the algorithms for insert and delete data operations. Later we modify program for delete operation to facilitate determination of path complexity for the class BST. The bounds for the path complexity of the class BST are determined. A program is developed to obtain path complexity of the class BST. | |

dc.publisher | Dhirubhai Ambani Institute of Information and Communication Technology | |

dc.subject | Computational complexity | |

dc.subject | Algorithms | |

dc.subject | Computer algorithms | |

dc.subject | Data structures | |

dc.subject | Computer science | |

dc.subject | Paths and cycles | |

dc.subject | Graph theory | |

dc.classification.ddc | 005.73 DOS | |

dc.title | Path complexity of the class binary search tree | |

dc.type | Dissertation | |

dc.degree | M. Tech | |

dc.student.id | 200711038 | |

dc.accession.number | T00226 | |