Mphasis Placement Paper

Company Name : Mphasis
Type : Fresher
Job Interview, Question Paper

I'm Arvind. I appeared in MPHASIS campus drive in my college Sree Chitra Thirunal College Of Engineering Trivandrum on 29TH January 2011.

The test was conducted by aspiring minds. First I would like to tell about criteria 60% in B.Tech they didn’t mention about 10th and 12th so don’t worry.

Now test procedure
There is no negative marking .but sectional cut off is for each round so be care full because you will have to pass all 5 section. There will be 5 sections which I mention below
1. English. (25 question- 25 minutes)
2. Quantities aptitude (25 question -35 minutes)
3. Computer basic (25 question -35 minutes)
4. Personality related group (32 question 25 minutes)
5. Reasoning (24 Question 35 minutes)

Now if you want to know about question then I will suggest you that RS AGARWAL is more than enough so do practice of RS AGARWAL and you can pass any aptitude test.And other thing be hope full yaar don’t worry about job because kismet se jayada and time se pahle kuch nhi milta hai. so wait for time if you are not selecting in any company because I will tell my experience how much company I cross to till get MPHASIS an hp company listed below

1. TCS (reject in final round)
2. ACCENTURE (reject in final round)
3. Patni computer couldn’t pass test
4. SYNTEL (reject in final round)
5. UST GLOBAL (reject in GD)
6. NEST ( reject in test)
7. ARS SOLUTION (reject in test)
8. SUNTECH (reject in final round)
9. ROBERT BOSCH (reject in technical round)
10. MPHASIS (finally selected thanks god)

So friends don’t loss hope your hope unless end because in my case I got late job but I got joining letter first till only Mphasis is one company in my college who send every thing with address within 7 days so see. Now interview panel: My interviewer sir was so cool they ask only few question from me

Technical round
1. Write a program to swap no without using third variable
2. Are you flexible give example?
3 Why you came from north India to Kerala?
4 What you like here?
5. Have you any job location?
After all this he told me now arvind you can move for the HR Round you are selected in Technical Round

HR Round
Tell me your introduction? After that hr person told me about Mphasis and he told now you selected go and enjoy party. So 7 selected I was so lucky that my name was there.

All the best guys

Exam/Interview Date : 29-Jan-2011
No of Rounds : Aptitude Test, Technical Round

Latest Yahoo Placement Paper

Information about company :->

-------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Institute: IIT Guwahati
Date of test: 28/10/2010
Paper Submitted By: Sameer Biswas
Package: 8Lakh
Paper Type: CSE B Tech/M Tech /PHD
Experience: Question is base on C/C++/Algo ,OS(little) ,Puzzles mixed Apti.
Questions: 25 questions time 1 hour.
Full Question set is available here!!!
All Questions are multiple type. 

---------------------------------------------------------------------------------------------------------------------------------------------------------------------

1. Teacher asked the students to find the cube root of a natural number but she did not mention the base. Students assumed the base found the cube root. Each student got an integer. Find the sum of digits of that number.
A. 0
B. 1
C. 6
D. 7
E. 8

2. What is the difference of last two digits of N where N=7^2010

a.1
b.3
c.5
d.7
e.9



3.Find the first non Zero digit in 67!(Factorial)

a.3
b.4
c.5
d.6
e.7


4. Suppose here are n processes in the system and each one needs k instances of a resources to complete. What would be the minimum number of resources that you should keep in the system to ensure no deadlock in the system.]

a.n*k
b.n*k-n+1
c.n*k+1
d.n*k*k
e.None of the above

5. If we have a ring counter of 4 bits, with an initial state of 1000, what is the modulus of the counter?

a. 16
b.8
c.32
d.4
e.Node of the above

6. Which of the following masks can be used to zero out alternate bits of a 16 bit number?

a.0101
b.AAAA
c.FFFF
d.EEEE
e.BBBB

7. We define a function below. What is the value returned by this function: express your answer as a function of n.
unsigned int func(unsigned int n)
{
unsigned int r=0;
unsigned int i,j,k;
for(i=1;i<=n;i++) for(j=1;j<=i;j++) for(k=j;k<=i+j;k++) r++ return r; }

