| IT6311 | PROGRAMMING AND DATA STRUCTURE | L T P C |
| LABORATORY II | 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:
- Constructors & Destructors, Copy Constructor.
- Friend Function & Friend Class.
- Inheritance.
- Polymorphism & Function Overloading.
- Virtual Functions.
- Overload Unary & Binary Operators Both as Member Function & Non Member Function.
- Class Templates & Function Templates.
- Exception Handling Mechanism.
- Standard Template Library concept.
- File Stream classes.
- Applications of Stack and Queue
- Binary Search Tree
- Tree traversal Techniques
- Minimum Spanning Trees
- Shortest Path Algorithms
REFERENCE:
spoken-tutorial.org.
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.
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
Standalone desktops with C++ compiler 30 Nos. (or)
Server with C++ compiler supporting 30 terminals or more.
#################################################################################################
Post a Comment Blogger Facebook