Internship

What happened to my vacations

sonam — Wed, 22 Jul 2009 05:20:28 GMT

College is opening tommorow and I am thinking what i have done in past 1 and half months of vacations.

The only thing i can remember is bluz,my open source project.
Where is that p2p thing i decided earlier?
All the research papers about skype,overlay networks ,guntella etc are lying there on disk as it is.i have read them only once.I have read not understood..

The positive side of vacations is:
1)I learned a lot about WPF,Blend etc.
2) I am participating in win7 contest based on above experience.
3)I met shaun,my new co-developer of bluz..
4)I have got some books of ASP.Net by bill ,scott and WPF book by Mathew macdonald..

And now i have some web 2.0 ideas that i hope to implement as a way of parcticing this ASP.net stuff.Thats a business idea,So you might see something interesting on web soon.

So,If i look back that way,I think it was more rewarding than any of internship i could get.

Now ,its my last year of graduation,My targets include:
1)Enjoy it fully.I know thats hard but i'll have to make this year remeberable .
2)Implement business ideas.(I love making money in humanatic way).
3)Make final year Project.
The 3rd one is where i'll cut my efforts ,Becoz i don't think that really matters as compared to my learning.Also,I don't see potential partners for a cool. .Net team to make a cool project at the college.

cya guys,
cheers

New Open Source Project-Bluz(Next Generation Media Player)

sonam — Wed, 15 Jul 2009 20:49:56 GMT

hi guys.

I have just released a pre beta release of next generation media player bluz.

Link is here:

http://code.google.com/p/bluz/

Its based on vlc libraries and bass and a couple of others for various tasks.
Its in c#,WPF but if any of you would like to contribute through any means.
The UI is purely in XAML,I am not a good designer,Even all icons are made in XAML.
.
If any of you would like to contribute through coding various modules or helping me develop the website,it would be nice of you to make it a hit on windows OS.

Atleast,U guys can check out and report any bugs you find to me directly..

It requires .Net 3.5
Have a nice day.

Screenshots:

What to do in summer?

sonam — Thu, 16 Apr 2009 16:24:34 GMT

I am a Computer science student and there is a big Question mark of what i'll do in summers.
Ofcourse,I have some projects to do ,But even then i would like to get some internship.A fun and learning opportunity at the same time,i can earn too..

But this recession has really affected my internship hopes..
Companies like Microsoft,Google are giving paid internships to Phd Students only and i am a pursuing undergraduate from not so famous college.
..And they require some big references which i am not having.

What may be other cooler options..?Let me think over it ..hmmm..

Recipe for Learning Programming

sonam — Tue, 23 Dec 2008 17:39:57 GMT

Recipe for Learning programmming :(Reference:http://norvig.com/21-days.html)

Get interested in programming, and do some because it is fun. Make sure that it keeps being enough fun so that you will be willing to put in ten years.
Talk to other programmers; read other programs. This is more important than any book or training course.
Program. The best kind of learning is learning by doing. To put it more technically, "the maximal level of performance for individuals in a given domain is not attained automatically as a function of extended experience, but the level of performance can be increased even by highly experienced individuals as a result of deliberate efforts to improve." (p. 366) and "the most effective learning requires a well-defined task with an appropriate difficulty level for the particular individual, informative feedback, and opportunities for repetition and corrections of errors." (p. 20-21) The book Cognition in Practice: Mind, Mathematics, and Culture in Everyday Life is an interesting reference for this viewpoint.
If you want, put in four years at a college (or more at a graduate school). This will give you access to some jobs that require credentials, and it will give you a deeper understanding of the field, but if you don't enjoy school, you can (with some dedication) get similar experience on the job. In any case, book learning alone won't be enough. "Computer science education cannot make anybody an expert programmer any more than studying brushes and pigment can make somebody an expert painter" says Eric Raymond, author of The New Hacker's Dictionary. One of the best programmers I ever hired had only a High School degree; he's produced a lot of great software, has his own news group, and made enough in stock options to buy his own nightclub.
Work on projects with other programmers. Be the best programmer on some projects; be the worst on some others. When you're the best, you get to test your abilities to lead a project, and to inspire others with your vision. When you're the worst, you learn what the masters do, and you learn what they don't like to do (because they make you do it for them).
Work on projects after other programmers. Be involved in understanding a program written by someone else. See what it takes to understand and fix it when the original programmers are not around. Think about how to design your programs to make it easier for those who will maintain it after you.
Learn at least a half dozen programming languages. Include one language that supports class abstractions (like Java or C++), one that supports functional abstraction (like Lisp or ML), one that supports syntactic abstraction (like Lisp), one that supports declarative specifications (like Prolog or C++ templates), one that supports coroutines (like Icon or Scheme), and one that supports parallelism (like Sisal).
Remember that there is a "computer" in "computer science". Know how long it takes your computer to execute an instruction, fetch a word from memory (with and without a cache miss), read consecutive words from disk, and seek to a new location on disk. (Answers here.)
Get involved in a language standardization effort. It could be the ANSI C++ committee, or it could be deciding if your local coding style will have 2 or 4 space indentation levels. Either way, you learn about what other people like in a language, how deeply they feel so, and perhaps even a little about why they feel so.
Have the good sense to get off the language standardization effort as quickly as possible.

How to Wrap hard disk in a control?Help

sonam — Fri, 28 Nov 2008 17:38:02 GMT

Well..I am trying to index my hard disk.
After making an initial Index,I want to get notified from hard disk for any change in the file system on any drive whatsoever (Removable media not into account).The hard disk will notify a background running windows service(of my app) for event like file moved,copied,deleted,created etc.
U can say,i want to make my hard disk a control like a button which fires event when clicked.Using Windows Indexing Service would be an overkill.
Any suggestions or ideas or alternates if somebody have in mind.:)
I would be very thankful to u.

