BCA Data Structures and Algorithms

Definition, Abstract Data Type, Impoftance of Data structure.

Introduction, Stack Evaluation of Infix, as an ADT, POP and PUSH Operation, Starck Application: Evaluatopn of Infix , Postfix, and Prefix Expressions, Conversion of Expression.

Introduction, Queue as an ADT, Primitive Operations in Que:ue, Linear and Circular Queue and Their Application, Enqueue and Dequeue, Priority Queue

Introduction, Static and Dynamic List Structure, Array Implemerrtation of Lists, Queues as a List

Introduction, Linked List as an ADT, Dynamic Implementation, Insertion & Deletion of Node To and From a List, Insertion and Deletion After and Before Nodes, Linked Stacks and Queues, Doubly Linked Lists and Its Arlvantages

Introduction, Principle of Recursion, Recursion vs. Iteration, Recuusion Example: ToH and Fibonacci Series, Applications of Recursion, Search rrer:

introduction , Basic Operation in Binary Tree , Tree Search and Insertion / Deletion , Binary Tree Traversals (pre - order , post - order and in - order ). Tree Height , Level and Depth, Balanced Trees: AVL Balaneed Trees, Balancing r\J,gorithm, The Huffman Algorithm, Game tree, B-Tr

Introduction, Internal and External Sort, Insertion and Selection Sort, Exchange Sort, Bubble and Quick Sort Merge and Radix Sort , Shell Sort, Binary Sort, Heap Sort as priority Queu , Efficiency of Sorting Big O Notation

Introduction to Search Technique; essential of search, Sequential search, search, Tree search, General search tree, Hashing: Hash function and hash tables , collision resolution technique, Efficiency comparisons of drifferent search technique

Introduction, Graphs as an ADT, Transitive Closure , Warshall's Algorithm , Types of Graph , Graph Traversal and Spanning Forests, Kruskal and Round Robin Algorithms , Shortest Path Algorithm , Greedy Algorithm , Dijkstra's Algorithm

Deterministic and Non-deterministic Argorithm, Divide and conquer Argorithm, Algorithm Series and Parallel Algorithm, Heuristic and Approximate Algorithms