Course Plan

Lecture Clear Is Plan Unit Topic Resource CDM CO Created By

No Plan Applicable Date
1.Hashing Hash Table- course_owner
Concepts-hash table,
hash function, basic
operations bucket,
collision, probe,
synonym, overflow
1.Hashing open hashing, closed course_owner
hashing, perfect hash
function, load density
full table, load factor,
1.Hashing rehashing, issues in course_owner
hashing, hash
functions- properties
of good hash function,
1.Hashing division, course_owner
multiplication,
extraction,
1.Hashing mid-square, folding course_owner
and universal,
1.Hashing Collision resolution course_owner
strategies- open
addressing and
chaining, Hash table
overflow- open
addressing and
chaining, extendible
hashing, closed
addressing and
separate chaining.
1.Hashing Skip List- course_owner
representation,
searching and
operations- insertion,
removal
2.Trees Tree- basic course_owner
terminology, General
tree and its
representation,
representation using
sequential and linked
organization,
2.Trees Binary tree- course_owner
properties, converting
tree to binary tree,
2.Trees binary tree course_owner
traversals(recursive
and non-recursive)-
inorder, preorder, post
order,
2.Trees depth first and course_owner
breadth first,
Operations on binary
tree.
2.Trees Huffman Tree course_owner
(Concept and Use),
Lecture Clear Is Plan Unit Topic Resource CDM CO Created By
No Plan Applicable Date
Binary Search Tree
(BST),
2.Trees BST operations, course_owner
Threaded binary
search tree- concepts,
2.Trees threading, insertion course_owner
and deletion of nodes
in in-order threaded
binary search tree,
2.Trees in order traversal of in- course_owner
order threaded binary
search tree.
3.Graphs Basic Concepts, course_owner
Storage
representation,
Adjacency matrix,
adjacency list,
3.Graphs adjacency multi list, course_owner
inverse adjacency list.
3.Graphs Traversals-depth first course_owner
and breadth first,
3.Graphs Minimum spanning course_owner
Tree, Greedy
algorithms for
computing minimum
spanning tree- Prims
and Kruskal
Algorithms,
3.Graphs Dikjtra Single source course_owner
shortest path '
3.Graphs All pairs shortest course_owner
paths- Flyod-Warshall
Algorithm
3.Graphs s Single source course_owner
shortest path,
3.Graphs Topological ordering. course_owner
4.Search Symbol Table- course_owner
Trees Representation of
Symbol Tables- Static
tree table and
Dynamic tree table,
4.Search Weight balanced tree course_owner
Trees
4.Search - Optimal Binary course_owner
Trees Search Tree (OBST),
4.Search OBST as an example course_owner
Trees of Dynamic
Programming,
4.Search Height Balanced Tree- course_owner
Trees AVL tree.
4.Search Red-Black Tree, course_owner
Trees
4.Search AA tree, K- course_owner
Trees dimensional tree,
4.Search Splay Tree course_owner
Lecture Clear Is Plan Unit Topic Resource CDM CO Created By
No Plan Applicable Date
Trees
5.Indexing Indexing and Multiway course_owner
and
Multiway
Trees
5.Indexing Trees- Indexing, course_owner
and
Multiway
Trees
5.Indexing indexing techniques- course_owner
and primary, secondary,
Multiway
Trees
5.Indexing dense, sparse, course_owner
and
Multiway
Trees
5.Indexing Multiway search trees, course_owner
and B-Tree- insertion,
Multiway deletion,
Trees
5.Indexing B+Tree - insertion, course_owner
and deletion,
Multiway
Trees
5.Indexing use of B+ tree in course_owner
and Indexing, Trie Tree.
Multiway
Trees
6.File Files: concept, need, course_owner
Organization primitive operations.
6.File Sequential file course_owner
Organization organization- concept
and primitive
operations,
6.File Direct Access File- course_owner
Organization Concepts and
Primitive operations,
6.File Indexed sequential file course_owner
Organization organization-concept,
types of indices,
6.File structure of index course_owner
Organization sequential file,
6.File Linked Organization- course_owner
Organization multi list files, coral
rings,
6.File inverted files and course_owner
Organization cellular partitions.