06EC761 Data Structures using C plus syllabus for EC


Part A
Unit-1 Introduction 9 hours

Functions and parameters, Dynamic memory allocation classis, Testing and debugging. Data Representation, Introduction, Linear lists, Formula-based representation linked representation, Indirect addressing simulating pointers.

Unit-2 Arrays And Matrics 6 hours

Arrays, Matrices, Special matrices spare matrices.

Unit-3 Stacks 5 hours

The abstract data types, Derived classed and inheritance, Formula-based representation, Linked representation, Applications.

Unit-4 Queues 6 hours

The abstract data types, Derived classes and inheritance, Formula-based representation, Linked Linked representation, Applications.

Part B
Unit-5 Skip Lists And Hashing 6 hours

Dictionaries, Linear representation, Skip list presentation, Hash table representation.

Unit-6 Binary And Other Trees 7 hours

Trees, Binary trees, Properties and representation of binary trees, Common binary tree operations, Binary tree traversal the ADT binary tree, ADT and class extensions.

Unit-7 Pririty Queues 6 hours

Linear lists, Heaps, Leftist trees.

Unit-8 Search Trees 7 hours

Binary search trees, B-trees, Applications.

Last Updated: Tuesday, January 24, 2023