{
  "schema_version": "jupius_geo_course_v1",
  "exported_at": "2026-07-15T05:38:17.355Z",
  "generated_at": "2026-07-27T11:51:31.915Z",
  "source": "geo-from-backend",
  "slug": "c-ds-a",
  "course": {
    "course_code": "C-DS-A",
    "title": "Algorithmic thinking and data structures in C",
    "description": "Algorithmic-thinking-first course in C: think → cases → code → apply. Progressive ADT build labs plus bridging easy applies and CP-style problem packs. SLL core 8 ops (honors stretch 6). Bubble sort as confidence anchor. Builds on C-PROG-A. Sequel C-ALG-B adds graphs, DP, heaps, timed CP, and C++/STL bridge.",
    "credits": 4,
    "duration": "14 weeks",
    "compliance_standard": "NBA",
    "publication_status": "published",
    "price_amount": 5000,
    "currency": "INR",
    "tags": [
      "c",
      "data-structures",
      "algorithms",
      "linked-lists",
      "trees",
      "sorting",
      "paid-course",
      "progressive-labs",
      "ds-challenge",
      "cp-inspired",
      "algorithmic-thinking",
      "cp-readiness",
      "bridge-apply"
    ],
    "assessment_methods": [
      "quizzes",
      "programming",
      "formative_practice",
      "progressive_extension_labs",
      "bridge_apply_labs",
      "apply_pack_labs",
      "summative",
      "eoc"
    ],
    "target_audience": "undergraduate",
    "tagline": "Algorithmic thinking in C — stacks, queues, lists, trees, sorting; progressive build labs plus apply packs.",
    "prerequisite": "C-PROG-A (pointers, dynamic memory, modular C)",
    "abstract": "Algorithmic-thinking-first course in C: think → cases → code → apply. Progressive ADT build labs plus bridging easy applies and CP-style problem packs. SLL core 8 ops (honors stretch 6). Bubble sort as confidence anchor. Builds on C-PROG-A. Sequel C-ALG-B adds graphs, DP, heaps, timed CP, and C++/STL bridge.",
    "slug": "c-ds-a",
    "weeks": 14,
    "certificates": 2,
    "co_threshold": "75%",
    "price": "₹5,000",
    "price_inr": 5000,
    "public_syllabus_url": "https://www.jupiuslearning.com/courses/c-ds-a",
    "geo_profile_url": "https://www.jupiuslearning.com/accreditation/directory/c-ds-a/",
    "geo_payload_url": "https://www.jupiuslearning.com/geo-payloads/c-ds-a.json"
  },
  "outcomes": [
    {
      "ref": "CO1",
      "bloom_level": "understand",
      "weightage": 17,
      "description": "Explain ADTs, asymptotic complexity, and algorithmic paradigms (iterative, recursive, brute force, greedy, divide & conquer, DP preview); justify structure and technique choice."
    },
    {
      "ref": "CO2",
      "bloom_level": "apply",
      "weightage": 17,
      "description": "Formulate algorithms for stack/queue operations and expression processing; implement in modular C and apply stacks to stated problems."
    },
    {
      "ref": "CO3",
      "bloom_level": "apply",
      "weightage": 17,
      "description": "Formulate algorithms for linked-list operations; implement core SLL ops in modular C; apply list techniques to CP-style problems."
    },
    {
      "ref": "CO4",
      "bloom_level": "apply",
      "weightage": 17,
      "description": "Formulate and analyze searching and sorting algorithms; implement on arrays; relate comparison counts to asymptotic growth."
    },
    {
      "ref": "CO5",
      "bloom_level": "apply",
      "weightage": 17,
      "description": "Formulate algorithms for BST/AVL operations and traversals; implement rotations and insert rebalancing; apply tree traversals to queries."
    },
    {
      "ref": "CO6",
      "bloom_level": "analyze",
      "weightage": 15,
      "description": "Analyze which data structure fits a problem; complete integrative capstones; demonstrate readiness for CP-style multi-step problems in C."
    }
  ],
  "certificates": [
    {
      "kind": "foundations",
      "label": "C Data Structures Foundations",
      "co_scope": [
        "CO1",
        "CO2",
        "CO3",
        "CO4"
      ],
      "required_lab_pct": 90,
      "co_attainment_threshold": 75,
      "gate": "C Data Structures Foundations summative quiz"
    },
    {
      "kind": "professional",
      "label": "C Data Structures Professional",
      "co_scope": [
        "CO1",
        "CO2",
        "CO3",
        "CO4",
        "CO5",
        "CO6"
      ],
      "required_lab_pct": 95,
      "co_attainment_threshold": 75,
      "gate": "C Data Structures Professional end-of-course capstone"
    }
  ],
  "activity_totals": {
    "units": 14,
    "topics": 75,
    "topic_quiz_activities": 390,
    "mcq_questions": 390,
    "practice_labs": 0,
    "eval_labs": 71,
    "content_blocks": 516
  },
  "evaluation_metrics": {
    "evaluation_mode": "obe_co_attainment",
    "unit_title": null,
    "hard_gates": [
      {
        "certificate": "C Data Structures Foundations",
        "co_scope": "CO1–CO2–CO3–CO4",
        "evaluated_lab_quota": "≥ 90%",
        "co_attainment": "≥ 75%",
        "gate": "C Data Structures Foundations summative quiz"
      },
      {
        "certificate": "C Data Structures Professional",
        "co_scope": "CO1–CO2–CO3–CO4–CO5–CO6",
        "evaluated_lab_quota": "≥ 95%",
        "co_attainment": "≥ 75%",
        "gate": "C Data Structures Professional end-of-course capstone"
      }
    ],
    "activity_totals": {
      "units": 14,
      "topics": 75,
      "topic_quiz_activities": 390,
      "mcq_questions": 390,
      "practice_labs": 0,
      "eval_labs": 71,
      "content_blocks": 516
    }
  },
  "jsonLd": {
    "@context": "https://schema.org",
    "@type": "Course",
    "name": "Algorithmic thinking and data structures in C",
    "description": "Algorithmic-thinking-first course in C: think → cases → code → apply. Progressive ADT build labs plus bridging easy applies and CP-style problem packs. SLL core 8 ops (honors stretch 6). Bubble sort as confidence anchor. Builds on C-PROG-A. Sequel C-ALG-B adds graphs, DP, heaps, timed CP, and C++/STL bridge.",
    "courseCode": "C-DS-A",
    "provider": {
      "@type": "EducationalOrganization",
      "name": "Jupius Learning",
      "url": "https://jupiuslearning.com",
      "founder": {
        "@type": "Person",
        "name": "Vadher Nikunj",
        "jobTitle": "Founder & Principal CSE Architect",
        "knowsAbout": [
          "Computer Science Engineering",
          "Outcome-Based Education",
          "Embedded Systems Architecture"
        ]
      }
    },
    "credentialCategory": "Certificate",
    "educationalCredentialAwarded": [
      "C Data Structures Foundations",
      "C Data Structures Professional"
    ],
    "hasCourseInstance": {
      "@type": "CourseInstance",
      "courseMode": "Blended",
      "duration": "P14W"
    },
    "teaches": [
      "Explain ADTs, asymptotic complexity, and algorithmic paradigms (iterative, recursive, brute force, greedy, divide & conquer, DP preview); justify structure and technique choice.",
      "Formulate algorithms for stack/queue operations and expression processing; implement in modular C and apply stacks to stated problems.",
      "Formulate algorithms for linked-list operations; implement core SLL ops in modular C; apply list techniques to CP-style problems.",
      "Formulate and analyze searching and sorting algorithms; implement on arrays; relate comparison counts to asymptotic growth.",
      "Formulate algorithms for BST/AVL operations and traversals; implement rotations and insert rebalancing; apply tree traversals to queries.",
      "Analyze which data structure fits a problem; complete integrative capstones; demonstrate readiness for CP-style multi-step problems in C."
    ],
    "educationalLevel": "NBA-aligned OBE",
    "url": "https://www.jupiuslearning.com/courses/c-ds-a",
    "offers": {
      "@type": "Offer",
      "price": "5000",
      "priceCurrency": "INR",
      "availability": "https://schema.org/InStock"
    }
  },
  "abstract": "Algorithmic-thinking-first course in C: think → cases → code → apply. Progressive ADT build labs plus bridging easy applies and CP-style problem packs. SLL core 8 ops (honors stretch 6). Bubble sort as confidence anchor. Builds on C-PROG-A. Sequel C-ALG-B adds graphs, DP, heaps, timed CP, and C++/STL bridge."
}