C Programming & Data Structures by Sravanti Aduri

This online C Programming course is designed to build a strong foundation in C language and Data Structures, guided by Sravanti Aduri. The course is ideal for beginners as well as students who want to strengthen their core programming concepts for academics, interviews, or embedded systems learning.

The tutor has prior offline teaching experience and offers to record and share demo or learning videos for students, ensuring clarity and flexibility in learning.

Classes are conducted online and are suitable for learners in Mahadevapura, Bangalore, and across India.

What You Will Learn

• C Programming Basics

  • Introduction to C language

  • Syntax, keywords, and structure of C programs

  • Variables, data types, and operators

• Control Statements

  • if, if-else, switch

  • for, while, do-while loops

  • Logic-building programs

• Functions & Arrays

  • User-defined and built-in functions

  • 1D & 2D arrays

  • Passing arrays to functions

• Pointers

  • Pointer basics

  • Pointer arithmetic

  • Pointers with arrays and functions

• Structures & Unions

  • Real-world data modeling

  • Memory management concepts

• Data Structures Using C

  • Stack and Queue

  • Linked Lists

  • Searching and Sorting techniques

• Introduction to Embedded C

  • Basics of embedded programming

  • C usage in hardware-level programming

• Introduction to Data Structures:

  • Abstract Data Types (ADT); linear vs non-linear; time/space complexity basics (Big O).

• Arrays & Strings Revisited:

  • Operations, searching (linear/binary), sorting (bubble, selection); multi-D arrays.

• Linked Lists:

  • Singly/doubly/circular; node structure, insertion/deletion (front/end/position), traversal, search.

• Stacks:

  • ADT, array/linked list implementation; push, pop, peek, isEmpty; applications (expression evaluation, recursion).

• Queues:

  • ADT, array/linked list/circular/deque; enqueue, dequeue, front; priority queues intro.

• Recursion:

  • Base case, tail recursion; solving Towers of Hanoi, tree traversals.

Algorithms & Advanced

• Sorting Algorithms:

  • Bubble, Selection, Insertion, Merge Sort, Quick Sort; comparisons.

• Searching Algorithms:

  • Linear, Binary (sorted arrays); Hashing intro.

• Trees Basics:

  • Binary trees, BST (insert/search/delete); traversals (in/pre/post-order, level-order).

• Graphs Intro:

  • Representation (adjacency matrix/list); BFS, DFS basics.

• Hands-on Projects:

  • Student management system, expression parser, simple file compressor; debugging, optimization for IT interviews

Teaching Method

• Online live classes

• Step-by-step explanation from basics

• Practical coding examples

• Doubt-clearing sessions

• Optional recorded sessions on request

The teaching approach is simple, structured, and focused on logic building and real understanding, not just theory.

Who Should Join

• Beginners learning programming for the first time

• Engineering and diploma students

• Students preparing for technical interviews

• Learners interested in Embedded C

• Anyone who wants a strong foundation in C & Data Structures

Learning Outcomes

By the end of the course, students will be able to:

• Write clean and efficient C programs

• Understand memory and pointer concepts clearly

• Implement basic data structures using C

• Build a strong base for advanced programming or embedded systems