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 200 pages are in this category, out of 496 total.
(previous page) (next page)K
L
- L-system
- Largest five adjacent number
- Largest number divisible by its digits
- Largest prime factor
- Largest proper divisor of n
- Last letter-first letter
- Leap year
- Least common multiple
- Leonardo numbers
- Literals/Integer
- Literals/String
- Logical operations
- Long literals, with continuations
- Long multiplication
- Long stairs
- Long year
- Longest common subsequence
- Longest common substring
- Longest common suffix
- Longest string challenge
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loops/Break
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Foreach
- Loops/Increment loop index within loop body
- Loops/Infinite
- Loops/N plus one half
- Loops/Nested
- Loops/While
- Loops/With multiple ranges
- Loops/Wrong ranges
- Lucas-Lehmer test
- Luhn test of credit card numbers
M
- Mad Libs
- Magic 8-ball
- Magic constant
- 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
- McNuggets problem
- MD5
- Meissel–Mertens constant
- Mersenne primes
- Mertens function
- Middle three digits
- Minesweeper game
- Minimum multiple of m where digital sum equals m
- Minimum number of cells after, before, above and below NxN squares
- Minimum numbers of three lists
- Minimum primes
- Modular inverse
- Monte Carlo methods
- Monty Hall problem
- Motzkin numbers
- Multiple regression
- Multiplication tables
- Multiplicatively perfect numbers
- Musical scale
- Mutual recursion
- Möbius function
N
- N'th
- Neighbour primes
- Nested templated data
- Next special primes
- Nim game
- Nth root
- Number names
- 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
- Numbers with prime digits whose sum is 13
O
P
- Padovan n-step number sequences
- Palindrome dates
- Palindromic primes in base 16
- Pancake numbers
- Pandigital prime
- Pangram checker
- Parameterized SQL statement
- Penney's game
- Perfect numbers
- Perfect totient numbers
- Periodic table
- Permutations
- Permutations by swapping
- Permutations with repetitions
- Pernicious numbers
- Phrase reversals
- Pi
- Pick random element
- Pig the dice game
- Piprimes
- Playing cards
- Population count
- Posit numbers/encoding
- 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
- Rainbow
- Ramer-Douglas-Peucker line simplification
- 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
- Round-robin tournament schedule
- RPG attributes generator
- Run-length encoding
- Runge-Kutta method
S
- Safe and Sophie Germain primes
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Search a list
- Semiprime
- SEND + MORE = MONEY
- Sequence of non-squares
- Sequence of primes by trial division
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Set consolidation
- Sexy primes
- Shape-Machine
- Shift list elements to left by 3
- Shoelace formula for polygonal area
- Show ASCII table
- Sierpinski carpet
- Sierpinski triangle
- Sieve of Eratosthenes
- Sieve of Pritchard
- 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 disjoint sublist
- Sort primes from list to a list
- Sorting algorithms/Bogosort
- Sorting algorithms/Bubble sort
- Sorting algorithms/Counting sort