EC2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ SYLLABUS | ANNA UNIVERSITY ECE THIRD SEMESTER SYLLABUS REGULATION 2008 2011-2012

Latest: TNEA 2014 Engineering Application Status, Counselling Date, Rank List

EC2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++  SYLLABUS | ANNA UNIVERSITY ECE THIRD SEMESTER SYLLABUS REGULATION 2008 2011-2012
BELOW IS THE ANNA UNIVERSITY 3RD SEMESTER BE ELECTRONICS AND COMMUNICATION DEPARTMENT SYLLABUS IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011-2012(ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI,TIRUNELVELI,COIMBATORE), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009.
EC 2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ 3 0 0 3
AIM
To provide an in-depth knowledge in problem solving techniques and data structures.
OBJECTIVES
 To learn the systematic way of solving problems
 To understand the different methods of organizing large amounts of data
 To learn to program in C++
 To efficiently implement the different data structures
 To efficiently implement solutions for specific problems
UNIT I PRINCIPLES OF OBJECT ORIENTED PROGRAMMING 9
Introduction- Tokens-Expressions-contour Structures –Functions in C++, classes and
objects, constructors and destructors ,operators overloading and type conversions .
UNIT II ADVANCED OBJECT ORIENTED PROGRAMMING 9
Inheritance, Extending classes, Pointers, Virtual functions and polymorphism, File
Handling Templates ,Exception handling, Manipulating strings.
UNIT III DATA STRUCTURES & ALGORITHMS 9
Algorithm, Analysis, Lists, Stacks and queues, Priority queues-Binary Heap-Application,
Heaps–hashing-hash tables without linked lists
UNIT IV NONLINEAR DATA STRUCTURES 9
Trees-Binary trees, search tree ADT, AVL trees, Graph Algorithms-Topological sort,
shortest path algorithm network flow problems-minimum spanning tree - Introduction to
NP - completeness.
UNIT V SORTING AND SEARCHING 9
Sorting – Insertion sort, Shell sort, Heap sort, Merge sort, Quick sort, Indirect sorting,
Bucket sort, Introduction to Algorithm Design Techniques –Greedy algorithm (Minimum
Spanning Tree), Divide and Conquer (Merge Sort), Dynamic Programming (All pairs
Shortest Path Problem).
TOTAL = 45 PERIODS
TEXT BOOKS
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 3rd ed, Pearson
Education Asia, 2007.
2. E. Balagurusamy, “ Object Oriented Programming with C++”, McGraw Hill Company
Ltd., 2007.
REFERENCES
1. Michael T. Goodrich, “Data Structures and Algorithm Analysis in C++”, Wiley
student edition, 2007.
2. Sahni, “Data Structures Using C++”, The McGraw-Hill, 2006.
3. Seymour, “Data Structures”, The McGraw-Hill, 2007.
4. Jean – Paul Tremblay & Paul G.Sorenson, An Introduction to data structures with
applications, Tata McGraw Hill edition, II Edition, 2002.
5. John R.Hubbard, Schaum’s outline of theory and problem of data structure with
C++,McGraw-Hill, New Delhi, 2000.
6. Bjarne Stroustrup, The C++ Programming Language, Addison Wesley, 2000
7. Robert Lafore, Object oriented programming in C++, Galgotia Publication