by Kaustuva DevKaustuva DevType:
Biju Patnaik University of Technology BPUT
2 years agoAdd to Favourite Add to FavouriteAdd to classroom
Go To Page:- / 59
Algorithms, Asymptotic notations and analysis, Measuring time and space complexities, sparse matrices
Functions, storage structures for arrays, sparse matrices, strings,
pattern matching, structures and arrays of structures, Abstractio Mechanisms, Abstract
data type, Stacks and Queues: representation and Applications.
Singly linked lists, Linked stacks and queues, Operation on polynomial,
Lnked dictionary, Doubly linked list, Circular linked list, Doubly circular linked lists
Binary trees, Terminologies and memory representation, Binary search trees,
General trees, Tree traversing, Operations on binary trees, - Expression manipulations,
Threaded binary trees, Height balancing trees, Heaps, forest, File structures, Introduction
to multi-way search trees, B-tree and B+
Terminologies and representation, Path matrix, graph traversal,- DFS and BFS, shortest path problems
: Bubble sort, selection sort, Insertion sort, Merge sort, Quick sort, Heap sort, Topological sort.
Dynamic storage Management, Garbage collection and compaction, Hashing functions.