Algorithm to add element in the end of circular linked list, Data Structure & Algorithms

Assignment Help:

Q. Write down an algorithm to add an element in the end of the circular linked list.

Ans.

Algorithm to Add the Element at the End of Circular Linked Lists written below.

IINSENDCLL( INFO, LINK, START, AVAIL, ITEM) The algorithm deletes last element from the circular linked list.

1. [OVERFLOW?] if AVAIL = NULL, then Write:

OVERFLOW, and Exit.

2. [Remove first node from the AVAIL: = LIN[AVAIL].

a. Set NEW:= AVAIL and AVAIL:=LINK[AVAIL].

3. Set INFO[NEW]:=ITEM. [copies new data into new node.]

4. Set PTR:= LINK[START] and SAVE:=START.[initializes popinters]

5. Repeat while LINK[PTR]!=START: [ Traverses list seeking last node.]

a. Set PTR:=LINK[PTR]. [Updates PTR] [ End of loop]

6. Set LINK [PTR]:= NEW. [ Attaches new node to the last node of the list]

7. Set LINK[NEW]:= START [ New node now points to the original first node.]

8. Exit

Related Discussions:- Algorithm to add element in the end of circular linked list

Write an algorithm outputs number of books using psuedocode, A shop sells b...

A shop sells books, maps and magazines. Every item is identified by a unique 4 - digit code. All books have a code starting with a 1, all maps have a code which starts with a 2 and

Program segment for insertion of an element into the queue, Program: Progra...

Program: Program segment for insertion of an element into the queue add(int value) { struct queue *new; new = (struct queue*)malloc(sizeof(queue)); new->value = val

Elaborate the symbols of abstract data type, Elaborate the symbols of abstr...

Elaborate the symbols of abstract data type length(a)-returns the number of characters in symbol a. capitalize(a)-returns the symbol generated from a by making its first cha

Make adjacency matrix for un-directed graph, Q. Describe the adjacency matr...

Q. Describe the adjacency matrix and make the same for the given undirected graph. Ans: The representation of Adjacency Matrix: This representation consists of

Graphs, In this unit, we will describe a data structure called Graph. Actua...

In this unit, we will describe a data structure called Graph. Actually, graph is a general tree along no parent-child relationship. In computer science, Graphs have several applica

Relationship between shortest path distances of modified, a) Given a digrap...

a) Given a digraph G = (V,E), prove that if we add a constant k to the length of every arc coming out from the root node r, the shortest path tree remains the same. Do this by usin

Splaying steps - splay trees, Readjusting for tree modification calls for r...

Readjusting for tree modification calls for rotations in the binary search tree. Single rotations are possible in the left or right direction for moving a node to the root position

Logical database design, 1. For the ER diagram you created in assignment, t...

1. For the ER diagram you created in assignment, the artefact of the conceptual database design, map the ER model into the relational model according to how it was designed in the

Write an algorithm to input number of passengers travelling, There are ten ...

There are ten stations on a railway line: Train travels in both directions (i.e. from 1 to 10 and then from 10 to 1). Fare between each station is $2. A passenger input

What is assertions, What is Assertions Introduction At every point...

What is Assertions Introduction At every point in a program, there are generally constraints on the computational state that should hold for program to be correct. For ins

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages