Data Structure Lectures in Hindi by University Academy

Syllabus

Data Structures
Unit - I Introduction:

Basic Terminology, Elementary Data Organization, Structure operations, Algorithm Complexity and Time-Space trade-off Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, address calculation, application of arrays, Character String in C, Character string operation, Array as Parameters, Ordered List, Sparse Matrices and Vectors. Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, Array Representation of Stack, Linked Representation of Stack, Operations Associated with Stacks, Application of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using stack. Recursion.

UNIT - II Queues:

Array and linked representation and implementation of queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, dequeues and Priority Queues. Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Linked List in Array, Polynomial representation and addition.

UNIT – III Trees:

Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees. Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation.

UNIT – IV Sorting:

Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort, Heap Sort, Sorting on Different Keys, Practical consideration for Internal Sorting. Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST.

UNIT - V Graphs:

Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal.

Suggested Readings:
- 1. Horowitz and Sahani, “Fundamentals of data Structures”, Galgotia Publication Pvt. Ltd., New Delhi.
- 2. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education Asia, Delhi-2002
- 3. A. M. Tenenbaum, “Data Structures using C & C++”, Prentice-Hall of India Pvt. Ltd., New Delhi.
Semester
- III
Subject Code

BCA-303

DAA19: Sorting Algorithms | Shell sort ,Concept, Algorithm, Examples, Time And Space Complexity

By Anand

March 26, 2022

Reviews

Download Handwritten Notes of all subjects by the following link: https://www.instamojo.com/universityacademy Join our official Telegram Channel by the Following Link: https://t.me/universityacademy Join Official WhatsApp Group by Link: https://chat.whatsapp.com/FjPSEITZFbY7bBNVvgKi6U Topics: Design and Analysis of Algorithm, Advanced Data Structures, Divide and Conquer, Greedy Methods, Dynamic Programming, Backtracking, Branch