What are a bit and a byte?
A bit is one binary digit, either 0 or 1. A byte is a group of 8 bits.
Study 1 Binary Representation and Data with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What are a bit and a byte?
A bit is one binary digit, either 0 or 1. A byte is a group of 8 bits.
How do binary place values work?
Binary is base 2, so each position represents a power of 2. For example, 1011012=4510.
How does one hexadecimal digit relate to binary?
Each hexadecimal digit corresponds to exactly 4 bits, making hexadecimal a compact way to write binary.
Convert 110110102 to hexadecimal.
1101 is D16, and 1010 is A16. Therefore, 110110102=DA16.
What is the range of an unsigned n-bit integer?
An unsigned n-bit integer ranges from 0 to 2n−1, inclusive.
What values can an 8-bit unsigned integer represent?
An 8-bit unsigned integer ranges from 0 through 255.
What is the range of an n-bit two’s-complement integer?
An n-bit two’s-complement integer ranges from −2n−1 to 2n−1−1, inclusive.
How can you form a two’s-complement negative value?
Invert the bits of the positive value, then add 1. For example, 000001012 becomes 111110112.
What value does 111110112 represent as an 8-bit two’s-complement integer?
In 8-bit two’s complement, 111110112 equals −5: its leftmost bit contributes −128, and the other bits sum to 123.
How can 111111112 have two different integer values?
The same pattern has different values by convention: 111111112 is 255 unsigned and −1 as an 8-bit two’s-complement integer.
Do bit patterns have fixed meanings on their own?
Bits have no inherent meaning. A format or program determines whether a pattern represents a number, text, or another kind of data.
What ASCII value represents uppercase A?
ASCII assigns numeric values to a limited set of characters. Uppercase A has value 65, or 0x41.
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.
A progressive guide to measuring algorithmic time and memory requirements, interpreting asymptotic bounds, analyzing common code patterns, and balancing performance trade-offs.
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.