Interested to Buy Any Domain ? << Click Here >> for more details...
what is array?
- 63 Answers
- 70543 Views
- Amdocs, HCL, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / prakash
array is nothing but group of elements and store the many values
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / vijay
An array is a collection of homogenous data elements which are
stored in consecutive memory locations.Always address location
of array starts from 0.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / rahamatulla
Array is collectioan of homogenius data types which stored
in memory allocation
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / shubham
an array is a series of values in computers memory all of which have the same name and also same data type but they are differ with special values called subscripts
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / manish sharma
Array is a collection of similar data type,
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / shabaz
fgfmy hjddf gjyf gng hjv veyug gjfu gkfgxj, hgkg ckyy gfgh
ff ghggh cghyg cfh fgxgg hchh vgv hg vyuv hcgv gvb 4467bv
ftbbm,
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / muhammad junaid malik
Array is a collection of elements that have different data types but are stored in a same header name
| Is This Answer Correct ? | 6 Yes | 7 No |
Answer / balamurugan
An Array is a collection of similar data type,that are
refered by common or single name.
| Is This Answer Correct ? | 0 Yes | 1 No |
Answer / saroja patil
Array is simple program structure collection of homogeneous
data elements which are stored the elements are same data
same type and same size.
| Is This Answer Correct ? | 0 Yes | 1 No |
Answer / hanif sagar
The collection of similar data type is called an array.
| Is This Answer Correct ? | 0 Yes | 1 No |
What are the back slash character constants or escape sequence charactersavailable in c?
Are the variables argc and argv are always local to main?
What is dynamic dispatch in c++?
Explain what is dynamic data structure?
What does a function declared as pascal do differently?
Explain about the constants which help in debugging?
a number is perfect if it is equal to the sum of its proper divisor.. 6 is perfect number coz its proper divisors are 1,2 and three.. and 1+2+3=6... a number is deficient if the sum of its proper divisor is less than the number.. sample: 8 is deficient, coz its proper divisors are 1,2 and 4, and 1+2+4=7. abundant number, if the sum of its proper divisor is greater than the number.. sample..12 is abundant coz 1+2+3+4+6=16 which is geater than 12. now write a program that prompts the user for a number, then determines whether the number is perfect,deficient and abundant..
Which operators cannot be overloaded a) Sizeof b) .* c) :: d) all of the above
What's the difference between struct x1 { ... }; and typedef struct { ... } x2; ?
What is a lvalue
What is a ternary operator 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.
C 
