In the worst case the number of comparisons needed to search a singly linked list of length n for a

Capgemini Question Papers: Capgemini Interview Experience(7) CAPGEMINI Company Profile

Capgemini Select Another Category Database Select Another Topic

Company

Capgemini Question Topics

Category (1)

General Ability (14)

General Knowledge(14)

HR Interview (3)

Interview(3)

Logical Reasoning (84)

Numerical Ability (385)

Programming (15)

Verbal Ability (21)

Advertisements

Previous Question: The average weight of 30 Students is 25. If the Heaviest and Lightest are excluded the average weight reduces by 2. If only the Heaviest is excluded then also the average reduces by 2. What is the weight of the Lightest? A)20 B)32 C)23 D)42 E)None of these Next Question: A is fourteenth from the left end and B is tenth from the right end. If there are 3 boys between them and B is to the left of A then the total number of a students in the row. A)21 B)27 C)22 D)26 E)None of these

(#M40166962) CAPGEMINI Programming question Keep an EYE

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
a) log 2 n b) n/2 c) log 2 n 1 d) n: Asked In Capgemini Devendra Marghade (3 years ago); Unsolved Read Solution (1); Is this Puzzle helpful? (1) (1) Submit Your Solution Database

Dimple

India

Punjab

Time: 00:01:33

Points

Maths Quotes

Common sense is the collection of prejudices acquired by age eighteen.

Albert Einstein

Creative mathematicians now, as in the past, are inspired by the art of mathematics rather than by any prospect of ultimate usefulness.

Eric Temple Bell

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 3 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 4 years ago

Latest Capgemini Aptitude Question SOLUTION: In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is a) log 2 n b) n/2 c) log 2 n 1 d) n