Anda di halaman 1dari 4

Mindtree:

Round 1:
1. Storage classes and storage class specifies.
2. how to find whether the given number is power of 2.(normal and optimized)
3. Big Endean and little Endean difference and conversion.
4. Set bits and get bits .
5. Define pointer to an array.
6. Define function pointer.
7. Difference b/w constant pointer and pointer to an constant and define them.
8. Volatile and register variables.
9. Function calling mechanism and variable storage.
10. what is stack pointer and Link register.

Round 2:
1. Regarding all my projects.
2. SMS ,MMS ,Voice mail and Email
3. what is difference b/w user mode and kernel mode.

Ruound3:
Package and notice period,strengths,weakness,company change why mind tree 

Huawei:

Round 1:
Written test total 25 questions
C – 19(some logics and error findings)
OS – 6(mutex, deadlock, select system call,

Round 2:
1. Write Strstr function
2. Replace the searched string with ‘*’ in stsstr.
3. What is difference return type and value type?
4. Where pointer variables are stored.
5. Some basic pointer questions like why memory allocation..?
6. Pass a pointer variable to another function and allocate memory in the
function. Return the value.
7. Double pointer..? What is the use?
8. Difference phases of project explain them.

Round 3:
1. Explain the design of u r latest project.
2. Architecture of wince and rex.
3. What is scheduling? Different types
4. What is scheduling type in wince and rex.
5. Some simple puzzle like below.

1 2 3 4
5 6 7
8 9
10

Reverse the above triangle with minimal steps.


6. write flow diagram of message box(my latest project)
7. algorithms of different sorting techniques and their complexities and
performance( as I used sorting in my latest project)
8. Snake and ladder game algorithm.

Round 4:
1. How to find a Common node in a 2 different linked lists.(general and
optimized way)
2. Write the above same program in a standard way (API) by checking all
conditions and following coding standards).
3. Explain all u r projects one by one.
4. set bits and get bits 
5. strncpy function.
6. IPC and process synchronization. Deadlock,mutex,select system call.

Round 5: Managerial round ( f-----ing round)

1.He asked What ever I know about my self ,about others ,about companies, about
huawei ,about my family, about LG ,NOKIA , Samsung.
2. Problem solving in projects, about quality, management.
3. Different phases of project and explain all of them.
4. Why company change, why huawei.
5. U r strengths, weakness, hobbies
6. about my team and my role and challenges phased.
7. Why electronics? Why less marks in diploma.
Much other stuff.
(It went for 2 hours I don’t know what I said).
Round 6:

Common questions …mostly repeated from above round.


NARENDRA QUESTIONS FACED

************************* GE ****************************
1. Virtual functions what is the use, how fun call resolved, pure virtual functions
2. Overloading types , operator overloading
3. casting types explain
4. Inheritance and access specifier relation
5. Contants and constant functions
6. Class and access specifiers

***********************************************************************
************** SASKEN
************************
1. Pass by value pass by reference
2. Reverse a string
3. How to delete a node at perticular position
4. How to access a variable in another file
5. Tell about proffessional experience
6. Why do you choose sakaen
7. Why you want to change the job apart from work
8. What are oops concepts
***********************************************************************
************** MOTOROLA
*****************************
1. Tell about proffessional experince
2. How to access a variable in another file
3. Difference between string constant and array
4. How to allocate memory to double pointer **p
5. How to find the middle node of single list in one traversal
6. Tell about the projects
7. Tell about the GTK widgets
8. Tell me about custom widgets (I told I know c.w)
9. About sql he just needs whether I know or not
10. *************************************TECH2*********************
11. Deleting middle of a node
12. String revesrs ip=”I am a good boy” op=”bo good a am I” program
13. What is dynamic memory from where this is allocated
14. *************************************TECH3**********************
15. Dangling pointer in main function char *p=malloc free(p) can I access P?
16. Above que ext: fun(p) def void func(char *x){ fee(x) ; x= NULL; can I
access p in main
17. Ext how to do safe free
18. Puzzle 4 people a b c d has to cross river in a boat (2 people can travel) a can take
1 hour b 2 c 5 d 10 min time to completely cross ????17
19. Deleting middle of node in sligle list on one traverse
***********************************************************************
************** L&T
******************************
1. Tell me about your self
2. Tell me about the projects
3. What is Volatile const valatile is valied or not
4. What are ipc’s
5. If I have a 500kb data how to share b/w 2 process (shared memory)
6. Fork and exec and system
7. File system used in Linux (ext3)
8. About D-Bus as I mentioned in the project.
9. About callbacks.
********************************************************************
***************** IBM
************************************
1. Stucture padding
2. How to controll it -#pragma
3. Which prgma #prgma pack
4. Conditimal compilation  #ifdef NARENDRA
5. How you will give to compiler gcc –DNARENDRA
6. How to give myinclude/test.h mylib/test.so in make file  -I./myinclude –L/mlib
–ltest
7. Recusrively reverse a string program
8. Reverse a sigle list in single traverse program
9. Deleting middle of a node
10. How an integer can be tranferred b/w two machines of diff OS.
11. Redirection
12. Fork system call
13. What for retunrs
14. Optimise for fork if in the child process nothing is done
15. File discriptors for stdin stdout stderr  0 1 2
16. 2 power n how you will find

Anda mungkin juga menyukai