IndiaBIX.com
Arithmetic Aptitude Data Interpretation
Logical Reasoning Verbal Reasoning Non Verbal Reasoning
General Knowledge
Sudoku Number puzzles Missing letters puzzles Logical puzzles Playing cards puzzles Clock puzzles
C Programming C++ Programming C# Programming Java Programming
Microbiology Biochemistry Biotechnology Biochemical Engineering
Civil Engineering Mechanical Engineering Chemical Engineering Networking Database Questions Computer Science Basic Electronics Digital Electronics Electronic Devices Circuit Simulation Electrical Enigneering Engineering Mechanics Technical Drawing
Placement Papers Group Disucssion HR Interview Technical Interview Body Language
Aptitude Test Verbal Ability Test Verbal Reasoning Test Logical Reasoning Test C Programming Test Java Programming Test Data Interpretation Test General Knowledge Test
Data Structures Operating Systems Networking DATABASE Database Basics SQL Server Basics SQL Server Advanced SQL Server 2008 JAVA Core Java Java Basics Advanced Java UNIX Unix File Management Unix Memory Management Unix Process Managemnt C Interview Questions The C Language Basics .NET Interview Questions .NET Framework ADO.NET ASP.NET Software Testing

Companies

Placement Papers - Caritor

@ : Home > Placement Papers > Caritor > View Paper
CARITOR PAPER - 2004
Rated : +0 , -0

It is believed that they've 25 set of papers. And they distribute different papers in the same examination hall.
         
Total 1 hr          ,40 marks 5 sections, 8          questions each  
         
 1 mark for correct, -.25 for          wrong  
         
1st          section          
         
                   /* This section is          damn ..tough, lengthy and time consuming. It is highly  recommended to leave this          section  or set aside to          last. I am quoting some part of this question so you can easily          identify  this          section..  */
         
                     It is based on recursive function
             M(a,b,c)- L(a) is if u delete 1st element from it             whatever is left.             N(a,b,c)-L(b) is 1st element of the list.             if (a,b) &a r two lists  then M(l1,l2) is ((a,b),a).               X(a,l)=a
                 =L(a)
                 =M(a,l)               y(a,l)=l
                 =L(b)
                 =M(l,a)            
Based on this          they gave 8 questions were there
         
2nd section          
         
                  This          is about arrangement of dominos
                               
6 Dominos are given.  Also a figure created using these is also shown. But the alignment of the dominos in the figure is unknown. The question is to found out the possible alignment of the dominos.



  The          multiple choices some what look like this
           
a)                                                    
                                                                                                                                        3                                                    2                                                                  

Like this?   +0   -0



© 2008-2013 by IndiaBIX™ Technologies. All Rights Reserved | Copyright | Terms of Use & Privacy Policy

Contact us: info@indiabix.com     Follow us on twitter!