Microsoft Internship Test Questions

Today i attended the Microsoft's Internship test . Here i am posting the questions so it will be useful to you too..

It was a one hour long descriptive test with six questions. The first four carries 5 marks each and remaining two carries 10 marks each.

1. You are given a character string . Write the algo to print the character with maximum occurence and print that number of occurence too.
   Eg: i am an hacker --> output should be 'a' 3 times
2. Give the output of the following code:
   

   #include<iostream>
   using namespace std;
   
   int main()
   {
   int a=10,b=2;
   b=a+++a;
   cout<<b<<" "<<a"\n";
   return 0;
   }
   

3. Give the pseudocode for finding the factorial of a given integer.Make sure that the number should be of atmost two digits.
4. What is Early binding and Late binding.
5. You are given with a tree. Write the algo to make sure that it is a binary tree.
6. You are given with a software application to send an email. write the testcases to check the working of the software.
(There was a picture here ..showing the working of email sender application.i cant waste time by drawing it.)

Amazon Interview questions

I recently had an interview for internship by Amazon . Here i'm posting the questions asked during that . There were about four questions , out of which one was coding .

1) Consider you have a list of 2n+1 elements. n elements in the list have one duplicate. Give the algo to find the remaining unique element(the element without duplicate) ? { Eg: array 5 2 4 4 2 1 5 : here 1 is the unique element }

Modify the algo , if we have many elements without duplicate ? { Eg: array 5 2 4 4 1 7 2 3 5 here 1 7 and 3 are unique ie without duplicates }

2) Consider a singly linked (non circular ) list . Give the algo to find the pointer to the k'th element from the last , in a single iteration through the list .

3) Consider you have an array . the elements are arranged as in increasing order till a peak element , and from this element onwards it decreases..Give the algo to find this peak element .{ Eg: array : 2 3 4 5 6 3 2 1 : here 6 is the peak element. }
Modify your algo to take care of multiple peak elements . { Eg: array 2 3 4 5 6 3 2 1 5 8 9 2 1 here we peak elements are 6 9

Coding :
Write a definiton for the function with prototype given below:
Reversal(pointer to head of list, an integer k )
This function takes a list and an integer k, and reverses the first k elements of list and return a pointer to the head of new reversed list .

Open Office Recovery problem

Yesterday when i was creating my assignment document in open office, some how it crashed .so i gave a force quit.Then when i restarted open office , it shows a window saying " openOffice.org Document recovery ", and the problem was that , it neither recovering my document nor allowing me to open a new one .screen shot added here:



WTH. So i think this post will help those having the same problem .

To solve this problem , just goto your home folder. Press ctrl + H to show hidden files. Get into the folder as shown : ".openoffice.org" -> 3 -> user -> registry -> data -> org -> openoffice ->Office . Delete that "Recovery.xcu" ( DONE ). Now just restart your open office..It will work without any problem ..

One Laptop Per Child ( OLPC) Project

The One Laptop Per Child Association,(OLPC) is a U.S. non-profit organization set up to oversee the creation of an affordable educational device for use in the developing world. Its mission is "To create educational opportunities for the world's poorest children by providing each child with a rugged, low-cost, low-power, connected laptop with content and software designed for collaborative, joyful, self-empowered learning." Informally the chairmen says that the mission is to eliminate poverty. Its current focus is on the development, construction and deployment of the XO-1 laptop.

The goal of the foundation is to provide children around the world with new opportunities to explore, experiment, and express themselves. To that end, OLPC is designing a laptop, educational software, manufacturing base, and distribution system to provide children outside of the first-world with otherwise unavailable technological learning opportunities.

GET INVOLVED :
Posters: Print these stuffs in your neighbourhood


Download poster 1 Download poster 2 Download poster3

FOSS meet 2010 at NIT calicut

FOSSMeet is an annual event on Free and Open Source Software at National Institute of Technology Calicut. This event brings together FOSS enthusiasts from all over India. The 2010 edition of the event is scheduled to be held during February 5 to 7, 2010.

It started as FLOSS Meet @ NIT Calicut in 2005 which was a single day event. It is being conducted at NIT Calicut annually since then. During this period, it has evolved into one of the biggest Free Software conferences in India.

FOSSMeet 2010 is the 6th edition of this attempt at popularizing Free and Open Source Software in India.

visit: http://fossmeet.in/
Follow twitter updates:

FOSS.IN 2009 at Bengaluru

FOSS.IN is one of the world’s largest Free and Open Source Software (FOSS) events, held annually in India. The event is highly focussed on FOSS development and contribution.FOSS.IN 2009 is now going on at NIMHANS center Bengaluru(from Dec 1 - 5).Im so happy to be a part of this big event..Really i can't express the feeling when i see guyz like Kishore bhargava nd Atul chitni ..standing near me..
The talks are also great.

#####################################
Follow FOSS in twitter: Foss.in 2009