Search results

Page title matches

• Computer Number Systems
  ...mbers, using 0s and 1s only, are quite unwieldy for humans. For example, a computer would need 19 bits to store the numbers up to 500,000! We use of different ...nts 4 binary bits. For example, the decimal number 53201, stored as in the computer as the binary number 10000001111000101100, is represented by the octal numb
  13 KB (1,733 words) - 14:23, 4 July 2022

Page text matches

• Main Page
  * [[Computer Number Systems]] ...wUUzG02SJKXkvDSpJWxeVbhORnYLkRhLQJMo/edit?usp=sharing Elementary Division: Computer Number Systems (Contest 1)]
  2 KB (270 words) - 10:53, 22 January 2021
• Prefix/Infix/Postfix Notation
  ...alternative notations have been developed which lend themselves to simple computer algorithms for evaluating expressions. In ''prefix'' notation, each operato ...ion: ''A general tutorial on prefix notation that can be used for American Computer Science League.''
  10 KB (1,363 words) - 12:04, 20 December 2021
• Computer Number Systems
  ...mbers, using 0s and 1s only, are quite unwieldy for humans. For example, a computer would need 19 bits to store the numbers up to 500,000! We use of different ...nts 4 binary bits. For example, the decimal number 53201, stored as in the computer as the binary number 10000001111000101100, is represented by the octal numb
  13 KB (1,733 words) - 14:23, 4 July 2022
• Boolean Algebra
  Boolean algebra is important to programmers, computer scientists, and the general population. ...ientists, Boolean algebra is the basis for digital circuits that make up a computer's hardware. The [[Digital Electronics]] category concerns a graphical repre
  14 KB (2,010 words) - 21:15, 7 December 2021
• Recursive Functions
  ...that defines an object in terms of itself is said to be ''recursive''. In computer science, recursion refers to a function or subroutine that calls itself, an ...ely more efficiently than they can be done recursively, many algorithms in computer science must be written recursively. The Tower of Hanoi which is referred
  9 KB (1,360 words) - 21:18, 7 December 2021
• Graph Theory
  ...ormulated in terms of points and connections between them. For example, a computer network has PCs connected by cables, an airline map has cities connected by A talked-over presentation discussing graph theory as needed for the American Computer Science League and its tests.
  10 KB (1,801 words) - 21:16, 7 December 2021
• Data Structures
  At the heart of virtually every computer program are its algorithms and its data structures. It is hard to separate ...e courses devoted to fundamental data structures. Implementation varies by computer language, but for our purposes, they can all be represented as a list of it
  17 KB (2,891 words) - 23:43, 9 June 2020
• Advanced Regular Expressions
  It tells the computer to repeat the preceding character (or set of characters) for ::6. www.edu.training.computer-science.org
  5 KB (834 words) - 10:22, 1 September 2020
• Digital Electronics
  The topic of Digital Electronics is fundamental in Computer Science and there are many videos on YouTube that teach this subject. We fo
  10 KB (1,411 words) - 12:14, 18 December 2021
• FSAs and Regular Expressions
  ...finite state automatons and regular expressions as needed for the American Computer Science League and its tests.
  10 KB (1,635 words) - 10:25, 1 September 2020
• LISP
  LISP is one of the simplest computer languages in terms of syntax and semantics, and also one of the most powerf
  10 KB (1,776 words) - 06:45, 11 February 2023