Answer Posted / vrushali

Hi Vighnesh,

Please explain the term data security.....


Thanks

What are the back slash character constants or escape sequence charactersavailable in c?

1154

---

any restrictions have on the number of 'return' statements that may be present in a function. a) no restriction b) only 2 return statements c) only 1 return statements d) none of the above

1106

---

Explain how do you print an address?

1114

---

Explain what are global variables and explain how do you declare them?

1114

---

How can you increase the size of a statically allocated array?

1055

---

How can I handle floating-point exceptions gracefully?

1131

---

How pointers are declared?

925

---

What do you understand by friend-functions? How are they used?

1176

---

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.

2156

---

Differentiate between the expression “++a” and “a++”?

1222

---

How do you convert a decimal number to its hexa-decimal equivalent.Give a C code to do the same

1069

---

any C program contains only one function, it must be a) void () b) main () c) message () d) abc ()

1095

---

What is console in c language?

1068

---

Explain how can I remove the trailing spaces from a string?

1015

---

What are the 4 types of unions?

1006

---