what is Array?
- 3 Answers
- 3798 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / lakshmi
it is a grouped item of consequitive memory elements with
similar type of values.
| Is This Answer Correct ? | 7 Yes | 0 No |
Answer / lakshmi
Array is the group of consequitive elements with same type.
| Is This Answer Correct ? | 7 Yes | 2 No |
Answer / guest
collection of element in continuous memory location
| Is This Answer Correct ? | 1 Yes | 1 No |
Describe static function with its usage?
a<<1 is equivalent to a) multiplying by 2 b) dividing by 2 c) adding 2 d)none of the above
what is the code to display color fonts in the output?
program to find out date after adding 31 days to a date in the month of febraury also consider the leap year
Where are some collections of useful code fragments and examples?
What is nested structure?
Explain what math functions are available for integers? For floating point?
What is the use of static variable in c?
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.
My teacher ask to make a program that can: Insert record in front Insert record at the end Insert in between Search node record Delete record in front Delete record at the end Delete record in between Using Data structure Linked List type. But I'm really confused about the codes and I can't go through. Please help Thanks in advance. Also here is my unfinished code if someone can make changes it will be more good.
Why is c called "mother" language?
Explain what is dynamic data structure?
C 
