Algorithmic thinking in C — stacks, queues, lists, trees, sorting; progressive build labs plus apply packs.
- Duration
- 14 weeks
- Certificates
- 2
- CO threshold
- 75%
- Price
- ₹2,500 (one-time access)
Tagline: Algorithmic thinking in C — stacks, queues, lists, trees, sorting; progressive build labs plus apply packs.
| Field |
Value |
| Course code |
C-DS-A |
| Duration |
14 weeks |
| Credits |
4 |
| Compliance |
NBA-aligned OBE |
| Prerequisite |
C-PROG-A (pointers, dynamic memory, modular C) |
| Publication |
published |
| Price |
INR 2500 |
| DB snapshot |
2026-07-06T07:25:38.661Z |
Course objective
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.
Course outcomes (CO1–CO6)
| CO |
Bloom |
Weight |
Statement |
| CO1 |
understand |
17% |
Explain ADTs, asymptotic complexity, and algorithmic paradigms (iterative, recursive, brute force, greedy, divide & conquer, DP preview); justify structure and technique choice. |
| CO2 |
apply |
17% |
Formulate algorithms for stack/queue operations and expression processing; implement in modular C and apply stacks to stated problems. |
| CO3 |
apply |
17% |
Formulate algorithms for linked-list operations; implement core SLL ops in modular C; apply list techniques to CP-style problems. |
| CO4 |
apply |
17% |
Formulate and analyze searching and sorting algorithms; implement on arrays; relate comparison counts to asymptotic growth. |
| CO5 |
apply |
17% |
Formulate algorithms for BST/AVL operations and traversals; implement rotations and insert rebalancing; apply tree traversals to queries. |
| CO6 |
analyze |
15% |
Analyze which data structure fits a problem; complete integrative capstones; demonstrate readiness for CP-style multi-step problems in C. |
Activity totals (live from platform)
| Metric |
Count |
| Units / chapters |
14 |
| Topics |
75 |
| Topic quiz activities |
75 |
| MCQ questions |
390 |
| Practice / run-only labs |
0 |
| Evaluated build & apply labs |
71 |
| Instructional content blocks |
516 |
Certificates & earning criteria
| Certificate |
CO scope |
Evaluated lab quota |
CO attainment |
Gate |
| C Data Structures Foundations |
CO1–CO4 |
≥ 90% |
≥ 75% |
C Data Structures Foundations summative quiz |
| C Data Structures Professional |
CO1–CO6 |
≥ 95% |
≥ 75% |
C Data Structures Professional end-of-course capstone |
Unit syllabus (unit → topics → activities)
Unit 1 — Paradigm bootcamp, ADTs, complexity & CP I/O
Unit totals: 6 topics · 30 MCQ questions · 0 practice · 2 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
What is algorithmic thinking? |
5 |
0 |
0 |
— |
| 2 |
Iterative vs recursive |
5 |
0 |
0 |
— |
| 3 |
Brute force & greedy concepts |
5 |
0 |
0 |
— |
| 4 |
Divide & conquer & DP literacy |
5 |
0 |
0 |
— |
| 5 |
Big-O & ADT preview |
5 |
0 |
0 |
— |
| 6 |
CP I/O bootcamp |
5 |
0 |
2 |
— |
Unit 2 — Stack (array)
Unit totals: 5 topics · 25 MCQ questions · 0 practice · 7 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Stack ADT & paradigms |
5 |
0 |
0 |
— |
| 2 |
Array stack build: push & pop |
5 |
0 |
2 |
— |
| 3 |
Peek, status & overflow/underflow |
5 |
0 |
2 |
— |
| 4 |
Balanced parentheses check |
5 |
0 |
1 |
— |
| 5 |
Next greater element & min-stack |
5 |
0 |
2 |
— |
Unit 3 — Stack applications
Unit totals: 5 topics · 25 MCQ questions · 0 practice · 4 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Expression notation & stack role |
5 |
0 |
0 |
— |
| 2 |
Balanced symbol check |
5 |
0 |
1 |
— |
| 3 |
Infix to postfix conversion |
5 |
0 |
1 |
— |
| 4 |
Postfix expression evaluation |
5 |
0 |
1 |
— |
| 5 |
Remove adjacent duplicates (honors) |
5 |
0 |
1 |
— |
Unit 4 — Queue, circular queue & deque
Unit totals: 5 topics · 25 MCQ questions · 0 practice · 6 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Queue ADT & paradigms |
5 |
0 |
0 |
— |
| 2 |
Circular queue build: enqueue & dequeue |
5 |
0 |
2 |
— |
| 3 |
FRONT, status & full vs empty |
5 |
0 |
1 |
— |
| 4 |
FIFO queue drain |
5 |
0 |
1 |
— |
| 5 |
FCFS scheduling & hot potato |
5 |
0 |
2 |
— |
Unit 5 — Nodes, List wrapper & memory
Unit totals: 5 topics · 25 MCQ questions · 0 practice · 5 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Node, List wrapper & memory |
5 |
0 |
0 |
— |
| 2 |
List build: init & node factory |
5 |
0 |
2 |
— |
| 3 |
INSERT_LAST & DISPLAY_FORWARD |
5 |
0 |
1 |
— |
| 4 |
Build list from input & display |
5 |
0 |
1 |
— |
| 5 |
Build list from input & print length |
5 |
0 |
1 |
— |
Unit 6 — Singly linked list (progressive master)
Unit totals: 6 topics · 30 MCQ questions · 0 practice · 8 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Singly linked list — core operations |
5 |
0 |
0 |
— |
| 2 |
Prepend node (INSERT_FIRST) |
5 |
0 |
1 |
— |
| 3 |
DELETE_FIRST & DELETE_LAST |
5 |
0 |
1 |
— |
| 4 |
INSERT_AT & DELETE_AT |
5 |
0 |
1 |
— |
| 5 |
Search & full list command driver |
5 |
0 |
1 |
— |
| 6 |
Merge, middle node, cycle & dedupe |
5 |
0 |
4 |
— |
Unit 7 — Doubly linked list (delta)
Unit totals: 6 topics · 30 MCQ questions · 0 practice · 6 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Doubly linked list — what prev adds |
5 |
0 |
0 |
— |
| 2 |
Dual-link insert at head and tail |
5 |
0 |
1 |
— |
| 3 |
DELETE_FIRST & DELETE_LAST with prev |
5 |
0 |
1 |
— |
| 4 |
Backward traversal (DISPLAY_BACKWARD) |
5 |
0 |
1 |
— |
| 5 |
Middle splice & full DLL command driver |
5 |
0 |
1 |
— |
| 6 |
Reverse segment & palindrome on DLL |
5 |
0 |
2 |
— |
Unit 8 — Circular linked lists
Unit totals: 6 topics · 30 MCQ questions · 0 practice · 6 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Circular linked lists — tail closes the ring |
5 |
0 |
0 |
— |
| 2 |
Circular SCL — INSERT_FIRST & INSERT_LAST |
5 |
0 |
1 |
— |
| 3 |
Circular SCL — delete ends & display one lap |
5 |
0 |
1 |
— |
| 4 |
Circular SCL — INSERT_AT, DELETE_AT & integrative driver |
5 |
0 |
1 |
— |
| 5 |
Doubly circular list — DCL delta & deque comparison |
5 |
0 |
1 |
— |
| 6 |
Josephus survivor & rotate by k |
5 |
0 |
2 |
— |
Unit 9 — Searching
Unit totals: 6 topics · 30 MCQ questions · 0 practice · 6 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Searching — brute force vs decrease & conquer |
5 |
0 |
0 |
— |
| 2 |
Array linear search & comparison counts |
5 |
0 |
1 |
— |
| 3 |
Binary search on sorted arrays |
5 |
0 |
1 |
— |
| 4 |
Integrative search_lab driver & CMP analysis |
5 |
0 |
1 |
— |
| 5 |
Linear search on linked lists & when binary fails |
5 |
0 |
1 |
— |
| 6 |
First/last position & count equal (apply pack) |
5 |
0 |
2 |
— |
Unit 10 — Sorting (arrays)
Unit totals: 6 topics · 30 MCQ questions · 0 practice · 6 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Sorting — stability, growth rates & array policy |
5 |
0 |
0 |
— |
| 2 |
Bubble sort — confidence anchor |
5 |
0 |
1 |
— |
| 3 |
Insertion sort — sorted prefix |
5 |
0 |
1 |
— |
| 4 |
Merge sort — divide & conquer |
5 |
0 |
1 |
— |
| 5 |
Quick sort & integrative sort_lab.c |
5 |
0 |
1 |
— |
| 6 |
Inversion count & k-th smallest (apply pack) |
5 |
0 |
2 |
— |
Unit 11 — Binary search trees
Unit totals: 6 topics · 30 MCQ questions · 0 practice · 8 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
BST — ordering invariant & pointer-tree policy |
5 |
0 |
0 |
— |
| 2 |
BST insert & inorder display |
5 |
0 |
1 |
— |
| 3 |
BST search |
5 |
0 |
1 |
— |
| 4 |
BST delete |
5 |
0 |
1 |
— |
| 5 |
Traversals & integrative bst_lab.c |
5 |
0 |
1 |
— |
| 6 |
BST apply pack (depth, path, validate, k-th) |
5 |
0 |
4 |
— |
Unit 12 — AVL trees (compact cert core)
Unit totals: 6 topics · 30 MCQ questions · 0 practice · 6 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
AVL trees — balance factor & cert core scope |
5 |
0 |
0 |
— |
| 2 |
Height fields & balance factor queries |
5 |
0 |
1 |
— |
| 3 |
LL & RR single rotations |
5 |
0 |
1 |
— |
| 4 |
LR & RL double rotations |
5 |
0 |
1 |
— |
| 5 |
Integrative avl_lab.c |
5 |
0 |
1 |
— |
| 6 |
Height-balanced bridge & balance trace apply |
5 |
0 |
2 |
— |
Unit 13 — OS applications & synthesis
Unit totals: 4 topics · 20 MCQ questions · 0 practice · 1 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
Call stack & activation records |
5 |
0 |
0 |
— |
| 2 |
Queues & CPU scheduling (round-robin) |
5 |
0 |
0 |
— |
| 3 |
Symbol tables & ordered maps (concept) |
5 |
0 |
0 |
— |
| 4 |
Capstone — round-robin scheduler (capstone_lab.c) |
5 |
0 |
1 |
— |
Unit 14 — Summative gates & pathway to C-ALG-B
Unit totals: 3 topics · 30 MCQ questions · 0 practice · 0 evaluated labs
| # |
Topic |
MCQs |
Practice |
Evaluated |
Preview |
| 1 |
C Data Structures Foundations summative quiz |
12 |
0 |
0 |
— |
| 2 |
C Data Structures Professional end-of-course capstone |
12 |
0 |
0 |
— |
| 3 |
Pathway to C-ALG-B (read-only preview) |
6 |
0 |
0 |
— |
Counts are from the live course catalog. MCQs = questions in topic checkpoint quizzes. Practice = formative run-only or SQL practice lane. Evaluated = submit-graded labs that count toward progress and certificates.
← All paid courses · LLM site guide