# Google Placement Papers – Download Google Previous Question Papers & Answers

*Google Placement Papers *

Hi welcome to India wide jobs Here we are providing the All MNC Companies Placement papers like Google placement papers these are asked in the All MNC Companies for Placements. Coming to the Google placement papers that are asked in the Google Placements. Google conducting the Placements for the fresher as well as for the experience candidates regularly. Massive number of candidates are attending for the Google Placements for every time. Bust some people are not getting the jobs because of the lake of knowledge on the Google placement papers. So the candidates who are going to attend the Google Placements refer these Google previous placement papers. These papers are very useful for the candidates while attending the Google Placements written test. So many candidates also searching for these Google placement papers to download. For all those candidates we are providing the Google placement papers free download for the candidates.

**Google Placement Papers free PDF Download**

These Google placement papers contains all the question asked in the previous sections topics like aptitude questions, reasoning, simple grammar questions. So we also providing Google aptitude questions as the special reference because so many candidates are felling difficult in the aptitude section. So the candidates who are preparing for the software companies these are placement papers very useful. So all candidates who are searching for the Google recruitment questions papers for system engineer we can download from the below link also. For candidates reference we are providing Google previous papers.

**About google:**

Google Inc. is an American multinational technology company specializing in services and products related to the Internet. These include online advertising technologies, research, cloud computing, and software.Most of its profits are derived from AdWords, an online advertising service that places advertising next to the list of search results. Google was founded by Larry Page and Sergey Brin while they were PhD students at Stanford University.

**Some questions in Google placement papers**

1) Given four matrices

- P = 20×10
- Q = 10×5
- R = 5×10
- S = 10×10

Find minimum no. of multiplication required for PxQxRxS?

- a) 4000
- b) 2500
- c) 3000
- d) None Of These

2) Two n-size arays are given . n1 in decreasing order and n2 in increasing order. If c1 is time complexity for n1 using quicksort and c2 is time complexity for n2 using quicksort. Then –

- a) c1 > c2
- b) c1 < c2
- c) c1 = c2
- d) None of these

3) If there is a N sorted array then what is time complexity of finding 2 no.s having sum less than 1000.

- a) O(1)
- b) O(n^2)
- c) O(n)
- d) O(logn)

4) There are some process . In which of the scheduling algo CPU utilization is minimum. If I/O burst time is 90ms and CPU burst time is 10ms.(question is very long to remember)

5)int func(int x, int *y, int **z)

{

int p, q;

x += 2;

p = *y++;

q = **z++;

q = **z++; //Not a repeated line.

}

void main()

{

int a = 5, *b, **c;

b = &a;

c = &b;

printf(“%d”,a);

}

6) Find the least significant digit of 2^3*google where google=10^100.

- a) 2
- b) 4
- c) 6
- d) 8

7) Let w(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. which of the following is ALWAYS TRUE?

- a) A(n) = Omega(W(n))
- b) A(n) = Theta(W(n))
- c) A(n) = O(W(n))
- d) A(n) = o(W(n))

8) Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight of the edge {i, j}.

0 1 8 1 4

1 0 12 4 9

W = 8 12 0 7 3

1 4 7 0 2

4 9 3 2 0

What is the minimum possible weight of a spanning tree T in this graph such that vertex 0 is a leaf node in the tree T?

- a) 7
- b) 8
- c) 9
- d) 10

9) In the graph given in question 8, what is the minimum possible weight of a path P from vertex 1 to vertex 2 in this graph such that P contains at most 3 edges?

- a) 7
- b) 8
- c) 9
- d) 10

10) A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below.

|0| |

|1| |

|2| 42|

|3| 23|

|4| 34|

|5| 52|

|6| 46|

|7| 33|

|8| |

|9| |

Which one of the following choices gives a possible order in which the key values could have been inserted in the table?

- a) 46, 42, 34, 52, 23, 33
- b) 34, 42, 23, 52, 33, 46
- c) 46, 34, 42, 23, 52, 33
- d) 42, 46, 33, 23, 34, 52

11) How many different insertion sequences of the key values using the same hash function of question 10 and linear probing will result in the hash table shown above?

- a) 10
- b) 20
- c) 30
- d) 40

**Important links of Google placement papers**

**Click here to download Google placement papers 1**

**Click here to download Google placement papers 2**

**Click here to download Google placement papers 3**

**Click here to download Google placement papers 4**

**Click here to download Google placement papers 5**

** **