Follow

Translate

Friday, March 18, 2016

COUNT(INFO, LINK, START, NUM)


1.  Set NUM : = 0.   [Initialize Counter]

2.  Call Algorithm Traversing a Linked List, Replace the processing Step by:

Set NUM : = NUM +1.

3.  Return.
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE

Related Posts:

  • Searching A Link List LIST Is Unsorted:   Algorithm:  SEARCH(INFO, LINK, START, ITEM, LOC) LIST is a linked list in memory. This algorithm finds the location LOC of the node where ITEM fistn appears in LIST, or sets LOC = NU… Read More
  • COUNT(INFO, LINK, START, NUM) Procedure: COUNT(INFO, LINK, START, NUM) 1.  Set NUM : = 0.   [Initialize Counter] 2.  Call Algorithm Traversing a Linked List, Replace the processing Step by: Set NUM : = NUM +1. 3.  Retur… Read More
  • Huffman's Algorithm Huffman's Algorithm:  Suppose w1 and w2 are two minimum weights among the n given weights w1, w2,..................,wn.Find a tree T Prime which gives a solution for the n - 1 weights       w1 + w2,… Read More
  • PATH LENGTH: HUFFMAN'S ALGORITHM PATH LENGTH: HUFFMAN'S ALGORITHM: An extended binary tree or 2-tree is a binary tree T which each node has either 0 or 2 node children. The nodes with 0 children are called external nodes. and the nodes with 2 children ar… Read More
  • Procedure: COUNT(INFO, LINK, START, NUM) Procedure: COUNT(INFO, LINK, START, NUM) 1.  Set NUM : = 0 .    [Initializes Counter]    2. Set PTR : = START.  [Initializes Pointer]  3.  Repeat Steps 4 and 5 while PTR != N… Read More

0 comments:

Post a Comment