Representing and Manipulating Information in modern computer - Part 1
As most of you might already know computer can only understand, store and process on a bit(0 and 1).
But why?
Well it turns out, two-valued signals can readily be represented, stored, and transmitted easily and more reliably than traditional base 10 number representation — for example, as the presence or absence of a hole in a punched card, as a high or low voltage on a wire, or as a magnetic domain oriented clockwise or counterclockwise, etc.
Morever, a single bit is usually not very helpful in representing anything meaningful in computer but once we combine a sequence of bits, we can represent any finite set. for example, we can encode bits into negative/nonnegative and floating numbers and also can encode the letters and symbols in a document. This is why(or maybe not) we use 8bits or a byte as the smallest addressable unit of memory. In binary notation, its value ranges from 00000000 to 11111111. When viewed as a decimal integer, its value ranges from 0 to 255 and in hexadecimal it ranges from 00 to FF. We usually write bit patterns as hexadecimals(0 - 9, A - F) because it is easy for us to convert to/from binary notations.
In C programming language, numeric constants starting with 0x or 0X are interpreted as being in hexadecimal. The characters ‘A’ through ‘F’ may be written in either upper - or lowercase. For example, we could write the number FA1D37B as 0xFA1D37B, as 0xfa1d37b, or even mixing upper - and lower case (e.g., 0xFa1D37b).
Okay lets cover one more thing,
Data sizes
Some CS terms ahead!!!
Virtual memory - A conceptual large array of bytes in memory(there is more to it but it will come later in the series)
Memory Address - A unique number used to identify a byte of memory.
Virtual memory space - The set of all possible memory addresses(more will come later).
Word size - The nominal size of pointer data or maximum size of virtual memory address.
Today's computers are of either 32-bit or 64-bit word size which means programs can have access a range from 0 to 2^32 - 1(incase of 32-bit) and 0 to 2^64 - 1(incase of 64-bit) of virtual addresses. Most of the programs compiled in 64-bit machines can be run on 32-bit machines as well but vice-versa is not true.
Computers and compilers support multiple data formats using different ways to encode data, such as integers and floating point, as well as different lengths. For example, many machines have instructions for manipulating single bytes, as well as integers represented as 2-, 4-, and 8-byte quantities. They also support floating-point numbers represented as 4- and 8-byte quantities. The exact numbers of bytes for some data types depends on how the program is compiled. I showed sizes for typical 32-bit and 64-bit programs below:
To avoid confusion between bitness of the machine and compiler settings, ISO C99 introduced some datatypes where datasizes are fixed regardless of compiler or machine settings. As you can see in the above screenshot, int32_t and int64_t are among thems. Using fixed-size integer types is the best way for programmers to have close control over data representations.
Before signing off - We should try to write code which can be portable to different machines and compilers. One aspect of portability is to make the program insensitive to the exact sizes of the different data types. With the transition to 64-bit machines, many hidden word size dependencies have arisen as bugs in migrating 32-bit programs to new machines. For example, many programmers historically assumed that an object declared as type int could be used to store a pointer. This works fine for most 32-bit programs, but it leads to problems for 64-bit programs because as discussed above the word size or pointer size of 32-bit and 64-bit machine will be different.
Okay. that's all for today. Thank you.
Ref: Computer Systems: A Programmer's perspective.
The above is the detailed content of Representing and Manipulating Information in modern computer - Part 1. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.

The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.

C language functions are the basis for code modularization and program building. They consist of declarations (function headers) and definitions (function bodies). C language uses values to pass parameters by default, but external variables can also be modified using address pass. Functions can have or have no return value, and the return value type must be consistent with the declaration. Function naming should be clear and easy to understand, using camel or underscore nomenclature. Follow the single responsibility principle and keep the function simplicity to improve maintainability and readability.

The C language function name definition includes: return value type, function name, parameter list and function body. Function names should be clear, concise and unified in style to avoid conflicts with keywords. Function names have scopes and can be used after declaration. Function pointers allow functions to be passed or assigned as arguments. Common errors include naming conflicts, mismatch of parameter types, and undeclared functions. Performance optimization focuses on function design and implementation, while clear and easy-to-read code is crucial.

The calculation of C35 is essentially combinatorial mathematics, representing the number of combinations selected from 3 of 5 elements. The calculation formula is C53 = 5! / (3! * 2!), which can be directly calculated by loops to improve efficiency and avoid overflow. In addition, understanding the nature of combinations and mastering efficient calculation methods is crucial to solving many problems in the fields of probability statistics, cryptography, algorithm design, etc.

C language functions are reusable code blocks. They receive input, perform operations, and return results, which modularly improves reusability and reduces complexity. The internal mechanism of the function includes parameter passing, function execution, and return values. The entire process involves optimization such as function inline. A good function is written following the principle of single responsibility, small number of parameters, naming specifications, and error handling. Pointers combined with functions can achieve more powerful functions, such as modifying external variable values. Function pointers pass functions as parameters or store addresses, and are used to implement dynamic calls to functions. Understanding function features and techniques is the key to writing efficient, maintainable, and easy to understand C programs.

Algorithms are the set of instructions to solve problems, and their execution speed and memory usage vary. In programming, many algorithms are based on data search and sorting. This article will introduce several data retrieval and sorting algorithms. Linear search assumes that there is an array [20,500,10,5,100,1,50] and needs to find the number 50. The linear search algorithm checks each element in the array one by one until the target value is found or the complete array is traversed. The algorithm flowchart is as follows: The pseudo-code for linear search is as follows: Check each element: If the target value is found: Return true Return false C language implementation: #include#includeintmain(void){i

C language multithreading programming guide: Creating threads: Use the pthread_create() function to specify thread ID, properties, and thread functions. Thread synchronization: Prevent data competition through mutexes, semaphores, and conditional variables. Practical case: Use multi-threading to calculate the Fibonacci number, assign tasks to multiple threads and synchronize the results. Troubleshooting: Solve problems such as program crashes, thread stop responses, and performance bottlenecks.
