CS6311 PROGRAMMING AND DATA STRUCTURE LABORATORY II |syllabus

      CS6311     PROGRAMMING AND DATA STRUCTURE LABORATORY II L T P C
                                                                                                                                            0 0 3 2

OBJECTIVES:

The student should be made to:
 Be familiarized with good programming design methods, particularly Top- Down design.
 Getting exposure in implementing the different data structures using C++
 Appreciate recursive algorithms.

LIST OF EXPERIMENTS:

IMPLEMENTATION IN THE FOLLOWING TOPICS:
1. Constructors & Destructors, Copy Constructor.
2. Friend Function & Friend Class.
3. Inheritance.
4. Polymorphism & Function Overloading.
5. Virtual Functions.
6. Overload Unary & Binary Operators Both as Member Function & Non Member Function.
7. Class Templates & Function Templates.
8. Exception Handling Mechanism.
9. Standard Template Library concept.
10. File Stream classes.
11. Applications of Stack and Queue
12. Binary Search Tree
13. Tree traversal Techniques
14. Minimum Spanning Trees
15. Shortest Path Algorithms

                                                                                                                        TOTAL: 45 PERIODS

OUTCOMES:

At the end of the course, the student should be able to:
 Design and implement C++ programs for manipulating stacks, queues, linked lists, trees, and
graphs.
 Apply good programming design methods for program development.
 Apply the different data structures for implementing solutions to practical problems.
 Develop recursive programs using trees and graphs.

REFERENCE:

spoken-tutorial.org.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone desktops with C++ complier 30 Nos.
(or)
Server with C++ compiler supporting 30 terminals or more.

Click here to download full syllabus                              AULibrary.com