Indian Knowledge System
The Indian Knowledge System (IKS) refers to the vast, ancient body of knowledge developed
in India across various fields:
🌿 Ayurveda – Medicine & Health
📚 Sanskrit Literature & Grammar
🔢 Mathematics & Astronomy
Technology & Architecture
Key Features:
✅ Systematic classification of knowledge
✅ Logical, hierarchical organization
✅ Rule-based reasoning & problem-solving
✅ Emphasis on observation, experimentation, and efficiency
🌿 Ayurveda – The Original Data Organizer
Ayurvedic texts classified diseases, herbs, and treatments in a structured manner.
The "Father of Ayurveda" (or Father of Ayurvedic Medicine) is the ancient Indian physician
Charaka. while Dhanvantari is revered as the divine God of Ayurveda
Example: Tridosha System (Vata, Pitta, Kapha) → hierarchical classification like a tree.
Diagram: Ayurveda Tree Structure
HUMAN BODY
|
--------------------------------
| | |
VATA PITTA KAPHA
Searching for treatment is like modern binary search: narrow possibilities step by step.
Grouping herbs is similar to sorting algorithms (Bubble Sort, Merge Sort).
Tree Data Structure
Connection with Modern Sorting
🔶 Ancient Ayurvedic Texts used:
✅ Grouping
✅ Ordering
✅ Categorization
✅ Sequential arrangement
These resemble:
Modern Technique Ancient Practice
Bubble Sort Repeated comparison of medicinal properties
Merge Sort Combining classifications from different schools
Binary Search Identifying disease through elimination
🔍 Binary Search Resemblance in Diagnosis
Ayurveda Diagnosis Flow
Patient Symptoms
|
Check Dosha Type
|
Narrow Disease Category
|
Find Exact Disease
⚡ Similar to Binary Search:
Divide possibilities
Eliminate half
Reach accurate result quickly
📚 B. Sanskrit Text Organization & Searching
Sanskrit grammar and literature used highly systematic structures.
✨ Panini’s Grammar System
Pāṇini created:
📖 Ashtadhyayi
Around 4000 grammar rules
Rule-based generation system
Compact encoding techniques
💻 Similarity with Algorithms
Sanskrit System Computer Science Concept
Sutra arrangement Sequential indexing
Rule priority Priority Queue
Grammar derivation Recursive Algorithms
Sound classification Hashing/Categorization
🌈 Important Insight
⚡ Panini’s grammar is often compared with:
Formal Language Theory
Compiler Design
Artificial Intelligence rule systems
🧠 Visual Representation
INPUT WORD
|
Apply Grammar Rules
|
Transform Step-by-Step
|
OUTPUT WORD
➡️Similar to Compiler Processing
🎯 Key Point for Exams
⭐ Ancient Indian systems were not random knowledge collections.
They used:
✅ Logical organization
✅ Classification
✅ Structured indexing
✅ Rule-based searching
which resemble modern:
Sorting
Searching
Data organization techniques
🧮 2. The Buddhist Numerical Sorting Method (Bhaskara II)
Bhāskara II (1114–1185 CE) contributed greatly to mathematical organization methods.
📌 About Bhaskara II
Famous Works
Book Subject
Lilavati Arithmetic
Bijaganita Algebra
Siddhanta Shiromani Astronomy & Mathematics
Book Subject
🔷 Buddhist Numerical Sorting Method
The method refers to systematic arrangement of numbers used in Indian mathematical traditions.
Features
✅ Ordered arrangement
✅ Ascending-descending methods
✅ Place value understanding
✅ Stepwise comparison
💻 Resemblance with Sorting Algorithms
Ancient Numerical Method Modern Sorting Equivalent
Arranging smallest to largest Selection Sort
Repeated comparison Bubble Sort
Position-based arrangement Insertion Sort
🌟 Example
Ancient Method
Arrange:
9, 3, 7, 1, 5
Stepwise Comparison
1, 3, 5, 7, 9
➡️Similar to modern sorting logic.
🧠 Conceptual Diagram
UNSORTED NUMBERS
|
Compare Values
|
Rearrange Position
|
SORTED NUMBERS
📌 Importance
⭐ Indian mathematicians understood:
Ordering systems
Numerical hierarchy
Efficient arrangement techniques
long before modern computing.
3. Indian Contribution in Data Structure
👨🏫 A. Dr. Sartaj Sahni
Sartaj Sahni
📌 Contributions
✅ Expert in:
Data Structures
Algorithms
Parallel Computing
🌟 Famous Work
📘 Fundamentals of Data Structures
Widely used textbook in computer science education.
💡 Contributions to:
Area Contribution
Trees Efficient traversal methods
Graph Algorithms Optimization techniques
Sorting Algorithms Performance analysis
Sparse Matrices Efficient storage
🎯 Key Achievement
⭐ Developed efficient algorithmic techniques for:
Storage optimization
Fast searching
Computational efficiency
🌳 Example Diagram
ROOT
/ \
LEFT RIGHT
➡️Tree Data Structure Research
👨💻 B. Dr. Arvind
Arvind
📌 Known For
✅ Parallel Computing
✅ Dataflow Architecture
✅ Programming Models
🌟 Main Contributions
Concept Explanation
Dataflow Computing Execution based on data availability
Parallel Processing Multiple tasks together
Dynamic Scheduling Efficient resource use
⚡ Dataflow Model
DATA INPUT
|
Process Node
|
Output Generated
➡️Similar to graph-based execution.
💡 Importance
Helps in:
✅ Faster computation
✅ Efficient memory usage
✅ High-performance systems
👨🏫 C. R. K. Gupta
R. K. Gupta
📌 Contributions
✅ Research in:
Data organization
Algorithm design
Computational methods
🌟 Areas of Focus
Topic Contribution
Searching Methods Efficient retrieval
Data Management Structured organization
Educational Research Computer science teaching
🧠 Common Indian Contributions to Data Structures
DATA
|
Organize
|
Store
|
Search
|
Retrieve Efficiently