CS25C17 C Programming and Data Structures – Semester III – EIE / ICE – R-2025

Subject Code & Name: CS25C17 – C Programming and Data Structures

Regulation: R-2025

Semester: III (Third Semester)

Branch: B.E. Electronics and Instrumentation Engineering (EIE) / B.E. Instrumentation and Control Engineering (ICE)

Credits / L-T-P: 3 Credits | L-T-P: 3-0-0

Course Objectives

• This course introduces the fundamentals of the C programming language including its advanced features.
• It enables students to implement linear and non-linear data structures such as lists, stacks, queues, trees, and hashing.
• The course also covers the design and implementation of sorting and searching algorithms for effective problem-solving.

Full Unit-wise Syllabus

Unit I – C Programming Fundamentals, Advanced Features

Data types, variables, operations, expressions and statements, conditional statements, functions, recursive functions, arrays, single and multi-dimensional arrays.Structures, union, enumerated data types, pointers: pointers to variables, arrays and functions, file handling, preprocessor directives.

Unit II – Linear Data Structures

Abstract Data Types (ADTs), List ADT, array-based implementation, linked list, doubly-linked lists, circular linked list, Stack ADT, implementation of stack, applications, Queue ADT, priority queues, queue implementation, applications.

Unit III – Non-Linear Data Structures

Trees, binary trees, tree traversals, expression trees, binary search tree, hashing, hash functions, separate chaining, open addressing, linear probing, quadratic probing, double hashing, rehashing.

Unit IV – Sorting and Searching Techniques

Insertion sort, quicksort, heap sort, merge sort, linear search, binary search.

Course Outcomes (COs)

• CO1: Explain the fundamentals and advanced features of C programming including data types, arrays, pointers functions, structures, file handling, and preprocessor directives.
• CO2: Develop C programs to solve computational problems using conditional statements, loops, functions, recursion, arrays and file operations.
• CO3: Implement and apply linear data structures such as lists stacks, queues, and priority queues using arrays and linked lists for practical applications.
• CO4: Implement and apply non linear data structures including trees, binary search trees, expression trees, and hashing techniques for efficient data storage and retrieval.
• CO5: Design, implement, and compare sorting and searching algorithms including insertion sort, quicksort, heap sort merge sort, linear search, and binary search to evaluate algorithm efficiency.

Assessment Pattern (Quick Note)

• Weightage: Continuous Assessment 40% | End Semester Examinations 60%
• Internal methodology: Assignments (20%), Solution to application-oriented problems using software (20%), Review of GATE questions (20%), Internal Examinations (40%)

Source: Official Anna University – B.E. Electronics and Instrumentation Engineering R-2025 Curriculum
Last Updated: September 2026