algo for kth smallest no .

sonam — Mon, 24 Nov 2008 15:56:20 GMT

Well,I am trying hard to get an internship preferably from Microsoft and that too in US..
Now a days, i am trying to build an Impressive portfolio..But these end semester exams have really made my pace a little slow towards doing some creative things.
Anyways,I was reading up some Interview experiences of Interns at Microsoft..In that i got a question,:
Ques:"Finding the kth smallest element in a given unsorted sequence of nos."?
The intern answered that we can sort and then find that kth no.
Well this might be right but has flaw, when all the nos in the array are not distinct.
But the Interviewer emphasized on doing without sorting.

Well,I thought to give it   a shot.This question was already asked by my prof of DAA (Data Analysis And Algo)in Internal viva to someone but he was expecting a conventional answer of some steps of Randomised sort etc.
No one knew the steps ,neither they tried to think for some method.
I thought to give this question a shot and within few minutes i invented a nice algo.
A nice algo becoz it works for every sequence,a recursive procedure and it was invented by me in few minutes.Maybe ,someone had already knew this but atleast i didn't knew anything before(my ignorance)..

Here is the code :

class KthSmallestElement

    {
       static int highest; //Maximum Element Among all the numbers in the sequence
       static int smallest;    //Smallest number among all the numbers in sequence
       static int i = 1;        //Index which stores the Last position in sorted array

        /// <summary>
        /// The algo is :
        /// At each call to method,we find the smallest no which is not in the sorted array.
        /// Since,The sorted array is initialized with smallest number in the sequence,
        /// the method goes on finding next smaller numbers until the length of array reaches k.
        /// Finally,we have a sorted array which contains all the elements of sequence sorted upto kth position.
        /// but sorted array have all distinct numbers.
        /// </summary>
       /// <param name="sequence">unsorted "sequence" of numbers</param>
       /// <param name="sortArray">A temporary array "sortarray"</param>
       /// <param name="k">the kth position</param>
      static void KthElement(int[] sequence, int[] sortArray, int k)
        {
           int minimum=highest ;
            foreach (int number in sequence)
            {
                if (minimum > number && !sortArray.Contains(number))
                {
                    minimum = number;

                }
            }
            sortArray[i] = minimum;
            i++;
            if ((i) != k)
                KthElement(sequence, sortArray, k);               //Recursive call to find kth lement until sortarray contains k sorted elements

        }



        static void Main(string[] args)
        {

            int[] sequence = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,19,110 };
            int[] sortArray=new int[sequence.Length];
            highest = 110;
            smallest = 1;
            sortArray[0] = smallest;


            KthSmallestElement.KthElement(sequence, sortArray, 20);
            foreach(int no in sortArray)
            Console.WriteLine(no);
            Console.WriteLine("The 20th smallest No is : " + sortArray[i-1]);
        }


    }