Implementation of Data Structures

In case you have received a "Transaction Failure" message, then please wait for 2 or 3 working days. If your name still doesn't appear on the Confirmed Participants list then only send an email to dbpaccounts@cse.iitb.ac.in

Learn how to write correct and efficient data structures manipulation using the existing standard template library (STL) of C++. Get introduced to the power of STL and make your code more solid, reusable, and robust.

In this Computer Science course, you will learn about the implementation of all major abstract data structures using the object-oriented programming paradigm of C++ and map abstract data types to the Standard Template Library of C++.

The topics covered in this course:

• Review of OO programming, STL of C++
• Stacks
• Queues
• Lists
• Trees
• Graphs

The detailed description is given below:

Topic 1: Review of Object Oriented Programming

• Know about the member functions as interfaces of structures
• Learn to control access to members
• Get to know the use of scope resolution operator
• Learn about Template class

Topic 2: Stacks

• Learn more about Stack and a two-stack program
• Know the operations using Text Editor
• Know more about other applications of Stack
• Learn Infix to Postfix expression using Stack

Topic 3: Queues

• Learn the basics about Queue
• Look at an example called Bus Queue
• Explore the Program for a Bus Queue
• Get the concepts clear with Mumbai Vada Pav Seller Program

Topic 4: Lists

• Know more on List operations
• Learn the features of List class
• Know the cause and effect of redesigning Mumbai Vada Pav Seller Program
• Learn the Data Structure and Algorithms of a Media Player

Topic 5: Trees

• Learn more about Binary Tree and its Traversal
• Know how to gain efficiency of Binary Search Trees
• Learn about Trie
• Learn to write Binary Tree Program
• Learn the Huffman Coding

Topic 6: Graphs

• Get to know about the Graphs
• Know the types of Graphs
• Learn the basic operations of Graphs using a program
• Learn about Depth First Search and Breadth First Search