[-] Show simple item record

dc.contributor.advisorHan, Yijie, 1959-
dc.contributor.authorTitti, Oshani
dc.date.issued2015
dc.date.submitted2015 Fall
dc.descriptionTitle from PDF of title page viewed on May 2, 2016
dc.descriptionThesis advisor: Yijie Han
dc.descriptionVita
dc.descriptionIncludes bibliographical references (page 37)
dc.descriptionThesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2015
dc.description.abstractData structures have been around since the structured programming era. Algorithms often associate with data structures. An algorithm is a sequence of instructions that accomplishes a task in a finite time period. The algorithm receives zero or more inputs, produces at least one output, consists of clear and unambiguous instructions, terminates after a finite number of steps, and is basic enough that a person can carry out the algorithm using a pencil and paper. Algorithms for dividing objects into bins have long been invented. However, dividing objects in summation format is not received due attention. In this paper, objects are divided into n bins in such a way that the next bin will contain more than or equal number of objects than the preceding bin.eng
dc.description.tableofcontentsGenerating edge covers of PATH -- Efficient data structures for storing the partitions of integers -- Approach -- Analysis
dc.formatix, 38 pages
dc.identifier.urihttps://hdl.handle.net/10355/48976
dc.subject.lcshData structures (Computer science)
dc.subject.lcshAlgorithms
dc.subject.otherThesis -- University of Missouri--Kansas City -- Computer science
dc.titleData Structures and Algorithms for Partitioning a Set into Sets of Non-Descending Cardinalityeng
dc.typeThesiseng
thesis.degree.disciplineComputer Science (UMKC)
thesis.degree.grantorUniversity of Missouri--Kansas City
thesis.degree.levelMasters
thesis.degree.nameM.S.


Files in this item

[PDF]

This item appears in the following Collection(s)

[-] Show simple item record