Answer Posted / sravankumar

The #include<> and #include" " are almost same, but #include<>
searches the included file in predefined default location(This predefined default location is often an INCLUDE environment variable that denotes the path to your include files)i.e searches the location where the predefined function are present in installed C language, whereas #include" " searches the included file in the current directory first , if not found then goes to the predefined default location.

What is a null pointer assignment error? What are bus errors, memory faults, and core dumps?

1408

---

Can you apply link and association interchangeably?

1111

---

.find the output of the following program? char*myfunc(char*ptr) { ptr +=3; return (ptr); } int main() { char*x,*y; x="HELLO"; y=myfunc(x); printf("y = %s ",y); return 0; }

2565

---

Explain what is the best way to comment out a section of code that contains comments?

1125

---

What is dangling pointer in c?

1200

---

Can you explain what keyboard debouncing is, and where and why we us it? please give some examples

2182

---

What are structures and unions? State differencves between them.

1155

---

Is c procedural or object oriented?

985

---

What are the usage of pointer in c?

1179

---

What is the difference between %d and %i?

1082

---

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.

2174

---

How do we declare variables in c?

1047

---

What is %lu in c?

1237

---

Why do we use pointer to pointer in c?

1065

---

What does nil mean in c?

1231

---