mca Syllabus

Data Structures and Algorithms
Code: CS 302
Contact: 3L + IT
Credit: 4
Overview of C language
Time and Space analysis of Algorithms - Order Notations.
Linear Data Structures - Sequential representations - Arrays and Lists, Stacks, Queues and Dequeues, strings, Application.
Linear Data Structures, Link Representation, Linear linked lists, Circularly linked lists. Doubly linked lists, application.
Recursion - Design of recursive algorithms, Tail Recursion, When not to use recursion, Removal of recursion.
Non-linear Data Structure: Trees - Binary Trees, Traversals and Threads, Binary Search Trees, Insertion
and Deletion algorithms, Height-balanced and weight-balanced trees, B-trees, B+ -trees, Application of trees; Graphs - Representations, Breadth-first and Depth-first Search.
Hashing - Hashing Functions, collision Resolution Techniques.
Sorting and Searching Algorithms - Bubble sort, Selection Sort, Insertion Sort, Quick sort, Merge Sort, Heap sort and Radix Sort
File Structures - Sequential and Direct Access. Relative Files, Indexed Files - B+ tree as index. Multiindexed Files, Inverted Files, Hashed Files.

Text book :
1. Data Structures and Algorithms, O.G. Kakde and U.A. Deshpandey, ISTE/EXCEL BOOKS
2. Aho Alfred V., Hopperoft John E., UIlman Jeffrey D., “Data Structures and Algorithms”,
Addison Wesley
3. Drozdek- Data Structures and Algorithms, Vikas
1. Ajoy Agarwal.: Data Structures Through C, Cybertech.
2. Lipschutz: Data Structures TMH
References :
1.Heileman :Datastructure Algorithims &OOP
2. Data Structure Using C – M.Radhakrishnan, V.Srinivasan, ISTE/EXCEL BOOKS
2.Weiss Mark Allen, “Algorithms, Data Structures, and Problem Solving with C++”, Addison
Wesley.
3. Horowitz Ellis & Sartaj Sahni, “Fundamentals of Data Structures”, Galgotria Pub.
4.. Tanenbaum A. S. , “Data Structures using ‘C’ ”