Data Structures &
Algorithms

Foundations of Algorithmic Thinking

From first principles to recursive mastery — building real problem-solving skills.

Duration
7 Days
Venue
Gayatri Vidya Parishad College of Engineering for Women, Visakhapatnam
Conducted by
AI Karyashala

Session photos — relive the moments from both days

Coming Soon

Session Overview

A two-day hands-on session at Gayatri Vidya Parishad College of Engineering for Women focused on learning the fundamentals of Data Structures and Algorithms. Students were introduced to core concepts and practiced writing programs to develop algorithmic thinking from the ground up.

Core philosophy: A program is a precise description of a process. Learning DSA means learning to think precisely.

Problem of the Session

Q1
Print Digits of a Number Using Recursion

Read a number from the user and print each digit of that number on a separate line using a recursive function. Do not use loops inside the recursive function.

Example: Input 1234 → output digits: 1 2 3 4 (one per line)

Questions From Students

1
What is DSA?

DSA stands for Data Structures and Algorithms. A data structure is a way of organising data in memory so it can be used efficiently — examples include arrays, stacks, queues, and trees. An algorithm is a step-by-step procedure to solve a problem using that data. Together they form the core of all software — from a search engine to a banking app, every program relies on DSA under the hood.

2
How is DSA implemented in companies?

In real companies, DSA shows up at every level. Choosing the right data structure — like a hash map for O(1) lookups or a priority queue for scheduling — directly affects how fast and scalable a product is. Algorithms power search rankings, recommendation feeds, route optimisation in maps, fraud detection in banking, and compiler design. Engineers also apply DSA concepts during code reviews and system design to justify choices around time and space trade-offs.

+ Many more questions were explored during the session

Visual Reference Sheets

Session 1
Data Structures — Arrays & Linked Lists
A visual walkthrough of arrays and linked lists — memory layout, operations, and comparisons with interactive diagrams.
→
Session 2
Trees — A Visual Introduction
Explore directory trees, DOM trees, and expression trees with annotated visual examples to build intuition around hierarchical data.
→
Session 3
Recursion, Divide & Conquer, Binary Trees
Visualise how recursion unwinds, how divide & conquer splits problems, and how binary trees are built and traversed step by step.
→
Session 4
Trees, Binary Trees & BSTs
An interactive guide to general trees, binary trees, and binary search trees — with hands-on insert & search on a live BST.
→
Session 5
Anatomy of a Tree
A visual terminology guide to the parts of a tree — root, nodes, edges, leaves, subtrees, depth, and height, all annotated on live diagrams.
→
Session 6
The Composition of Code
A step-by-step journey from variables and expressions all the way up to modules and packages — how small pieces build whole programs.
→
Session 7
Binary Tree in C — Build & Count
Build a binary tree in C and count its nodes with a live visualisation of the recursion call stack as it unwinds frame by frame.
→

Thank You — Gayatri Vidya Parishad College of Engineering for Women

We thank the faculty and management of Gayatri Vidya Parishad College of Engineering for Women, Visakhapatnam for the warm welcome and for providing the space and opportunity to engage with their students. The enthusiasm of the students made every minute worthwhile.