Answer Posted / saroja patil

Array is simple program structure collection of homogeneous
data elements which are stored the elements are same data
same type and same size.

What are the 3 types of structures?

1063

---

What is double pointer?

1041

---

Given only putchar (no sprintf, itoa, etc.) write a routine putlong that prints out an unsigned long in decimal. [ I gave the obvious solution of taking % 10 and / 10, which gives us the decimal value in reverse order. This requires an array since we need to print it out in the correct order. The interviewer wasn't too pleased and asked me to give a solution which didn't need the array ].

1138

---

Write a program to implement queue.

1169

---

What is enumerated data type in c?

1126

---

Explain how do you use a pointer to a function?

1154

---

What are the different types of linkage exist in c?

1074

---

Do you know the purpose of 'register' keyword?

1068

---

What happens if you free a pointer twice?

1134

---

You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

3237

---

Can the “if” function be used in comparing strings?

1107

---

What is the condition that is applied with ?: Operator?

1182

---

What is the use of in c?

1085

---

What is a dynamic array in c?

1219

---

What is pre-emptive data structure and explain it with example?

3788

---