DATA STRUCTURES FOR B.TECH

-

DATA STRUCTURES

Unit 1:

Introduction : Basic Terminologies: Concept of Data Structure, Choice of right Data Structure, Algorithms , how to design and develop algorithm, Complexity of algorithm. Operations: insertion, deletion, traversal etc, Analysis of an Algorithm.

Searching: Linear Search and Binary Search Techniques and their complexity analysis.


Unit 2:

Stacks  and  Queues: Stack  and  its  operations: Algorithms and their complexity analysis, Applications of Stacks: Expression       Conversion and evaluation -corresponding algorithms and complexity analysis. queue, Types of Queue: Simple  Queue, Circular Queue, Priority Queue; Operations on each types of Queues: Algorithms and their analysis.

 

Unit 3:

Linked Lists:    Singly   linked  lists: Representation in memory, Algorithms of several operations:  Traversing, Searching, Insertion into, Deletion from linked list; Linked representation of Stack and Queue, Header nodes, Doubly linked list: operations on it and algorithmic analysis; Circular Linked Lists: all operations their algorithms and the complexity analysis.

Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree; Tree operations on each of the trees and their algorithms with complexity analysis. Applications of Binary Trees. B Tree, B+ Tree: definitions, algorithms and analysis.


Unit 4:

Sorting and Hashing: Objective and properties of different sorting algorithms: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort; Performance and Comparison among all the methods.

Graph: Basic Terminologies and Representations, Graph search and traversal algorithms and complexity analysis.

LINK FOR VIDEO LECTURES BY SAHARSH GERA

E-BOOKS

1. DATA STRUCTURES USING C LANGUAGE BY REEMA THAREJA.

2. DATA STRUCTURES AND ALGORITHM BY Narasimha Karumanchi.

3. DATA STRUCTURE & ALGORITHM WITH C BY DEBDUTTA PAL , SUMAN HALDER.

4. DATA STRUCTURES USING C LANGUAGE BY SEYMOUR LIPSCHUTZ.  

NOTES



Popular posts from this blog

DATA STRUCTURES-II

-
 UNIT – I  Tree: Header nodes, Threads, Binary search trees, Searching, Insertion and deletion in aBinary search tree , AVL search trees, Insertion and deletion in AVL search tree , m-waysearch tree, Searching, Insertion and deletion in an m-way search tree , B-trees, Searching,Insertion and deletion in a B-tree, B+tree , Huffman’s algorithm , General trees.  UNIT – II  Graphs: Warshall’s algorithm for shortest path , Dijkstra algorithm for shortest path , Operations on graphs , Traversal of graph , Topological sorting .  UNIT – III  Sorting: Internal & external sorting , Radix sort , Quick sort , Heap sort , Merge sort . Searching: Liner search, binary search, merging , Comparison of various sorting and searching algorithms on the basis of their complexity .  UNIT – IV  Files: Physical storage devices and their characteristics , Attributes of a file viz fields, records,Fixed and variable length records, Primary and secondary keys , Clas...
Read more

DATA STRUCTURES FOR BCA

-
UNIT – I  Introduction: Elementary data organization, Data Structure definition , Data type vs. data structure , Categories of data structures, Data structure operations, Applications of data structures, Algorithms complexity and time-space tradeoff, Big-O notataion.   Strings: Introduction, Storing strings, String operations, Pattern matching algorithms.  UNIT – II  Arrays: Introduction, Linear arrays, Representation of linear array in memory, address calculations, Traversal, Insertions, Deletion in an array, Multidimensional arrays, Parallel arrays, Sparse arrays.  Linked List: Introduction, Array vs. linked list, Representation of linked lists in memory, Traversal, Insertion, Deletion, Searching in a linked list, Header linked list, Circular linked list, Two-way linked list, Threaded lists, Garbage collection, Applications of linked lists.  UNIT – III  Stack: Introduction, Array and linked representation of stacks, Operations on stacks, Ap...
Read more