Category:BASIC256
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Lang tag(s): | BASIC256 |
|---|---|
| See Also: |
|
BASIC256 is an implementation of BASIC.
Other implementations of BASIC.
BASIC-256 is an easy to use version of BASIC designed to teach anybody (especially middle and high-school students) the basics of computer programming. It uses traditional control structures like gosub, for/next, and goto, which helps kids easily see how program flow-control works. It has a built-in graphics mode which lets them draw pictures on screen in minutes, and a set of detailed, easy-to-follow tutorials that introduce programming concepts through fun exercises.
- Features
- fast graphics suitable for animation
- native speech synthesis
- mouse and keyboard events
- graphic files manipulation (saving, retrieving)
- playing sounds from WAV files
- sprites handling
- database functions
- socket networking
- error handling
- files I/O
- true functions/subroutines (version 0.9.9.1 and later)
- Disadvantages
- BASIC-256 does not support three- and N-dimensional arrays in general (N>2)
BASIC256 is open source and available for Linux, Windows and Mac.
For more information see basic256.org or to download and install sourceforge.
Pages in category "BASIC256"
The following 197 pages are in this category, out of 428 total.
(previous page) (next page)M
- Magic squares of odd order
- Magnanimous numbers
- Mandelbrot set
- Map range
- Matrix transposition
- Maximum difference between adjacent elements of list
- Maximum triangle path sum
- Maze generation
- MD5
- Meissel–Mertens constant
- Mersenne primes
- Mertens function
- Minesweeper game
- Minimum multiple of m where digital sum equals m
- Minimum number of cells after, before, above and below NxN squares
- Minimum primes
- Modular inverse
- Monte Carlo methods
- Monty Hall problem
- Motzkin numbers
- Multiplication tables
- Multiplicatively perfect numbers
- Musical scale
- Mutual recursion
- Möbius function
N
- N'th
- Neighbour primes
- Next special primes
- Nim game
- Nth root
- Number reversal game
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers which are the cube roots of the product of their proper divisors
- Numbers whose count of divisors is prime
- Numbers with equal rises and falls
O
P
- Palindrome dates
- Pancake numbers
- Pangram checker
- Parameterized SQL statement
- Penney's game
- Perfect numbers
- Perfect totient numbers
- Periodic table
- Permutations
- Permutations by swapping
- Permutations with repetitions
- Pernicious numbers
- Pi
- Pick random element
- Pig the dice game
- Piprimes
- Playing cards
- Population count
- Price fraction
- Primality by trial division
- Primality by Wilson's theorem
- Prime numbers which contain 123
- Prime triplets
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Probabilistic choice
- Problem of Apollonius
- Product of divisors
- Program termination
- Proper divisors
- Pseudo-random numbers/Middle-square method
- Pythagoras tree
R
- Ramsey's theorem
- Random numbers
- Range extraction
- Rate counter
- Read a file character by character/UTF8
- Read a file line by line
- Read a specific line from a file
- Read entire file
- Real constants and functions
- Reduced row echelon form
- Remove duplicate elements
- Remove vowels from a string
- Repeat
- Repeat a string
- Reverse a string
- Reverse the order of lines in a text file while preserving the contents of each line
- Reverse words in a string
- Roman numerals/Decode
- Roman numerals/Encode
- Roots of unity
- Rot-13
- RPG attributes generator
- Run-length encoding
- Runge-Kutta method
S
- Safe and Sophie Germain primes
- Safe primes and unsafe primes
- Search a list
- Semiprime
- SEND + MORE = MONEY
- Sequence of non-squares
- Sequence of primes by trial division
- Shift list elements to left by 3
- Shoelace formula for polygonal area
- Show ASCII table
- Sierpinski carpet
- Sierpinski triangle
- Sieve of Eratosthenes
- Sine wave
- Sleep
- Sleeping Beauty problem
- Smallest multiple
- Smallest square that begins with n
- Smarandache prime-digital sequence
- Snake and ladder
- Soloway's recurring rainfall
- Solve equations with substitution method
- Solve hanging lantern problem
- Sort primes from list to a list
- Sorting algorithms/Bubble sort
- Sorting algorithms/Counting sort
- Sorting algorithms/Insertion sort
- Special divisors
- Speech synthesis
- Spinning rod animation/Text
- Split a character string based on change of character
- Square but not cube
- Start from a main routine
- Steady squares
- Stern-Brocot sequence
- String append
- String case
- String comparison
- String concatenation
- String interpolation (included)
- String prepend
- Strip a set of characters from a string
- Strip comments from a string
- Strip whitespace from a string/Top and tail
- Substring
- Substring primes
- Substring/Top and tail
- Sudan function
- Sum and product of an array
- Sum digits of an integer
- Sum multiples of 3 and 5
- Sum of a series
- Sum of divisors
- Sum of elements below main diagonal of matrix
- Sum of first n cubes
- Sum of squares
- Sum of two adjacent numbers are primes
- Summarize primes
- Sylvester's sequence
- System time
T
- Tau function
- Tau number
- Temperature conversion
- Terminal control/Clear the screen
- Terminal control/Display an extended character
- Ternary logic
- The Name Game
- The Twelve Days of Christmas
- Thue-Morse
- Tic-tac-toe
- Time a function
- Tokenize a string
- Topic variable
- Towers of Hanoi
- Trabb Pardo–Knuth algorithm
- Trigonometric functions
- Triplet of three numbers
- Twin primes
- Two identical strings