0 views collected around this technical thread.
Understanding the underlying assumptions—whether humans are rational economic agents, emotion‑driven animals, socially constructed beings, gene‑driven organisms, or information processors—reveals why different disciplines model decision‑making differently and highlights each perspective’s insights and limitations.
Given unlimited time and memory, any computing device—from supercomputers to smartphones—can execute the same set of tasks, differing only in speed and resources, because a system that can simulate a Turing machine is Turing‑equivalent, making all Turing‑complete languages capable of solving any computable problem, with only efficiency or code length varying.
When a computer powers on, the CPU first runs firmware stored in ROM (BIOS or UEFI) that performs hardware checks, locates the boot device, loads the 512‑byte MBR containing a first‑stage bootloader, which then loads a more capable second‑stage loader that finally loads the operating system kernel into memory, after which the OS completes its own initialization and begins handling user programs.
This article classifies sorting algorithms into internal, external, comparison, and non‑comparison types, discusses stability and time‑complexity, and provides clear Python implementations with examples for Bubble Sort, Selection Sort, Insertion Sort, Shell Sort, Merge Sort, Quick Sort, Heap Sort, Counting Sort, Bucket Sort, and Radix Sort.
Tencent engineers recommend nine classic computer‑science books—ranging from Hamming’s The Art of Doing Science and Engineering to Kleppmann’s Designing Data‑Intensive Applications and Bryant & O’Hallaron’s Computer Systems: A Programmer’s Perspective—to help software engineers deepen theory, improve practice, and gain fresh insights, with a giveaway for commenters.
Rob Pike and Ken Thompson devised UTF‑8 in 1992 at Bell Labs, turning a three‑day prototype into the web’s dominant Unicode encoding by using a variable‑length, ASCII‑compatible, length‑prefixed and prefix‑free scheme that maximizes efficiency, robustness, and universal adoption across more than 96 % of sites.
This article surveys the evolution of programming languages from the 1940s to the 2000s, highlighting key milestones, the emergence of language families, and how modern languages like Java and C# inherit features from earlier pioneers such as FORTRAN, Lisp, and Algol.
This article surveys the various kinds of numbers—natural, integers, rational, irrational, real, complex, hypercomplex, vectors, matrices, and tensors—explaining their definitions, mathematical significance, and practical applications in fields such as computer science, engineering, physics, graphics, and machine learning.
The article offers a candid, experience‑based guide on which computer‑science topics are truly valuable for most undergraduate students, contrasting essential fundamentals with industry‑focused frameworks and emphasizing pragmatic skill acquisition for job readiness while acknowledging the role of deeper theoretical study for those pursuing research.
This comprehensive guide equips computer‑science students and professionals with essential habits and a curated toolbox—including advanced Google search, English communication, GitHub, StackOverflow, Markdown/LaTeX, macOS‑centric development utilities, collaboration platforms, and effective time‑management techniques—to boost productivity, professionalism, and lifelong learning.
This book explores fundamental computer science concepts including programming language execution, compiler operations, memory allocation mechanisms, and system architecture through accessible explanations and practical examples.
This article presents a comprehensive overview of the most influential figures in computer science—from the founding fathers like Turing and Shannon to modern innovators such as Linus Torvalds, Jeff Dean, and leading entrepreneurs—illustrating their contributions, affiliations, and the hierarchical tiers of programmers in the industry.
This article presents a curated collection of 69 frequently asked algorithm and data‑structure interview questions, each accompanied by concise English explanations, solution ideas, and illustrative diagrams to help readers master core programming concepts and improve their interview performance.
This article profiles fourteen of the most renowned programmers worldwide, detailing their reputations, major achievements, and how the tech community perceives them, with each entry highlighting their contributions to software development, algorithms, open‑source projects, and computing history.
This article provides a concise overview of eight essential data structures—arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs—explaining their definitions, core operations, and typical applications in software development and computer science.
This article provides a comprehensive visual guide to ten fundamental data structures—including arrays, linked lists, skip lists, stacks, queues, trees, heaps, hash tables, and graphs—explaining their concepts, characteristics, and typical use cases for programmers and interview preparation.
This article introduces the concepts, implementation steps, and key ideas behind several classic sorting algorithms—including bubble, selection, insertion, quick, merge, heap, shell, and radix sort—as well as a brief review of fundamental data structures and recursion techniques, providing clear explanations and code outlines for each.
This article reflects on why foundational computer‑science topics such as operating systems, databases, and networking are essential, describing their practical skill value, their role in shaping technical thinking, and the spiral learning process that deepens a programmer’s expertise over a career.
This article presents concise biographies of ten influential computer scientists, highlighting their groundbreaking algorithms, programming language innovations, award recognitions, and lasting impact on the fields of algorithms, data structures, and computer science fundamentals.
The article recounts the author’s progression from a curious high‑school student to a seasoned computer scientist through Dartmouth’s quarter‑system curriculum, detailing hands‑on Java, Haskell, C projects, AI and topology courses, and the rigorous academic culture that shaped his career.