a. func(n)=summation of i*(i+1) with i varing from 1to n
b. func(n)=n*n+1 + n*n-1
c. func(n)=func(n-1)+n*n+n with func(n)=0
d. func(n)=func(n-1)+n*n+2 with func(n)=0
e. both a and c.

Question 8:

Which of the following statements about the datagram sent by a node in a network using IPv4 protocol is (are) true?
i. Datagrams at the source must be the size of the smallest maximum transmission unit(MTU) of alla the links on a path to the destination
ii. Datagrams may be fragmented during routing
iii. Datagrams are re-assembled at the destinations
A. I only
B.II only
C.III only
D. I and III
E. II and III

Question 9:

In a pipeline RISC computer all arithmetic instructions have the same CPI(Cycles per instructions), which of the following actions would improve the execution time of a tpical; program?
i. Instructions the clock cycle rate
ii. Disallowing any forwarding in the pipeline
iii. Doubling the sizes of the instruction acache and the data cache without changing the clock cycle time
A. I only
B.II only
C.III only
D. I and II
E. I and III

Question 10:

Let n(1), n(2), n(3)…. n(t) be positive integers. What is the minimum number N of objects to ensure that if N objects are placed into t boxes, for some I in [1,t], box I contains at least n(i) objects?
i. n(1)+ n(2)+ n(3)+….+ n(t)
ii. n(1)+ n(2)+ n(3)+….+ n(t)+t-1
iii. n(1)+ n(2)+ n(3)+….+ n(t)-t
iv. n(1)+ n(2)+ n(3)+….+ n(t)-t-1
v. n(1)+ n(2)+ n(3)+….+ n(t)-t+1



Question 11.
#define scanf “%s is a string”
Main(){
Printf(scanf,scanf);
}
What is the output?
A. Ccompiler error
B. scanf is a string
C. %s is a string is a string
D. %s is a string
Question 12.

#define boo(x) x/4
Main(){
Int I;
I=64/boo(4);
Printf(“%d\n”,i);
}
A. Compiler time error
B. 16
C. 64
D. 20
E. Divide by Zero Error






Question 13.

