DATA STRUCTURES AND ALGORITHMS

Syllabus

Corse Code: BCA-63T-201

Data Structures and Algorithms

UNIT – I

Introduction to Algorithm Design: Algorithm, its Characteristics, Efficiency of Algorithms, Analyzing Algorithms and Problems.

Linear Structure: Arrays, Records, Stack, Operation on Stack, Implementation of Stack as an Array, Queue, Types of Queues, Operations on Queue, Implementation of Queue.

UNIT – II

Linked Structure: List Representation, Polish Notations, Operations on Linked List - Get Node and Free Node Operation, Implementing the List Operation, Inserting into an Ordered Linked List, Deleting, Circular Linked List.

Tree Structure: Concept and Terminology, Types of Trees, Binary Search Tree, Inserting, Deleting and Searching into Binary Search Tree, Tree Traversals.

UNIT – III

Graph Structure: Graph Representation - Adjacency Matrix, Adjacency List, Warshall’s Algorithm, Adjacency Multilist Representation. Orthogonal Representation of Graph. Graph Traversals - BFS and DFS. Shortest Path, Transitive Closure.

UNIT – IV

Searching and Sorting: Searching - Sequential Searching, Binary Searching, Hashing. Sorting - Selection Sort, Bubble Sort, Quick Sort, Heap Sort, Merge Sort, and Insertion Sort, Efficiency Considerations.