Answer Posted / glibwaresoftsolutions

A linear data structure that executes operations in Last In First Out (LIFO) order is referred to as a stack.
Only the topmost element in a stack can be accessed, followed by the bottom element.

How are structure passing and returning implemented?

1043

---

What is volatile variable how do you declare it?

1104

---

What is the correct declaration of main?

1215

---

please send me the code for multiplying sparse matrix using c

2182

---

What is the basic structure of c?

1086

---

What is switch in c?

1112

---

WHICH TYPE OF JOBS WE GET BY WRITING GROUPS .WHEN THE EXAMS CONDUCTED IS THIS EXAMS ARE CONDUCTED EVERY YEAR OR NOT.PLS TELL ME THE ANSWER

1868

---

can anyone please tell about the nested interrupts?

2125

---

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 }

3191

---

What is the use of pragma in embedded c?

1063

---

What is a volatile keyword in c?

1165

---

What is structure of c program?

1168

---

How is actual parameter different from the formal parameter?

1026

---

What should malloc() do? Return a null pointer or a pointer to 0 bytes?

1081

---

What is preprocessor with example?

1068

---