amdocs placement paper

Aptitude Test:

The aptitude test is generally of duration of two hours. The number of questions in the test is 95. There are two sections- General Aptitude Test and Technical Test. Sectional cut-off for both of these sections is 60%. The topics for the general aptitude test are Arithmetic Ability, Verbal Reasoning and Attention to Detail. Questions are from Puzzles, Data Sufficiency, Venn Diagrams, Blood Relations, Profit and Loss, Ratio, Percentage etc.

The topics for the technical test are UNIX, SQL and any programming language from C, C++ and Java. All the three sections are of 15 minutes. The UNIX and SQL sections consist of 15 questions each while the language section has 20 minutes. The language section consists of “find the error type questions”. UNIX section consists of questions based on UNIX commands generally.

Those who clear the written test are called for the interviews.



Read more here: http://entrance-exam.net/amdocs-placement-papers/#ixzz0BHCHT5b7










1.    All fat people are not dancers, food loving people are all fat .Find the contradictory statement?
2.    The day before yesterday was WEDNESDAY then the day after 2morrow is?
3.     A goes to the party if B goes
         B goes to the party if C goes
         C goes to the party if D goes                                                              
         Totally how many will go to the party?
4.   Mary's father's brother is Andrews Andrews daughter's son is Sunil Brothers name is Sam Who is Sam to Sunil?
5.   If A>B,A<C,B>D,B<DFind the Shortest?
6.   There are A,B techers and C,D doctors.Find the possible no of  combinations that should not be repeated more than once?
7. There are 3 males and 2 females,find the possible no of orders that can be made by making the arrangement as in between two males one women is allowed to sit?
8.  Computer checking:eeeDD
     1.eeggg 2.eeeDD3.eerrt,4.DDeee  The write answer is 2)eeeDD
9.  The syntax of command statement in UNIX
10. If the permission for a file is 000,then the file can be accessed  by whom?
11.  Where we can run two same programs on a UNIX console at the same time?
12.  Which is the Shell of UNIX?
13. Wat is the number of the masked code ee@?
14. We are UPDATING a field in SQL and ALTER the row also.After giving  the COMMIT command the system is crashed.Wat will happen to the commands given,whether it will UPDATE and ALTER the table r not?
15.  If we r terminated at the middle of the program execution in UNIX,wat will happen to the program,it will continue running r terminate r the o/p will be send to ur mail?
16. How will add additional conditions in SQL?
17. How will u print TATA alone from TATA POWER using string copy and  concate commands in C?
18.   If switch(n)
      case 1:printf("CASE !");
     case(2):printf("default")                                                                            
     break;
     What will be printed?
19. How will u divide two numbers in a MACRO?

20.  int a,b;
      1.main()
      2.{
     3.scanf("............",&a,&b);
     4.if...........{
     5.printf("Print A");
     6.else
     7.Printf("...........");
    8.endif}
    9..........
   A.Wat will come in the 9 dash?
   B.Wat will happen if we replace Print A as Print X?
   C.Wat will come in the 3 dash?                                                                              
   D.Wat will happen if we interchange 4 and 7?
   E.Wat will come in the 4 dash?











sample:
FGH
``
ABC=> + => => =>BAA
FG
RRQP
Then:
TUV=> => => =>?
VUT
SECTION:2
36qs,20 min
similar type of qs only boxes of different colours are chosen
SECTION:4
60qs
this is the easiest section
MATCHMAKING:
60 question in 7 minutes.
u can attemp all as question is very easy
1:AM%:$69
match with
a: BM%:$69
b: AM%:$69->correct
c: AM%:69
d: AM%:$59
section:6
technical test.
this is very easy test. you will get enough time.
A language made up of c and pascal is given
And 30 qs follow.25 carry marks and 5 are bonus i.e. if two people
get the same marks one getting more bonuses right will be in
a advantageous
position. If u have learned c well don't waste much time reading
the language as it is like c. go back to it when answering qs. Try
to get as many correctly as possible.
30 qs, 90 min
***********
a program is given and u have to find count
ans of first question is 3 and next question ans is 0(believe me).
1:input string 1011011100010
a long program is given and u'll have to find out the a count
answer given here is =3.
2:the string is changed to 10101010101010 and u'll have to
find the count again.
ans-0
3: if not C1 AND NOT C2 AND NOT C3 =?
answer given here is =if not(c1or c2 or c3).
4:given a program on input string what will be printed
answer given here is =GOOD GOLD
5: answer given here is =CANNY
7:similar qs
answer given here is =HELLO
****a program of binary search is given
ans
1-mean=(top+botton)/2
2=mean
3 top=min+1
4-bottom=mean-1
*********
8:A PROGRAM on fibonacci series u'll have to find out the
changes to be made.
** in this quwstion
in a line given
b=c;
a=b;
this is incorrect
it should be
a=b;
b=c;
and
in next question intialise sum=2;
*************
a program to cheque a palindrom(1253521)
it is very easy,
ans-
1 temp=n
2 temp >0
3 mod(temp,10)
4 temp/10
plz verify the ans also
****************
Section :3
This is a tough section and there r some coloured lights
and they r on or off.
It is similar to first and second sections. don't panic u'll get
enough time to grasp these in the example time given.
See u.
note-there is no psychometric test
BEST OF LUCK
SECTION -I : PROGRAMMING SKILLS TEST (30 QUESTIONS)
(25 COMPULSORY + 5 OPTIONAL Q'S)
TIME: 90 MINUTES.
SECTION - II: LETTER REASONING. (36 QUESTIONS)
TIME:30 MINUTES
SECTION -III: DIAGRAMATIC REASONING TEST (36 QUESTIONS)
TIME : 20 MINUTES.
SECTION- IV: FAULT FINDING TEST (36 QUESTIONS)
TIME: 20 MINUTES.
SECTION -V : COMPUTER CHECKING TEST (60 QUESTIONS)
TIME: 7 MINUTES.
SECTION -VI: PSYCHOLOGY TEST (136 QUESTIONS)
TIME : 15 - 20 MINUTES.
1) PROGRAMMING TEST:
program- One to find whether no. is perfect or not.
eg. 28 = 1+2+4+7+14 (sum of factors excluding no.)
ans-
**************
for i=2 to n/2 step 1
if mod(n ,i)=0
then sum=sum+i
endif
endfor
if sum<>n
then return 0(not perfect)
else
return 1(perfect)
*****************
EXAMPLE:
The following program reads 100 integers and displays the
no. of appearances of Even and Odd nos. resp.
MAIN()
INTEGER in,odds=0,evens = 0,i
FOR i = ???????
READ in
IF ????? = 0
evens = evens + 1
else
odds = odds + 1
ENDIF
ENDFOR
PRINT evens,odds
ENDMAIN
A) What does the ??????in line 3 represent?
i) i = 1 TO 100 STEP 1
ii) i = 1 TO 100 STEP 2 Correct ans: (i)
iii) i = 1 TO 100
iv) None of these
B) What does the ????? in line 5 represent?
i) in/2
ii) MOD(in,10)
iii) MOD(in,2) Correct ans ; (iii)
iv) in
THESE ARE THE TYPE OF TEST QUESTIONS YOU WILL ENCOUNTER.
3) DIAGRAMMATIC REASONING :
This section aims at finding the resultant figure
obtained after passing
Through some special symbols (2 in no.)
Process box: When figure is input to this box the
corresponding size.shape
And color attribute changes according to marked X .
Check Box: it compares the input figure with the comparison
Figure .comparison is done of the attribute marked by ?
In the symbol.