Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "b47fb4b5-0cfa-42e5-b2d3-40244661a56d"}, "_deposit": {"id": "3878", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3878"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3878", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Evaluation of Searching And Creation of B-tree And Binary Search Tree", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Artificial Intelligence (AI) is the computational part of theability to achieve goal. A search algorithm, broadly speaking isan algorithm that takes a problem as input and returns asolution to the problem, usually after evaluating a number ofpossible solutions. Most of the algorithms studied by computerscientists that solve problems are kinds of search algorithms.The set of all possible solutions to a problem is called the space.Otherwise known as naive or uniformed , algorithms use thesimplest method of the searching through the search space ,whereas informed search algorithms use heuristic functions toapply knowledge about the structure of the search space to try toreduce the amount of time spent searching’s-tree is a datastructure that maintains an ordered set of data and followsefficient operations to find, delete, insert and browse the data. Inthis system, B-tree and Binary search tree algorithms are usedfor searching of Military terms and Weapons."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-08-02"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Evaluation of Searching And Creation of B.pdf", "filesize": [{"value": "10 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 10000.0, "url": {"url": "https://meral.edu.mm/record/3878/files/Evaluation of Searching And Creation of B.pdf"}, "version_id": "bb12e16d-3f82-4566-9fe4-8dc908caea7c"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Third Local Conference on Parallel and Soft Computing", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Yar, Thar"}, {"subitem_authors_fullname": "Nwe, Nwe"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2009-08-03"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1601"}, "item_title": "Evaluation of Searching And Creation of B-tree And Binary Search Tree", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003878", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-08-02"}, "publish_date": "2019-08-02", "publish_status": "0", "recid": "3878", "relation": {}, "relation_version_is_last": true, "title": ["Evaluation of Searching And Creation of B-tree And Binary Search Tree"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Evaluation of Searching And Creation of B-tree And Binary Search Tree

http://hdl.handle.net/20.500.12678/0000003878
http://hdl.handle.net/20.500.12678/0000003878
f8776024-239f-4381-9255-ac057a720c25
b47fb4b5-0cfa-42e5-b2d3-40244661a56d
None
Preview
Name / File License Actions
Evaluation Evaluation of Searching And Creation of B.pdf (10 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 13:44:23.382911
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL