Code Optimization using DAG

YACC

Recursive Descent Parser in C++ for a sample grammar

Code

Intermediate Code Generation using Lex & YACC

Code

Generates Three Address, Four Address, Triple Intermediate Code.

Equalization of Histogram of an Image with & without OpenCV using C++

Code

8 Queens using BackTracking in Python using JSON file as Input

Input

The input to the program is the position of the first queen which taken from a json file.

Read & Display Image & Historgram in C++ using OpenCV

Code

Parser for Sample Language

Creation of Parser for a Sample Language using Lex &Yacc.


Basic Version for Parsing simple c++ code

Token Generator in Lex for C Program

This is a simple token generation program written using lex.

Concurrent Quick Sort Class in OpenMP

Q: Design a class for concurrent quicksort in C++.

Decided to use OpenMp since Pthread doesn't work well with classes, not without ton's of efforts.

Recursive & Iterative Binary Search in Scala

Scala

My very first program in Scala. And I don't find Scala close to Java. I am quite used to Java and C++ and rather find the two more close as very as programming is concerned.

Scala however is closer to Java since scala code is converted to Java Bytecode and the executed.

Program

I used 2 classes a Binary Search class & a Tester object

. An object is more like a singleton class according to my understanding. 

The BinarySearch class has constructor which accepts a sorted array.

It has 2 functions 

1. A Recursive Binary Search
2. An Iterative Binary Search.

Dark Conky Theme

I recently worked on a dark desktop theme for conky, the result was a super cool desktop theme. It is completely modular and consists of a number of widgets whose position can be easily configured using conky manager. I actively make additional commits to this project, add new widgets and fix any bugs that I find.

Screenshot

Launch Applications Faster :Preload in Linux

Wanna speed up Launch time of Applications in Linux then read on.

Preload is a package that enables a service which can preload libraries required for Applications in the Ram. Obviously reading from ram is way more faster than reading from the disk. That's where your system gains up speed and can launch applications faster.

UVa 1203 - Argus C++ map and priority queue

Question

Solution to this UVa problem by using simple data structures like map and priority queue.

Solution

Since priority queue stores data in descending order but we needed ascending order, we simply stored negative instead of positive. Alternatively we might have to write our own comparing function.

UVa 11173 - Grey Codes Using Bitset

This question asks to convert a decimal to gray code and print the decimal value of this gray code.

Competitive Programing: Vowel Substring

Q: Given a string find all the number of sub-strings which contain all the five vowels at least once.


It is solved in two ways:

1. A slightly more complicated linear scan method
2. By generating all the sub-strings and then checking whether or not it satisfies the our requirements. (brute force)

UVa 00637 - Booklet Printing

This problem is an adhoc problem that asks to you to design a system to print folding booklets. The problem description and test cases can be found here.

Record internal speaker audio in Linux

Recording internal audio in Linux

The other day I came up with this brilliant idea to use my mobile phone as a bluetooth speaker for my laptop. I decided this could be easily accomplished once we had access to the whatever the audio card has, save it and stream it on tcp or udp port across a network connection to my mobile phone by piping it netcat after conversion to wav.

Sounds perfect, except the fact that it has been already implemented. Meanwhile, through numerous visits to stackoverflow and askUbuntu I finally discovered a cool new way to record audio.

Uva 278 - Chess

This problem  is one of the best ad-hoc problems I have come across - simple but thought provoking. It asks you to the maximum number of  rooks, queens, kings or knights you could place on n*m chess board such that no piece attack another.
Given that 4<=m,n<=10.

Uva 11586 - Train Tracks

This is a solution to this Ad Hoc Problem on uva online judge.

Summing the digits of a number in C++

Q: This is a simple ad-hoc problem which asks to sum up the digits of a number repeatedly until the sum is less than 10. We are required to stop the program when input given is 0.