Interested to Buy Any Domain ? << Click Here >> for more details...
#include<stdio.h>
void main()
{
int a [5];
for (i=0; i<=4; i++)
printf(“%d” ,a[i]);
}
- 8 Answers
- 11855 Views
- I also Faced
- E-Mail Answers
Answer Posted / tanvi jain
as i is not yet declared,so give an error.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What are the types of pointers in c?
List out few of the applications that make use of Multilinked Structures?
How can a process change an environment variable in its caller?
What is sizeof int in c?
write a program to input 10 strings and compare without using strcmp() function. If the character of one string matches with the characters of another string , sort them and make it a single string ??? example:- str1="Aakash" st2="Himanshu" str="Uday" output:- Aakashimanshuday (please post the answer as quickly as possible)
What is the function of this pointer?
What are the types of assignment statements?
What is the size of enum in c?
Which is an example of a structural homology?
What’s the special use of UNIONS?
how to write a c program to print list of fruits in alpabetical order?
What does == mean in texting?
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.
What will be your course of action for a push operation?
Explain how can you determine the size of an allocated portion of memory?
