What is a bit?
A bit is a binary digit with one of two values: or .
Study 6 Data Representation with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is a bit?
A bit is a binary digit with one of two values: 0 or 1.
How many bit patterns can one byte represent?
A byte contains eight bits and can represent 28=256 possible bit patterns.
Convert 001011012 to decimal.
001011012=4510, because 32+8+4+1=45.
How many patterns can an n-bit value represent?
An n-bit value can represent 2n different bit patterns.
What is the difference between big-endian and little-endian storage?
In big-endian storage, the most significant byte comes first; in little-endian storage, the least significant byte comes first.
What range does an n-bit unsigned integer represent?
The range is 0 to 2n−1. For eight bits, that is 0–255.
How is a negative value formed in two’s complement?
Invert every bit of the positive value, then add 1. For eight-bit +5, this produces 11111011, or −5.
What does floating-point representation store?
Floating-point representation stores a sign, a significant portion, and a scale or exponent, allowing a wide range of values.
What does a Boolean value represent?
A Boolean represents a logical condition with two states: true and false. It can often be stored as 0 for false and 1 for true.
How does ASCII represent the character A?
ASCII assigns numeric codes to common English characters; uppercase A has decimal code 65, or binary 01000001.
How do Unicode and UTF-8 differ?
Unicode assigns code points to characters across many languages and symbol systems. UTF-8 encodes each code point as one to four bytes.
What distinguishes a nibble from a byte?
A nibble is four bits; a byte is eight bits.
A progressive guide to how computers encode numbers, text, images, and sound as binary data, including the trade-offs and limits of digital representation.
A 14-question medium-difficulty quiz on Boolean algebra, logic gates, truth tables, and combinational circuits.
A focused set of flashcards covering Python variables, data types, expressions, control flow, functions, input, output, and common programming practices.
A structured guide to the main data structures, their operations, efficiency trade-offs, representations, and practical selection criteria.
Learn how computer memory stores and addresses information, how RAM and ROM differ, and how caches and the memory hierarchy balance speed, capacity, and cost.
A progressive guide to tree structure, binary-tree traversals, binary search tree operations, deletion, balancing, and the way tree height determines time and space costs.
A focused review of propositional logic, quantifiers, sets, relations, functions, and foundational proof methods in discrete mathematics for computer science.
A progression through how data is organized, searched, exposed through software interfaces, and managed through abstraction layers in modern computer systems.
A medium-difficulty quiz on integrating problem definition, representation, algorithms, complexity analysis, testing, correctness, ethical evaluation, and documentation in a computer science capstone.
A practical guide to integrating problem definition, data representation, modular programming, algorithms, complexity analysis, testing, correctness, and ethical evaluation into a responsible computer science capstone.
This quiz covers process management, context switching and scheduling, multitasking, traps and interrupts, and RISC-V privilege transitions.