Its like a life saver that netbeans included the qt application for c++ else god knows how much time I would have wasted figuring out the integration etc etc like I did for converting the obfuscated code in to OOP's code I know I know Bad practice but never mind.. :)
Now I need to figure out the power of Qt started learning about it. Lets see how much fruitful will that turn out to be
Tuesday, May 11, 2010
Kick Start with ubuntu - Linux
Hello every one..
As a hardcore fan of Ubuntu. I encouraged ubuntizing the community near and dear to me. So my friends the absolute new bie installation is here. Methods might be disturbing to geek gurus..bear with me..
People who have windows vista installed and want to dual boot with ubuntu Might face problems after installation but any ways here is how "crudely" I started to install linux on the my machines.
These steps are falling through my memory so if there is some thing wrong correct me..
1) Inside Windows go to control panel.
2) locate Administrative tools
3) double click computer management
4) click on disk management on the left side
5) you would now be able to see the list of drives. Make sure you empty one of the drive for linux. (NOTE: This I want you to do to avoid the partition making during installation)
6) say D: drive or E: drive.
7) 10-15 GB would be more than enough for ubuntu. now right click on the drive in which you want to install ubuntu. (The data on the drive is going to be erased and its irrevocable) select delete partition.
8) now you have deleted the partition creating empty space. Thats it do not do any thing. If my memory serves right you can see the empty space in green color.
9) Insert the ubuntu CD ( Request from https://shipit.ubuntu.com/ or download the image and burn it ). For beginners with almost zero experience I suggest to request it . You'll receive it with in 4 Weeks
10) After inserting it See to that the boot order is set to CD first.
11) select Install Ubuntu or if you want to just run the live CD select Try Ubuntu
12) The next few steps would be inherent and self explanatory. when you reach to a step where you are asked on which partition you need to install ubuntu. select probably the fourth or 5th option install on Largest contiguous space available
13) Thats it.
14) After installation open System>adminstration>synaptic and hit reload on the top. (internet connectivity is required)
15) after the process finishes search for your software suppose VLC . check the option and hit Apply on the top.
16) Have fun with Ubuntu Spread the word . Live FREE...
Tuesday, March 9, 2010
My Semester Project.. :)
This was done using Open CV , XLIB and ofcourse in my fav lang C++ :)
Computer Vision Rocks :D
Computer Vision Rocks :D
Sunday, October 18, 2009
Codes Codes !!
So much for the title. Well how many times i code a certain algorithm i always lost it in the mess of my laptops Hard drive, so finally thinking of organizing all my work and liking the codes in the blog :)
Here are few of them. Needless to say no matter how compacted i code there is always a scope of optimizing it, i agree.
1. Merge sort , Sorting problem time complexity O(NlogN)
2. Binary Search , using recursion
3. Binary Search , using iterative method
4. grade school multiplication , (how ever the code can be implemented using D & C this is the basic idea of it
5. Binary Search Tree , (well, if you check out the output at the bottom of the page you can find a seg fault (I wonder) The code runs perfectly fine on my machine.
6. Red Black Tree , This one took a lot of time for me to code.. huh!? It has in it the implementation of insert operation on red black trees. Doesn't include the delete()
7. Longest Common Subsequence, an exhaustive version using backtracking - non DP code
8. The whole bunch of Link list operations
9. Depth First search, the raw code, source, introduction to algorithms, useful in determining # of paths b/w given pair of vertices* and detecting cycles in a graph* (topological sorting)
I'd update the list after coding more..:)
Here are few of them. Needless to say no matter how compacted i code there is always a scope of optimizing it, i agree.
1. Merge sort , Sorting problem time complexity O(NlogN)
2. Binary Search , using recursion
3. Binary Search , using iterative method
4. grade school multiplication , (how ever the code can be implemented using D & C this is the basic idea of it
5. Binary Search Tree , (well, if you check out the output at the bottom of the page you can find a seg fault (I wonder) The code runs perfectly fine on my machine.
6. Red Black Tree , This one took a lot of time for me to code.. huh!? It has in it the implementation of insert operation on red black trees. Doesn't include the delete()
7. Longest Common Subsequence, an exhaustive version using backtracking - non DP code
8. The whole bunch of Link list operations
9. Depth First search, the raw code, source, introduction to algorithms, useful in determining # of paths b/w given pair of vertices* and detecting cycles in a graph* (topological sorting)
I'd update the list after coding more..:)
Friday, October 9, 2009
Some things that i should have learnt way before...
There was nothing much to keep me occupied in the past month to post about it. Creating Makefile was one of the thing that came across after idling for long time.
So here is the way you do it, how ever the complete tutorial about it could be found at
http://www.gnu.org/software/make/manual/make.html
Here are a few simple sample files for make
/**
*main.c
*/
#include"stdio.h"
int main()
{
printf("main");
two();
return 0;
}
/**
*two.c
*/
#include "stdio.h"
#include "header.h"
int two(){
printf("two %d", N);
return 0;
}
/**
*header.h
*/
#define N 100
#Makefile
objects = main.o\
two.o
edit : $(objects)
gcc -o edit $(objects)
two.o : header.h
.PHONY : clean
clean :
rm edit $(objects)
#end Makefile
how ever a better insight could be obtained by glancing through the URL though ;)
So here is the way you do it, how ever the complete tutorial about it could be found at
http://www.gnu.org/software/make/manual/make.html
Here are a few simple sample files for make
/**
*main.c
*/
#include
int main()
{
printf("main");
two();
return 0;
}
/**
*two.c
*/
#include "stdio.h"
#include "header.h"
int two(){
printf("two %d", N);
return 0;
}
/**
*header.h
*/
#define N 100
#Makefile
objects = main.o\
two.o
edit : $(objects)
gcc -o edit $(objects)
two.o : header.h
.PHONY : clean
clean :
rm edit $(objects)
#end Makefile
how ever a better insight could be obtained by glancing through the URL though ;)
Friday, August 21, 2009
Semester Project on Gesture Recognition
There is not much of to post about this in this blog because its all together a group project and had to be maintained by all the group members, Here is the link to it
http://gesture-recognition.blogspot.com
http://gesture-recognition.blogspot.com
Tuesday, July 28, 2009
Back to college..New Campus
And so the summer passed away, I have things left to be done still ExIF project was merely touched got lame reasons as excuses but never Mind Hoping to hop back on to its back and start riding with jet speed ^_^. As of now i am happy as a child cuz I am browsing the fastest ever Net I have experienced. New Semester, New Courses, New Campus lets see what new I would learn this seem.. sounds egotistic but never mind.
So talking about Exif, I would carry on that work with mozilla. I was so damn excited when started my work with it and I would be continuing on the same. This semester I have got loads of work on hand to do. The Sem Project Regarding the Effective Human Computer Interaction with the help of gestures, will post that after getting started.
So talking about Exif, I would carry on that work with mozilla. I was so damn excited when started my work with it and I would be continuing on the same. This semester I have got loads of work on hand to do. The Sem Project Regarding the Effective Human Computer Interaction with the help of gestures, will post that after getting started.
Subscribe to:
Posts (Atom)