data structures


Count Vowels – Enter a string and the program counts the variety of vowels within the text. For added complexity have it report a sum of every vowel discovered. Reverse a String – Enter a string and this system will reverse it and print it out. Connected Graph – Create a program which takes a graph as an enter and outputs whether every node is connected or not. Eulerian Path – Create a program which will take as an input a graph and output both a Eulerian path or a Eulerian cycle, or state that it isn’t potential.

17 1.9. Passing Pointers (or: Passing Parameters By Reference)¶

Then create a list class which keeps monitor of assorted products and may sum up the stock value. Bandwidth Monitor – A small utility program that tracks how much data you have uploaded and downloaded from the web in the course of the course of your current on-line session. See if you’ll find out what periods of the day you employ more and less and generate a report or graph that shows it.

data structures

Graph from hyperlinks – Create a program that can create a graph or community from a collection of hyperlinks. Complex Number Algebra – Show addition, multiplication, negation, and inversion of complex numbers in separate functions. (Subtraction and division operations may be made with pairs of those operations.) Print the results for every operation tested. Unit Converter – Converts numerous units between one another.

Data Construction

A Eulerian Path starts at one node and traverses every fringe of a graph via each node and finishes at another node. A Eulerian cycle is a eulerian Path that starts and finishes on the identical node.