Answer / sruthy

union allocates the memory equal to the maximum memory
required by the member of the union but structure allocates
the memory equal to the total memory required by the members

Answer / revathi pawar

structure is the set of different datatype whereas the
struct is the keyword
union is the one where will not print or give correct ouptut
whereas it will give the address of tat particular string or
no given
union s the keyword

wite a programme in c to linear search a data using flag and without using flags?

3 Answers   TCS,

---

write a program in c to read array check element is present or not?

1 Answers  

---

WHAT IS HEADER?

8 Answers   ProKarma, TCS,

---

what is the flow of execution in cprogram? ex:printf();,scanf();

2 Answers  

---

Why is event driven programming or procedural programming, better within specific scenario?

0 Answers   Wipro,

---

At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.

0 Answers   Infosys,

---

print out put like this form 1 2 3 4 5 6 3 5 7 9 11 8 12 16 20

8 Answers   TCS,

---

Binary tree traversing

1 Answers   Qualcomm,

---

is c language is a object oreinted language?

5 Answers   TCS,

---

du u know test pattern for robosoft? Plz share

1 Answers   RoboSoft, TATA, Wipro,

---

All technical questions

0 Answers   TCS,

---

What is #include stdio h?

0 Answers  

---