Three European Turing Award laureates—Niklaus Wirth, Edsger Dijkstra, and Tony Hoare—revolutionized programming with innovations like Pascal, the shortest‑path algorithm, and structured programming concepts, leaving a lasting legacy that still influences modern languages, compilers, and software engineering practices.
The article reflects on the deep joy and philosophical significance of programming, comparing it to creating a personal universe, and explores how understanding computer science parallels physics while emphasizing creativity, problem‑solving, and the ultimate challenge of building operating systems.
This article chronicles the evolution of artificial intelligence over eight decades, spotlighting seminal figures such as Alan Turing, Allen Newell, Marvin Minsky, John McCarthy, Yoshua Bengio, Geoffrey Hinton, Andrew Ng and Yann LeCun, and explains how their groundbreaking work shaped modern AI.
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.
This article profiles five renowned programmers—Ada Lovelace, Grace Hopper, Larry Page & Sergey Brin, Guido van Rossum, and Tim Berners‑Lee—detailing their early backgrounds, key achievements, and the challenges they overcame, offering insights for aspiring developers.
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.
This article explores the lives of pioneering programmers—from Ada Lovelace to Linus Torvalds—and distills ten essential traits that define outstanding developers, offering both historical insight and practical guidance for modern software engineers.
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.
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.
From March 23‑24, 2024, nearly 200 university computer‑science teachers from 74 Chinese campuses gathered in Hangzhou for a two‑day advanced training hosted by the Ministry of Education and Huawei, covering AI, cloud, EDA, OpenHarmony, and industry‑academia collaboration through expert lectures, hands‑on labs, and panel discussions.
During his 2023 'Growth' speech, Lei Jun recalled his 1992 university paper on a computer virus detection expert system—once a pioneering AI approach published in *Computer Research and Development*—which resurfaced online after 30 years, sparking admiration for its forward‑thinking security insights.
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.
A former top‑tier computer science graduate shares a candid, data‑driven analysis of why the field may not be as lucrative or stable as it appears, covering salary myths, career longevity, gender imbalance, health risks, and who might still benefit from studying CS.
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 essay explores how focusing on enduring abstract models rather than transient knowledge, drawing from philosophy, mathematics, and computer science, can guide a more meaningful and adaptable learning journey.
The article reflects on the rise and fall of China's internet boom, compares the career prospects of computer science and civil engineering, and argues that despite recent layoffs, computer science remains a strong, versatile field for those who truly enjoy programming and problem‑solving.
The article reflects on the massive layoffs in the internet sector, examines the golden decade of China's online boom, compares the rise and fall of computer science and civil engineering careers, and offers practical advice for anyone considering a switch to or staying in the tech field.
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 traces the pivotal role of mathematics from the 18th‑century golden age of classical mechanics through Maxwell's equations, Einstein's relativity, biological modeling, game‑theoretic economics, the birth of modern computers, and the emergence of chaos and fractal theory, highlighting key figures and breakthroughs that linked abstract theory to real‑world applications.
Jeff Erickson, a veteran UIUC professor, has compiled his 20‑year lecture notes into a free 448‑page algorithm textbook covering recursion, dynamic programming, greedy methods, graph algorithms, NP‑hard problems and more, which has quickly become a hit among computer science students worldwide.
A former top‑university coder shares personal anecdotes, career timelines, and extensive salary data to examine why many people hesitate to choose computer science, highlighting issues of job stability, social status, health risks, and the lucrative but demanding nature of the field.
This article traces the 50‑year legacy of the C programming language, its creator Dennis Ritchie, the birth of Unix, their profound influence on modern operating systems and software development, and how their simple, portable design continues to shape today’s technology landscape.
This article explains what an algorithm is, outlines its three essential properties, and introduces ten foundational computer algorithms—including sorting methods, Fourier transforms, Dijkstra's shortest‑path, RSA encryption, hash functions, factorization, link analysis, PID control, data compression, and random‑number generation—highlighting their historical origins and real‑world impact.
The article discusses how the booming internet industry has made computer science the most popular major, examines the lower but possible chances for non‑elite school graduates to receive offers from top tech firms, and offers practical advice on choosing between graduate study and entering the workforce.
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.
An illustrated guide walks readers through the fundamentals of red‑black trees, explaining binary search tree basics, their limitations, and the red‑black tree’s balancing operations—including node rotations, insertion, and deletion cases—while providing complete source code tested with massive random operations.
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 chronicles the overlooked history of Chinese university computer departments, detailing their early establishment dates, key figures, institutional changes, and the broader significance of these milestones for the development of computer education in China.
This article compiles a comprehensive checklist of technical and soft‑skill competencies—ranging from algorithm practice and data‑structure implementation to networking, OS, compiler knowledge, project experience, English proficiency, and information‑gathering—that can help a recent computer‑science graduate secure a high‑paying job in major Chinese tech hubs.
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.
The article commemorates the passing of Turing Award laureate Edmund M. Clarke, detailing his pioneering work on model checking, his distinguished academic career at Carnegie Mellon, numerous honors, and the lasting impact of his formal verification methods on both hardware and software engineering.
A comprehensive look at Chinese computer science graduates reveals that while the field enjoys high employment rates and impressive average salaries—especially for top universities and advanced degrees—individual earnings vary widely, and demanding work conditions raise concerns about sustainability.
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 explains what an algorithm is, outlines its essential properties, traces its historical roots, and introduces ten pivotal algorithms—from sorting and Fourier transforms to RSA, hash functions, and random number generators—that underpin today’s digital world.
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.
The article chronicles Vint Cerf’s battle with COVID‑19, his pioneering work on TCP/IP with Bob Kahn, his extensive academic and industry career, and the numerous honors that recognize his lasting impact on the development and security of the modern Internet.
This article profiles fourteen of the most renowned programmers worldwide, detailing their reputations, key achievements, and memorable quotes that illustrate why they are celebrated as legends in software development and computer science.
This article traces Unix’s half‑century evolution from a failed Multics project at Bell Labs, through the resource‑scarce PDP‑7 experiments that birthed UNICS, to its legacy in BSD, Linux and ultimately the Android and iOS operating systems that power modern smartphones.
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 explores the true meaning of a programmer, outlines the essential knowledge structure, discusses learning desire and ability, and provides practical methods for mastering new technologies, reading source code, and building a solid foundation in computer fundamentals and career planning.
This article profiles the ten most influential algorithm and computer‑science pioneers, detailing their groundbreaking contributions, landmark publications, major awards, and lasting impact on modern computing and algorithmic research.
This personal essay shares a computer‑science student’s journey—from discovering coding’s universal relevance, through rigorous university courses and internships, to practical advice on building fundamentals, debugging, side projects, and balancing effort—to help anyone master programming and advance their career.
The article uses Thanos’ snap from the Avengers movies as a springboard to explain the concepts of randomness, compare true and pseudo random numbers, describe a layered sampling model, discuss hardware true random generators, and show how Java provides various APIs for generating random values.
The article uses Thanos' snap from the Avengers to examine the concept of randomness, compares true random numbers with pseudo‑random generators, explains quantum random number generators, and demonstrates how Java provides various APIs for generating random values, highlighting their strengths and limitations.
Explore the 25 most essential computer science interview questions, covering core concepts from hardware and operating systems to networking, software development, AI, and security, with concise answers designed to help aspiring developers and IT professionals ace technical interviews.
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.
Guide2Research has released a real‑time ranking of the top 1,000 computer science and electronics scholars worldwide based on H‑index, highlighting the leading researchers, especially those dominating the AI and machine learning fields.
This article compiles a comprehensive set of NetEase interview questions covering computer science fundamentals, networking, operating systems, Linux commands, databases, and short‑answer problems, providing candidates with a practical resource to assess and improve their technical knowledge.
This article introduces the fundamental counting principles—classification addition and stepwise multiplication—explaining their concepts, formulas, conditions, and real-world examples such as travel route choices, while comparing their similarities and differences and highlighting their importance in mathematics and computer science.
This comprehensive guide explains fundamental data structures—including linked lists, stacks, queues, various tree types, binary indexed trees, segment trees, heaps, hash tables, and graphs—detailing their definitions, variants, typical operations, and time‑complexity characteristics for efficient algorithm design.
This article defines artificial intelligence as a branch of computer science that aims to simulate and extend human intelligence, outlines its key research areas such as robotics and natural language processing, and presents a detailed visual timeline from TalkingData that charts the technology’s major milestones.
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.
This article traces the evolution of programming languages from the early 1950s regional assembly language to modern languages like Go and Dart, highlighting key milestones, influential predecessors, and the continual innovation that has produced over 250 distinct languages.
This article profiles ten influential computer scientists and innovators—from Donald Knuth and Edsger Dijkstra to John Backus and Tony Hoare—highlighting their groundbreaking contributions, awards, and lasting impact on algorithms, programming languages, and the evolution of computer science.
Databases originated in the 1960s‑1990s when the United States consolidated wartime intelligence into computer‑stored Data Bases, and a review of their development from 1962 to 2016 reveals a relentless stream of technological breakthroughs that continuously enrich everyday life.
This article profiles twelve influential programmers—from Ada Lovelace to Linus Torvalds—detailing their groundbreaking contributions to programming languages, operating systems, and the internet, and showing how their work has fundamentally transformed modern computer science and technology.
This personal essay shares a Rice University computer‑science graduate’s journey, emphasizing the importance of coding, the value of persistent practice, the impact of side projects and internships, and practical advice on learning, problem‑solving, and balancing effort to succeed in the tech field.
