CS3353 C Programming and Data Structures Notes - Anna University Regulation 2021

About CS3353 C Programming and Data Structures

CS3353 is a core subject for Anna University Semester 3 students, focusing on the fundamentals of C programming and essential data structures. The subject covers programming constructs, advanced C features, linear and non-linear data structures, sorting, searching, and their applications. These CS3353 notes are designed to help you master programming logic, problem-solving, and data organization for both internal assessments and university exams.

CS3353 Important Topics (Unit-wise)

These are the most important unit-wise topics for CS3353 (C Programming and Data Structures - R2021). Practice these topics regularly to strengthen core concepts and improve exam performance.

Unit I – C Programming Fundamentals

• Functions and recursion (problem solving)
• Control structures (if, loops, switch with programs)
• Single dimensional arrays
• Multi-dimensional arrays (matrix operations)
• Expressions and operators evaluation

Unit II – Advanced C Features

• Pointers (arrays, functions, pointer arithmetic)
• Structures and unions (usage and comparison)
• File handling (read, write, append programs)
• Preprocessor directives (macros, header files)

Unit III – Linear Data Structures

• Singly linked list (creation, insertion, deletion)
• Doubly linked list and circular linked list
• Stack (array and linked list implementation)
• Stack applications (infix to postfix, evaluation)
• Queue (linear, circular, priority queue)
• Queue applications

Unit IV – Non-Linear Data Structures

• Binary tree (representation and traversals)
• Expression trees
• Binary search tree (insertion, deletion, searching)
• Hashing techniques (collision handling methods)

Unit V – Sorting and Searching

• Quick sort and merge sort
• Heap sort and insertion sort
• Binary search and linear search
• Time complexity comparison