06CS35 Data Structures with C syllabus for CS


Part A
Unit-1 Pointers 7 hours

Pointers: Concepts, Pointer variables, Accessing variables through pointers, Pointer declaration and definition, Initialization of pointer variables, Pointers and functions, Pointer to pointers, Compatibility, Lvalue and Rvalue, Arrays and pointers, Pointer arithmetic and arrays, Passing an array to a function, Understanding complex declarations, Memory allocation functions, Array of pointers.

Unit-2 Strings Derived types Enumerated Structure and Union Binary Files 7 hours

Strings: String concepts, C strings, String I/O functions, Array of strings, String manipulation function, Memory formatting. 2 Hours Derived types-Enumerated, Structure, and Union: The type definition, Enumerated types, Structure, Accessing structures, Complex structures, Array of structures, Structures and functions, Unions 3 Hours Binary Files: Classification of Files, Using Binary Files, Standard Library Functions for Files 2 Hours

Unit-3 The Stack 6 hours

The Stack: Definition and Examples, Representing Stacks in C, An Example – Infix, Postfix, and Prefix

Unit-4 Recursion Queues 6 hours

Recursion: Recursive Definition and Processes, Recursion in C, Writing Recursive Programs, Simulating Recursion, Efficiency of Recursion. 4 Hours Queues: The Queue and its Sequential Representation. 2 Hours

Part B
Unit-5 Lists 7 hours

Lists: Linked Lists, Lists in C, An Example – Simulation using Linked Lists

Unit-6 Lists contd 6 hours

Lists contd.: Other List Structures

Unit-7 Trees 6 hours

Trees: Binary Trees, Binary Tree Representations

Unit-8 Trees contd 7 hours

Trees contd.: Representing Lists as Binary Trees, Trees and their applications

Last Updated: Tuesday, January 24, 2023