0
What else can I help you with?
Can a linked list implemented using an array be accessed by giving the location?
A linked list implemented with an array defeats the purpose of using a linked list, which is to address the memory allocation problems associated with arrays.
Differences linked-list non contiguous allocation and linked-list allocation using index?
ok
Which of the following data structures can be randomly accessed giving loc A. linked list implemented using array B. singly linked list C. double linked list D. both single and double linked list?
Which of the following data structures can be randomly accessed giving loc?A. linked list implemented using arrayB. singly linked listC. double linked listD. both single and double linked listThe answer is A.
Evaluate the polynomial expression using linked list using c?
Evaluating a Polynomial expression using a singly linked list visit : http://myfundatimemachine.blogspot.in/2012/06/polynomial-evaluation-in-c.html
Explain any two advantages using Single linked list over Doubly linked list and vice-versa?
Advantages of single linked list: # Decrease in storage space per linked list node # Simpler implementation Advantages of double linked list # Decrease in work when accessing a random node # Decrease in work when inserting or deleting a node
Is it possible to implement stack and queues using linkes list?
Yes it is possible to implement stack and queue using linked list
How do you solve josephus problem using circular linked list?
The Josephus problem is a problem to locate the place for the last survivour. It shows the power of the circular linked list over the singly linked lists.
Convert single linked list to double linked list?
You copy a singly linked list into a doubly linked list by iterating over the singly linked list and, for each element, calling the doubly linked list insert function.
How do you implement a doubly linked list by using singly linked list?
Add another pointer to the nodes for the previous node: struct node { struct node *next; struct node *previous; void *data; }; typedef struct node node; Then change the logic for insertion and removal to make sure you set the previous pointer as well as the next one.
To enter n nos without using arrays in c?
Use a linked-list.
Can you simulate linked list using arrays?
I would say no, but it really depends on your point of view. An array and a linked list can both hold the same data; the only difference is how they do so. The definition of a linked list is a sequence of connected nodes. An array is a contiguous block of memory, so you can think of an array as a linked list in which each element is spacially connected to the next.
Which is the easy insertion operator single linked-list or double-linked list?
It is easier to insert into a singly linked list.
