Physical Sciences and Mathematics Commons^™

Algorithms Analysis System: Recurrences, Anchit Sharma

Master's Projects

Algorithms which are recursive have running times which can be described by

recurrence equations or recurrences. These equations determine the overall running time complexity of the algorithm. This project intends to create a mechanism for

• auto generating recurrence equations of the form T(n) = a(T(n)/b) + f(n)

• creating a computational method for solving them and generating running times

  i.e. O (f(n)) or Ω (f(n)).

• presenting students with a way to verify their manually computed answers with

  the solution generation by the project

• generating grading and feedback for their solution

  The exercises will utilize the ‘Substitution Method’ and the ‘Master Method’ …

  ---

  Go to article

Decompiler For Pseudo Code Generation, Ankit Patel

Master's Projects

Decompiling is an area of interest for researchers in the field of software reverse engineering. When the source code from a high-level programming language is compiled, it loses a great deal of information, including code structure, syntax, and punctuation.
The purpose of this research is to develop an algorithm that can efficiently decompile assembly language into pseudo C code. There are tools available that claim to extract high-level code from an executable file, but the results of these tools tend to be inaccurate and unreadable.
Our proposed algorithm can decompile assembly code to recover many basic high-level programming structures, including …