InfoCoBuild

Programming and Data Structure

Programming and Data Structure. Instructor: Prof. N. S. Narayanaswamy, Department of Computer Science Engineering, IIT Madras. The focus of the course is program design using data structures. After this course, the student will be able to analyze the difference between the choice of different data structures for a given programming task. The student will be able to write programs involving different data structures, and also appreciate the value of asymptotic analysis of data structure set-up times, maintenance times and space used. (from nptel.ac.in)

A Simple C Program for Sorting


Outline of the Course and a Review of C Programming
Lecture 01 - A Simple C Program for Sorting
Lecture 02 - Review of Structures, Pointers and Functions
Lecture 03 - Recursion
Data Types: Specification and Implementation
Lecture 04 - Abstract Data Types - Data + Methods
Lecture 05 - List Data Type
Lecture 06 - Access and Update Methods
Other Abstract Data Types: Doubly Linked Lists, Arrays, Stacks and Queues
Lecture 07 - Doubly Linked List Data Type
Lecture 08 - Doubly Linked Lists and Arrays
Stack-ADT and Applications
Lecture 09 - ADT Stacks
Lecture 10 - Checking of Balanced Parenthesis
Lecture 11 - Infix and Postfix Expressions and Expression Evaluation
Queue ADT and Applications
Lecture 12 - Queue ADT Definition and Implementation
Lecture 13 - Merging using Queue ADT and Queue Types
Nonlinear Data Structures
Lecture 14 - Tree ADT and Traversals
Lecture 15 - Binary Tree ADT and Traversals
Lecture 16 - Tree Applications
A Couple of Advanced Data Structures
Lecture 17 - Binary Search Trees
Lecture 18 - Heaps

References
Programming and Data Structure
Instructor: Prof. N. S. Narayanaswamy, Department of Computer Science Engineering, IIT Madras. The focus of the course is program design using data structures.