What the following C function will do?
Unsigned int bitwise(Unsigned int x)
{
Unsigned int r=x &-x;
Unsigned int l
x+=r
if(0==l)
return 0;
l=x &-x;
l-=r;
while(0==(l&l)
{
l>>=1;
}
Return x|(l>>1);
}
A. Return the greatest integer smaller then x
B. Returns x/2
C. Returns the smallest integer greater than x with the some number of bits set
D. Returns the smallest integer greater than x with less number of bits set
E. None of the above
Question 14 
Int i
Void intcrement(int i)
{
I++
}
Int main()
{
For(i=0;i<10; increment(i)) { } Printf(“i=%d”,i); Return 0; } Predict the output of the above C ode A. I=10 B. I=9 C. I=11 D. Compiler Error E. NoNne of the above Question 15.

Consider the following C program
Main()
{
Int i=0;
I++;
Fork();
Printf(“d”,i);
I++;
Fork();
Printf(“d”,i);
}
What is the maximum value of the I that will be printed?
A. 0
B. 7
C. 5
D. 2

Question 16.

What will be printed by the code below?
#include
Using namespace std;
Template
Void swap( T *a, T *b){
Temp =*a;
*a=*b
*b=temp;
}
Int main(){
Char hello[]=”hello”;
Char world[]=”world”;
Swap((char *)&hello, (char **)&world);
Cout<<<” “<< World”; Retun 0; } A. Hello World B. World hello C. Helld worlo D. Compiler error at the swap call E. Runtime error Question 17.
Consider a Binary Tee represented as a 1-indexed array(where the children of an element L are at indexes L and 2*L+1, elements at index is the root), with elements 1,2,3,4,5,6,7 in that order. If the post order traversal of the array gives ab-cd*+, the the lebel on the nodes 1,2,3,4,5,6,7 can be

A. +,-,*,a,b,c,d
B. a,-,b,+,c,*,d
C. a,b,c,d,-,*,+
D. -, a,b,+,*,c,d
E. nOne of the above

Question 18.

A hypercube is defined as follows:
A hypercube of dimension 0 has only a vertex. To construct a hypercube of N dimentions, take two N-1 dimentional hypercubes, and attach edges between corresponding nodes of each of these hypercubes. How many colors will you need to color the EDGES of an N dimentional hypercube such that no two edges of the same color share a common vertex?

A. 2
B. 2^N
C. N
D. N^2
E. Node of the above

Question 19.
Find the complexity function

F(n)=2F(n/2)+10n, if n>1
F(n)=1, if n=1

A. n^2
B. n(logn)^2
C. n
D. nlogn
E. None of the aboveE. 10

Question 20

In each step of insertion sort algorithm, a new elemennt has to be inserted into an already sorted subarry. Instead of using sequential search to determine the location of new element which takes O(n) time( Which makes the overall cpmplexity O(n^2) ), We can use bunary search since the subarray is sorted, which will take O(logn) time. By using this techinue, we can reduce the complexity of insertion sort from O(n^2) to

A. O(nlogn)
B. O(n)
C. O(logn)
D. O(n^2)
E. O(1)

Question 21

Cossider the following procedure:
f(n)
for i=1 to n
dp
j=n
while j>i
do
j=j-1
end while
end for
Assume the above procedure are only an integer n>0;
What is the time complexity in n for the procedure above:
A.O(nlogn)
B.O(n)
C. O(n^2)
D. O(N^3)
E. O(1)


Question 22 

The worst case time complexity of finding 5th smallest number in sa list of 50000 randomly chosen numbers.

A. O(1)
B. O(n)
C. O(logn)
D. O(n^2)
E. O(nlogn)


Question 23

Consider the problem of sorting (in ascending order ) of an array of numbers, each number being the range(50,000 5000,000). What sorting algorithm is the best choice for the above problem. What is the best case time complexity of sorting achievable for this problem?

A. Merge sort
B Insertion Sort
C. Quick Sort
D. Counting sort
E. Bubble SOrt

Question 24

Two matrices M1 And M2 are to be stored in an Array A and b respectively. Each Array can be stored either in row major r column major order in contiguous memory
locations. The time complexity to compute M1*M2 (Matrix Multipication) wil be
A. Best if A is in row-major and B is in Column Major Order.
B. Best if both are in row major
C. Best if both are in column major
D. independent of the storage scheme.
E. None of the above


Question 25 

An large array[]1...n] with N slots is filled only up to positions n for the n very less than N. To start with We do not know n. To locate an empty slot, we check A[j] for j=2^[2^i]
in step i. What is the fewest number of steps in which we are guaranteed to find an empty slot?
A. O(n)
B. O(log n)
C. O(logN)
D. O(loglog n)
E. O(loglogN)Please write Comments if this paper is useful to you... As more comments you made I do upload more questions.

..

Google Stuff---Google Search Tricks

many of you still dont know this so here it is for u.. a Compilation


