Interested to Buy Any Domain ? << Click Here >> for more details...
what is self refrential structure
- 3 Answers
- 7669 Views
- HCL, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / silpa
if a structure tag is a datatype of a variable or data
member then it is known as a self referential structure.
for ex
template <class t>
struct node
{
t data;
node *link;//here link is a variable which contains data
type of structuretag ie node
}
| Is This Answer Correct ? | 12 Yes | 0 No |
whenever a structure is been pointed by the same structure
pointer which is the member of the same structure is called
as self referential structure....
thank u
| Is This Answer Correct ? | 7 Yes | 0 No |
Answer / ambar
whenever a structure calls itself during execution it is
known as a self referential structurte
| Is This Answer Correct ? | 1 Yes | 0 No |
How is a macro different from a function?
Can a binary search tree be used as an index? If yes, how? Explain
read an array and search an element
What is #include cctype?
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.
Can math operations be performed on a void pointer?
Reverse the part of the number which is present from position i to j. Print the new number.[without using the array] eg: num=789876 i=2 j=5 778986
How can I send mail from within a c program?
Write the program for displaying the ten most frequent words in a file such that your program should be efficient in all complexity measures.
Explain what will the preprocessor do for a program?
Design a program using an array that searches a number if it is found on the list of the given input numbers and locate its exact location in the list.
What is function prototype?
C 
