Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Data Structures & Files (214452)
UNIT – I STACKS AND QUEUES
Session 1 : Concept of stack
Session 2 : stack as ADT
Session 3 : Implementation of stack using linked organization
Session 4 : Concept of implicit and explicit stack
Session 5 : Applications of stack
Session 6 : Concept of queues as ADT
Session 7 : Implementation of queue using linked organization
Session 8 : Concept of circular queue
Session 9 : double ended queue and priority queue
Session 10 : Applications of queues
UNIT – II TREES
Session 11 : Difference in linear and non-linear data structure
Session 12 : Trees and binary trees-concept and terminology
Session 13 : Expression tree
Session 14 : Conversion of general tree to binary tree
Session 15 : Binary tree as an ADT
Session 16 : Recursive and non-recursive algorithms for binary tree traversals
Session 17 : Binary search trees
Session 18 : Binary search tree as ADT
Session 19 : Applications of trees
UNIT – III GRAPHS
Session 20 : Graph as an ADT
Session 21 : Representation of graphs using adjacency matrix and adjacency list
Session 22 : Depth First Search and Breadth First Search traversal
Session 23 : Prim’s and Kruskal’s algorithms for minimum spanning tree
Session 24 : shortest path using Warshall’s and Dijkstra's algorithm
Session 25 : topological sorting
UNIT – IV TABLES
Session 26 : Symbol Table: Notion of Symbol Table
Session 27 : OBST
Session 28 : Huffman's algorithm
Session 29 : Heap data structure
Session 30 : Min and Max Heap
Session 31 : Heap sort implementation
Session 32 : applications of heap
Session 33 : Hash tables and scattered tables: Basic concepts
Session 34 : hash function
Session 35 : characteristics of good hash function
Session 36 : different key-to-address transformations techniques
Session 37 : synonyms or collisions
Session 38 : collision resolution techniques- linear probing
Session 39 : quadratic probing
Session 40 : rehashing
Session 41 : chaining without replacement and chaining with replacement
UNIT – V ADVANCE TREES
Session 42 : Concept of threaded binary tree
Session 43 : Preorder and In-order traversals of in-order threaded binary tree
Session 44 : Concept of red and black trees
Session 45 : AVL Trees
Session 46 : B trees
Session 47 : B+ trees
Session 48 : Splay trees
UNIT - VI FILE ORGANIZATION
Session 49 : External storage devices
Session 50 : File
Session 51 : File types and file organization (sequential, index sequential and Direct access)
Session 52 : Primitive operations and implementations for each type and comparison
Session 41 : chaining without replacement and chaining with replacement
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock