NCR

NCR PAPER ON 26th DECEMBER AT MUMBAI

It Consist of 2 round first is Aptitude & final round is Tech + HR round. There different panels for HR interview. Aptitude test having 2 sections first one is general maths & second one is a technical question based on database & C ques. Technical part is very easy. I suggest you first solve technical part.
Test Consists of 60 questions in 1 hr. there is no sectional cut off. But overall cut off is 25 I got 38.

Sec- 1) 40 ques on MATHS
Sec -2 ) 20 ques on C & Database

1) Data Interpretation, Train, boat, time & work, Interest & simple series problems.
2) Technical questions is- what is pointer, find out simple output, some database query. All questions are very easy. I give u answer all of these questions.

For Maths section Answer is as -
2) A 3) A 6) C 15) A 16) A
17) A 18) A 19) B 20) C 21) A
35) D 36) A 37) C 38) D 39) A

For technical section Answer is as -
41) D 42) A 43) B 44) A 45) B
46) A 47) A 48) C 49) B,D 50) D
51) A 52) A 53) B 54) D 55) C
56) C 57) B 58) B 59) C

That’s all. So Tech & Hr interview is very easy. They asked me normal questions.
What is functions, OOPS concepts, diff. between FOXPRO & ORACLE. Ans is FoxPro is DBMS & Oracle is RDBMS.
What is XML, diff. between primary key & Unique key. & HR questions is Tel me about urself, ur weakness..



NCR PAPER ON 22nd DECEMBER

NCR has changed its pattern to a general aptitude test it was containing 40 questions in total containing the general aptitude questions (very easy R.S. Aggarwal is sufficient for that) but the main thing in the test was G.K. question like
1)who dropped his B.tech. in 1966 but completed it in 2000
2) the pearl city of world (candy:sri lanka)
3) to whom president gives his resignation letter( chief justice of india) some questions on the baselines of companies..

what is the fullform of LG and the test was also containing some english comprehension passages (very very easy) and some analogy questions were also there.



NCR CORP PAPER - 22 APR 2006 - HYDERABAD

Four Sections.

1.RDBMS/SQL Concepts. (5 Marks)
2.C and Data Structures. (5 Marks)
3.Programming. (10 Marks)
4.Operating Systems. (5 Marks)
Each section contains five bits.Except Programming.

1.Operating Systems. (5 Marks)

1.Using UNIX Shell Commands,how you will count the number of lines in ASCII
2.What is sticky bit in UNIX.
3.Difference between process and deamon.
4.Why thread is light-weight
5.What is Monitor.

2.C and Data Sructures (5 Marks)

1.program given n asked to write the type of error.
2.write tha c code in one statement for given "N" number is ODD/EVEN
3.what are linked list.
4.Question on binary search tree.(dnt remember)
5.one function was given n asked to explain that function.

3.RDBMS/SQL(5 Marks)(Dont Remember exact questions)

1.If two tables are given.
Department(Dept_id,dept_name)
employee(emp_id,emp_name,emp_sal)
write the query for all departments id and the sum of all
employee sal should be greater than 500.
2.select "true" from dual where 1="NULL";
will this dual statement will return NULL if not rewrite the statement.
3.Two tables were given and query was given on "left outer joins" and asked to write the output.
4.Query on subquery/nested query was given to select the correct o/p( 4 multiple choices were given).
5. difference between PK column and unique column.

4.Programming (10 Marks)

Write a c program
take two strings "str1" and "str2" and find the end letters of the first string
return true if found.


The pattern for the company NCR Teradata in HYD.

The exam was of 1:45 and consisted of -

C,C++, Data Structures
total 4(5 Marks)...

Note that the code or the values may not be correct.... Just get the concept.

Predict the o/p... each 1 mark

1.
static int i;
{
i=10;
...
}
printf("%d",i);
Ans: 10

2.
#define func1(a) #a
#define func2(a,b,c) a##b##c
printf("%s",func1(func2(a,b,c)))
Ans: func2(a,b,c)

3.
const int* ptr;
int* ptr1;
int a=10;
const int p=20;
ptr=a;
ptr1=p;

4.
class a
virtual disp()
{ printf("In a");}
class b:public a
disp()
{ printf("In b");}
class c:public a
disp()
{ printf("In c");}
main()
{
a obj;
b objb;
c objc;
a=objb;
a.disp();
a=objc;
a.disp();
Ans: "In a" "In a"

5.
a="str";
char *b="new str";
char *temp;
malloc(sizeof(temp)+1,....
strcpy(a,temp);
malloc(sizeof(b)+1,....
strcpy(temp,b);

6.
int m,i=1,j=0,k=-1;
m=k++||j++&&i++;
printf("%d...",m,i,j,k);

7.
class x
{
double b;
double *l;
float &c;
}
main()
{
double g=10.34;
double *f=1.3;
float k=9;
x o;
o.b=g;
o.l=f;
o.c=k;
}

Ans: Compiler Error

For all the probs, u will have decide on wht DS to use.... and u'r program must be efficient...explain in detail... (5 Marks)

1. Find the Kth smallest element in a Binary Tree. (5 Marks)

2. Each worker does a job and is given a rating +ve,-ve or Zero.
Find the MaxSubSequenceSum for given no. of workers.
Ex: Workers=6; Ratings={1,0,-1,4,5,-3}
MaxSubSequenceSum=4+5=9 (5 Marks)

3. 1 to N ppl sitting in a circle. Each one passes a hot potato to the next person. After M passes the person holding the potato is eliminated. The last person remaining is winner. Find winner for given N,M.
Ex: N=5, M=2, Winner=4 (5 Marks)

4. Reverse a given Linked List. (5 Marks)

5. There is a file called KnowledgeBase.txt which contains some words. Given a sub-string u have to find all the words which match the word in the file.
Ex: file contains a, ant, and, dog, pen.
If I give "an" I should get o/p as "ant, and" (10 Marks)

6. Company employee have id,level,no. of sub-ordinates under him...
If a emp leaves then his sub-ordinates are assigned to any of the emp's seniors...
Write four functions:

ConstructEmployee
JoinEmp
LeaveEmp
TransferEmp