MCS021 syllabus

Objectives

After completing this course, the learner will be able to

use with various concepts of Algorithm developmentuse various Data Structureapply various Sorting and Searching Techniquesapply 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.