01
Introduction to Data Structure
Concepts of data and information, classification of data structures, abstract data types, memory representation, arrays, linked lists, circular linked lists and doubly linked lists.
Complete unit-wise study material for AL303 Data Structures for RGPV Artificial Intelligence and Machine Learning III Semester students.
Study all five units of Data Structures, including linked lists, stacks, queues, trees, graphs, sorting and searching.
Concepts of data and information, classification of data structures, abstract data types, memory representation, arrays, linked lists, circular linked lists and doubly linked lists.
Stack as ADT, stack implementation, multiple stacks, infix to postfix conversion, postfix evaluation, recursion, queues, circular queue, deque, priority queue and queue applications.
Tree terminology, binary search trees, operations, traversal and searching, AVL trees, heaps, forests, multi-way trees, B tree, B+ tree, B* tree and red-black tree.
Directed and undirected graphs, graph representation, DFS, BFS, minimum spanning trees, Kruskal, Prim's algorithm, Dijkstra's shortest path algorithm and graph applications.
Bubble, Quick, Selection, Heap, Insertion, Shell, Merge and Radix sorting. Sequential and binary search, hashing, indexing and applications of data structures.
Complete unit-wise syllabus for RGPV Artificial Intelligence and Machine Learning III Semester.
Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data structures operations and its cost estimation. Introduction to linear data structures — Arrays, Linked List: Representation of linked list in memory, different implementation of linked list. Circular linked list, doubly linked list, etc. Application of linked list: polynomial manipulation using linked list.
Stacks as ADT, Different implementation of stack, multiple stacks. Application of Stack: Conversion of infix to postfix notation using stack, evaluation of postfix expression, Recursion. Queues: Queues as ADT, Different implementation of queue, Circular queue, Concept of Dqueue and Priority Queue, Queue simulation and applications.
Definitions — Height, depth, order, degree etc. Binary Search Tree — Operations, Traversal, Search. AVL Tree, Heap, Applications and comparison of various types of tree; Introduction to forest, multi-way Tree, B tree, B+ tree, B* tree and red-black tree.
Introduction, Classification of graph: Directed and Undirected graphs, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Minimum Spanning Tree — Kruskal and Prim's algorithms. Dijkstra's shortest path algorithm, comparison between different graph algorithms and applications of graphs.
Sorting: Bubble Sort, Quick Sort, Selection Sort, Heap Sort, Insertion Sort, Shell Sort, Merge Sort and Radix Sort; comparison of sorting techniques. Searching: Sequential Search and Binary Search, comparison of search methods. Hashing and Indexing. Case Study: Application of various data structures in Operating System, DBMS etc.
AL303 Data Structures introduces students to fundamental methods of organizing, storing and processing data efficiently.
Students can access all five units in one place and prepare according to the RGPV syllabus using unit-wise handwritten notes.