Data Structures and Algorithms detailed syllabus for Electronics & Communication Engineering (ECE) for 2019 regulation curriculum has been taken from the Anna Universities official website and presented for the ECE students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.
For Electronics & Communication Engineering 7th Sem scheme and its subjects, do visit ECE 7th Sem 2019 regulation scheme. For Open Elective-II scheme and its subjects refer to ECE Open Elective-II syllabus scheme. The detailed syllabus of data structures and algorithms is as follows.
Course Objective:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.
Unit I
Algorithm Analysis, List Adt
Algorithms: Notation – analysis – running time calculations. Abstract Data Types (ADTs): List ADT -array-based implementation – linked list implementation – singly linked lists- applications of lists: Polynomial Manipulation. Implementation of List ADT using an array and using a linked list in C.
Unit II
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Unit III
Searching and Sorting Algorithms
Divide and conquer methodology – Searching: Linear Search – Binary Search. Sorting: Insertion sort -Merge sort – Quick sort – Heap sort. Analysis of searching and sorting techniques. Implementation of linear search, binary search, insertion sort, merge sort and quick sort algorithms in C.
Unit IV
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Unit V
Graphs
Definition – Representation of Graph – Breadth-first traversal – Depth-first traversal – Dynamic programming Technique – Warshalls and Floyds algorithm – Greedy method – Dijkstras algorithm -applications of graphs. Implementation of graph, graph traversal methods, finding shortest path using Dijkstras algorithm in C
Course Outcome:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Text Books:
- Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson Education,1997.
- Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, 2nd Edition, Pearson Education, 1988.
References:
- Aho, Hopcroft and Ullman, Data Structures and Algorithms, Pearson Education,1983.
- S.Sridhar, Design and Analysis of Algorithms, First Edition, Oxford University Press. 2014
- Byron Gottfried, Jitender Chhabra, Programming with C (Schaums Outlines Series), Mcgraw Hill Higher Ed., III Edition, 2010
- Yashvant Kanetkar, Data Structures Through C, BPB publications, II edition, 2003
For detailed syllabus of all the other subjects of Electronics & Communication Engineering 7th Sem, visit ECE 7th Sem subject syllabuses for 2019 regulation.
For all Electronics & Communication Engineering results, visit Anna University ECE all semester results direct link.