10CS35 Data Structures with C syllabus for IS


Part A
Unit-1 BASIC CONCEPTS 8 hours

Pointers and Dynamic Memory Allocation,Algorithm Specification, Data Abstraction,
Performance Analysis,Performance Measurement

Unit-2 ARRAYS and STRUCTURES 6 hours

Arrays, Dynamically Allocated Arrays,Structures and Unions, Polynomials, Sparse Matrices,
Representation of Multidimensional Arrays

Unit-3 STACKS AND QUEUES 6 hours

Stacks, Stacks Using Dynamic Arrays, Queues,Circular Queues Using Dynamic Arrays,
Evaluation of Expressions,Multiple Stacks and Queues.

Unit-4 LINKED LISTS 6 hours

Singly Linked lists and Chains, Representing Chains in C, Linked Stacks and Queues, Polynomials,
Additional List operations,Sparse Matrices, Doubly Linked Lists

Part B
Unit-5 TREES – 1 6 hours

Introduction, Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Heaps.

Unit-6 TREES – 2, GRAPHS 6 hours

Binary Search Trees, Selection Trees, Forests,Representation of Disjoint Sets, Counting Binary Trees,
The Graph Abstract Data Type.

Unit-7 PRIORITY QUEUES 6 hours

Single- and Double-Ended Priority Queues, Leftist Trees, Binomial Heaps, Fibonacci Heaps,
Pairing Heaps.

Unit-8 EFFICIENT BINARY SEARCH TREES 8 hours

Optimal Binary Search Trees,AVL Trees, Red-Black Trees, Splay Trees.

Last Updated: Tuesday, January 24, 2023