Subjective Question 3:
Memory not allocated to char *.
Interview Questions:
1] As you mentioned, can be done in log n. Modified Binary Search.
2] You calculate n factorial once and store it in PROD. O(n)
You loop through 1 to n-1, divide PROD by a[i] and multiply it be (a[i]+1).
Check and set fo
written 25 question 45 min
Data structures and algoosss need to be strong
heap
bst
sorted and unsorted array
paging concept frm OS
deadlocks
trashing
subjective test
1. find the output of
main()
{
int tmp;
for(i=0;i<9;i++)
{
tmp=fork();
if
