Study guide
18.3 Number Systems, Logic Gates, Flowcharts & Computer Basics
SBI Clerk Junior Associate
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Structure, Eligibility, Selection & Winning Strategy
1.1 SBI Clerk Overview, Eligibility & Two-Stage Selection 1.2 Exam Pattern, Sectional Timing & Negative Marking Mechanics 1.3 Time Allocation, Question Selection & Cutoff Strategy 1.4 Final Selection, Local Language Proficiency Test & Joining Formalities
2 Chapter 2: Reasoning — Coding, Series, Relations & Input-Output
2.1 Alphanumeric, Symbol & Number Sequences 2.2 Coding-Decoding Techniques 2.3 Blood Relations 2.4 Input-Output (Machine Input) Arrangements
3 Chapter 3: Reasoning — Direction, Ranking, Inequalities & Miscellaneous
3.1 Direction Sense & Distance 3.2 Order, Ranking & Comparison Tests 3.3 Coded and Direct Inequalities 3.4 Alphabet Test, Word Formation, Calendar & Clock
4 Chapter 4: Reasoning — Syllogisms, Critical Deduction & Data Sufficiency
4.1 Standard Syllogisms & Venn Diagram Foundations 4.2 Advanced Syllogism Cases: Only a Few & Possibility Models 4.3 Critical Reasoning for Mains Examination 4.4 Reasoning Data Sufficiency
5 Chapter 5: Reasoning — Seating Arrangements
5.1 Linear Seating Arrangements 5.2 Parallel Row Seating Arrangements 5.3 Circular & Square/Rectangular Seating Arrangements
6 Chapter 6: Reasoning — Puzzles & Complex Enigmas
6.1 Floor and Flat-Based Puzzles 6.2 Box-Based Puzzles & Vertical Stacks 6.3 Scheduling, Month-Date & Multi-Variable Matrix Puzzles
7 Chapter 7: Quantitative Aptitude: Speed Math & Number Foundations
7.1 Speed Math, Vedic Shortcuts & BODMAS Simplification 7.2 Approximation Strategies for High-Speed Calculations 7.3 Missing and Wrong Number Series
8 Chapter 8: Quantitative Aptitude: Equations & Percentage Mathematics
8.1 Quadratic Equations & Root Comparison 8.2 Percentages, Base Conversions & Successive Changes 8.3 Profit, Loss, Marked Price, Discount & Dishonest Seller Traps
9 Chapter 9: Quantitative Aptitude: Interest, Ratio & Partnership
9.1 Simple & Compound Interest Mechanics 9.2 Ratio, Proportion & Variation Techniques 9.3 Partnership Mathematics
10 Chapter 10: Quantitative Aptitude: Averages, Mixtures & Time-Work
10.1 Averages, Weighted Averages & Age Problems 10.2 Alligation Method & Solution Replacement Problems 10.3 Time & Work, Efficiency Ratios & Pipes and Cisterns
11 Chapter 11: Quantitative Aptitude: Speed, Motion & Applied Mathematics
11.1 Speed, Time & Distance Principles 11.2 Problems on Trains, Platforms, and Boats & Streams 11.3 2D/3D Mensuration & Banking Permutation, Combination, Probability
12 Chapter 12: Quantitative Aptitude: Data Interpretation & Sufficiency
12.1 Tabular, Bar & Line Graph Data Interpretation 12.2 Pie Charts & Paragraph-Based Caselet DI 12.3 Advanced Mains DI & Quantitative Data Sufficiency
13 Chapter 13: English Language: Grammar & Usage
13.1 Core Grammar Rules for Banking Exams 13.2 Tenses, Prepositional Usages & Conditional Clauses 13.3 Error Spotting & Sentence Correction Strategies
14 Chapter 14: English Language: Comprehension, Vocabulary, Idioms & Discourse
14.1 Phrase Replacement, Single/Double Fillers & Sentence Improvement 14.2 Reading Comprehension Mastery 14.3 Cloze Tests, Para Jumbles & Discourse Connectors 14.4 Vocabulary: Synonyms, Antonyms, One-Word Substitution & Word Usage 14.5 Idioms, Phrasal Verbs, Spelling & Odd Sentence Out
15 Chapter 15: General & Financial Awareness: Banking System, RBI & Capital Regulation
15.1 Structure of the Indian Banking System 15.2 Reserve Bank of India & Monetary Policy Framework 15.3 Banking Operations, Negotiable Instruments & KYC/AML 15.4 Basel III Capital Framework, Prompt Corrective Action & D-SIBs
16 Chapter 16: General & Financial Awareness: Digital Banking & Financial Inclusion
16.1 Payment Systems, NPCI & Digital Banking 16.2 Priority Sector Lending & Financial Inclusion Initiatives 16.3 Non-Performing Assets & Debt Recovery Mechanisms
17 Chapter 17: General & Financial Awareness: Financial Markets, Economy, Schemes & Current Affairs
17.1 Money Market & Capital Market Instruments 17.2 Flagship Government Social Security Schemes & Union Budget 17.3 Static Banking GK, Financial Regulators & Current Affairs Mastery 17.4 Indian Economy Essentials: National Income, Inflation, Fiscal Indicators, GST & External Sector
18 Chapter 18: Computer Aptitude
18.1 Computer Fundamentals: Hardware Architecture, Memory & OS 18.2 Networking Protocols, Cybersecurity & Microsoft Office 18.3 Number Systems, Logic Gates, Flowcharts & Computer Basics
18.3 Number Systems, Logic Gates, Flowcharts & Computer Basics
Key Takeaways Explain This Topic AI
Decimal-to-binary conversion uses repeated division by 2, and binary digits group in threes for octal and fours for hexadecimal, so 77 in decimal is 1001101 in binary, 115 in octal and 4D in hexadecimal.
The 2's complement of a binary number is its 1's complement plus 1, so -29 in an 8-bit register is stored as 11100011.
NAND and NOR are universal gates, XOR outputs 1 only when its inputs differ, and XNOR outputs 1 only when its inputs match.
Computer generations progressed from vacuum tubes to transistors, integrated circuits, VLSI microprocessors and artificial intelligence.
In a relational database, the primary key uniquely identifies each record and cannot be NULL, while a foreign key refers to the primary key of another table.
Last updated: September 2026
18.3 Number Systems, Logic Gates, Flowcharts & Computer Basics
In the SBI Clerk Main Examination, the fourth test is Reasoning Ability & Computer Aptitude (50 questions, 60 marks, 45 minutes). The notification does not publish a separate question count for computer aptitude, so prepare its core topics: number-system conversions, binary arithmetic, logic gates, flowchart tracing, computer generations, database basics and common abbreviations, alongside the hardware, software, networking, security and MS Office topics in Sections 18.1 and 18.2.
Note: The Local Language Proficiency Test (LLPT) is not part of Computer Aptitude. Its pattern, exemption rule and qualifying requirement are covered in Section 1.4.
1. Positional Number Systems & Base Conversions
Modern digital computers process instructions through binary electronics. Understanding positional number systems involves identifying the base (or radix) representing the count of unique symbols utilized:
Decimal System (Base 10): Standard human counting system utilizing ten distinct digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 .
Binary System (Base 2): Native computer architecture utilizing two states: 0 (low voltage / off) and 1 (high voltage / on).
Octal System (Base 8): Compact notation utilizing eight digits: 0, 1, 2, 3, 4, 5, 6, 7 . Each octal digit maps to a 3-bit binary group ( 2 3 = 8 2^3 = 8 2 3 = 8 ).
Hexadecimal System (Base 16): Alphanumeric notation utilizing sixteen symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 followed by A (10), B (11), C (12), D (13), E (14), and F (15). Each hexadecimal digit maps to a 4-bit nibble ( 2 4 = 16 2^4 = 16 2 4 = 16 ).
- Decimal (Base 10) Binary (Base 2) Octal (Base 8) Hexadecimal (Base 16)
- 0 0000 0 0
- 1 0001 1 1
- 2 0010 2 2
- 3 0011 3 3
- 4 0100 4 4
- 5 0101 5 5
- 6 0110 6 6
- 7 0111 7 7
- 8 1000 10 8
- 9 1001 11 9
- 10 1010 12 A
- 11 1011 13 B
- 12 1100 14 C
- 13 1101 15 D
- 14 1110 16 E
- 15 1111 17 F
- Step-by-Step Base Conversion Techniques
- Technique A: Decimal to Binary (Successive Division by 2)
To convert a decimal integer to binary, divide repeatedly by the base (2) and record the integer remainders. Read remainders from the last division (Most Significant Bit - MSB) to the first (Least Significant Bit - LSB):
Worked Example: Convert Decimal 77 10 77_{10} 7 7 10 to Binary: 77 ÷ 2 = 38 Remainder: 1 ( LSB ) 77 \div 2 = 38 \quad \text{Remainder: } 1 \quad (\text{LSB}) 77 ÷ 2 = 38 Remainder: 1 ( LSB ) 38 ÷ 2 = 19 Remainder: 0 38 \div 2 = 19 \quad \text{Remainder: } 0 38 ÷ 2 = 19 Remainder: 0 19 ÷ 2 = 9 Remainder: 1 19 \div 2 = 9 \quad \text{Remainder: } 1 19 ÷ 2 = 9 Remainder: 1 9 ÷ 2 = 4 Remainder: 1 9 \div 2 = 4 \quad \text{Remainder: } 1 9 ÷ 2 = 4 Remainder: 1 4 ÷ 2 = 2 Remainder: 0 4 \div 2 = 2 \quad \text{Remainder: } 0 4 ÷ 2 = 2 Remainder: 0 2 ÷ 2 = 1 Remainder: 0 2 \div 2 = 1 \quad \text{Remainder: } 0 2 ÷ 2 = 1 Remainder: 0 1 ÷ 2 = 0 Remainder: 1 ( MSB ) 1 \div 2 = 0 \quad \text{Remainder: } 1 \quad (\text{MSB}) 1 ÷ 2 = 0 Remainder: 1 ( MSB )
Reading remainders bottom-to-top yields: 77 10 = 1001101 2 \mathbf{77_{10} = 1001101_2} 7 7 10 = 100110 1 2 .
Technique B: Binary to Decimal (Positional Expansion)
Multiply each binary digit by its corresponding positional weight ( 2 n 2^n 2 n , starting with n = 0 n=0 n = 0 from the extreme right): 1001101 2 = ( 1 × 2 6 ) + ( 0 × 2 5 ) + ( 0 × 2 4 ) + ( 1 × 2 3 ) + ( 1 × 2 2 ) + ( 0 × 2 1 ) + ( 1 × 2 0 ) 1001101_2 = (1 \times 2^6) + (0 \times 2^5) + (0 \times 2^4) + (1 \times 2^3) + (1 \times 2^2) + (0 \times 2^1) + (1 \times 2^0) 100110 1 2 = ( 1 × 2 6 ) + ( 0 × 2 5 ) + ( 0 × 2 4 ) + ( 1 × 2 3 ) + ( 1 × 2 2 ) + ( 0 × 2 1 ) + ( 1 × 2 0 ) = 64 + 0 + 0 + 8 + 4 + 0 + 1 = 77 10 = 64 + 0 + 0 + 8 + 4 + 0 + 1 = \mathbf{77_{10}} = 64 + 0 + 0 + 8 + 4 + 0 + 1 = 7 7 10
Technique C: Fast Binary to Octal & Hexadecimal Grouping
Binary to Octal: Partition binary bits into groups of 3 bits starting from the right (pad with leading zeros on the left if necessary) and write the decimal equivalent for each group: 001 ⏟ 1 001 ⏟ 1 101 ⏟ 5 ⟹ 115 8 \underbrace{001}_{1} \quad \underbrace{001}_{1} \quad \underbrace{101}_{5} \implies \mathbf{115_8} 1 001 1 001 5 101 ⟹ 11 5 8
Binary to Hexadecimal: Partition binary bits into groups of 4 bits starting from the right: 0100 ⏟ 4 1101 ⏟ 13 = D ⟹ 4 D 16 \underbrace{0100}_{4} \quad \underbrace{1101}_{13 = D} \implies \mathbf{4D_{16}} 4 0100 13 = D 1101 ⟹ 4 D 16
- 2. Binary Arithmetic & 2's Complement Representation
- Binary Addition Mechanics
Binary addition follows four fundamental bit-level rules: 0 + 0 = 0 0 + 0 = 0 0 + 0 = 0 0 + 1 = 1 0 + 1 = 1 0 + 1 = 1 1 + 0 = 1 1 + 0 = 1 1 + 0 = 1 1 + 1 = 0 ( with a Carry of 1 into the next higher column ) 1 + 1 = 0 \quad (\text{with a Carry of } 1 \text{ into the next higher column}) 1 + 1 = 0 ( with a Carry of 1 into the next higher column ) 1 + 1 + 1 = 1 ( with a Carry of 1 into the next higher column ) 1 + 1 + 1 = 1 \quad (\text{with a Carry of } 1 \text{ into the next higher column}) 1 + 1 + 1 = 1 ( with a Carry of 1 into the next higher column ) Carry: 1 1 1 1 1 1 1
- 1 0 1 1 0 1 1 (Decimal 91)
- + 0 1 1 0 1 1 1 (Decimal 55)
- ----------------
- 1 0 0 1 0 0 1 0 (Decimal 146)
Every one of the seven columns produces a carry, and the final carry becomes the eighth bit of the answer: 91 + 55 = 146 = 10010010 2 91 + 55 = 146 = 10010010_2 91 + 55 = 146 = 1001001 0 2 .
Signed Integers: 1's Complement & 2's Complement
Modern CPU ALUs perform arithmetic subtraction through addition using 2's Complement Notation , eliminating the need for dedicated subtractor circuits and avoiding dual representations of zero ( +0 and -0 ).
Step 1 (Find 1's Complement): Invert every individual bit in the binary word ( 0 becomes 1 , and 1 becomes 0 ).
Step 2 (Find 2's Complement): Add binary 1 to the 1's complement result: 2’s Complement = ( 1’s Complement ) + 1 \mathbf{\text{2's Complement} = (\text{1's Complement}) + 1} 2’s Complement = ( 1’s Complement ) + 1
Worked Example: Represent negative decimal − 29 -29 − 29 in an 8-bit signed binary register:
- Express + 29 +29 + 29 as an 8-bit binary number: 00011101
- Compute 1's Complement (invert all bits): 11100010
Add 1 to compute 2's Complement: 11100010 + 00000001 11100011 2 \begin{array}{rl} & 11100010 \\ + & 00000001 \\ \hline & \mathbf{11100011}_2 \end{array} + 11100010 00000001 11100011 2
(Verification: The leftmost bit is 1 , confirming a negative value. Weight: − 128 + 64 + 32 + 0 + 0 + 0 + 2 + 1 = − 29 -128 + 64 + 32 + 0 + 0 + 0 + 2 + 1 = -29 − 128 + 64 + 32 + 0 + 0 + 0 + 2 + 1 = − 29 ).
3. Digital Logic Gates & Master Truth Table
Digital logic gates are physical electronic circuits implementing fundamental Boolean logic functions: AND GATE OR GATE NOT GATE
- A ---+ A ---\ A ---|>o--- Y
- )--- Y )--- Y (Inverter)
- B ---+ B ---/
- NAND GATE NOR GATE XOR GATE
- A ---+ A ---\ A ---\ \
- )o-- Y )o-- Y )--- Y
- B ---+ B ---/ B ---/ /
AND Gate ( Y = A ⋅ B Y = A \cdot B Y = A ⋅ B ): Yields output 1 only if all inputs are 1 .
OR Gate ( Y = A + B Y = A + B Y = A + B ): Yields output 1 if at least one input is 1 .
NOT Gate / Inverter ( Y = A ‾ Y = \overline{A} Y = A ): Unary operator that outputs the inverse of the input.
NAND Gate ( Y = A ⋅ B ‾ Y = \overline{A \cdot B} Y = A ⋅ B ): Universal Gate. Inverted AND; yields output 0 only when all inputs are 1 .
NOR Gate ( Y = A + B ‾ Y = \overline{A + B} Y = A + B ): Universal Gate. Inverted OR; yields output 1 only when all inputs are 0 .
XOR Gate ( Y = A ⊕ B = A ‾ B + A B ‾ Y = A \oplus B = \overline{A}B + A\overline{B} Y = A ⊕ B = A B + A B ): Exclusive OR (Inequality Detector). Yields output 1 when inputs are different; yields 0 when inputs are identical.
XNOR Gate ( Y = A ⊕ B ‾ = A B + A ‾ B ‾ Y = \overline{A \oplus B} = AB + \overline{A}\overline{B} Y = A ⊕ B = A B + A B ): Exclusive NOR (Equivalence Detector). Yields output 1 when inputs are identical.
Input A Input B AND ( A ⋅ B A \cdot B A ⋅ B ) OR ( A + B A + B A + B ) NAND ( A ⋅ B ‾ \overline{A \cdot B} A ⋅ B ) NOR ( A + B ‾ \overline{A + B} A + B ) XOR ( A ⊕ B A \oplus B A ⊕ B ) XNOR ( A ⊕ B ‾ \overline{A \oplus B} A ⊕ B )
- 0 0 0 0 1 1 0 1
- 0 1 0 1 1 0 1 0
- 1 0 0 1 1 0 1 0
- 1 1 1 1 0 0 0 1
Important
Universal Logic Gates: NAND and NOR are designated as Universal Gates because any Boolean function (AND, OR, NOT, XOR, XNOR) can be constructed exclusively from NAND gates or exclusively from NOR gates without requiring any other gate type.
4. Flowchart Aptitude & Coded Algorithm Questions
Flowchart questions test whether you can trace decisions and loops step by step without skipping a branch. FLOWCHART SHAPE CONVENTIONS:
- [ Start / Stop ] ===> Oval / Rounded Rectangle (Terminal)
- / Input / Output / ===> Parallelogram (Data I/O Operations)
- [ Process ] ===> Rectangle (Arithmetic / Calculations)
- < Decision > ===> Diamond (Conditional Branch: Yes/No)
- | ===> Directed Arrow (Execution Flowline)
- Worked Example 1: A Decision Flowchart
- Consider this simple loan-screening flowchart: [ START ]
- |
- v
- / Input: Age, Balance, Score /
- |
- v
- < Is Age >= 21? > ----- No -----> [ REJECT ]
- | Yes
- v
- < Is Score >= 700? > ---- Yes ----> [ APPROVE ]
- | No
- v
- < Is Balance >= 50,000? > --- No -----> [ REJECT ]
- | Yes
- v
- [ MANUAL REVIEW ]
Problem Scenario: An applicant has Age = 24 , Balance = Rs. 65,000 and Score = 675 .
Decision 1: Is 24 ≥ 21 24 \ge 21 24 ≥ 21 ? Yes , so move to Decision 2.
Decision 2: Is 675 ≥ 700 675 \ge 700 675 ≥ 700 ? No , so move to Decision 3.
Decision 3: Is 65,000 ≥ 50,000 65{,}000 \ge 50{,}000 65 , 000 ≥ 50 , 000 ? Yes .
Outcome: The application goes to MANUAL REVIEW .
Worked Example 2: Tracing a Loop Counter [ START ] --> [ Sum = 0, i = 1 ] --> < Is i <= 5? > -- No --> / Print Sum / --> [ STOP ]
- | Yes
- v
- [ Sum = Sum + i x i ]
- |
- v
- [ i = i + 2 ]
- |
- +----> back to "Is i <= 5?"
- Pass Value of i at the decision Is i <= 5? Sum after the process box i after the update
- 1 1 Yes 0 + 1 = 1 3
- 2 3 Yes 1 + 9 = 10 5
- 3 5 Yes 10 + 25 = 35 7
- 4 7 No Loop ends —
Output: 35. The two usual errors are stopping one pass early (10) and adding one extra square (35 + 49 = 84). Write a trace table like this one for every loop question.
5. Generations of Computers
Generation Approximate period Main technology Characteristics Examples
First 1940s–1956 Vacuum tubes Very large, high power use and heat; machine language; punched cards and magnetic drums ENIAC, EDVAC, UNIVAC I
Second 1956–1963 Transistors Smaller, faster and more reliable; assembly language and early high-level languages such as FORTRAN and COBOL; magnetic core memory IBM 1401, IBM 7094
Third 1964–1971 Integrated circuits (ICs) Keyboards, monitors and operating systems; multiprogramming IBM System/360, PDP-8
Fourth 1971–present Microprocessors built with VLSI Personal computers, graphical user interfaces, networking and the internet Intel 4004, IBM PC, Apple Macintosh
Fifth Present and beyond ULSI, parallel processing and artificial intelligence Natural language processing, machine learning and voice recognition AI systems and modern supercomputers
Textbooks differ slightly on the year boundaries, so learn the technology that defines each generation.
Milestones Worth Remembering
Charles Babbage designed the Analytical Engine in 1837 and is called the father of the computer; Ada Lovelace is often described as the first computer programmer.
The transistor was invented at Bell Laboratories in 1947 by John Bardeen, Walter Brattain and William Shockley.
The integrated circuit was developed independently by Jack Kilby (Texas Instruments, 1958) and Robert Noyce (Fairchild Semiconductor, 1959).
The Intel 4004 (1971) was the first commercially available single-chip microprocessor.
PARAM 8000 , built by C-DAC in 1991, is regarded as India's first supercomputer.
Computers by Size and Power
Supercomputers: the fastest machines, used for weather forecasting and scientific simulation.
Mainframes: large systems that handle huge transaction volumes for many simultaneous users, such as a bank's central processing.
Minicomputers: mid-sized multi-user systems.
Microcomputers: personal computers, laptops, tablets and smartphones built around a microprocessor.
6. Database Management System (DBMS) Basics
A DBMS is software for storing, retrieving and managing data; a Relational DBMS (RDBMS) stores data in related tables. Examples include Oracle Database, MySQL, Microsoft SQL Server and PostgreSQL.
Relational Terms
- Term Meaning Banking example
- Relation (table) Data organised in rows and columns CUSTOMER table
- Tuple (record or row) One entry in a table One customer's details
- Attribute (field or column) One property of the entity Customer_ID, Name, PAN
- Degree Number of attributes (columns) A table with 6 columns has degree 6
- Cardinality Number of tuples (rows) A table with 10,000 customers has cardinality 10,000
- Domain Set of allowed values for an attribute Account type: Savings or Current
- Types of Keys
- Key Definition Example
- Super key Any set of attributes that uniquely identifies a record {Customer_ID, Name}
- Candidate key A minimal super key; a table can have several Customer_ID, or PAN
Primary key The candidate key chosen as the main identifier; values must be unique and cannot be NULL Customer_ID
Alternate key A candidate key not chosen as the primary key PAN
Foreign key An attribute that refers to the primary key of another table, enforcing referential integrity; its values can repeat Customer_ID stored in the ACCOUNT table
- Composite key A key made of two or more attributes together {Account_No, Txn_No}
- SQL Command Categories
- Category Purpose Commands
- DDL (Data Definition Language) Defines or changes table structure CREATE, ALTER, DROP, TRUNCATE
- DML (Data Manipulation Language) Changes the data in tables INSERT, UPDATE, DELETE
- DQL (Data Query Language) Retrieves data; often grouped with DML SELECT
- DCL (Data Control Language) Grants or removes access rights GRANT, REVOKE
- TCL (Transaction Control Language) Manages transactions COMMIT, ROLLBACK, SAVEPOINT
DELETE removes selected rows and can be rolled back before a commit; TRUNCATE removes all rows and is treated as DDL; DROP removes the table itself.
ACID Properties of a Transaction
Take a transfer of Rs. 5,000 from Account A to Account B:
Atomicity: The debit to A and the credit to B both happen, or neither does.
Consistency: The database moves from one valid state to another; the combined balance stays the same.
Isolation: Simultaneous transactions do not interfere with each other.
Durability: Once committed, the transfer survives a system crash or power failure.
7. Character Codes and High-Frequency Abbreviations
ASCII is a 7-bit code with 128 characters; extended ASCII uses 8 bits for 256 characters.
EBCDIC is an 8-bit character code developed by IBM for its mainframes.
Unicode assigns a unique code to characters across the world's writing systems, including Indian scripts.
- Abbreviation Full form
- ASCII American Standard Code for Information Interchange
- EBCDIC Extended Binary Coded Decimal Interchange Code
- BIOS Basic Input/Output System
- CMOS Complementary Metal-Oxide-Semiconductor
- GUI Graphical User Interface
- URL Uniform Resource Locator
- HTML HyperText Markup Language
- ISP Internet Service Provider
- VPN Virtual Private Network
- MODEM Modulator-Demodulator
- SQL Structured Query Language
- IoT Internet of Things
- SaaS / PaaS / IaaS Software / Platform / Infrastructure as a Service
- CAPTCHA Completely Automated Public Turing test to tell Computers and Humans Apart
- UPS Uninterruptible Power Supply
- USB Universal Serial Bus
- COBOL Common Business-Oriented Language
- FORTRAN Formula Translation
- Common Traps
Octal groups binary digits in threes ; hexadecimal groups them in fours .
2's complement is the 1's complement plus 1 .
NAND and NOR are universal gates; XOR and XNOR are not.
A foreign key can repeat and can be NULL; a primary key can do neither.
TRUNCATE is DDL, while DELETE is DML.