data structures

Knowledge Varieties

This program may require discovering coordinates for the cities like latitude and longitude. Binary to Decimal and Back Converter – Develop a converter to transform a decimal quantity to binary or a binary quantity to its decimal equivalent. Change Return Program – The user enters a cost and then the amount of cash given. The program will figure out the change and the number of quarters, dimes, nickels, pennies needed for the change. Next Prime Number – Have this system discover prime numbers until the user chooses to stop asking for the next one. Find e to the Nth Digit – Just just like the earlier downside, but with e instead of PI.

Dynamic Arrays And Amortized Analysis

Port Scanner – Enter an IP handle and a port vary where this system will then try to seek out open ports on the given pc by connecting to each of them. FTP Program – A file transfer program which can switch recordsdata backwards and forwards from a remote internet sever. Regex Query Tool – A device that enables the consumer to enter a text string and then in a separate management enter a regex sample. It will run the regular expression against the supply text and return any matches or flag errors within the regular expression. Vigenere / Vernam / Ceasar Ciphers – Functions for encrypting and decrypting information messages. Count Words in a String – Counts the number of individual phrases in a string.

data structures

While appends and pops from the top of record are fast, doing inserts or pops from the beginning of a listing is gradual . Sort the gadgets of the listing in place (the arguments can be utilized for sort customization, see sorted() for his or her explanation). Return the index in the record of the first merchandise whose value is x. Although dictionaries have the semantics of unordered collections, in programming environments they’re typically equipped with some intrinsic ordering. Such ordering is supported in all of Python, Ruby and JavaScript. In Python, the modifying assignments are disallowed because of the usage of sibling indices that are not current within the initial construction. assigns every non-leaf node with finitely many children its final child node.

Enter a quantity and have this system generate e up to that many decimal locations. Find PI to the Nth Digit – Enter a number and have this system generate PI up to that many decimal locations. The initial expression in a list comprehension may be any arbitrary expression, including another listing comprehension. If there’s only one merchandise within the sequence, its value is returned; if the sequence is empty, an exception is raised. It is also attainable to use a list as a queue, the place the first factor added is the first component retrieved (“first-in, first-out”); however, lists aren’t environment friendly for this purpose.

For added complexity read these strings in from a text file and generate a abstract. Fizz Buzz – Write a program that prints the numbers from 1 to one hundred. But for multiples of three print “Fizz” as a substitute of the quantity and for the multiples of 5 print “Buzz”. For numbers that are multiples of both three and five print “FizzBuzz”. Dijkstra’s Algorithm – Create a program that finds the shortest path through a graph utilizing its edges. Tax Calculator – Asks the user to enter a price and either a country or state tax. Distance Between Two Cities – Calculates the distance between two cities and permits the person to specify a unit of distance.