Data Structures and Algorithms

CSE 201

 

 

Prerequisites: Programming and Computing

Course Contents:

Basic concepts and notation, Mathematical background.

Stacks and Queues: Representations of stacks and queues, linked, sequential.

Lists: List representation techniques, Multilinked structures, Dynamic storage allocation techniques,

Sorting Algorithms: Insertion sort, Bubble sort, Quicksort, Mergesort, Heapsort.

Tables: Searching sequential tables, Hash tables and Symbol tables, Heaps.

Trees: Definitions and basic concepts, Linked tree representations,

Binary tree traversal algorithms, B-trees and their applications.

Graphs: Depth-first-search, Breadth-first-search.

 

Textbook:

Y. Langsam, M. J. Augenstein and A. M. Tenenbaum,

Data Structure Using C and C++ , Second Edition,

Prentice Hall of India, 1997.

 

SPACER

© 1999 IET Kanpur. This information is provided as is and does not imply any commitment
on the part of the Institute or the author of the site as to whether these courses will be
available at the time of admission / correspondence. They are subject to review by the faculty
on the basis of current technology, AICTE guidelines and their suitability.
Official information courtesy admininstration of IETK.