Restrictive Searches Google also has restrictive searches that allow you to limit the sites or information that you are searching for.
[soccer site:whitehouse.gov] Will return only documents from the site whitehouse.gov with the word soccer on the page, in the title or in the anchor text that links to the page.
[intitle:soccer site:whitehouse.gov] Will return only documents from the site whitehouse.gov with the word soccer in the title.
[ipod $100..$150] Will return pages with the word IPod on the page, in the title, or anchor text linking to the page, and with dollar amounts between $100 and $150 on the page, in the title, or in the anchor text linking to the web page.
[ipod $100..$150 “in stock”] Will return pages with the word IPod, and “in and stock” on the page, in the title, or anchor text linking to the page, and with dollar amounts between $100 and $150 on the page, in the title, or in the anchor text linking to the web page.
[ipod $100..$150 “in stock” -shuffle (green OR blue)] Will return pages with the word IPod, and “in and stock” on the page, in the title, or anchor text linking to the page, and with dollar amounts between $100 and $150 on the page, in the title, or in the anchor text linking to the web page. The word shuffle must not be on the page, in the title or anchor text, and the page, title or anchor text must contain either the word green or blue.
[telescope filetype:pdf] Will return only PDF files with the word telescope on the document, in the title or in the anchor text to the document. Filetypes can be any of the following: Adobe Portable Document Format (pdf), Adobe PostScript (ps), Lotus 1-2-3 (wk1, wk2, wk3, wk4, wk5, wki, wks, wku), Lotus WordPro (lwp), MacWrite (mw), Microsoft Excel (xls), Microsoft PowerPoint (ppt), Microsoft Word (doc), Microsoft Works (wks, wps, wdb), Microsoft Write (wri), Rich Text Format (rtf), Shockwave Flash (swf), Text (ans, txt).
[telescope filetype:pdf intitle:dobsonian 2004..2005] Will return only PDF files with the word telescope on the document, in the title or in the anchor text to the document. The title must contain the word Dobsonian and the document will contain numbers from 2004 through 2005.
[link:whitehouse.gov] Provides a completely random sampling of some sites that link to whitehouse.gov. There is no logic or reason to the sites displayed or the order they are displayed in. Many sites that link to you will not be displayed. This search is considered “broken”.
[info:whitehouse.gov]Provides links to information and searches about the website whitehouse.gov.
[cache:whitehouse.gov] Displays a copy of the page stored on Google’s server. This may vary from the actual page on the website.

Specialized Searches

Google has a number of specialized searches that search through a small subset of data for highly relevant results.
[phonebook: gibson NY] Will return a sampling of business and residential listings with the word gibson in the name, town or street that are in New York.
[bphonebook: gibson NY]Will return a business listings with the word gibson in the name, town or street that are in New York.
[rphonebook: gibson NY]Will return a residential listings with the word gibson in the name that are in New York.
[movie:Goblet of Fire] Will return pages about the Goblet of Fire, contain the words Goblet of Fire . Has links to reviews about the Goblet of Fire and movie show times. 
[movie: flux capacitor] Will return pages about movies with the words flux capacitor on them.
[stocks:goog] Will return information about the stock symbol GOOG.
[weather las vegas NV] Will give the local weather for Las Vegas Nevada.
[fly JFK LAX] Links to flight information from JFK airport to LAX airport.
[fly new york to los angeles] Link to flight information from New York to Los Angeles
[jetblue 189] Provides a direct link to the status of Jet Blue Airlines flight 189.
[frank zappa] Links to More information about Frank Zappa, albums, and other information. This is sometimes hit or miss depending on the artist.
[related:whitehouse.gov] Returns links to other pages that are about similar topics or information. Some of these sites will have links that exist between them others will not. In some cases this may show direct competition, for example [related:walmart.com]
[1600 pennsylvania avenue washington dc] This is an address search and provides a direct link to Google Map for the address.

Fact Searches

This category provides you with immediate answers to a specific narrow set of questions. It’s a bit of hit or miss here but here are some examples.
[gdp malta] Gross Domestic Product of Malta
[population malta] Population of Malta.
[capital malta] The capital of Malta.
[location malta] Rough idea of where Malta is located.
[currency malta] What is the currency of Malta.
[flag france] The flag of France. Note there was no flag shown for Malta.
[anthem france] What is the national anthem of France.
[state bird hawaii] What is the state bird of Hawaii.
[state flower hawaii] State flower of Hawaii.
[motto hawaii] what is the state motto of Hawaii.
[size hawaii]
[governor hawaii] The governor of Hawaii.
[birthplace of walt disney] Where Walt Disney was born.

Math and Number Searches

[100+37+92+641-7] Works like a calculator to perform math operations.
[how many teaspoons in a tablespoon] Provides the answer to measurement conversions.
[convert 300 yen to dollars] Provides currency conversion
[1Z9999W99999999999] Provides a link to UPS tracking information.
[790187289080] Provides a link to Fed Ex tracking information.
[0103 8555 7493 2721 4413] Provides a link to USPS tracking information.
[1HD1BEK11BY123456]
Provides a link to VIN (Vehicle Identification Number) information.
[073333531084]Provides a link to UPC information for that product.
[212] Provides a link to information about the area code 212.
[202-456-1111]Provides a link to more information about the residence, business, or organization for that phone number.
[patent 5123128]Provides a link to more information about patent number 5123128.
[n199ud] Provides a link for more information about the FAA registration for the airplane with that registration number.
[fcc IHDT5ZG1]Provides a link to information about the product with that FCC id number

