# 1
| |||

| |||

Data Structure And Algorithm Syllabus Pondicherry University |

# 2
| |||

| |||

Re: Data Structure And Algorithm Syllabus Pondicherry University
As you have asked about the syllabus of 7th Semester B.Tech Electrical and Electronics engineering data structure and algorithm subject of Pondicherry University, I am providing you with it, check below for the details DATA STRUCTURES AND ALGORITHMS UNIT I: INTRODUCTION TO DATA STRUCTURESAbstract data types - Sequences as value definitions - Data types in C - Pointers in C -Data structures and C - Arrays in C - Array as ADT - One dimensional array -Implementing one dimensional array - Array as parameters - Two dimensional array -Structures in C - Implementing structures - Unions in C - Implementation of unions -Structure parameters - Allocation of storage and scope of variables. Recursive definition and processes: Factorial function - Fibonacci sequence - Recursion in C - Efficiency of recursion. UNIT II: STACK, QUEUE AND LINKED LISTStack definition and examples – Primitive operations – Example - Representing stacks in C - Push and pop operation implementation. Queue as ADT - C Implementation of queues - Insert operation - Priority queue - Array implementation of priority queue. Inserting and removing nodes from a list-linked implementation of stack, queue and priority queue - Other list structures - Circular lists: Stack and queue as circular list -Primitive operations on circular lists. Header nodes - Doubly linked lists - Addition of long positive integers on circular and doubly linked list. UNIT III: TREESBinary trees: Operations on binary trees - Applications of binary trees - Binary tree representation - Node representation of binary trees - Implicit array representation of binary tree – Binary tree traversal in C - Threaded binary tree - Representing list as binary tree - Finding the Kth element - Deleting an element. Trees and their applications: C representation of trees - Tree traversals - Evaluating an expression tree - Constructing a tree. UNIT IV: SORTING AND SEARCHINGGeneral background of sorting: Efficiency considerations, Notations, Efficiency of sorting. Exchange sorts: Bubble sort; Quick sort; Selection sort; Binary tree sort; Heap sort. Heap as a priority queue - Sorting using a heap-heap sort procedure - Insertion sorts: Simple insertion - Shell sort - Address calculation sort - Merge sort -Radix sort. Sequential search: Indexed sequential search - Binary search - Interpolation search. UNIT V: GRAPHSApplication of graph - C representation of graphs - Transitive closure - Warshall’s algorithm – Shortest path algorithm - Linked representation of graphs - Dijkstra’s algorithm - Graph traversal - Traversal methods for graphs - Spanning forests - Undirected graph and their traversals - Depth first traversal - Application of depth first traversal - Efficiency of depth first traversal - Breadth first traversal - Minimum spanning tree - Kruskal’s algorithm -Round robin algorithm.
__________________ Answered By StudyChaCha Member |