# Placement Papers - Aricent

## Why Aricent Placement Papers?

Learn and practice the placement papers of Aricent and find out how much you score before you appear for your next interview and written test.

## Where can I get Aricent Placement Papers with Answers?

IndiaBIX provides you lots of fully solved Aricent Placement Papers with answers. You can easily solve all kind of placement test papers by practicing the exercises given below.

## How to solve Aricent Placement Papers?

You can easily solve all kind of questions by practicing the following exercises.

### Aricent Placement Paper 4th Sep 2008 at Orissa (Pattern & Interview)

Posted By : Saparna Rating : +19, -1

Paper: Aricent Placement Paper 4th Sep 2008 at Orissa (Pattern & Interview)

Hi friends ,I am GURU from university college of Engineering,burla,orissa .ARICENT came to our college on 4th sep 2008 It had 4 stages in selection procedure.

1.written test
2.critical incident form filling
3.GI(group interview)
4.tech interview+critical incident interview

1.WRITTEN TEST
This time the pattern was different .This test was consisting of 4 sections .each paper will b given 1 after another there was sectional cut-off. so b careful.
1st was Analytical ability test including puzzle test+ statement- assumption+ logical reasoning+ statement- conclusions+ figure  series etc. puzzle section was quite difficult n time taking n others easy. 30 ques were there.

2nd section was Aptitude test having 20 ques. which was very very easy. i managed to do them within 10 minutes.

3rd was Data structure which had 20 ques regarding time complexity of sorting algorithm like quick sort , merge sort also time complexity if an array consists of some particular no of elements through binary search(O(log2 n=? if n=10).and ques from linked list, tree( which tree is used in binary sorting). This DS section was very very easy i took only 5 minutes to do all d ques. so friends read DS very carefully , that ll help u both in written test as well as in interview.

In 4th test one has 2 opt for c or c++ or java as u strong accordingly.i chose c .there ll be 30 ques. so practising test your c skill by kanetkar ll help u a lot. One thing keep in mind that there is sectional cut-off n a good marks obtained in this round will help u much more in the selection procedure.21 out of 120 qualified for the next round. fortunately i was one of them. after the written test , all the remaining stages are open to the selected candidates.

2.CRITICAL INCIDENT FORM FILLING
After written test , we had PPT. then all candidates selected through written test were given a form  having around 7 critical situation based ques and u have to answer all the ques within 30 mins. like:----------
1.give a recent experience where u had some proposal but u r enforced to change ur opinion while working in  a team
2.give your one recent situation while working in a team dat u have managed to do some tasks at a time
3.while working in a group , how did u manage yourself to accomplish a task where u have no preliminary idea about that .
4. how did u make ur team members understand a task, while they had no knowledge ................etc.

3.GROUP INTERVIEW(GI)
Here i had 12 members in my group and as i said this is not an elimination round. our topic was :"PACKAGED FOOD IS A GOOD IDEA "(as compared to the mid-day meals or hot meals delivered to school going children)
We were divided in to two groups . don't b worried u ll b given a sheet having some facts about d topic n u have 2 present your own views n not to oppose or to support others

4.TECH-INTERVIEW + CRITICAL-INTERVIEW (TI+CI)
Here u ll b asked about some technical ques as well as from critical incident form u filled up. There were 4 panels and i was d first to b interviewed in panel no.-1. my interview was @6.30pm n like this.
1.introduce yourself briefly
2.what are storage classes used in c n their advantages , disadvantages n their uses
3.do u know fibonacci series n implement it 1.using main() as recursive 2.using user defined recursive function with parameter passing 3.without parameter passing (he just wanted to know whether you have sound programming skill or not)
4.different stages of c programming
5.function used for dynamic memory allocation n their differences
6.what is data structure n ADT (abstact data type)
7.given an expression n told 2 draw d tree. then 2 find out post-order n pre-order n explanation
8.implementing doubly linked list and adding n deleting nodes at some given positions
9.difference between c n c++
11.about new n delete operator in comparison with malloc(), calloc() and free() functions
12.why malloc() function isn't used in c++ . instead we r using new operator
13.difference between structure and class in c++
14.difference between DBMS n RDBMS (told abt E.M.CODD'S 12 rules n key concept)
15.abt INF and 2NF
16.some simple queries
17.abt page replacement algorithm
18.what is page fault n thrashing
19.what is synchronization n different tools
20.how to implement semaphor n monitor
21.what is deadlock n different mechanism to avoid it
22.which c/c++ complier u r using and it's effect on size of data types. what do u mean by a 32-bits os
23.what is computer network n distinguish from distributed system
24.what is an IP, it's function n d layer on which it is used
25.diffeent version of IP addresses n explain IPV4 in details with classes
26.abt OSI n TCP/IP network model
27.application of queue n stack
28.abt router,bridge ,switch ..............................................etc.
29.1-2 situation based ques
30.What is endianness. how can u know your computer is either little or big one. write a code to find it.
31.where extern n static variables are stored.
32.write program for binary search and derive its time complexity.
33.what is constructor and why it is mainly used.
34.what is binary search tree and it's uses
35.hav u any ques to me

Definitely it was too long .My interview took around 1.30 hrs n almost technical. he was very cool, helping in nature n gave some hints when not finding any idea.8 out of 21 got selected ........THAT DAY WAS FOR ME AND LUCKILY I WAS ONE OF THEM .....So my dear friends b cool, confident n do not try to bluff them .if u rn't finding any point , simply tell i don't know or i m not getting any  point. so have faith on yourself n god .WHEN UR DAY WILL COME , NO ONE CAN STOP U, EVEN NOT U. BUT KEEP IN MIND THAT  HARD WORK ALWAYS PAYS , BCOZ GOOD LUCK COMES TO IT

For technical, have depth concept on c, data structure , os , n/w and some fundamental concept on c++ , dbms and microprocessor .i was from computer science . for electronics student depth concept about DEC, MP & MC n N/W is essential.