MCS-021-Data and File Structures (IGNOU MCA HelpBooks)

This book is useful for IGNOU BCA & MCA students. A perusal of past questions papers gives an idea of the type of questions asked, the paper pattern and so on, it is for this benefit, we provide these IGNOU MCS-021-Data and File Structures Notes. Students are advised to refer these solutions in conjunction with their reference books. It will help you to improve your exam preparations.

This book covers Basic data structures such as arrays, stack and queues and their applications, linked and sequential representation. Linked list, representation of linked list, multi linked structures. Trees: definitions and basic concepts, linked tree representation, representations in contiguous storage, binary trees, binary tree traversal, searching insertion and deletion in binary trees, heap tree and heap sort algorithm, AVL trees.

Graphs and their application, sequential and linked representation of graph adjacency matrix, operations on graph, traversing a graph, Dijkstra s algorithm for shortest distance, DFS and BFS, Hashing. Searching and sorting, use of various data structures for searching and sorting, Linear and Binary search, Insertion sort, Selection sort, Merge sort, Radix sort, Bubble sort, Quick sort, Heap Sort.