Software Companies Placement Papers With Answers- -Free Download
It consisted of 5 sections:-
Total time given was 1 hr and 30 minutes. There was no negative
1.) Aptitude:- (10 questions) 1 mark each question.
- Geometry-Questions related to circle and triangle (Little Bit tough).
- Pipes and Cisterns
- Time and Work,Time Speed and Distance
2.) Logical reasoning:- (10 questions).1 mark each question
-Blood Relation- 4 to 5 questions.
-Coding & decoding
3.) Verbal:- (11 questions).Essay-10 marks & 1 marks questions.
- An essay of not more than 300 words had to be written and it carried
-Future of Nokia.
-Competitive exams in india.
-Potholes of India
-Aam Aadmi Party
and many mores....
1 marks question:-
- Identify error in sentence.3 to 4 questions
- Jumbled sentences.-4 to 5 questions
- Synonyms and Antonyms.1 to 2 questions
4.) Technical:-(10 questions).1 marks questions.
-Very basic and simple questions from c and dbms.
-Error Detection in Programs.
5.) Coding Section :- 1 question of 20 marks.(Real Time Programming)
Some Programs asked by me and my frnds :-
In Mathematics each number has one special number, which it supports,
chosen as follows. It counts the number of ones in its own binary
representation, and adds this count to itself to obtain the value of
the number it supports. That is, if j(m) means the number of ones in
the binary representation of m, then m supports m+j(m). For example,
the number eight (1000 in binary) supports nine, whereas nine supports
However, in this way not all the numbers get supported; some are left
without support, and we call these numbers bleak. For example since one
supports two, two supports three and three supports five, there is no
number less than four, which would support four, so four is bleak.
Your task is for a given number recognize if it is bleak or supported
by some number.
First integer containing the number of test cases, followed by the
number to be checked.
For every checked number n write one line containing the word BLEAK if
n is bleak or the word SUPPORTED if given n there exists m such that
n=m+j(m). In case of wrong input print -999.
Source: Contents are provided by Technicalsymposium Google Group Members.
Disclaimer: All the above contents are provided by technicalsymposium.com Google Group members.
Further, this content is not intended to be used for commercial purpose. Technicalsymposium.com is not liable/responsible for any copyright issues.