Quick Links
| University Papers | University Syllabus | Entrance Exam |
| PSU Papers | Bank Papers | Placement Papers |
| VTU | Anna Univerity Syllabus | Anna Univerity Papers |
Anna University
Question Paper Code : 20358
B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2018.
Third Semester
Computer Science and Engineering
CS6301 Programming and Data Structure II
( Common to Information Technology )
( Regulation 2013 )
Question Paper Code : 20358
B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2018.
Third Semester
Computer Science and Engineering
CS6301 Programming and Data Structure II
( Common to Information Technology )
( Regulation 2013 )
Download PDF
For More 1st Year Question Papers
For More Question paper of CSE
For More Question paper of IT
Books:
Anna university all semester examination books and study material can be accessed through below link. Feel free search for different subject books and authors. The link will provide both local and foreign author books for references. Share the page with friends and college students as required.
GATE:
GATE papers can be a good practice for any competitive technical exams like DRDO, ISRO, REC, BEL, BHEL, GAIL, ONGC, IOC, NTPC, NHPC etc. As candidates we can prepare for GATE exams and try solving the papers for getting good score in other entrance examinations.
CS6301 Programming and Data Structure II syllabus
OBJECTIVES:
The student should be made to:
- Be familiar with the C++ concepts of abstraction, encapsulation, constructor, polymorphism, overloading and Inheritance.
- Learn advanced nonlinear data structures.
- Be exposed to graph algorithms
- Learn to apply Tree and Graph structures
UNIT I OBJECT ORIENTED PROGRAMMING FUNDAMENTALS
C++ Programming features – Data Abstraction – Encapsulation – class – object – constructors – static members – constant members – member functions – pointers – references – Role of this pointer – Storage classes – function as arguments.
UNIT II OBJECT ORIENTED PROGRAMMING CONCEPTS
String Handling – Copy Constructor – Polymorphism – compile time and run time polymorphisms – function overloading – operators overloading – dynamic memory allocation – Nested classes – Inheritance – virtual functions.
UNIT III C++ PROGRAMMING ADVANCED FEATURES
Abstract class – Exception handling – Standard libraries – Generic Programming – templates – class template – function template – STL – containers – iterators – function adaptors – allocators – Parameterizing the class – File handling concepts.
UNIT IV ADVANCED NON-LINEAR DATA STRUCTURES
AVL trees – B-Trees – Red-Black trees – Splay trees – Binomial Heaps – Fibonacci Heaps – Disjoint Sets – Amortized Analysis – accounting method – potential method – aggregate analysis.
UNIT V GRAPHS
Representation of Graphs – Breadth-first search – Depth-first search – Topological sort – Minimum Spanning Trees – Kruskal and Prim algorithm – Shortest path algorithm – Dijkstra’s algorithm – Bellman-Ford algorithm – Floyd – Warshall algorithm.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
- Design problem solutions using Object Oriented Techniques.
- Apply the concepts of data abstraction, encapsulation and inheritance for problem solutions.
- Use the control structures of C++ appropriately.
- Critically analyse the various algorithms.
- Apply the different data structures to problem solutions.
TEXT BOOKS:
Bjarne Stroustrup, “The C++ Programming Language”, 3rd Edition, Pearson Education, 2007.
Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, 2nd Edition, Pearson Education, 2005
REFERENCES:
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Second Edition, Mc Graw Hill, 2002.
Michael T Goodrich, Roberto Tamassia, David Mount, “Data Structures and Algorithms in C++”,
The student should be made to:
- Be familiar with the C++ concepts of abstraction, encapsulation, constructor, polymorphism, overloading and Inheritance.
- Learn advanced nonlinear data structures.
- Be exposed to graph algorithms
- Learn to apply Tree and Graph structures
UNIT I OBJECT ORIENTED PROGRAMMING FUNDAMENTALS
C++ Programming features – Data Abstraction – Encapsulation – class – object – constructors – static members – constant members – member functions – pointers – references – Role of this pointer – Storage classes – function as arguments.
UNIT II OBJECT ORIENTED PROGRAMMING CONCEPTS
String Handling – Copy Constructor – Polymorphism – compile time and run time polymorphisms – function overloading – operators overloading – dynamic memory allocation – Nested classes – Inheritance – virtual functions.
UNIT III C++ PROGRAMMING ADVANCED FEATURES
Abstract class – Exception handling – Standard libraries – Generic Programming – templates – class template – function template – STL – containers – iterators – function adaptors – allocators – Parameterizing the class – File handling concepts.
UNIT IV ADVANCED NON-LINEAR DATA STRUCTURES
AVL trees – B-Trees – Red-Black trees – Splay trees – Binomial Heaps – Fibonacci Heaps – Disjoint Sets – Amortized Analysis – accounting method – potential method – aggregate analysis.
UNIT V GRAPHS
Representation of Graphs – Breadth-first search – Depth-first search – Topological sort – Minimum Spanning Trees – Kruskal and Prim algorithm – Shortest path algorithm – Dijkstra’s algorithm – Bellman-Ford algorithm – Floyd – Warshall algorithm.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
- Design problem solutions using Object Oriented Techniques.
- Apply the concepts of data abstraction, encapsulation and inheritance for problem solutions.
- Use the control structures of C++ appropriately.
- Critically analyse the various algorithms.
- Apply the different data structures to problem solutions.
TEXT BOOKS:
Bjarne Stroustrup, “The C++ Programming Language”, 3rd Edition, Pearson Education, 2007.
Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, 2nd Edition, Pearson Education, 2005
REFERENCES:
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Second Edition, Mc Graw Hill, 2002.
Michael T Goodrich, Roberto Tamassia, David Mount, “Data Structures and Algorithms in C++”,
0 Comments