This page is a repository of my assignments done as part of the Algorithms course during Fall 2009, at IIIT-B under the guidance of Prof. G.N.S Prasanna.
Efficient Implementation of a Sorting Algorithm
In this assignment, we implemented a heap sort both using C and Java. The programs were then evaluated with large inputs of 1 - 10 million numbers.
Downloads: Source Code ( C ) Readme Test Case Source Code (Java)
Computation vs Disk Access Time Comparison Insertion Sort / Merge Sort / Matrix Multiplication
In this assignment, we aim to find the dominating factor between computation time and disk access time for three different algorithms - insertion sort, merge sort and matrix multiplication. We found that the computation time is the dominant factor for insertion sort and matrix multiplication, whereas the disk access time was the dominant factor for merge sort.
Downloads: Excel Charts
Performance Evaluation of Fibonacci Series Computation
This is a homework based on a lecture from Prof. Muralidhara V.N as part of the Algorithms course. He presented three different approaches to find the Fibonacci series - Standard recursion, Iterative and Matrix form. I implemented these approaches with the aim to determine which approach performs the best, in terms of time and memory in computing the highest number in the series.
Downloads: Source Code
Matlab Assignments
The purpose of this assignment is to effectively use the Matlab tool to solve complex mathematical problems like Fourier transform, SVD decomposition, entropy conparison, etc.
Downloads: Questions Source Code Output Plots
Excel Assignments
The purpose of this assignment was to improve our fluency with MS Excel and at the same time understand its limitations with respect to both integer number precision and floating point IEEE 754 standard.
Downloads: Source Code
CPLEX Assignment
In this assignment we used the CPLEX tool to solve certain optimization problems using linear programming. The software allows users to write a script in which we can specify the constraints and objective function. The solver then executes the script and finds a set of local and globally optimal solutions.
Downloads: Questions Source Code
Video Lecture Annotation
Annotated the lecture session covering graph traversal and MST algorithms - Kruskal's and Prim's. Detailed annotation of the video and added subtitles, where the audio of the professor was not clear. Created an animation for the opening screen. Also created a credits video template where a picture of each group member appears.