Algorithm that inputs the codes for all items in stock, Data Structure & Algorithms

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

Write an algorithm in form of a flowchart that inputs the codes for all items in stock and outputs number of books, number of magazines and number of maps in stock. Include any validation checks needed.

 

1115_flowchart.png

Posted Date: 9/11/2013 3:15:39 AM | Location : United States







Related Discussions:- Algorithm that inputs the codes for all items in stock, Assignment Help, Ask Question on Algorithm that inputs the codes for all items in stock, Get Answer, Expert's Help, Algorithm that inputs the codes for all items in stock Discussions

Write discussion on Algorithm that inputs the codes for all items in stock
Your posts are moderated
Related Questions
A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree

One can change a binary tree into its mirror image by traversing it in Postorder is the only proecess whcih can convert binary tree into its mirror image.

How to create an General Tree and how to search general tree?

It is a useful tool for indicating the logical properties of data type. It is a collection of values & a set of operations on those values. Methodically, "a TYPE is a set, & elemen


With the help of a program and a numerical example explain the Depth First Traversal of a tree.


1. Use the Weierstrass condition, find the (Strongly) minimizing curve and the value of J min for the cases where x(1) = 0, x(2) = 3. 2. The system = x 1 + 2u; where

RGB Model The RGB model is based on the assumption that any desired shade of colour can be obtained by mixing the correct amounts of red, green, and blue light. The exact hues

In any singly linked list, each of the elements contains a pointer to the next element. We have illustrated this before. In single linked list, traversing is probable only in one d