Interested to Buy Any Domain ? << Click Here >> for more details...
What is a Genralised LInked List??
Please give a detailed explation of it..
- 1 Answers
- 3733 Views
- I also Faced
- E-Mail Answers
Generally, there are two kind of linked list.
i) Single Linked List and
ii) Double Linked List.
In single Linked List, you can move only in forward
direction using the address of the next node. Each node
contains two fields namely Data and Address of Next node.
In Double Linked List, you can move in both forward and
reverse direction using the address of the next node and
previous node respectively. Here each node contains three
fields namely Data, Address of next node, and Address of
Previous node.
| Is This Answer Correct ? | 2 Yes | 0 No |
How do you list a file’s date and time?
What is the scope of global variable in c?
Two's compliment of -5
wats SIZE_T meant for?
To what value are pointers initialized? 1) NULL 2) Newly allocated memory 3) No action is taken by the compiler to initialize pointers.
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 are the properties of union in c?
What are the three constants used in c?
What is the difference between union and anonymous union?
Is null always equal to 0(zero)?
How we add our function in liabrary as liabrary function. Exp. we want use our int factorical(int); function as int pow(int,int); function working in math header file.
What is the difference between procedural and declarative language?
C 
