• Placement Questions

Placement Papers with Solutions

(#M40032118) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
The array A has n elements. We want to determine the position of X in the array. We know that X is present in the array A and X can be present at any location in the array with equal probability. How many comparisons will be required on average to find the element X using linear search?
Option
a) n
b) (n+1)/2
c) 2*n
d) n^2

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (8)

Is this Puzzle helpful?   (3)   (1) Submit Your Solution Technical

(#M40032117) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
Srishti writes a program to find an element in the array A[5] with the following elements in order: 8 30 40 45 70. She runs the program to find a number X. X is found in the first iteration of binary search. What is the value of X?
Option
a) 40
b) 8
c) 70
d) 30

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (10)

Is this Puzzle helpful?   (60)   (28) Submit Your Solution Technical

(#M40032116) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
An array of 5 numbers has the following entries in order: 7 4 5 10 8. Prashant uses selection sort to sort this array in

descending order. What will the array contain after two iterations of selection sort?

Option 1 : 10 8 7 5 4
Option 2 : 10 8 5 7 4
Option 3 : 8 10 5 7 4
Option 4 : None of these

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (12)

Is this Puzzle helpful?   (11)   (1) Submit Your Solution Technical

(#M40032115) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
An array contains the following elements in order: 7 6 12 30 18. Insertion sort is used to sort the array in ascending

order. How many times will an insertion be made?

Option 1 : 2
Option 2 : 3
Option 3 : 4
Option 4 : 5

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (13)   (4) Submit Your Solution Technical

(#M40032114) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
A full binary tree with n leaves contains

Option 1 : 2n + 1 nodes
Option 2 : log2 n nodes
Option 3 : 2n - 1 nodes
Option 4 : 2n nodes

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (26)

Is this Puzzle helpful?   (45)   (15) Submit Your Solution Database

(#M40032113) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
A hash table can store a maximum of 10 records. Currently there are records in locations 1, 3, 4, 7, 8, 9, 10. The

probability of a new record going into location 2, with a hash function resolving collisions by linear probing is

Option 1 : 0.6
Option 2 : 0.1
Option 3 : 0.2
Option 4 : 0.5

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (16)

Is this Puzzle helpful?   (16)   (9) Submit Your Solution Definition

(#M40032112) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper

order, at the end of each day. The ideal choice will be

Option 1 : bubble sort
Option 2 : insertion sort
Option 3 : selection sort
Option 4 : heap sort

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (13)

Is this Puzzle helpful?   (7)   (3) Submit Your Solution Technical

(#M40032111) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
The best sorting methods if number of swapping done is the only measure of efficiency is

Option 1 : Bubble sort
Option 2 : Selection sort
Option 3 : Insertion sort
Option 4 : Quick sort

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (25)

Is this Puzzle helpful?   (12)   (8) Submit Your Solution Technical

(#M40032110) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
Number of possible ordered trees with 3 nodes A, B, C is

Option 1 : 16
Option 2 : 12
Option 3 : 13
Option 4 : 14

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (17)

Is this Puzzle helpful?   (17)   (7) Submit Your Solution Technical

(#M40032109) AMCAT QUESTION Keep an EYE

Que: Choose the correct answer
Which of the following data structure may give overflow error, even though the current number of element in it is less

than its size ?

Option 1 : Queue implemented in a linear array
Option 2 : Queue implemented in a circularly connected array
Option 3 : Stack implemented in a linear array
Option 4 : none of these

Asked In AMCAT Aashu (11 years ago)

Unsolved Read Solution (5)

Is this Puzzle helpful?   (25)   (4) Submit Your Solution Technical