Search results

Page title matches

• 1
  0 bytes (0 words) - 02:54, 13 August 2020

Page text matches

• My test page
  ...consists of 2 questions on each of the first two topics listed below and 1 question on the third topic for a total of 5 questions. The time limit for ...logical negation on each bit. Bits that are 0 become 1, and those that are 1 become 0. For example: ~101110 has a value of 010001.
  2 KB (333 words) - 11:27, 28 July 2020
• Digital Electronics
  | 1 || 1 | 0 || 1
  10 KB (1,411 words) - 12:14, 18 December 2021
• Tests - Math
  <math>1<2</math> <math>1<2</math>
  5 KB (687 words) - 21:02, 11 July 2018
• Tests - Syntax
  <syntaxhighlight lang="python" line='line' highlight="1,4,8"> if len(arr) <= 1:
  332 bytes (38 words) - 21:29, 11 July 2018
• Advanced Regular Expressions
  || \d\d\d || 123 || 1-3 || \d\D\d || 1-3 || 123
  5 KB (834 words) - 10:22, 1 September 2020
• Recursive Functions
  ...function that you’ve probably encountered is the Fibonacci numbers: 0, 1, 1, 2, 3, 5, 8, 13, and so on. That is, you get the next Fibonacci number by a $$f(N)=f(N-1)+f(N-2)$$
  9 KB (1,360 words) - 21:18, 7 December 2021
• What Does This Program Do?
  ...dimensional arrays. Most ACSL past problems start with either A(1) or A(1,1). The size of the array will usually be specified in the problem statement ...r Division. In the Junior Division, loops will not be included in contest 1; loops will be used in contest 2; strings will be used in contest 3; and ar
  6 KB (955 words) - 15:12, 22 October 2020
• Bit-String Flicking
  ...use a single variable (if it is internally stored using at least 8 bits or 1 byte, which is usually the case) and represent each option with a single bi ...logical negation on each bit. Bits that are 0 become 1, and those that are 1 become 0. For example: ~101110 has a value of 010001.
  8 KB (1,239 words) - 09:51, 30 January 2024
• Boolean Algebra
  ...constants have exactly two values: ''true'' and ''false'', usually denoted 1 and 0 respectively. !1
  14 KB (2,010 words) - 21:15, 7 December 2021
• Assembly Language Programming
  ...ly language, which is turned into machine language programs – sequences of 1’s and 0’s – by an assembler. Even today, with very good quality compi ...e ACC. The sum is stored in the ACC. LOC is unchanged. Addition is modulo 1,000,000.
  6 KB (1,002 words) - 10:54, 22 January 2021
• FSAs and Regular Expressions
  ...is a mathematical model of computation comprising all 4 of the following: 1) a finite number of ''states'', of which exactly one is ''active'' at any g :1. The null string (λ) is a RE.
  10 KB (1,635 words) - 10:25, 1 September 2020
• Prefix/Infix/Postfix Notation
  ...d order of precedence in mathematics: We first evaluate the parentheses (3-1=2); then, because division has higher precedence that subtraction, we next ...erand. The expression above is <syntaxhighlight lang="python" inline>5 8 3 1 - / +</syntaxhighlight>. In ''prefix'' and ''postfix'' notations, there is
  10 KB (1,363 words) - 12:04, 20 December 2021
• Computer Number Systems
  ...nformation, called a ''bit'' ('''bi'''nary digi'''t'''), has two values: a 1 (or ''true'') when the signal is on, and a 0 (of ''false'') when the signal ...system''' or '''base 10''' because it is based on 10 different digits: 0, 1, 2, ..., 8, and 9. The base of number is written as subscript to a number.
  13 KB (1,733 words) - 14:23, 4 July 2022
• Graph Theory
  ...of edges by E. Note that E can range anywhere from $V$ to $V^2$ (or $V(V-1)/2$ in an undirected graph). Graphs with all edges present are called ''co ...een any two nodes in a tree. A tree with $N$ vertices contains exactly $N-1$ edges.
  10 KB (1,801 words) - 21:16, 7 December 2021
• Karnaugh Maps
  ...nd a map on n variables must contain 2ⁿ cells. An assignment of 1 for uncomplemented variable and 0 for a complemented variable is made. For The appearance of 1’s in adjacent cells immediately identifies the presence of a redundant va
  7 KB (1,174 words) - 09:31, 2 September 2020
• LISP
  ...3) (ADD 1 4 2)) has a value of 35, since (ADD 2 3) has a value of 5, (ADD 1 4 2) has a value of 7, and (MULT 5 7) has a value of 35. Some functions ha |(SETQ p '(ADD 1 2 3 4))
  10 KB (1,776 words) - 06:45, 11 February 2023
• Main Page
  ...JMo/edit?usp=sharing Elementary Division: Computer Number Systems (Contest 1)]
  2 KB (270 words) - 10:53, 22 January 2021
• Data Structures
  ...lion items, one can search for a particular value in about log₂ 1,000,000 ≈ 20 steps. Items can be inserted or deleted in about as many st ...e. At the left, we delete I (0 children); in the middle, we delete the R (1 child); and at the right, we delete the M (2 children).
  17 KB (2,891 words) - 23:43, 9 June 2020