Some of my academic projects and technologies associated with it.

-
Hi friends, that was a brief summary about my work experiences. For the next few posts, I am planning to include some of my academic projects, which has fascinated me a lot.

These projects includes Online Voting System, Multithreading, Virtual memory, Android Multicast, Android replicated key value storage, Bit torrent.

Next: Centralized Voting System

Comments

Post a Comment

Popular posts from this blog

Difference between "diff" and "sdiff" commands in Unix

-
Image
Hi everyone, in this blog post, I will be discussing about the difference between "diff" and "sdiff" commands in Unix. This is my first post about Unix. diff command diff command will compare two files and prints the difference between the 2 files. The format of diff command is diff file1 file2 . sdiff command sdiff command will compare two files side by side. The format of sdiff command is sdiff file1 file2. The contents of files are displayed side by side with a marker denoting the difference between each files. Some of the important markers used in sdiff are as follows: | - denotes the 2 files differ in the line completely. < - only the first file contains the line. > - only the second file contains the line. The better way to depict the difference is by showing examples. Here, I am comparing 2 files which are named as " ipl_teams_2008.txt " and " ipl_teams_2015.txt ". Let's see the contents of the files. ...
Read more

Java program to check if an array is bitonic

-
This blog post is about a java program to check whether an array is bitonic or not. Introduction A bitonic array for this program is defined as an array of length 'N" and for an index 'K' in this array, where 0<K<N-1, the sequence from 0 to K should be increasing order and from K to N-1 should be in decreasing order. Eg: {1,5,3}, {1,2,3,10,9,8} Solution From starting position, find the element K , upto which the sequence is in increasing order. Check whether the sequence is in decreasing order from K to last element in the array. If not return false. Return true after execution of the method. Program package techjourney.programs; /** * Created by Sujith Mohan on 7/20/2015. * This java program is for checking whether a given array is bitonic or not. * A bitonic array for this program is defined as an array of length 'N' and * for an index 'K' in this array, where 0<K<N-1, the sequence from 0 to K should be * incre...
Read more

Shell script to find factorial of a number using recursion

-
A shell script is a computer program designed to be run by the Unix shell, a command line interpreter. This blog is about a shell scripting program to find the factorial of a number using recursion. Logic The logic is simple. If the number ' n ' is 1, return 1. Else return ' n ' * ' factorial(n-1) '. Program #!/bin/sh factorial() { if [ "$1" -gt "1" ]; then a=`expr $1 - 1` b=`factorial $a` c=`expr $1 \* $b` echo $c else echo 1 fi } echo "Enter a number:" read x factorial $x Things to note: - After writing the script, change the mod of the script to enable execution. This is done by: chmod +x factorial.sh or chmod 755 factorial.sh Output of the program Enter a number: 4 24 Good to read 1) Java program to convert mobile number pad to characters 2) Difference between "diff" and "sdiff" command 3) Java program to return first non repeated character in a string
Read more