Computer Science Tutorials — Algorithms, Data Structures, OOP and Programming Styles

Flat illustration of four computer science discipline cards showing algorithms sorting chart data structures tree OOP class diagram and programming styles lambda symbol connected in blue and white

Computer science is the intellectual foundation beneath every line of code you write. While programming teaches you how to instruct a computer, computer science teaches you why certain approaches work better than others — why one algorithm processes a million records in seconds while another takes hours, why the right data structure makes the difference between elegant and unworkable code, and why the principles of object-oriented design produce software that survives contact with the real world.

MYCPLUS has been publishing computer science tutorials and practical programming guides since 2004, building a comprehensive resource covering the core theoretical and applied topics that every serious programmer needs to understand. This Computer Science hub brings together four interconnected areas of study — Algorithms, Data Structures, Object-Oriented Programming and Programming Styles — each with its own dedicated section of in-depth tutorials, practical examples and working source code.

Tis section gives you the theoretical understanding and hands-on programming experience to write better software, solve harder problems and think more clearly about how programs work. Whether you are studying for exams, preparing for technical interviews or simply becoming a stronger programmer — start here.

What You’ll Learn

  • Algorithms — sorting, searching, graph traversal, dynamic programming and optimisation techniques with working C implementations and complexity analysis for real-world problem solving
  • Data structures — arrays, linked lists, stacks, queues, trees, hash tables and graphs with practical C and C++ source code examples and guidance on choosing the right structure for every problem
  • Object-oriented programming — the complete OOP model including encapsulation, inheritance, polymorphism and abstraction with practical examples across C++, Java and C# for real-world software design
  • Programming styles and paradigms — procedural, object-oriented, functional and declarative programming approaches with examples showing how modern developers apply multiple paradigms in professional codebases
  • Algorithm complexity and analysis — understanding Big O notation, time and space complexity, best and worst case analysis and applying complexity thinking to write more efficient everyday code
  • Applied computer science — bridging theory and practice by applying computer science principles to real programming problems in C, C++ and Java with source code you can study and build on immediately

Explore the four core areas covered in this section:

→ Algorithms — sorting, searching, graph traversal and optimisation
→ Data Structures — arrays, linked lists, trees, stacks and graphs
→ Object-Oriented Programming — classes, inheritance and polymorphism
→ Programming Styles — procedural, functional and declarative paradigms

Why MYCPLUS: Trusted by programmers and computer science students since 2004 — MYCPLUS covers all four core computer science disciplines in one place, with practical implementations in C, C++ and Java designed for both academic study and real-world software development.

Data Structures and Their Role in Streamlining Daily Programming

Data Structures and Their Role in Streamlining Daily Programming

Data structures are essential for efficient programming, enabling optimal data storage, retrieval, and management. This article explores key data structures in C++, including arrays, linked lists, stacks, queues, hash tables, trees, and graphs. Each structure is explained with practical examples, highlighting its use cases and efficiency considerations. Choosing the right data structure improves performance, reduces memory usage, and enhances scalability. Understanding their strengths and limitations helps programmers write optimized and effective code.

Top 10 algorithms

Top 10 Algorithms Every Programmer Should Know

This article highlights the top 10 algorithms that every programmer should be familiar with. From sorting and searching algorithms to more advanced concepts like dynamic programming and machine learning, these algorithms form the foundation of efficient problem-solving and are widely applicable in real-world software development.

Solving the Knapsack Problem

Solving the Knapsack Problem with Code Examples

The Knapsack Problem is a classic optimization problem in computer science and mathematics. The goal is to maximize the value of items placed in a knapsack without exceeding its weight capacity. This problem has many variations, but the most common are: 0/1 Knapsack Problem: Each item can either be included or excluded. Fractional Knapsack Problem: Items can be divided to maximize value.

Binary Decision Diagram (BDD) - Data Structure

Binary Decision Diagram Data Structure

A BDD (Bryant 1986) or branching program is a data structure that is used to represent a Boolean function. On a more abstract level, BDDs can be considered as a compressed representation of sets or relations. Unlike other compressed representations, operations are performed directly on the compressed representation, i.e. without decompression.

trie data structure

Trie Data Structure

A trie (Fredkin, 1960), also called digital tree and sometimes radix tree, is an ordered multi-way tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated.

c-algorithms-library

C Algorithms Library

This article is about a collection of common Computer Science algorithms which may be used in C projects. The C Programming Language has a much smaller Standard Library as compared to other more modern programming languages such as Java or Python. The library provides a basic set of mathematical functions, string manipulation, type conversions, and file and console-based I/O.

Scroll to Top