|
the implementation part of it.So one must have a
general idea about the project done.
Interview is mainly based on Data Structures.Some
questions are as follows:-
- What is a tree,its application,order for
insertion,deletion and traversal with worst case
analysis.
- What is a graph,its application.
- Height of a tree
- Balanced tree and how to balance a tree
- Minimum Spanning Tree
- Dijikstra's, Prim algorithms
- Define a structure for a linked list.
- Binary search and its analysis
- Heap sort and its analysis
- What is a heap and its application
- Cache and its working
- Memory(IO mapped)
- Recursive fns and types, its adv and disadv.
- Compiler(grammar)
*****C debugging questions like
(1)What is the problem with the following code
int * f(int a)
{
int i;
i=a;
return(&i);
}
Ans-> We can't return address of auto variable as it
is allocation is made in stack which is deallocated
when the function returns.
(2)
a.h b.c c.c d.c
int i=0 #include"a.h" #include"a.h" extern int
i;void main{.....}
| | |
b.o c.o d.o
Compilation Phase
Linked to get exe.
|
|
