Documente Academic
Documente Profesional
Documente Cultură
e internal
implementation of malloc and free.(i.e map ,unmap )
2.free(NULL)...?
3.shared memmory vs malloc...?
4.How to find out memory leak using code ...?
5.Switch case vs if ...? which is faster ...?
6.Internal implementation of switch ...?
7.i++ vs ++i...which is faster ?
8.WAP to get o/p as A4B3C2D1 and where i/p is AAAABBBCCD.
9.Reverse the string with o(n/2) time complexity ..?
10.find middle of link-list
12.find nth element fro END of link list
13.when free() fails...?
14.what if we increment function pointer ...?
15.find
arr[]={1,1,2,2,11,11,11,2,2,2,2,1,1,1,1,4,4,4,11,11,11,11,11,11,11,11,2,2,2,}
find max consecative sequence and place same no after that
i.e max consecative sequence is of no 11 so place 11 before 2,2,2
so final output
arr[]={1,1,2,2,11,11,11,2,2,2,2,1,1,1,1,4,4,4,11,11,11,11,11,11,11,11,
[*11*],2,2,2,}
suppose 1st we accesing var a and we store 100 in 4 bytpe of data next time we
acces char which is 1byte so what is present in remaining 3 bytes...?
22. how to acces buttfer allocted in one thread(using malloc) in another
thread ...?
23.Create 5x4 Matrix using 1D array ..?
24.How to create new (our own ) environment variable in Linux ...?
25.int *ptr = 0x0100...will give any compilation error or warning .?