Write a program in ‘C’ language that will perform the following operation on static stack. 1. push 2. pop 3. Display 4. Exit Create separate functions for each operation. The push() should accept one argument of structure type and will not return any thing. The pop() function will not receive any argument & return structure type value. The stack & top must be declare as external variable. Each element of stack will contain the following information Roll No, Std Name, Course. Use do-while loop & switch case for generating the above menu. The format of the output should is given below: S.No. Roll No. Student Name Course 1 cse01 Anil Singh B.Tech

0 Answers  

---

write program which accept information about 5 student & display same information according to ascending order of their name??

0 Answers  

---

pls send me the e-book for verbal and non verbal reasoning of R S aggarwall

0 Answers  

---

what will happend if i fire this command in linux " rm -r / "

0 Answers  

---

could i know the selection pattern at hpcl, am an undergradute in chemical technology, but my sujects or course do not figure out antwhere on the lists.

0 Answers  

---

---

Give an algorithm for the following problem and determine its time complexity. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is maximized. You may assume that n is a multiple of 2 (i.e. n is even).

1 Answers  

---

What is "strstream" ?

0 Answers  

---

what is polymorphism?

1 Answers  

---

10. Each alphabet stands for one digit in the following multiplication. T H I S x I S --------- X F X X X X U X ------------ X X N X X ------------ What is the maximum value T can take?

4 Answers   eLitmus, Infosys, Verchaska,

---

If navara d40 injektor damage.what is the problem when we drive??

0 Answers  

---

What is Moore's law and what limits the size of a computer chip?

0 Answers  

---

Let an denote the number of bit strings of length n that do not have two consecutive zeroes. Find a recurrence relation for the number of bit strings of length n that do not have two consecutive zeroes. Hence find a4.

0 Answers  

---