One of our potential future investors ask us for
following: "We also wanted to see the high level algorithm
diagrams".
I have searched the Web a lot and have found a lot of types
of diagrams. I will not list them here.
I'm not sure that the definition "high level algorithm
diagrams" exists at all. Any way, if you know it is - where
I can find it on Web.
The more general question. If one need to create (let us
define it this way) high level algorithm diagrams - where
to find types, descriptions and templates on Web.

Thanks a lot.

Valery



One of our potential future investors ask us for following: "We also wanted to see the high l..

Answer / Asheesh Chaudhry

High-level algorithm diagrams are often referred to as flowcharts or block diagrams. They provide a visual representation of an algorithm's steps and decisions without going into details about implementation. There are various types like Flowchart, UML Activity Diagram, BPMN Diagram, etc. You can find examples, descriptions, and templates for these diagrams on websites such as Lucidchart (<https://www.lucidchart.com/>), draw.io (<https://www.diagrams.net/>), or Gliffy (<https://www.gliffy.com/>).

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Software Design AllOther Interview Questions

What is Make to Order, and what is the difference between Make to order and Make to Cash

1 Answers  


What are the advantages Information System Architecture Framework in term of analysis and system design

1 Answers  


How would you create a footprint in your PCB designer software (say, Altium)?

1 Answers   Tech Mahindra,


vendor out going payment suppose is 10000/- and after some time vendor returned 2000/- as it is excess where this transaction to be posted in fi/ap

1 Answers  


How to Design a Good Newsletter?

1 Answers  


Write a command to find all of the files which have been accessed within the last 30 days. Output should be stored in a file “December.files”

1 Answers  


I would like to submit the following question I was asked recently during my technical interview at Google. I'm rephrasing the question to make it clear for everyone to understand: - You are going on a one-way flight trip that includes billions of layovers. - You have 1 ticket for each part of your trip (i.e: if your trip is from city A to city C with a layover in city B, then you will have 1 flight ticket from city A to city B, and 1 flight ticket from city B to city C. - Each layover is unique. You are not stopping twice in the same city. - You forgot the original departure city. - You forgot the final destination city. - All the tickets you have are randomly sorted. Question are: - Design an algorithm to reconstruct your trip with minimum complexity. - How would you improve your algorithm. Example: - randomly sorted: New York->London San Francisco-> Hong Kong Paris->New York London->San Francisco - sorted: Paris->New York New York->London London->San Francisco San Francisco-> Hong Kong

3 Answers   Google,


Hi all... I finished BCA. Now, iam in testing team but i would like to work in developing team. Will u pls suggest me, which course can i study to enter into developing team????

1 Answers   Wipro,


what is meaning for .net?ten introduction of software tools?

2 Answers   Wipro,


what are the process colors? what is the space between letters called? what is the space between spaces called?

1 Answers  


Please send me Sample papers National Informatics Centre (NIC) Programmer Vacency

182 Answers   IBM, NIC,


how to downlaod image to target system? what is the vi editor?

1 Answers  


Categories