Data Structures | Syllabus | College Platform - NITH
Computer Science and EngineeringCS-201
CS-201core Course
Data Structures
4 Credits
5 Modules
Updated 12/31/2024
01
Trees
7 Lectures
Basic terminology General Trees Binary Trees Tree Traversing: in-order pre-order and
post-order traversal building a binary search tree Operations on Binary Trees - Expression
Manipulations - Symbol Table construction Height Balanced Trees(AVL) B-trees B+-trees.
02
Introduction
7 Lectures
Data types data structures abstract data types the running time of a programthe running time and storage cost of algorithms complexity asymptotic complexity big O notation obtaining the complexity of an algorithm.
03
Development of Algorithms
10 Lectures
Notations and Analysis Storage structures for arrays - sparse matrices - structures and arrays of structures Stacks and Queues: Representationsimplementations and applications.
Linked Lists: Singly linked lists Linked stacks and queues operations on Polynomials Doubly
Linked Lists Circularly Linked Lists Operations on linked lists- Insertion deletion and traversaldynamic storage management – Garbage collection and compaction.
04
Graphs
6 Lectures
: Basic definitions representations of directed and undirected graphs the single-source
shortest path problem the all-pair shortest path problem traversals of directed and undirected graphs directed acyclic graphs strong components minimum cost spanning tress articulation points and biconnected components graph matching.