[blue widgets] Finds pages with the words blue and/or widgets on them, in the title, or used in the anchor text to link the page. Words may not be near each other (this is known as proximity).
[“blue widgets”] Finds pages with the words blue and widgets on them, in the title, or used in the anchor text to link the page. The words must be next to each other and in the exact same order. This type of query is known as an exact phrase match.
[blue or widgets] Finds pages with the words blue or widgets on them, in the title, or used in the anchor text to link the page. 
[blue and widgets] Finds pages with the words blue and widgets on them, in the title, or used in the anchor text to link the page. Both words must occur in one of the cases, but can occur in any order.
[blue -widgets] Finds pages with the words blue on them, in the title, or used in the anchor text to link the page. The page, title and anchor text must not have the word widgets in them It’s very important that the minus sign [-] be next to the word without a space. This is known as a negative search term.
[blue ~widgets] Finds pages with the word blue on them, in the title, or used in the anchor text to link the page. It also returns documents with synonyms for the word next to the tilde [~] (in this case widgets) on the page, in the title or in the anchor text to the page.
[define: blue] This will give you definitions for the word [blue] and links to pages with definitions.

Compound Searches

Using logical operators like [and] and [or] we can create complex searches. We can create extremely complex searches by combining logical operators using parenthesis. These complex searches can also be combines with [”] and [-] as well.

[widgets (red OR blue)] Finds pages with the words widgets on them, in the title, or used in the anchor text to link the page. The words blue or red must be on the page, in the title or in the anchor text used to link to the page. 
[widgets (red AND blue)] Finds pages with the word widgets on them, in the title, or used in the anchor text to link the page. The words blue and red must be on the page, in the title or in the anchor text used to link to the page. 
[widgets (red AND blue) -green] Finds pages with the word widgets on them, in the title, or used in the anchor text to link the page. The words blue and red must be on the page, in the title or in the anchor text used to link to the page. The word green must not be on the page, in the title or in the anchor text used to link to the page.
Lets say you wanted to do a search for people who haven’t posted or updated their blog in a while, here’s how you would create that query [“haven’t (updated OR posted)” and blog]

Search Modifiers

Google has a series of search modifiers that allow you to perform very specific searches, these include [inanchor], [intext], [intitle], and [inurl]. In addition you can also add the word [all] in front of each term to include all of the words in the phrase. These modifiers can also be combined with the [”] , [-], and logical operators and be used to create complex queries.

[inanchor:blue widgets] Returns pages where the words blue is used by other pages or websites to link to the page, and have the word widgets on the page, in the title, or in the anchor text used to link to the page.2
[allinanchor:blue widgets] Returns pages where the words blue and widgets are used by other pages or websites to link to the page.
[intitle:blue widgets]Returns pages where the word blue is used in the title, and the word widgets is on the page, in the title, or in the anchor text used to link to the page.
[allintitle:blue widgets]Returns pages with the words blue and widgets are in the title.
[inurl:blue widgets]Returns pages where the word blue is used in the URL, and the word widgets is on the page, in the title, or in the anchor text used to link to the page.
[allinurl:blue widgets]Returns pages with the words blue and widgets are in the URL.
Lets say you were looking for pages about cookbooks where people used the words celebrity to link to them here is a query you might construct [cookbooks inanchor:celebrity]
Lets refine that query taking out all the bad, horrible, and terrible cookbooks with this query [cookbooks -bad -horrible -terrible inanchor:celebrity]
Now lets refine it once more to find only cookbooks with recipes from your favorite movie star Alicia Silverstone in them [cookbooks “alicia silverstone” -bad -horrible -terrible inanchor:celebrity]