Answer Posted / glibwaresoftsolutions

 Simple and efficient
 Portable
 Procedural language
 Rich set of built-in functions and operators
 Low-level access to memory
 Pointer support.

the 'sizeof' operator reported a larger size than the calculated size for a structure type. What could be the reason?

988

---

pgm to find any error in linklist(in single linklist check whether any node points any of previous nodes instead of next node)

2633

---

What is a string?

1093

---

How many header files are in c?

1017

---

what is bit rate & baud rate? plz give wave forms

1965

---

how much salary u want ? why u join in our company? your domain is core sector why u prefer software ?

1969

---

Give the rules for variable declaration?

1161

---

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.

2175

---

What is the difference between %d and %i?

1085

---

if (i = 0)printf ("True"); elseprintf("False"); Under what conditions will the above print out the string "True" a) Never b) Always c) When the value of i is 0 d) all of the above

1146

---

code for find determinent of amatrix

1943

---

What are preprocessor directives in c?

1081

---

Write a program on swapping (100, 50)

1097

---

Explain how can a program be made to print the line number where an error occurs?

1192

---

What does s c mean on snapchat?

1090

---