Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
162 views

ProgramPROGRAMMING AND DATA STRUCTURESming and Data Structures

This document outlines the objectives, units, outcomes, textbooks, and equipment for the course CS6301 Programming and Data Structures II. The course covers advanced C++ concepts like abstraction, encapsulation, inheritance, and polymorphism. It teaches nonlinear data structures like AVL trees, B-trees, and graphs. Students learn graph algorithms and how to apply tree and graph structures. The course aims to design problem solutions using object-oriented techniques and apply various data structures.

Uploaded by

Suresh Babu C V
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
162 views

ProgramPROGRAMMING AND DATA STRUCTURESming and Data Structures

This document outlines the objectives, units, outcomes, textbooks, and equipment for the course CS6301 Programming and Data Structures II. The course covers advanced C++ concepts like abstraction, encapsulation, inheritance, and polymorphism. It teaches nonlinear data structures like AVL trees, B-trees, and graphs. Students learn graph algorithms and how to apply tree and graph structures. The course aims to design problem solutions using object-oriented techniques and apply various data structures.

Uploaded by

Suresh Babu C V
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

CS6301 PROGRAMMING AND DATA STRUCTURES II L T P C

3 0 0 3
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 9
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 9
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 9
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 9
AVL trees B-Trees Red-Black trees Splay trees - Binomial Heaps Fibonacci Heaps
DisjointSets Amortized Analysis accounting method potential method aggregate
analysis.
UNIT V GRAPHS 9
Representation of Graphs Breadth-first search Depth-first search Topological sort
Minimum Spanning Trees Kruskal and Prim algorithm Shortest path algorithm Dijkstras
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:
1. Bjarne Stroustrup, The C++ Programming Language, 3rd Edition, Pearson Education, 2007.
2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 2nd Edition, Pearson
Education, 2005
REFERENCES:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, "Introduction
to Algorithms", Second Edition, Mc Graw Hill, 2002.
2. Michael T Goodrich, Roberto Tamassia, David Mount, Data Structures and Algorithms in
C++, 7th Edition, Wiley Publishers, 2004.
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.

You might also like