TCS  Placement Paper   Whole Testpaper   College Of Engineering And Technology, Bhubaneswar-27 Mar 2007

TCS  Placement Paper   Whole Testpaper   College Of Engineering And Technology, Bhubaneswar-27 Mar 2007


  • Posted by  FreshersWorld 
    7 Jan, 2012

     

    TCS PAPER ON 27th MARCH AT BHUBANESWAR

    Hello everyone! I am Abinash and I got thru TCS in an on campus where they recruited 140 students I am from Electrical Branch.

    WRITTEN TEST
    English:    All Questions are new just a few old ones.Synonyms and Antonyms really test your vocabulary.(No negative marks, so don't leave anything). A fill in the blanks passage which needs just carefull reading and is really the jackpot in this section(7 marks here). Most students didn't attempt  just  because of  fear due to length of passage and prejudice.Don't get carried away by length.

    The reading comprehension was damn too long.If you have time attempt, else leave. there are only 5-6 questions. The same paragraph is repeated 5 times and 1 question follows it each time.

    Aptitude:  Nothing different from the previous questions listed here.The few new ones were damn easy
    Reasoning: Just mug up GRE BARON's 12th edition. Questions are copied directly.Here too to create confusion same paragraph is repeated 5

    times and 1 question follows it each time.

    N.B.: 1) There are no sectional cut-off.
    2) Don't talk till the invigilators leave the room.Even after U submit your answer sheets,they can scratch Ur paper if U talk, as happened with
    one of my friends.
    After getting thru Written Test they will give a BLUE FORM  to fill up. It contains all details.Fill it in Capitals.
     
    TECHNICAL  INTERVIEW 
    Irrespective of branch they ask questions from C, C++, Data Structure, RDBMS, puzzles (Don't say no to any, rather say I know the concepts and I can Try.) They may ask very fundamental questions from Ur branch. They didn't ask me any. 
    In the interview there was only one person. He asked me only C and DS
     
    1) Write the output of  :
    a)for ( i=0 ; i<10 ; i++ ) ;
               printf ( "HELLO" );        Ans : HELLO is printed just once

    b) i =10;

             if ( i = 5)
                  printf ( "hi" ) ;
             else
                  printf ( "bye" )  Ans : hi . here 5 is assigned to i in the if statement which returns 5 and thus if statement is executed
     
    2) WAP to check if a no. is of the form 2m  do using bitwise shift operator
    3) What are MACROS?
    4)WAP to declare a function in a MACRO and pass arguments?  Read "Let Us C " Asked me regarding the slash at end of each line in the MACRO. Asked  me where I read this concept.
    5)What is a linklist?
    6)Create a node of a linklist ?     Use malloc to create node inside main( ).
    7)What is Self Referential Structure? If a member of a Structure points to itself, the Structure is called Self Referential Structure. eg node of a linklist
    8)Can a structure variable be member of the same structure? No. Else member after member will continue to be created which will not terminate and thus error.
    9)How many ways can a tree be Traversed?
    10)WAP for each traversal?                            
    pre( struct node *ptr)                                                   
     {
     if ( ptr = =NULL )
     return;
    else
     {
    printf ( "%d", ptr-> data );
    pre( ptr ->left );
    pre( ptr ->right);
    }
    }
     
    post( struct node *ptr)                                                   
    {
    if ( ptr = =NULL )
    return;
    else
    {
    post( ptr ->left );
    post( ptr ->right);
    printf ( "%d", ptr-> data );
    }
     }
     
    in( struct node *ptr)                                                   
    {
    if ( ptr = =NULl)
    return;
        else
    {
    in( ptr ->left );
    printf ( "%d", ptr-> data );
     in( ptr ->right);
    }
    }
     
    11)How can you calculate many nodes are present in a tree ? Use a counter in any traversal program and increment it at each print statement
    12) How to delete nodes of a tree?  Using postorder traversal , we can delete as in post... we reach root at the last.We have to delete child first.
     
    A very good round....Beyond my wildest dreams......Answered each and every Question....
     
    HR INTERVIEW   
    Just some common formal questions. If Ur tech has been smooth,don't worry u will get thru.
    Best Of Luck!!!!!!!!!!!!!!
     

2009-2016 downloadmela.com. All rights reserved.