Answer Posted / naresh lingampally

Stack is a data structure ,a last in, first out (LIFO)
abstract data type.
A stack can have any abstract data type as an element, but
is characterized by only two fundamental operations: push
and pop. The push operation adds to the top of the list,
hiding any items already on the stack, or initializing the
stack if it is empty. The pop operation removes an item from
the top of the list, and returns this value to the caller. A
pop either reveals previously concealed items, or results in
an empty list.

What is the difference between mpi and openmp?

1221

---

1.int a=10; 2.int b=20; 3. //write here 4.b=30; Write code at line 3 so that when the value of b is changed variable a should automatically change with same value as b. 5.

2107

---

What is the purpose of the preprocessor directive error?

1204

---

What is signed and unsigned?

1017

---

Explain a file operation in C with an example.

1058

---

What does node * mean?

1146

---

Why is c faster?

1018

---

What is the difference between class and object in c?

1094

---

What is the purpose of the following code? Is there any problem with the code? void send(int count, short *to, short *from) { /* count > 0 assumed */ register n = (count + 7) / 8; switch (count % 8) { case 0: do { *to = *from++; case 7: *to = *from++; case 6: *to = *from++; case 5: *to = *from++; case 4: *to = *from++; case 3: *to = *from++; case 2: *to = *from++; case 1: *to = *from++; } while (--n > 0); } }

2439

---

What is file in c language?

966

---

What is the ANSI C Standard?

1214

---

Can a pointer be volatile in c?

935

---

Does sprintf put null character?

990

---

What are derived data types in c?

1014

---

What are control structures? What are the different types?

1043

---