Trending: Anna University 8th Sem Results April 2014 May/June 2014 Time Table/ Internal Marks Calculate CGPA Online SSLC Results 2014 12th Result 2014

Test Footer 1

Wednesday, January 2, 2013

CS2068 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING SYLLABUS | ANNA UNIVERSITY BE BIOMEDICAL ENGG 6TH SEMESTER SYLLABUS REGULATION 2008 2011 2012-2013

Latest: TNEA 2014 Engineering Application Status, Counselling Date, Rank List
CS2068 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING SYLLABUS | ANNA UNIVERSITY BE BIOMEDICAL ENGG 6TH SEMESTER SYLLABUS REGULATION 2008 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY SIXTH SEMESTER B.E BIOMEDICAL ENGINEERING DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI, TIRUNELVELI,COIMBATORE), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009

CS2068 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING L T P C
3 0 0 3
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, skew heaps, Binomial –hashing-hash tables without linked lists
UNIT IV NONLINEAR DATA STRUCTURES 9
Trees-Binary trees, search tree ADT, AVL trees splay Trees, B-trees, Sets and maps in
standard Library, Graph Algorithms-Topological sort, shortest path algorithm network flow
problems-minimum spanning tree applications of depth-first-search-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, External sorting, Disjoint set class, Algorithm Design Techniques –Greedy
algorithm, Divide and Conquer, Dynamic Programming, Randomized Algorithm, Back
tracking algorithm.
TOTAL : 45 PERIODS
67
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. Sourav Sahay, object oriented programming with C++, Oxford University Press,
New Delhi,2006.
4. Seymour, “Data Structures”, The McGraw-Hill, 2007.

No comments:

Post a Comment

Any doubt ??? Just throw it Here...