Andhra University MCA 1st Year 1st Semester Data Structures and Algorithms Full Syllabus Information

Andhra University MCA 1st Year 1st Semester MCA 1.1 Data Structures and Algorithms Full Syllabus Information

Syllabus:-

Unit - 1

 Introduction to Data Structures and Algorithms: Review of C Programming, , Abstract Data

Types, Meaning and Definition of Data Structures, Efficiency of Algorithms, Asymptotic Notations,

Time complexity estimation using O notation, Average, Best case and Worst case complexities,

Analysis of recursive algorithms, Arrays Operations, single and Multi-dimensional array

Representation in memory

Unit-2

 Stacks: Stack as an Abstract Data Type, Primitive Operations, Implementing Stack Operations using

Arrays, Infix, Postfix and Prefix: Definitions, Evaluation and Conversions. Queues: Queue as an

Abstract Data Type, Operations, Implementation using Arrays, Types of Queues, circular Queue,

applications.

Unit-3

Linked List: singly linked list, Circular Lists: Insertion, Deletion and Concatenation Operations,

Doubly Linked Lists, Multiply linked lists, applications, Implementation of Stacks, Queues and priority

Queues using Linked Lists, Dynamic Memory Management, applications .

Unit-4

Trees and Binary Trees - Definitions and Terminology, representation of Trees, Binary Tree

Terminology, Representation and Traversal, Threaded Binary Trees and their Traversal, Trees and

their Applications; Tree Searching: Insertion and Deletion of a node from a Binary Search Tree, AVL

Tree operations, Applications

Unit -5

Searching and Hashing: Basic Searching, Sequential Searching and its Efficiency, Transpose

Sequential search, Binary Search, Interpolation Search, Hash Table structure, Hash Functions,

Linear open addressing, chaining, applications

Unit-6

Sorting: General Background: Efficiency of Sorting, Bubble Sort, Selection Sorting, Insertion sort,

Shell Sort and Quick Sort, Heap Sort, Merge Radix Sorts and their Efficiency

Unit-7

Graphs and Their Application: Definition of Graphs, Representation of Graphs, Transitive closure,

Linked Representation of Graphs, Graph Traversal and Spanning Forests, Topological sorting of

nodes, Undirected Graphs and their Traversals, Applications of Graphs, Minimal SpanningTrees.