Skip to main content

Tcs Interview Itis

By

HR-
  1. tell me something about urself 
  2. final year project + open ignite project..
  3. which language u r comfortable to work on..
  4. abstract classes
  5. questions from portfolio( jo bhra ho uspe ques.. to plz sb portfolio dhang se dek k jana)
  6. constructors, interfaces, concurrency, 
  7. db kon sa use kr lete ho.. 
  8. interests... strengths, weakness.. 
  9. what are u good at 
  10.  how are ur strengths useful..
  11. what ws ur role in open ignite project n wat did ur team mates do..
  12. simple probability ques
Tech-
  1.  tell me something about urself
  2. final year project + open ignite project.. (bt ise toda jada sahi se btana pda ta..)
  3. OOPS concept.. (Very Important)
  4. i have a pen in hand tell describe it in oops
  5. kon kon se subjects pde h ab tk...
  6. prgrms / algo for square root without using inbuilt fn.. reverse a string..
  7. Insertion Sort
  8. inheritance 
  9. again abstract class, final class, polymorphism, aggregation n generalization..
  10. c n java me difference.. acess specifiers.. public private protected.. 
  • ques- we have 3 jars 1 with oranges other with apples n 3rd 1 with both of them.. teeno pe label lga h 1 pe apple 2 pe orange n 3 pe both.. n sare labels glt h.. to kisi 1 jar me se 1 fruit nikal k teeno labels sahi sahi lgane h

  • poochh ra ta maths 12th ki maths yaad h.. hmne kaha NAHI YAAD HAI... 

Comments

Post a Comment

Popular posts from this blog

PROGRAM TO FIND OCTAL OF A NUMBER

By
LIST OF PROGRAMS #include<stdio.h> #include<conio.h> void main() { long int n,oct=0,r=1,pow=1;  clrscr(); printf("Enter a number "); scanf("%ld",&n); if(n<0) printf("WRONG INPUT"); else {  if(n<=7&&n>=0)  oct =n;  else  {  while(n>0)  { r=n%8; oct=oct+(r*pow); n=n/8; pow=pow*10;  }  }  printf("OCTAL = %ld",oct);  getch(); } } LIST OF PROGRAMS
2 comments
Read more

PROGRAM TO PERFORM BINARY SEARCH USING RECURSION

By
LIST OF PROGRAMS #include<stdio.h> #include<conio.h> int binary(int ,int ); int a[10],md,s,c=0; void main() { int n,i; clrscr(); printf("ENTER LIMIT \n"); scanf("%d",&n); printf("ENTER ARRAY\n"); for(i=0;i<n;i++) { fflush(stdin); scanf("%d",&a[i]); } printf("ENTER NUMBER TO BE SEARCHED"); scanf("%d",&s); c=binary(0,n-1); if(c==-1) printf("NOT FOUND"); getch(); } int binary(int f,int l) {  md=(f+l)/2; if(f>l) { return(-1); } else if (a[md]<s) return(binary(md+1,l)); else if(a[md]==s) {printf("Found AT LOCATION %d IN WHICH 0 IS THE STARTING ADDRESS",md); return (1); } else return(binary(f,md-1)); } LIST OF PROGRAMS
2 comments
Read more