Fundamentals of Digital Logic Design and Entrepreneurship

Flashcards covering the fundamentals of digital logic design from binary systems, Boolean algebra and functions, logic gates and circuits, sequential circuits including latches and flip-flops, counters, digital systems, computer hardware and software basics, and insights into entrepreneurship theory and its application.

Binary Number

A positional number system using base 2 with digits 0 and 1; a string of n bits can represent 2ⁿ different pieces of information.

Decimal Number

A positional number system using base 10 with digits from 0 to 9; each digit's value depends on its position.

Octal Number System

A positional number system using base 8; binary numbers can be grouped into sets of three bits for octal conversion.

Hexadecimal Number System

A positional number system using base 16, digits 0-9 and letters A-F; binary numbers can be grouped into sets of four bits for hexadecimal conversion.

Binary Coded Decimal (BCD)

An encoding of decimal numbers where each decimal digit is represented by its binary equivalent; only 4-bit binary numbers 0000 to 1001 are used.

Logic Gate

An electronic circuit implementing a logical operation on one or more binary inputs to produce a binary output, e.g., AND, OR, NOT.

AND Gate

Logic gate that outputs 1 only if all inputs are 1, otherwise 0; denoted as multiplication or dot (.) in Boolean algebra.

OR Gate

Logic gate that outputs 1 if at least one input is 1; denoted as '+' in Boolean algebra.

NOT Gate (Inverter)

Logic gate that outputs the logical complement of the input; the opposite value (0 becomes 1, and 1 becomes 0).

NAND Gate

Derived from an AND gate followed by a NOT gate; outputs the complement of the AND operation.

NOR Gate

Derived from an OR gate followed by a NOT gate; outputs the complement of the OR operation.

XOR Gate (Exclusive OR)

Outputs 1 if the inputs are different, 0 if the inputs are the same; defined as x ⊕ y = x y' + x' y.

XNOR Gate (Exclusive NOR)

Outputs 1 if the inputs are the same, 0 if the inputs are different; inverse of XOR.

Boolean Algebra

A mathematical system for logical operations with values 0 and 1 and operations AND, OR, NOT, governed by specific axioms and theorems.

DeMorgan’s Theorem

Two fundamental Boolean algebra theorems: ¬(x + y) = ¬x ¬y and ¬(xy) = ¬x + ¬y, useful in simplification of logical expressions.

Sum-of-Products

A Boolean function expressed as an OR (sum) of multiple AND (product) terms that represent 1-minterms where the function outputs 1.

Product-of-Sums

A Boolean function expressed as an AND (product) of multiple OR (sum) terms that represent 0- maxterms where the function outputs 0.

Minterm

A product term in Boolean algebra that includes all variables in true or complemented form representing exactly one input combination giving output 1.

Maxterm

A sum term in Boolean algebra that includes all variables in true or complemented form representing exactly one input combination giving output 0.

Sum-of-Minterms

A sum-of-products expression where the function is the OR of all minterms that produce output 1.

Product-of-Maxterms

A product-of-sums expression where the function is the AND of all maxterms that produce output 0.

S-R Latch

A bistable circuit using two NAND or NOR gates with Set and Reset inputs to store one bit and maintain state until changed.

D Latch

A latch derived from S-R latch with an inverter on the Set or Reset input preventing invalid states; input D controls output directly when enabled.

Flip-Flop

A bistable memory element built from latches that changes state synchronized to clock signals’ edges.

Master-Slave Flip-Flop

A flip-flop design using two latches controlled by opposite phases of the clock signal enabling edge-triggered behaviour.

T Flip-Flop

A flip-flop variant that toggles its state (0 to 1 or 1 to 0) on each clock edge when input is asserted; useful in counters.

Asynchronous (Ripple) Counter

A binary counter where each flip-flop is clocked by the output of the previous flip-flop; changes ripple through with cumulative delay.

Synchronous Counter

A binary counter where all flip-flops are clocked simultaneously by a common clock, improving speed and synchronization.

Von Neumann Architecture

A computer system design comprising CPU with control, arithmetic/logic unit, registers, memory, input/output devices and communication buses.

Hardware

Tangible physical components of a computer system such as CPU, memory, peripherals, motherboard, storage media.

Software

Set of instructions or codes that control computer functions; includes application, system software, OS, and utilities.

Microchip (Integrated Circuit)

An electronic component consisting of a silicon slab etched with millions of transistors and other elements to function as circuit switches.

Moore’s Law

Observed prediction that the number of transistors on a microchip doubles about every two years, driving technology miniaturization and performance.

Computer Network

A system where multiple computers and devices are interconnected to share data, resources and services.

Peripheral Devices

Non-core computer hardware attached externally such as keyboards, mice, monitors, printers, scanners, and speakers.

Data Structure

An organized way of storing and processing data in memory for efficient access and manipulation, including arrays, stacks, queues, lists, trees, graphs.

Queue (FIFO)

A linear data structure where elements are inserted at the rear and removed from the front, following First-In-First-Out rule.

Stack (LIFO)

A linear data structure where elements are inserted and removed from the top, following Last-In-First-Out rule.

Bubble Sort

A simple sorting algorithm that repeatedly swaps adjacent out-of-order elements until the list is sorted; has O(n²) complexity.

Insertion Sort

A sorting algorithm that builds the sorted list one item at a time by inserting elements into their correct position; stable with O(n²) worst case.

Selection Sort

A sorting algorithm that selects the minimum element and places it in the correct position, with O(n²) complexity.

Merge Sort

A divide-and-conquer sorting algorithm that recursively divides the list and merges sorted parts; O(n log n) complexity.

Algorithm

A finite step-by-step procedure to achieve a required result with defined space and time complexity.

Dynamic Programming

A bottom-up algorithmic technique solving optimization problems by breaking them into subproblems and avoiding redundant computations.

Eigenvalue and Eigenvector

Eigenvalue is a scalar for which a non-zero vector x satisfies Tx = λx for a linear operator T; x is the corresponding eigenvector.

Characteristic Polynomial

Polynomial det(tI - A) whose roots are the eigenvalues of matrix A or linear operator T.

Minimal Polynomial

The unique monic polynomial of least degree satisfied by a linear operator T or matrix A; divides characteristic polynomial.

Software Crisis

The difficulties and failures in software development due to complexity, poor planning, inadequate communication, and maintenance burdens.

System Analysis

The process of gathering, interpreting facts and developing recommendations to improve or design an information system.

System Design

The planning process detailing how to meet system objectives identified in analysis including hardware, software, inputs, outputs, and controls.

Preliminary Investigation

The initial study of a proposed system request to clarify requirements and determine feasibility.

Cost-Benefit Analysis

A method to estimate and compare costs and benefits of a system to evaluate its feasibility and justify investment.

Data Flow Diagram (DFD)

A graphical tool modeling the flow of data within a system, showing processes, data stores, external entities and data flows.

Data Dictionary

A store of metadata giving definitions, attributes and relationships of data elements used in the system analysis and design.

Hierarchy plus Input Process Output (HIPO)

A top-down diagramming method used to describe system modules with their inputs, processes and outputs.

Warnier-Orr Diagram

A left-to-right diagram showing the hierarchical decomposition of system modules by grouping related elements.

Nassi-Shneidermann Chart

A structured programming diagram showing sequence, decision and iteration, alternative to flowcharts and pseudocode.

System Implementation

The phase encompassing training personnel, conversion from old to new systems, post-implementation review and maintenance.

Systems Analyst

A person responsible for studying a business system, analyzing problems and designing solutions involving computerization