Category:BASIC256
(Redirected from 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 200 pages are in this category, out of 461 total.
(previous page) (next page)2
A
- A+B
- ABC problem
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Achilles numbers
- Ackermann function
- Additive primes
- Air mass
- Aliquot sequence classifications
- Almost prime
- Amicable pairs
- Angle difference between two bearings
- Animation
- Anonymous recursion
- Anti-primes
- Append numbers at same position in strings
- Archimedean spiral
- Arithmetic-geometric mean
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Integer
- Array concatenation
- Array length
- Arrays
- Assertions
- Associative array/Creation
- Associative array/Iteration
B
C
- Caesar cipher
- Calculating the value of e
- Call a function
- Calmo numbers
- Cantor set
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catamorphism
- Centroid of a set of N-dimensional points
- Chaos game
- Character codes
- Chebyshev coefficients
- Check that file exists
- Chinese zodiac
- Circles of given radius through two points
- Circular primes
- Closest-pair problem
- Code Golf: Code Golf
- Color of a screen pixel
- Colour pinstripe/Display
- Combinations
- Combinations with repetitions
- Comments
- Compare length of two strings
- Compile-time calculation
- Concatenate two primes is also prime
- Conditional structures
- Constrained random points on a circle
- Conway's Game of Life
- Copy a string
- Count in factors
- Count in octal
- Count occurrences of a substring
- Create a two-dimensional array at runtime
- Create an object/Native demonstration
- Cuban primes
- Cullen and Woodall numbers
D
- Damm algorithm
- Day of the week
- Day of the week of Christmas and New Year
- De Polignac numbers
- Department numbers
- Detect division by zero
- Determine if a string has all unique characters
- Determine if a string is numeric
- Dice game probabilities
- Digital root
- Dinesman's multiple-dwelling problem
- Disarium numbers
- Diversity prediction theorem
- Dot product
- Double Twin Primes
- Dragon curve
- Draw a pixel
- Draw a rotating cube
- Draw a sphere
- Dutch national flag problem
E
- Egyptian division
- Empty program
- Empty string
- Equal prime and composite sums
- Equilibrium index
- Erdős-Nicolas numbers
- Ethiopian multiplication
- Euler's sum of powers conjecture
- Even or odd
- Events
- Exactly three adjacent 3 in lists
- Execute a system command
- Execute HQ9+
- Exponentiation operator
- Exponentiation order
- Exponentiation with infix operators in (or operating on) the base
F
- Factorial
- Factorial primes
- Factors of an integer
- Farey sequence
- FASTA format
- Feigenbaum constant calculation
- Fibonacci n-step number sequences
- Fibonacci sequence
- File extension is in extensions list
- File input/output
- Find common directory path
- Find first and last set bit of a long integer
- Find limit of recursion
- Find minimum number of coins that make a given value
- Find square difference
- Find the intersection of two lines
- First 9 prime Fibonacci number
- First power of 2 that has leading decimal digits of 12
- FizzBuzz
- Flatten a list
- Flow-control structures
- Floyd's triangle
- Forest fire
- Formatted numeric output
- Fractal tree
- Frobenius numbers
- Function definition
- Fusc sequence
G
- Galton box animation
- Gamma function
- Gapful numbers
- Generate Chess960 starting position
- Generate lower case ASCII alphabet
- Generate random numbers without repeating a value
- Generic swap
- Giuga numbers
- Goldbach's comet
- Golden ratio/Convergence
- Grayscale image
- Greatest common divisor
- Greatest element of a list
- Greyscale bars/Display
- Guess the number
- Guess the number/With feedback
H
- Hamming numbers
- Happy numbers
- Harmonic series
- Harshad or Niven series
- Hash from two arrays
- Haversine formula
- Hello world/Graphical
- Hello world/Line printer
- Hello world/Newbie
- Hello world/Newline omission
- Hello world/Standard error
- Hello world/Text
- Here document
- Hofstadter Q sequence
- Hofstadter-Conway $10,000 sequence
- Horizontal sundial calculations
- Horner's rule for polynomial evaluation
I
- I before E except after C
- Iccanobif primes
- Identity matrix
- Idiomatically determine all the lowercase and uppercase letters
- Idoneal numbers
- Inconsummate numbers in base 10
- Increasing gaps between consecutive Niven numbers
- Increment a numerical string
- Infinity
- Input loop
- Integer comparison
- Integer roots
- Integer sequence
- ISBN13 check digit
- Isqrt (integer square root) of X
- Iterators