Mauktik Gandhi

Research Interests
Current Projects
Completed Projects
Return to Europa

Research Interests:

Currently my research interests include anything in the field of computing that I find interesting. My goals have not yet been defined, however, I am leaning towards system programming.
Recently I have been exploring various sorting algorithms, especially in the areas of efficiency.It seems to me that I have made some progress, but who knows ??

Current Projects:

Applications of Graph and Scheduling Theory for getting out of Ohio State

The focus of this project is to develop algorithms and techniques to solve scheduling problems with prerequisites. The goal is to schedule a certain amount of events in as short of a time possible, while considering the fact that some events must occur before others, some events cannot occur at the same time due to conflicts, and that at any given time there is a bounded number of events that can be happening simultaneously (due to limited resources).
Scheduling university courses towards a degree is one instance of such a problem, and will be the initial focus of our algorithm implementations. Other important applications of these ideas lie in industry, such as scheduling the flow of materials through a factory: parts must go through a fixed order of processing and machines, yet all machines cannot be run on all parts at once.

Completed Projects:

Sorting in Linear Time

Sorting has been researched for many years now, resulting in the development of various algorithms which are highly efficient both in time and the amount of memory used. The most common of them being Quicksort which has be refined to sort very efficiently in most cases. However, the problem with algorithms such as quicksort is that they are comparison based and all such algorithms have a lower bound time complexity of O(n*log(n)).
This project involves the development of an algorithm that is capable of sorting linear time. It is similar to the radix sort method in the way it breaks up the items that need to be sorted; however, the method used to perform the actual sort is significantly different.

Efficiency in RESOLVE/C++

RESOLVE/C++, the language used in the Software Component Engineering course sequence, has been found to be inefficient. This loss of efficiency is clearly evident in programs that involve heavy mathematical computations and is in the broad sence attributed to the generality inherent in all components written in RESOLVE/C++. This project involves performing various tests on this language to find out what factors lead to the loss of time, and which of them is results in a significant loss. Finally, if possible to find out ways by which the loss can be minimized.

Return to Europa