MCS-021: Data and File structures

New Revised Syllabus of MCS-021: Data and File structures From IGNOU

MCS-021: Data and File structures : 4 Credits
Objectives
After completing this course, the learner will be able to
use with various concepts of Algorithm development
use various Data Structure
apply various Sorting and Searching Techniques
apply Data Structures and other techniques to Real life problems.

Syllabus
Introduction to Algorithms, Algorithms for simple problems Recursive Algorithms, Array, Lists, Circular Lists, Doubly Linked Lists, Circularly Doubly Linked Lists, Stack, Queues, Undirected Graphs, Directed Graphs, Single Source Shortest Path Problem, Dijkstra�s Algorithm, Trees, Binary Trees Traversal Algorithms (Both Recursive and Non-recursive), AVL Trees, B Trees, Files, Search Techniques, Binary Search, Linear Search, Sorting Techniques, Bubble Sort, Heap Sort, Merge Sort, Radix Sort.

Home > MCA Revised New Syllabus > MCS-021: Data and File structures
Comments are closed.